> For the complete documentation index, see [llms.txt](https://algorithm.prettylog.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems.md). # Problems - [Interval](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/interval.md) - [56. Merge Intervals](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/interval/56.-merge-intervals.md) - [435. Non-overlapping Intervals](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/interval/435.-non-overlapping-intervals.md) - [x 57. Insert Interval](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/interval/x-57.-insert-interval.md) - [Heap](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/heap.md) - [x 295. Find Median from Data Stream](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/heap/x-295.-find-median-from-data-stream.md) - [347. Top K Frequent Elements](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/heap/347.-top-k-frequent-elements.md) - [23. Merge k Sorted Lists](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/heap/23.-merge-k-sorted-lists.md) - [Array](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array.md) - [Untitled](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/untitled.md) - [10. 11. Container With Most Water](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/10.-11.-container-with-most-water.md) - [9. 15. 3Sum](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/9.-15.-3sum.md) - [8. 33. Search in Rotated Sorted Array](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/8.-33.-search-in-rotated-sorted-array.md) - [7. 153. Find Minimum in Rotated Sorted Array](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/7.-153.-find-minimum-in-rotated-sorted-array.md) - [x 6. 152. Maximum Product Subarray](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/x-6.-152.-maximum-product-subarray.md) - [5. 53. Maximum Subarray](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/5.-53.-maximum-subarray.md) - [4. 238. Product of Array Except Self](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/4.-238.-product-of-array-except-self.md) - [1. Two Sums](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/1.-two-sums.md) - [2. Best Time to Buy and Sell Stock](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/2.-best-time-to-buy-and-sell-stock.md) - [3. Contains Duplicate](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/array/3.-contains-duplicate.md) - [Binary](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/binary.md) - [190. Reverse Bits](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/binary/190.-reverse-bits.md) - [268. Missing Number](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/binary/268.-missing-number.md) - [x 338. Counting Bits](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/binary/x-338.-counting-bits.md) - [12. 191. Number of 1 Bits](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/binary/12.-191.-number-of-1-bits.md) - [11. 371. Sum of Two Integers](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/binary/11.-371.-sum-of-two-integers.md) - [Graph](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/graph.md) - [x 417. Pacific Atlantic Water Flow](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/graph/x-417.-pacific-atlantic-water-flow.md) - [x 128. Longest Consecutive Sequence](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/graph/x-128.-longest-consecutive-sequence.md) - [207. Course Schedule](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/graph/207.-course-schedule.md) - [133. Clone Graph](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/graph/133.-clone-graph.md) - [200. Number of Islands](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/graph/200.-number-of-islands.md) - [Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree.md) - [x 297. Serialize and Deserialize Binary Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/x-297.-serialize-and-deserialize-binary-tree.md) - [x 105. Construct Binary Tree from Preorder and Inorder Traversal](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/x-105.-construct-binary-tree-from-preorder-and-inorder-traversal.md) - [x 212. Word Search II](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/x-212.-word-search-ii.md) - [211. Design Add and Search Words Data Structure](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/211.-design-add-and-search-words-data-structure.md) - [208. Implement Trie (Prefix Tree)](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/208.-implement-trie-prefix-tree.md) - [235. Lowest Common Ancestor of a Binary Search Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/235.-lowest-common-ancestor-of-a-binary-search-tree.md) - [230. Kth Smallest Element in a BST](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/230.-kth-smallest-element-in-a-bst.md) - [98. Validate Binary Search Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/98.-validate-binary-search-tree.md) - [572. Subtree of Another Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/572.-subtree-of-another-tree.md) - [297. Serialize and Deserialize Binary Tree ?](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/297.-serialize-and-deserialize-binary-tree.md) - [102. Binary Tree Level Order Traversal](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/102.-binary-tree-level-order-traversal.md) - [124. Binary Tree Maximum Path Sum](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/124.-binary-tree-maximum-path-sum.md) - [226. Invert Binary Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/226.-invert-binary-tree.md) - [100. Same Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/100.-same-tree.md) - [104. Maximum Depth of Binary Tree](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/tree/104.-maximum-depth-of-binary-tree.md) - [Dynamic Programming](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming.md) - [x 62. Unique Paths](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x-62.-unique-paths.md) - [x91. Decode Ways](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x91.-decode-ways.md) - [55. Jump Game](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/55.-jump-game.md) - [x 213. House Robber II](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x-213.-house-robber-ii.md) - [198. House Robber](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/198.-house-robber.md) - [377. Combination Sum IV](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/377.-combination-sum-iv.md) - [x 139. Word Break](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x-139.-word-break.md) - [1143. Longest Common Subsequence](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/1143.-longest-common-subsequence.md) - [300. Longest Increasing Subsequence](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/300.-longest-increasing-subsequence.md) - [322. Coin Change](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/322.-coin-change.md) - [70. Climbing Stairs](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/70.-climbing-stairs.md) - [2023 0709 39. Combination Sum](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/2023-0709-39.-combination-sum.md) - [String](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string.md) - [x 76. Minimum Window Substring](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/x-76.-minimum-window-substring.md) - [647. Palindromic Substrings](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/647.-palindromic-substrings.md) - [x 5. Longest Palindromic Substring](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/x-5.-longest-palindromic-substring.md) - [125. Valid Palindrome](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/125.-valid-palindrome.md) - [20. Valid Parentheses](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/20.-valid-parentheses.md) - [49. Group Anagrams](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/49.-group-anagrams.md) - [242. Valid Anagram](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/242.-valid-anagram.md) - [5. Longest Palindromic Substring](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/5.-longest-palindromic-substring.md) - [3. Longest Substring Without Repeating Characters](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/string/3.-longest-substring-without-repeating-characters.md) - [Matrix](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/matrix.md) - [x 48. Rotate Image](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/matrix/x-48.-rotate-image.md) - [79. Word Search](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/matrix/79.-word-search.md) - [x 73. Set Matrix Zeroes](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/matrix/x-73.-set-matrix-zeroes.md) - [54. Spiral Matrix](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/matrix/54.-spiral-matrix.md) - [Linked List](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/linked-list.md) - [143. Reorder List](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/linked-list/143.-reorder-list.md) - [19. Remove Nth Node From End of List](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/linked-list/19.-remove-nth-node-from-end-of-list.md) - [23. Merge k Sorted Lists](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/linked-list/23.-merge-k-sorted-lists.md) - [21. Merge Two Sorted Lists](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/linked-list/21.-merge-two-sorted-lists.md) - [141. Linked List Cycle](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/linked-list/141.-linked-list-cycle.md) - [206. Reverse Linked List](https://algorithm.prettylog.com/top-75-leetcode-questions-to-save-your-time/problems/linked-list/206.-reverse-linked-list.md)