π’ : Easy
π΅ : Medium
π΄ : Hard
β« : Very Hard
Category | Problem | Difficulty | Solution |
---|---|---|---|
Arrays | Two Number Sum | π’ | two-number-sum.py |
Arrays | Validate Subsequence | π’ | validate-subsequence.py |
Arrays | Sorted Squared Array | π’ | sorted-squered-array.py |
Arrays | Tournament Winner | π’ | tournament-winner.py |
Arrays | Non-Constructible Change | π’ | non-constructible-change.py |
Binary Search Trees | Find Closest Value in BST | π’ | closest-in-BST.py |
Binary Trees | Branch Sums | π’ | branch-sums.py |
Binary Trees | Node Depths | π’ | node-depths.py |
Graphs | Depth First Search | π’ | depth-first-search.py |
Greedy Algorithms | Minimum Waiting Time | π’ | minimum-waiting-time.py |
Greedy Algorithms | Class Photos | π’ | class-photos.py |
Linked Lists | Remove Duplicates from Linked List | π’ | remove-duplicates.py |
Recursion | Nth Fibonacci | π’ | nth-fibonacci.py |
Recursion | Product Sum | π’ | product-sum.py |