100 Days of LeetCode
100 LeetCode problems across arrays, trees, graphs, DP, sliding window & more.
repo → Coding-Interview-Preparation
| Problem | Solution Preview | Level / Approach (Language) |
|---|---|---|
| 1. Two Sum | Easy / Array (Python) | |
| 2. Concatenation of Array | Easy / Array (Python) | |
| 3. Reverse String | Easy / String Manipulation (Python) | |
| 4. Contains Duplicate | Easy / Hash Table (C++) | |
| 5. Valid Palindrome | Easy / Two Pointers (Python) | |
| 6. Best Time to Buy and Sell Stock | Easy / Dynamic Programming (Python) | |
| 7. Valid Parentheses | Easy / Stack (Python) | |
| 8. Binary Search | Easy / Binary Search (Python) | |
| 9. Reverse Linked List | Easy / Linked List (Python) | |
| 10. Invert Binary Tree | Easy / Binary Tree (Python) | |
| 11. Top K Frequent Elements | Medium / Heap/Hash Table (Python) | |
| 12. Two Sum II - Input Array Is Sorted | Medium / Binary Search (Python) | |
| 13. Longest Substring Without Repeating Characters | Medium / Sliding Window (Python) | |
| 14. Min Stack | Medium / Stack (Python) | |
| 15. Evaluate Reverse Polish Notation | Medium / Stack (Python) | |
| 16. Search a 2D Matrix | Medium / Binary Search (Python) | |
| 17. Reorder List | Medium / Linked List (Python) | |
| 18. Lowest Common Ancestor of a Binary Search Tree | Medium / Binary Search Tree (Python) | |
| 19. Subsets | Medium / Backtracking (Python) | |
| 20. K Closest Points to Origin | Medium / Heap/Sorting (Python) | |
| 21. Number of Islands | Medium / DFS (Python) | |
| 22. Sum of Two Integers | Medium / Bit Manipulation (Python) | |
| 23. Maximum Subarray | Medium / Kadane’s Algorithm (Python) | |
| 24. Insert Interval | Medium / Greedy (Python) | |
| 25. Rotate Image | Medium / Matrix Manipulation (Python) | |
| 26. Climbing Stairs | Easy / Dynamic Programming (Python) | |
| 27. Unique Paths | Medium / Dynamic Programming (Python) | |
| 28. Min Cost Climbing Stairs | Easy / Dynamic Programming (Python) | |
| 29. Longest Common Subsequence | Medium / Dynamic Programming (Python) | |
| 30. House Robber | Medium / Dynamic Programming (Python) | |
| 31. Best Time to Buy and Sell Stock with Cooldown | Medium / Dynamic Programming (Python) | |
| 32. Max Area of Island | Medium / DFS (Python) | |
| 33. Last Stone Weight | Easy / Heap (Python) | |
| 34. Kth Largest Element in an Array | Medium / Heap/Quickselect (Python) | |
| 35. Combination Sum | Medium / Backtracking (Python) | |
| 36. Combination Sum II | Medium / Backtracking (Python) | |
| 37. Jump Game | Medium / Greedy (Python) | |
| 38. Jump Game II | Hard / Greedy (Python) | |
| 39. 3Sum | Medium / Two Pointers (Python) | |
| 40. Koko Eating Bananas | Medium / Binary Search (Python) | |
| 41. Merge Two Sorted Lists | Easy / Linked List (Python) | |
| 42. Linked List Cycle | Easy / Linked List (Python) | |
| 43. Binary Tree Level Order Traversal | Medium / Binary Tree (Python) | |
| 44. Binary Tree Right Side View | Medium / Binary Tree (Python) | |
| 45. Maximum Depth of Binary Tree | Easy / Binary Tree (Python) | |
| 46. Valid Sudoku | Medium / Hash Table (Python) | |
| 47. Longest Repeating Character Replacement | Medium / Sliding Window (Python) | |
| 48. Daily Temperatures | Medium / Stack (Python) | |
| 49. Generate Parentheses | Medium / Backtracking (Python) | |
| 50. Remove Nth Node From End of List | Medium / Linked List (Python) | |
| 51. Copy List with Random Pointer | Medium / Linked List (Python) | |
| 52. Permutations | Medium / Backtracking (Python) | |
| 53. Count Good Nodes in Binary Tree | Medium / Binary Tree (Python) | |
| 54. Clone Graph | Medium / Graph (Python) | |
| 55. Rotting Oranges | Medium / BFS (Python) | |
| 56. House Robber II | Medium / Dynamic Programming (Python) | |
| 57. Longest Palindromic Substring | Medium / Dynamic Programming (Python) | |
| 58. Course Schedule | Medium / Graph (Python) | |
| 59. Gas Station | Medium / Greedy (Python) | |
| 60. Hand of Straights | Medium / Greedy/minHeap (Python) | |
| 61. Find Minimum in Rotated Sorted Array | Medium / Binary Search (Python) | |
| 62. Add Two Numbers | Medium / Linked List (Python) | |
| 63. Palindromic Substrings | Medium / Expand Around Center (Python) | |
| 64. Decode Ways | Medium / Recursion (Python) | |
| 65. Non-overlapping Intervals | Medium / Greedy/Sorting (Python) | |
| 66. Spiral Matrix | Medium / Matrix Traversal (Python) | |
| 67. Longest Consecutive Sequence | Medium / Hash Set (Python) | |
| 68. LRU Cache | Medium / Hash Map/Doubly Linked List (Python) | |
| 69. Validate Binary Search Tree | Medium / Binary Search Tree (Python) | |
| 70. Find the Duplicate Number | Medium / Floyd’s Cycle Detection (Python) | |
| 71. Search in Rotated Sorted Array | Medium / Binary Search (Python) | |
| 72. Word Search | Medium / Backtracking (Python) | |
| 73. Container With Most Water | Medium / Two Pointers (Python) | |
| 74. Trapping Rain Water | Hard / Two Pointers (Python) | |
| 75. Permutation in String | Medium / Sliding Window (Python) | |
| 76. Minimum Window Substring | Hard / Sliding Window (Python) | |
| 77. Sliding Window Maximum | Hard / Deque (Python) | |
| 78. Car Fleet | Medium / Stack (Python) | |
| 79. Implement Trie (Prefix Tree) | Medium / Trie (Python) | |
| 80. Coin Change | Medium / Dynamic Programming (Python) | |
| 81. Kth Smallest Element in a BST | Medium / Binary Search Tree (Python) | |
| 82. Construct Binary Tree from Preorder and Inorder Traversal | Medium / Binary Tree (Python) | |
| 83. Task Scheduler | Medium / Counter (Python) | |
| 84. Maximum Product Subarray | Medium / Dynamic Programming (Python) | |
| 85. Regular Expression Matching | Hard / Dynamic Programming (Python) | |
| 86. N-Queens | Hard / Backtracking (Python) | |
| 87. Interleaving String | Medium / Recursion (Python) | |
| 88. Number of 1 Bits | Easy / Bit Manipulation (Python) | |
| 89. Longest Increasing Subsequence | Medium / Dynamic Programming (Python) | |
| 90. Surrounded Regions | Medium / DFS (Python) | |
| 91. Distinct Subsequences | Hard / Dynamic Programming (Python) | |
| 92. Partition Equal Subset Sum | Medium / Dynamic Programming (Python) | |
| 93. Design Twitter | Medium / BruteForce (Python) | |
| 94. Balanced Binary Tree | Easy / Binary Tree (Python) | |
| 95. Cheapest Flights Within K Stops | Medium / Bellman Ford (Python) | |
| 96. Network Delay Time | Medium / Dijkstra’s Algorithm (Python) | |
| 97. Missing Number | Easy / Math/XOR (Python) | |
| 98. Merge Triplets to Form Target Triplet | Medium / Greedy (Python) | |
| 99. Pacific Atlantic Water Flow | Medium / DFS (Python) | |
| 100. Time Based Key-Value Store | Medium / Binary Search (Python) | |
| 101. Detect Squares | Medium / Hash Map (Python) |