- π§ -> To be done
- β -> Done
- π’ -> It was easy
- π‘ -> Strugled a bit
- π΄ -> It was hard
β π’ [1/69] Sales By Match
β π‘ [2/69] Couting Valleys
β π’ [3/69] Jumping on the Clouds
β π’ [4/69] Repeated String
β π’ [5/69] 2D Array - DS
β π‘ [6/69] Minimum Swaps 2
β π’ [7/69] Arrays: Left Rotation
β π΄ [8/69] New Year Chaos
π§ [9/69] Array Manipulation
β π’ [10/69] Hash Tables: Ransom Note
β π’ [11/69] Two Strings
β π΄ [12/69] Sherlock and Anagrams
β π‘ [13/69] Count Triplets
π§ [14/69] Frequency Queries
β π’ [15/69] Sorting: Bubble Sort
β π‘ [16/69] Mark and Toys
β π’ [17/69] Sorting: Comparator
π§ [18/69] Fraudulent Activity Notifications
π§ [19/69] Merge Sort: Counting Inversions
β π΄ [20/69] Greedy Flourist
Exercises not included in the interview kit list but I solved it anyway in order to consolidate concepts and algorithms
β π’ Insertion Sort - Part 1
β π’ Insertion Sort - Part 2