MIKE AND HASHTRICK

#1

Bhaiya karna kya hai is question mai ?

#2

hello @CODER_JATIN

jo hashing algorithm di ha ,usko samjhna hai aur phir tumhe apna algorithm frame karna hai jo kaam to same kare but givn algrorithm se efficient ho

#3

acha acha . . . . . . . . .

#4

https://ide.codingblocks.com/s/444721 bhaiya dekhna ese ni hoega?

#5

thoda sahi hai . . . .

basically tumko distinct element ko uske last occurence ke basis pe sort karna hai aur phir print

#6

bhaiya ese hi to ho rha hai is code mai, distinct elements ki last occurence map mai store kra rkhi hai, or map hai to key to pehle se hi sorted hogi to -> output sahi ni aani chahiye?

#7

key ke accoridng nahi hame value ke according sort karna hai na. … . . .

ek baar phirse dry run karo agar pattern samjh nahi aaya to

#8

acha acha , smjh gya , krta hu …

#9

https://ide.codingblocks.com/s/444737 , bhaiya dekhna ab sahi hai?

#10

or ye “subarrays with distinct elements” ki approach bhi bta do?

#11

ha . . . . . . . . . . . . . . . . . . . . . . .

#12

kaun sa question hai ye? doubt raise karo us problem pe jaake

#13

okay bhaiya , thank yoyu !!:slight_smile:

#14

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.