Can you give some idea how to solve this question

#1

I am getting tle and wrong answer in all test cases

#2

Hey,you have to apply greedy algorithm and choose the number that gives you maximum number from right to left.
Hint:Make a custom compare function that somehow checks and return whether a number should come before or after another number.

#3

I also did the same thing,i modified custom compare function

#4

Hey,Please go through this link

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#6

@KetanPandey
This is duplicate thread so closing this Hey please correct this code and tell me my error

Discuss everyhting over there and please dont open multiple threads for same doubt :slight_smile:

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.