HackerRank Sock Merchant Solution Explained – Java



FOLLOW ME BELOW

Patreon – https://www.patreon.com/nick_white?al…
Twitch – https://www.twitch.tv/matrixman
Reddit – https://www.reddit.com/r/NickWhiteCod…
Twitter – https://twitter.com/nickdoubleyouu
Instagram – https://instagram.com/nickdoubleyou
Linkedin – https://www.linkedin.com/in/nicholas-…
Github – https://github.com/white105
Discord – https://discord.gg/2f2Tgy3
Soundcloud – https://soundcloud.com/nickiswhite

Related Posts

4 Comments

  1. Hey Nick, I've solved this problem with different approach with using array only

    1. Sorting the array using any sorting algo
    2. For i=0;i < n;i++
    For j=i+1;j<n;j++
    If ar[i]==ar[j]
    Count++;
    i=j+1;
    break;
    This approach passed 2 test cases but failed in all hidden cases please tell me whats wrong

  2. Hey Nick, Thanks for the rundown of the problem. Your explanation of a set was spot on and simply put. I was struggling with this problem for a little bit and have been trying to start off doing easy coding challenges on my own to help get more comfortable with coding challenges for developer interviews and for my own interest. I appreciate it.

Leave a Reply

Your email address will not be published.

© 2022 Code As Pro - Theme by WPEnjoy · Powered by WordPress