Hey Every one, If you find this tutorial helpful, please do not forget to like, comment, share and It would be great if you can leave your feedback about the tutorial, as I have put a lot of hard work to make things easy for you. Thanks ..!!
Your videos are amazing and always come up with clarity ...which makes our problem statement clear and make ourselves easy to understand the logic ......keep doing .... waiting for many videos on hackerank , leetcode and other platform 🙏
I have also not solved all the problems on hackerrank 😜 but trying my best to do it. Honestly some problem I solved in less than the time which I take to explain on my channel.😜 and for some problem, I also took several hours to get a better solution. solving a problem is not difficult but getting the optimized version of it may be challenging which mostly consumes time. Will see, if people are interested maybe I can make a video on that topic too. I have already answered this question on quora, you can refer the same and check out my other answers as well on the similar topic(hope that may give you answer to most of the query which you have in your mind). www.quora.com/How-much-time-should-it-take-to-solve-a-problem-in-HackerRank-medium-level/answer/Kanahaiya-Gupta-2
Sir didn't get the if(j!=null) condition on line 28. Shouldn't we compare the key value with y in the 'if' condition? Or check just if y value is present in the map in the 'if' condition?
Even if it is, you would only change its value, namely its index number. Also if i'm not wrong it imposibble since the problem statement says: There will always be a unique solution.