## Sales by Match | Sock Merchant HackerRank Solution [O(N)] sock merchant hackerrank problem

2021-04-29

In this video, I have explained sales by match hackerrank solution algorithm. hackerrank sock merchant problem can be solved by using set data structure. The complexity of sock merchant hackerrank solution is O (n). This hackerrank problem is a part of Practice | Algorithms | Implementation | Sock merchant hackerrankContinue Reading