HackerRank - Minimum Loss | Full solution with visuals and examples | Study Algorithms 

Great Explanantion!! Thank you sir!!

Very Clear explanation sir. The best!! Better than all the other sophisticated teachers and platforms. Thankyou so much.

Keep these videos coming. They are really helpful Thanks ;)

Outstanding explanation!!! Thank you for sharing!!!

Clear explanation. Thanks.

Great Explanation 🤩

Excellent explanation.

Keep doing bro thanks for good content 🙂

I feel sorting and then finding min is gonna take more time for small number of values.. Sorting time complexity is around nlogn and then finding minimum is n.. overall solution is nlogn + n.. Brute force solution is I think nsq(2). Not much of a difference

Want you to upload more videos on Hackerrank Algorithmic problems !

It did not pass some of the test and Time limit exceeded

Thank you bro.. if(hmap.get(price.get(i))