# | Problem | Difficulty | Solution | Main Idea |
---|---|---|---|---|
1 | 2D Array - DS | Easy | Solution | Brute Force |
2 | Arrays: Left Rotation | Easy | Solution | Brute Force |
3 | New Year Chaos | Medium | Solution | Brute Force |
4 | Minimum Swaps 2 | Medium | Solution | Brute Force |
5 | Array Manipulation | Hard | Solution | Difference Array & Prefix Sum |
# | Problem | Difficulty | Solution | Main Idea |
---|---|---|---|---|
1 | Hash Tables: Ransom Note | Easy | Solution | Brute Force |
2 | Two Strings | Easy | Solution | Brute Force |
3 | Frequency Queries | Medium | Solution | Brute Force (2 Hash Maps) |
4 | Sherlock and Anagrams | Medium | Solution | Brute Force & Math (Combinations Formula) |
# | Problem | Difficulty | Solution | Main Idea |
---|---|---|---|---|
1 | Pairs | Medium | Solution | Brute Force (HashMap) |
2 | Hash Tables: Ice Cream Parlor | Medium | Solution | Brute Force (HashMap) |
3 | Triple sum | Medium | Solution | Brute Force & Binary Search) |
# | Problem | Difficulty | Solution | Main Idea |
---|---|---|---|---|
1 | Strings: Making Anagrams | Easy | Solution | Brute Force |
2 | Alternating Characters | Easy | Solution | Brute Force |
3 | Sherlock and the Valid String | Medium | Solution | Brute Force (HashMap) |
4 | Special String Again | Medium | Solution | Brute Force |
5 | Common Child | Medium | Solution 1 | Recursive approach with Memoization |
- | Solution 2 | Dynamic Programming |
# | Problem | Difficulty | Solution | Main Idea |
---|---|---|---|---|
1 | Sales by Match | Easy | Solution | Brute Force |
2 | Counting Valleys | Easy | Solution | Brute Force |
3 | Jumping on the Clouds | Easy | Solution | Brute Force |
4 | Repeated String | Easy | Solution | Brute Force |
# | Problem | Difficulty | Solution | Main Idea |
---|---|---|---|---|
1 | Sorting: Bubble Sort | Easy | Solution | Bubble Sort Algorithm |
2 | Mark and Toys | Easy | Solution | Brute Force |
3 | Sorting: Comparator | Medium | Solution | Brute Force |