https://github.com/himudigonda/leetcode-old
My LeetCode Journey
https://github.com/himudigonda/leetcode-old
algorithms-and-data-structures data-structures-and-algorithms dsa dsa-practice python sql
Last synced: 7 months ago
JSON representation
My LeetCode Journey
- Host: GitHub
- URL: https://github.com/himudigonda/leetcode-old
- Owner: himudigonda
- Created: 2025-02-08T13:27:05.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2025-08-22T00:14:53.000Z (8 months ago)
- Last Synced: 2025-09-29T06:15:41.944Z (7 months ago)
- Topics: algorithms-and-data-structures, data-structures-and-algorithms, dsa, dsa-practice, python, sql
- Language: Python
- Homepage:
- Size: 365 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Solutions Overview
## 🧮 Summary Stats
**Total Problems Solved:** 118
**By Difficulty:**
| Difficulty | Count |
|---|---|
| Easy | 56 |
| Medium | 60 |
| Hard | 2 |
**By Tag:**
| Tag | Count |
|---|---|
| Array | 68 |
| Hash Table | 28 |
| String | 27 |
| Sorting | 22 |
| Math | 17 |
| Two Pointers | 14 |
| Greedy | 11 |
| Depth-First Search | 10 |
| Stack | 10 |
| Binary Search | 10 |
| Bit Manipulation | 10 |
| Dynamic Programming | 10 |
| Database | 8 |
| Counting | 8 |
| Tree | 7 |
| Binary Tree | 7 |
| Sliding Window | 7 |
| Heap (Priority Queue) | 7 |
| Breadth-First Search | 6 |
| Design | 6 |
| Monotonic Stack | 5 |
| Recursion | 5 |
| Prefix Sum | 4 |
| Linked List | 4 |
| Matrix | 4 |
| Binary Search Tree | 3 |
| Divide and Conquer | 3 |
| Enumeration | 3 |
| Trie | 3 |
| Simulation | 3 |
| Backtracking | 3 |
| Union Find | 2 |
| Bucket Sort | 1 |
| Quickselect | 1 |
| Data Stream | 1 |
| Randomized | 1 |
| Brainteaser | 1 |
| Counting Sort | 1 |
| Memoization | 1 |
| Combinatorics | 1 |
| String Matching | 1 |
## Solutions by Tag
### Tree
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 100-same-tree | Easy | [code](./Tree/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |
| 101-symmetric-tree | Easy | [code](./Tree/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |
| 501-find-mode-in-binary-search-tree | Easy | [code](./Tree/easy/501-find-mode-in-binary-search-tree) | [leetcode](https://leetcode.com/problems/find-mode-in-binary-search-tree/) |
| 111-minimum-depth-of-binary-tree | Easy | [code](./Tree/easy/111-minimum-depth-of-binary-tree) | [leetcode](https://leetcode.com/problems/minimum-depth-of-binary-tree/) |
| 230-kth-smallest-element-in-a-bst | Medium | [code](./Tree/medium/230-kth-smallest-element-in-a-bst) | [leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |
| 98-validate-binary-search-tree | Medium | [code](./Tree/medium/98-validate-binary-search-tree) | [leetcode](https://leetcode.com/problems/validate-binary-search-tree/) |
| 998-check-completeness-of-a-binary-tree | Medium | [code](./Tree/medium/998-check-completeness-of-a-binary-tree) | [leetcode](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) |
### Depth-First Search
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 100-same-tree | Easy | [code](./Depth-First-Search/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |
| 101-symmetric-tree | Easy | [code](./Depth-First-Search/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |
| 501-find-mode-in-binary-search-tree | Easy | [code](./Depth-First-Search/easy/501-find-mode-in-binary-search-tree) | [leetcode](https://leetcode.com/problems/find-mode-in-binary-search-tree/) |
| 111-minimum-depth-of-binary-tree | Easy | [code](./Depth-First-Search/easy/111-minimum-depth-of-binary-tree) | [leetcode](https://leetcode.com/problems/minimum-depth-of-binary-tree/) |
| 230-kth-smallest-element-in-a-bst | Medium | [code](./Depth-First-Search/medium/230-kth-smallest-element-in-a-bst) | [leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |
| 98-validate-binary-search-tree | Medium | [code](./Depth-First-Search/medium/98-validate-binary-search-tree) | [leetcode](https://leetcode.com/problems/validate-binary-search-tree/) |
| 733-flood-fill | Easy | [code](./Depth-First-Search/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |
| 386-lexicographical-numbers | Medium | [code](./Depth-First-Search/medium/386-lexicographical-numbers) | [leetcode](https://leetcode.com/problems/lexicographical-numbers/) |
| 1753-path-with-minimum-effort | Medium | [code](./Depth-First-Search/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |
| 1350-remove-sub-folders-from-the-filesystem | Medium | [code](./Depth-First-Search/medium/1350-remove-sub-folders-from-the-filesystem) | [leetcode](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) |
### Breadth-First Search
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 100-same-tree | Easy | [code](./Breadth-First-Search/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |
| 101-symmetric-tree | Easy | [code](./Breadth-First-Search/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |
| 111-minimum-depth-of-binary-tree | Easy | [code](./Breadth-First-Search/easy/111-minimum-depth-of-binary-tree) | [leetcode](https://leetcode.com/problems/minimum-depth-of-binary-tree/) |
| 998-check-completeness-of-a-binary-tree | Medium | [code](./Breadth-First-Search/medium/998-check-completeness-of-a-binary-tree) | [leetcode](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) |
| 733-flood-fill | Easy | [code](./Breadth-First-Search/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |
| 1753-path-with-minimum-effort | Medium | [code](./Breadth-First-Search/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |
### Binary Tree
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 100-same-tree | Easy | [code](./Binary-Tree/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |
| 101-symmetric-tree | Easy | [code](./Binary-Tree/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |
| 501-find-mode-in-binary-search-tree | Easy | [code](./Binary-Tree/easy/501-find-mode-in-binary-search-tree) | [leetcode](https://leetcode.com/problems/find-mode-in-binary-search-tree/) |
| 111-minimum-depth-of-binary-tree | Easy | [code](./Binary-Tree/easy/111-minimum-depth-of-binary-tree) | [leetcode](https://leetcode.com/problems/minimum-depth-of-binary-tree/) |
| 230-kth-smallest-element-in-a-bst | Medium | [code](./Binary-Tree/medium/230-kth-smallest-element-in-a-bst) | [leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |
| 98-validate-binary-search-tree | Medium | [code](./Binary-Tree/medium/98-validate-binary-search-tree) | [leetcode](https://leetcode.com/problems/validate-binary-search-tree/) |
| 998-check-completeness-of-a-binary-tree | Medium | [code](./Binary-Tree/medium/998-check-completeness-of-a-binary-tree) | [leetcode](https://leetcode.com/problems/check-completeness-of-a-binary-tree/) |
### Binary Search Tree
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 501-find-mode-in-binary-search-tree | Easy | [code](./Binary-Search-Tree/easy/501-find-mode-in-binary-search-tree) | [leetcode](https://leetcode.com/problems/find-mode-in-binary-search-tree/) |
| 230-kth-smallest-element-in-a-bst | Medium | [code](./Binary-Search-Tree/medium/230-kth-smallest-element-in-a-bst) | [leetcode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |
| 98-validate-binary-search-tree | Medium | [code](./Binary-Search-Tree/medium/98-validate-binary-search-tree) | [leetcode](https://leetcode.com/problems/validate-binary-search-tree/) |
### Database
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 1724-customer-who-visited-but-did-not-make-any-transactions | Easy | [code](./Database/easy/1724-customer-who-visited-but-did-not-make-any-transactions) | [leetcode](https://leetcode.com/problems/customer-who-visited-but-did-not-make-any-transactions/) |
| 1827-invalid-tweets | Easy | [code](./Database/easy/1827-invalid-tweets) | [leetcode](https://leetcode.com/problems/invalid-tweets/) |
| 1509-replace-employee-id-with-the-unique-identifier | Easy | [code](./Database/easy/1509-replace-employee-id-with-the-unique-identifier) | [leetcode](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/) |
| 1908-recyclable-and-low-fat-products | Easy | [code](./Database/easy/1908-recyclable-and-low-fat-products) | [leetcode](https://leetcode.com/problems/recyclable-and-low-fat-products/) |
| 595-big-countries | Easy | [code](./Database/easy/595-big-countries) | [leetcode](https://leetcode.com/problems/big-countries/) |
| 584-find-customer-referee | Easy | [code](./Database/easy/584-find-customer-referee) | [leetcode](https://leetcode.com/problems/find-customer-referee/) |
| 197-rising-temperature | Easy | [code](./Database/easy/197-rising-temperature) | [leetcode](https://leetcode.com/problems/rising-temperature/) |
| 1153-product-sales-analysis-i | Easy | [code](./Database/easy/1153-product-sales-analysis-i) | [leetcode](https://leetcode.com/problems/product-sales-analysis-i/) |
### Hash Table
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2025-redistribute-characters-to-make-all-strings-equal | Easy | [code](./Hash-Table/easy/2025-redistribute-characters-to-make-all-strings-equal) | [leetcode](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/) |
| 2163-kth-distinct-string-in-an-array | Easy | [code](./Hash-Table/easy/2163-kth-distinct-string-in-an-array) | [leetcode](https://leetcode.com/problems/kth-distinct-string-in-an-array/) |
| 594-longest-harmonious-subsequence | Easy | [code](./Hash-Table/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |
| 169-majority-element | Easy | [code](./Hash-Table/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |
| 778-reorganize-string | Medium | [code](./Hash-Table/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |
| 1055-pairs-of-songs-with-total-durations-divisible-by-60 | Medium | [code](./Hash-Table/medium/1055-pairs-of-songs-with-total-durations-divisible-by-60) | [leetcode](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) |
| 900-reordered-power-of-2 | Medium | [code](./Hash-Table/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |
| 347-top-k-frequent-elements | Medium | [code](./Hash-Table/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
| 1995-finding-pairs-with-a-certain-sum | Medium | [code](./Hash-Table/medium/1995-finding-pairs-with-a-certain-sum) | [leetcode](https://leetcode.com/problems/finding-pairs-with-a-certain-sum/) |
| 1023-time-based-key-value-store | Medium | [code](./Hash-Table/medium/1023-time-based-key-value-store) | [leetcode](https://leetcode.com/problems/time-based-key-value-store/) |
| 380-insert-delete-getrandom-o1 | Medium | [code](./Hash-Table/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |
| 141-linked-list-cycle | Easy | [code](./Hash-Table/easy/141-linked-list-cycle) | [leetcode](https://leetcode.com/problems/linked-list-cycle/) |
| 496-next-greater-element-i | Easy | [code](./Hash-Table/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |
| 3-longest-substring-without-repeating-characters | Medium | [code](./Hash-Table/medium/3-longest-substring-without-repeating-characters) | [leetcode](https://leetcode.com/problems/longest-substring-without-repeating-characters/) |
| 1813-maximum-erasure-value | Medium | [code](./Hash-Table/medium/1813-maximum-erasure-value) | [leetcode](https://leetcode.com/problems/maximum-erasure-value/) |
| 1-two-sum | Easy | [code](./Hash-Table/easy/1-two-sum) | [leetcode](https://leetcode.com/problems/two-sum/) |
| 268-missing-number | Easy | [code](./Hash-Table/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |
| 2204-find-subsequence-of-length-k-with-the-largest-sum | Easy | [code](./Hash-Table/easy/2204-find-subsequence-of-length-k-with-the-largest-sum) | [leetcode](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) |
| 3788-maximum-unique-subarray-sum-after-deletion | Easy | [code](./Hash-Table/easy/3788-maximum-unique-subarray-sum-after-deletion) | [leetcode](https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/) |
| 500-keyboard-row | Easy | [code](./Hash-Table/easy/500-keyboard-row) | [leetcode](https://leetcode.com/problems/keyboard-row/) |
| 128-longest-consecutive-sequence | Medium | [code](./Hash-Table/medium/128-longest-consecutive-sequence) | [leetcode](https://leetcode.com/problems/longest-consecutive-sequence/) |
| 2661-smallest-missing-non-negative-integer-after-operations | Medium | [code](./Hash-Table/medium/2661-smallest-missing-non-negative-integer-after-operations) | [leetcode](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/) |
| 808-number-of-matching-subsequences | Medium | [code](./Hash-Table/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |
| 49-group-anagrams | Medium | [code](./Hash-Table/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |
| 36-valid-sudoku | Medium | [code](./Hash-Table/medium/36-valid-sudoku) | [leetcode](https://leetcode.com/problems/valid-sudoku/) |
| 17-letter-combinations-of-a-phone-number | Medium | [code](./Hash-Table/medium/17-letter-combinations-of-a-phone-number) | [leetcode](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) |
| 12-integer-to-roman | Medium | [code](./Hash-Table/medium/12-integer-to-roman) | [leetcode](https://leetcode.com/problems/integer-to-roman/) |
| 409-longest-palindrome | Easy | [code](./Hash-Table/easy/409-longest-palindrome) | [leetcode](https://leetcode.com/problems/longest-palindrome/) |
### String
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2025-redistribute-characters-to-make-all-strings-equal | Easy | [code](./String/easy/2025-redistribute-characters-to-make-all-strings-equal) | [leetcode](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/) |
| 2163-kth-distinct-string-in-an-array | Easy | [code](./String/easy/2163-kth-distinct-string-in-an-array) | [leetcode](https://leetcode.com/problems/kth-distinct-string-in-an-array/) |
| 778-reorganize-string | Medium | [code](./String/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |
| 1023-time-based-key-value-store | Medium | [code](./String/medium/1023-time-based-key-value-store) | [leetcode](https://leetcode.com/problems/time-based-key-value-store/) |
| 1350-remove-sub-folders-from-the-filesystem | Medium | [code](./String/medium/1350-remove-sub-folders-from-the-filesystem) | [leetcode](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) |
| 3-longest-substring-without-repeating-characters | Medium | [code](./String/medium/3-longest-substring-without-repeating-characters) | [leetcode](https://leetcode.com/problems/longest-substring-without-repeating-characters/) |
| 1351-replace-the-substring-for-balanced-string | Medium | [code](./String/medium/1351-replace-the-substring-for-balanced-string) | [leetcode](https://leetcode.com/problems/replace-the-substring-for-balanced-string/) |
| 2395-longest-binary-subsequence-less-than-or-equal-to-k | Medium | [code](./String/medium/2395-longest-binary-subsequence-less-than-or-equal-to-k) | [leetcode](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/) |
| 1751-slowest-key | Easy | [code](./String/easy/1751-slowest-key) | [leetcode](https://leetcode.com/problems/slowest-key/) |
| 500-keyboard-row | Easy | [code](./String/easy/500-keyboard-row) | [leetcode](https://leetcode.com/problems/keyboard-row/) |
| 808-number-of-matching-subsequences | Medium | [code](./String/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |
| 49-group-anagrams | Medium | [code](./String/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |
| 273-integer-to-english-words | Hard | [code](./String/hard/273-integer-to-english-words) | [leetcode](https://leetcode.com/problems/integer-to-english-words/) |
| 800-letter-case-permutation | Medium | [code](./String/medium/800-letter-case-permutation) | [leetcode](https://leetcode.com/problems/letter-case-permutation/) |
| 17-letter-combinations-of-a-phone-number | Medium | [code](./String/medium/17-letter-combinations-of-a-phone-number) | [leetcode](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) |
| 556-next-greater-element-iii | Medium | [code](./String/medium/556-next-greater-element-iii) | [leetcode](https://leetcode.com/problems/next-greater-element-iii/) |
| 12-integer-to-roman | Medium | [code](./String/medium/12-integer-to-roman) | [leetcode](https://leetcode.com/problems/integer-to-roman/) |
| 28-find-the-index-of-the-first-occurrence-in-a-string | Easy | [code](./String/easy/28-find-the-index-of-the-first-occurrence-in-a-string) | [leetcode](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) |
| 125-valid-palindrome | Easy | [code](./String/easy/125-valid-palindrome) | [leetcode](https://leetcode.com/problems/valid-palindrome/) |
| 1274-number-of-days-between-two-dates | Easy | [code](./String/easy/1274-number-of-days-between-two-dates) | [leetcode](https://leetcode.com/problems/number-of-days-between-two-dates/) |
| 409-longest-palindrome | Easy | [code](./String/easy/409-longest-palindrome) | [leetcode](https://leetcode.com/problems/longest-palindrome/) |
| 2496-count-days-spent-together | Easy | [code](./String/easy/2496-count-days-spent-together) | [leetcode](https://leetcode.com/problems/count-days-spent-together/) |
| 1302-delete-characters-to-make-fancy-string | Easy | [code](./String/easy/1302-delete-characters-to-make-fancy-string) | [leetcode](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) |
| 20-valid-parentheses | Easy | [code](./String/easy/20-valid-parentheses) | [leetcode](https://leetcode.com/problems/valid-parentheses/) |
| 3396-valid-word | Easy | [code](./String/easy/3396-valid-word) | [leetcode](https://leetcode.com/problems/valid-word/) |
| 2346-largest-3-same-digit-number-in-string | Easy | [code](./String/easy/2346-largest-3-same-digit-number-in-string) | [leetcode](https://leetcode.com/problems/largest-3-same-digit-number-in-string/) |
| 71-simplify-path | Medium | [code](./String/medium/71-simplify-path) | [leetcode](https://leetcode.com/problems/simplify-path/) |
### Counting
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2025-redistribute-characters-to-make-all-strings-equal | Easy | [code](./Counting/easy/2025-redistribute-characters-to-make-all-strings-equal) | [leetcode](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/) |
| 2163-kth-distinct-string-in-an-array | Easy | [code](./Counting/easy/2163-kth-distinct-string-in-an-array) | [leetcode](https://leetcode.com/problems/kth-distinct-string-in-an-array/) |
| 594-longest-harmonious-subsequence | Easy | [code](./Counting/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |
| 169-majority-element | Easy | [code](./Counting/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |
| 778-reorganize-string | Medium | [code](./Counting/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |
| 1055-pairs-of-songs-with-total-durations-divisible-by-60 | Medium | [code](./Counting/medium/1055-pairs-of-songs-with-total-durations-divisible-by-60) | [leetcode](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) |
| 900-reordered-power-of-2 | Medium | [code](./Counting/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |
| 347-top-k-frequent-elements | Medium | [code](./Counting/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
### Array
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2163-kth-distinct-string-in-an-array | Easy | [code](./Array/easy/2163-kth-distinct-string-in-an-array) | [leetcode](https://leetcode.com/problems/kth-distinct-string-in-an-array/) |
| 594-longest-harmonious-subsequence | Easy | [code](./Array/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |
| 169-majority-element | Easy | [code](./Array/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |
| 1055-pairs-of-songs-with-total-durations-divisible-by-60 | Medium | [code](./Array/medium/1055-pairs-of-songs-with-total-durations-divisible-by-60) | [leetcode](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) |
| 347-top-k-frequent-elements | Medium | [code](./Array/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
| 303-range-sum-query-immutable | Easy | [code](./Array/easy/303-range-sum-query-immutable) | [leetcode](https://leetcode.com/problems/range-sum-query-immutable/) |
| 1995-finding-pairs-with-a-certain-sum | Medium | [code](./Array/medium/1995-finding-pairs-with-a-certain-sum) | [leetcode](https://leetcode.com/problems/finding-pairs-with-a-certain-sum/) |
| 380-insert-delete-getrandom-o1 | Medium | [code](./Array/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |
| 733-flood-fill | Easy | [code](./Array/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |
| 1753-path-with-minimum-effort | Medium | [code](./Array/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |
| 1350-remove-sub-folders-from-the-filesystem | Medium | [code](./Array/medium/1350-remove-sub-folders-from-the-filesystem) | [leetcode](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) |
| 2503-longest-subarray-with-maximum-bitwise-and | Medium | [code](./Array/medium/2503-longest-subarray-with-maximum-bitwise-and) | [leetcode](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/) |
| 496-next-greater-element-i | Easy | [code](./Array/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |
| 503-next-greater-element-ii | Medium | [code](./Array/medium/503-next-greater-element-ii) | [leetcode](https://leetcode.com/problems/next-greater-element-ii/) |
| 883-car-fleet | Medium | [code](./Array/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |
| 739-daily-temperatures | Medium | [code](./Array/medium/739-daily-temperatures) | [leetcode](https://leetcode.com/problems/daily-temperatures/) |
| 238-product-of-array-except-self | Medium | [code](./Array/medium/238-product-of-array-except-self) | [leetcode](https://leetcode.com/problems/product-of-array-except-self/) |
| 1184-car-pooling | Medium | [code](./Array/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |
| 1966-frequency-of-the-most-frequent-element | Medium | [code](./Array/medium/1966-frequency-of-the-most-frequent-element) | [leetcode](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) |
| 561-array-partition | Easy | [code](./Array/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |
| 1813-maximum-erasure-value | Medium | [code](./Array/medium/1813-maximum-erasure-value) | [leetcode](https://leetcode.com/problems/maximum-erasure-value/) |
| 2498-smallest-subarrays-with-maximum-bitwise-or | Medium | [code](./Array/medium/2498-smallest-subarrays-with-maximum-bitwise-or) | [leetcode](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/) |
| 792-binary-search | Easy | [code](./Array/easy/792-binary-search) | [leetcode](https://leetcode.com/problems/binary-search/) |
| 1-two-sum | Easy | [code](./Array/easy/1-two-sum) | [leetcode](https://leetcode.com/problems/two-sum/) |
| 506-relative-ranks | Easy | [code](./Array/easy/506-relative-ranks) | [leetcode](https://leetcode.com/problems/relative-ranks/) |
| 268-missing-number | Easy | [code](./Array/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |
| 1127-last-stone-weight | Easy | [code](./Array/easy/1127-last-stone-weight) | [leetcode](https://leetcode.com/problems/last-stone-weight/) |
| 495-teemo-attacking | Easy | [code](./Array/easy/495-teemo-attacking) | [leetcode](https://leetcode.com/problems/teemo-attacking/) |
| 414-third-maximum-number | Easy | [code](./Array/easy/414-third-maximum-number) | [leetcode](https://leetcode.com/problems/third-maximum-number/) |
| 485-max-consecutive-ones | Easy | [code](./Array/easy/485-max-consecutive-ones) | [leetcode](https://leetcode.com/problems/max-consecutive-ones/) |
| 2204-find-subsequence-of-length-k-with-the-largest-sum | Easy | [code](./Array/easy/2204-find-subsequence-of-length-k-with-the-largest-sum) | [leetcode](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) |
| 1751-slowest-key | Easy | [code](./Array/easy/1751-slowest-key) | [leetcode](https://leetcode.com/problems/slowest-key/) |
| 1878-check-if-array-is-sorted-and-rotated | Easy | [code](./Array/easy/1878-check-if-array-is-sorted-and-rotated) | [leetcode](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) |
| 3788-maximum-unique-subarray-sum-after-deletion | Easy | [code](./Array/easy/3788-maximum-unique-subarray-sum-after-deletion) | [leetcode](https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/) |
| 118-pascals-triangle | Easy | [code](./Array/easy/118-pascals-triangle) | [leetcode](https://leetcode.com/problems/pascals-triangle/) |
| 121-best-time-to-buy-and-sell-stock | Easy | [code](./Array/easy/121-best-time-to-buy-and-sell-stock) | [leetcode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
| 500-keyboard-row | Easy | [code](./Array/easy/500-keyboard-row) | [leetcode](https://leetcode.com/problems/keyboard-row/) |
| 26-remove-duplicates-from-sorted-array | Easy | [code](./Array/easy/26-remove-duplicates-from-sorted-array) | [leetcode](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) |
| 136-single-number | Easy | [code](./Array/easy/136-single-number) | [leetcode](https://leetcode.com/problems/single-number/) |
| 88-merge-sorted-array | Easy | [code](./Array/easy/88-merge-sorted-array) | [leetcode](https://leetcode.com/problems/merge-sorted-array/) |
| 2316-count-hills-and-valleys-in-an-array | Easy | [code](./Array/easy/2316-count-hills-and-valleys-in-an-array) | [leetcode](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/) |
| 228-summary-ranges | Easy | [code](./Array/easy/228-summary-ranges) | [leetcode](https://leetcode.com/problems/summary-ranges/) |
| 1669-minimum-cost-to-cut-a-stick | Hard | [code](./Array/hard/1669-minimum-cost-to-cut-a-stick) | [leetcode](https://leetcode.com/problems/minimum-cost-to-cut-a-stick/) |
| 80-remove-duplicates-from-sorted-array-ii | Medium | [code](./Array/medium/80-remove-duplicates-from-sorted-array-ii) | [leetcode](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) |
| 189-rotate-array | Medium | [code](./Array/medium/189-rotate-array) | [leetcode](https://leetcode.com/problems/rotate-array/) |
| 128-longest-consecutive-sequence | Medium | [code](./Array/medium/128-longest-consecutive-sequence) | [leetcode](https://leetcode.com/problems/longest-consecutive-sequence/) |
| 150-evaluate-reverse-polish-notation | Medium | [code](./Array/medium/150-evaluate-reverse-polish-notation) | [leetcode](https://leetcode.com/problems/evaluate-reverse-polish-notation/) |
| 74-search-a-2d-matrix | Medium | [code](./Array/medium/74-search-a-2d-matrix) | [leetcode](https://leetcode.com/problems/search-a-2d-matrix/) |
| 75-sort-colors | Medium | [code](./Array/medium/75-sort-colors) | [leetcode](https://leetcode.com/problems/sort-colors/) |
| 3430-count-days-without-meetings | Medium | [code](./Array/medium/3430-count-days-without-meetings) | [leetcode](https://leetcode.com/problems/count-days-without-meetings/) |
| 2661-smallest-missing-non-negative-integer-after-operations | Medium | [code](./Array/medium/2661-smallest-missing-non-negative-integer-after-operations) | [leetcode](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/) |
| 2170-count-number-of-maximum-bitwise-or-subsets | Medium | [code](./Array/medium/2170-count-number-of-maximum-bitwise-or-subsets) | [leetcode](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) |
| 934-bitwise-ors-of-subarrays | Medium | [code](./Array/medium/934-bitwise-ors-of-subarrays) | [leetcode](https://leetcode.com/problems/bitwise-ors-of-subarrays/) |
| 1130-last-stone-weight-ii | Medium | [code](./Array/medium/1130-last-stone-weight-ii) | [leetcode](https://leetcode.com/problems/last-stone-weight-ii/) |
| 808-number-of-matching-subsequences | Medium | [code](./Array/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |
| 167-two-sum-ii-input-array-is-sorted | Medium | [code](./Array/medium/167-two-sum-ii-input-array-is-sorted) | [leetcode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) |
| 55-jump-game | Medium | [code](./Array/medium/55-jump-game) | [leetcode](https://leetcode.com/problems/jump-game/) |
| 53-maximum-subarray | Medium | [code](./Array/medium/53-maximum-subarray) | [leetcode](https://leetcode.com/problems/maximum-subarray/) |
| 11-container-with-most-water | Medium | [code](./Array/medium/11-container-with-most-water) | [leetcode](https://leetcode.com/problems/container-with-most-water/) |
| 134-gas-station | Medium | [code](./Array/medium/134-gas-station) | [leetcode](https://leetcode.com/problems/gas-station/) |
| 49-group-anagrams | Medium | [code](./Array/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |
| 31-next-permutation | Medium | [code](./Array/medium/31-next-permutation) | [leetcode](https://leetcode.com/problems/next-permutation/) |
| 15-3sum | Medium | [code](./Array/medium/15-3sum) | [leetcode](https://leetcode.com/problems/3sum/) |
| 36-valid-sudoku | Medium | [code](./Array/medium/36-valid-sudoku) | [leetcode](https://leetcode.com/problems/valid-sudoku/) |
| 45-jump-game-ii | Medium | [code](./Array/medium/45-jump-game-ii) | [leetcode](https://leetcode.com/problems/jump-game-ii/) |
| 735-asteroid-collision | Medium | [code](./Array/medium/735-asteroid-collision) | [leetcode](https://leetcode.com/problems/asteroid-collision/) |
| 1621-number-of-subsequences-that-satisfy-the-given-sum-condition | Medium | [code](./Array/medium/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) | [leetcode](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) |
| 3522-find-the-power-of-k-size-subarrays-i | Medium | [code](./Array/medium/3522-find-the-power-of-k-size-subarrays-i) | [leetcode](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) |
### Sliding Window
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 594-longest-harmonious-subsequence | Easy | [code](./Sliding-Window/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |
| 1966-frequency-of-the-most-frequent-element | Medium | [code](./Sliding-Window/medium/1966-frequency-of-the-most-frequent-element) | [leetcode](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) |
| 3-longest-substring-without-repeating-characters | Medium | [code](./Sliding-Window/medium/3-longest-substring-without-repeating-characters) | [leetcode](https://leetcode.com/problems/longest-substring-without-repeating-characters/) |
| 1813-maximum-erasure-value | Medium | [code](./Sliding-Window/medium/1813-maximum-erasure-value) | [leetcode](https://leetcode.com/problems/maximum-erasure-value/) |
| 2498-smallest-subarrays-with-maximum-bitwise-or | Medium | [code](./Sliding-Window/medium/2498-smallest-subarrays-with-maximum-bitwise-or) | [leetcode](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/) |
| 1351-replace-the-substring-for-balanced-string | Medium | [code](./Sliding-Window/medium/1351-replace-the-substring-for-balanced-string) | [leetcode](https://leetcode.com/problems/replace-the-substring-for-balanced-string/) |
| 3522-find-the-power-of-k-size-subarrays-i | Medium | [code](./Sliding-Window/medium/3522-find-the-power-of-k-size-subarrays-i) | [leetcode](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) |
### Sorting
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 594-longest-harmonious-subsequence | Easy | [code](./Sorting/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |
| 169-majority-element | Easy | [code](./Sorting/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |
| 778-reorganize-string | Medium | [code](./Sorting/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |
| 900-reordered-power-of-2 | Medium | [code](./Sorting/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |
| 347-top-k-frequent-elements | Medium | [code](./Sorting/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
| 147-insertion-sort-list | Medium | [code](./Sorting/medium/147-insertion-sort-list) | [leetcode](https://leetcode.com/problems/insertion-sort-list/) |
| 883-car-fleet | Medium | [code](./Sorting/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |
| 1184-car-pooling | Medium | [code](./Sorting/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |
| 1966-frequency-of-the-most-frequent-element | Medium | [code](./Sorting/medium/1966-frequency-of-the-most-frequent-element) | [leetcode](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) |
| 561-array-partition | Easy | [code](./Sorting/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |
| 506-relative-ranks | Easy | [code](./Sorting/easy/506-relative-ranks) | [leetcode](https://leetcode.com/problems/relative-ranks/) |
| 268-missing-number | Easy | [code](./Sorting/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |
| 414-third-maximum-number | Easy | [code](./Sorting/easy/414-third-maximum-number) | [leetcode](https://leetcode.com/problems/third-maximum-number/) |
| 2204-find-subsequence-of-length-k-with-the-largest-sum | Easy | [code](./Sorting/easy/2204-find-subsequence-of-length-k-with-the-largest-sum) | [leetcode](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) |
| 88-merge-sorted-array | Easy | [code](./Sorting/easy/88-merge-sorted-array) | [leetcode](https://leetcode.com/problems/merge-sorted-array/) |
| 1669-minimum-cost-to-cut-a-stick | Hard | [code](./Sorting/hard/1669-minimum-cost-to-cut-a-stick) | [leetcode](https://leetcode.com/problems/minimum-cost-to-cut-a-stick/) |
| 75-sort-colors | Medium | [code](./Sorting/medium/75-sort-colors) | [leetcode](https://leetcode.com/problems/sort-colors/) |
| 3430-count-days-without-meetings | Medium | [code](./Sorting/medium/3430-count-days-without-meetings) | [leetcode](https://leetcode.com/problems/count-days-without-meetings/) |
| 808-number-of-matching-subsequences | Medium | [code](./Sorting/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |
| 49-group-anagrams | Medium | [code](./Sorting/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |
| 15-3sum | Medium | [code](./Sorting/medium/15-3sum) | [leetcode](https://leetcode.com/problems/3sum/) |
| 1621-number-of-subsequences-that-satisfy-the-given-sum-condition | Medium | [code](./Sorting/medium/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) | [leetcode](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) |
### Divide and Conquer
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 169-majority-element | Easy | [code](./Divide-and-Conquer/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |
| 347-top-k-frequent-elements | Medium | [code](./Divide-and-Conquer/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
| 53-maximum-subarray | Medium | [code](./Divide-and-Conquer/medium/53-maximum-subarray) | [leetcode](https://leetcode.com/problems/maximum-subarray/) |
### Greedy
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 778-reorganize-string | Medium | [code](./Greedy/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |
| 1966-frequency-of-the-most-frequent-element | Medium | [code](./Greedy/medium/1966-frequency-of-the-most-frequent-element) | [leetcode](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) |
| 561-array-partition | Easy | [code](./Greedy/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |
| 2395-longest-binary-subsequence-less-than-or-equal-to-k | Medium | [code](./Greedy/medium/2395-longest-binary-subsequence-less-than-or-equal-to-k) | [leetcode](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/) |
| 3788-maximum-unique-subarray-sum-after-deletion | Easy | [code](./Greedy/easy/3788-maximum-unique-subarray-sum-after-deletion) | [leetcode](https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/) |
| 2661-smallest-missing-non-negative-integer-after-operations | Medium | [code](./Greedy/medium/2661-smallest-missing-non-negative-integer-after-operations) | [leetcode](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/) |
| 55-jump-game | Medium | [code](./Greedy/medium/55-jump-game) | [leetcode](https://leetcode.com/problems/jump-game/) |
| 11-container-with-most-water | Medium | [code](./Greedy/medium/11-container-with-most-water) | [leetcode](https://leetcode.com/problems/container-with-most-water/) |
| 134-gas-station | Medium | [code](./Greedy/medium/134-gas-station) | [leetcode](https://leetcode.com/problems/gas-station/) |
| 45-jump-game-ii | Medium | [code](./Greedy/medium/45-jump-game-ii) | [leetcode](https://leetcode.com/problems/jump-game-ii/) |
| 409-longest-palindrome | Easy | [code](./Greedy/easy/409-longest-palindrome) | [leetcode](https://leetcode.com/problems/longest-palindrome/) |
### Heap (Priority Queue)
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 778-reorganize-string | Medium | [code](./Heap-Priority-Queue/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |
| 347-top-k-frequent-elements | Medium | [code](./Heap-Priority-Queue/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
| 1753-path-with-minimum-effort | Medium | [code](./Heap-Priority-Queue/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |
| 1184-car-pooling | Medium | [code](./Heap-Priority-Queue/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |
| 506-relative-ranks | Easy | [code](./Heap-Priority-Queue/easy/506-relative-ranks) | [leetcode](https://leetcode.com/problems/relative-ranks/) |
| 1127-last-stone-weight | Easy | [code](./Heap-Priority-Queue/easy/1127-last-stone-weight) | [leetcode](https://leetcode.com/problems/last-stone-weight/) |
| 2204-find-subsequence-of-length-k-with-the-largest-sum | Easy | [code](./Heap-Priority-Queue/easy/2204-find-subsequence-of-length-k-with-the-largest-sum) | [leetcode](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) |
### Math
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 900-reordered-power-of-2 | Medium | [code](./Math/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |
| 380-insert-delete-getrandom-o1 | Medium | [code](./Math/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |
| 231-power-of-two | Easy | [code](./Math/easy/231-power-of-two) | [leetcode](https://leetcode.com/problems/power-of-two/) |
| 268-missing-number | Easy | [code](./Math/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |
| 189-rotate-array | Medium | [code](./Math/medium/189-rotate-array) | [leetcode](https://leetcode.com/problems/rotate-array/) |
| 150-evaluate-reverse-polish-notation | Medium | [code](./Math/medium/150-evaluate-reverse-polish-notation) | [leetcode](https://leetcode.com/problems/evaluate-reverse-polish-notation/) |
| 2661-smallest-missing-non-negative-integer-after-operations | Medium | [code](./Math/medium/2661-smallest-missing-non-negative-integer-after-operations) | [leetcode](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/) |
| 273-integer-to-english-words | Hard | [code](./Math/hard/273-integer-to-english-words) | [leetcode](https://leetcode.com/problems/integer-to-english-words/) |
| 3201-distribute-candies-among-children-ii | Medium | [code](./Math/medium/3201-distribute-candies-among-children-ii) | [leetcode](https://leetcode.com/problems/distribute-candies-among-children-ii/) |
| 9-palindrome-number | Easy | [code](./Math/easy/9-palindrome-number) | [leetcode](https://leetcode.com/problems/palindrome-number/) |
| 1444-number-of-steps-to-reduce-a-number-to-zero | Easy | [code](./Math/easy/1444-number-of-steps-to-reduce-a-number-to-zero) | [leetcode](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) |
| 7-reverse-integer | Medium | [code](./Math/medium/7-reverse-integer) | [leetcode](https://leetcode.com/problems/reverse-integer/) |
| 556-next-greater-element-iii | Medium | [code](./Math/medium/556-next-greater-element-iii) | [leetcode](https://leetcode.com/problems/next-greater-element-iii/) |
| 12-integer-to-roman | Medium | [code](./Math/medium/12-integer-to-roman) | [leetcode](https://leetcode.com/problems/integer-to-roman/) |
| 1274-number-of-days-between-two-dates | Easy | [code](./Math/easy/1274-number-of-days-between-two-dates) | [leetcode](https://leetcode.com/problems/number-of-days-between-two-dates/) |
| 2496-count-days-spent-together | Easy | [code](./Math/easy/2496-count-days-spent-together) | [leetcode](https://leetcode.com/problems/count-days-spent-together/) |
| 342-power-of-four | Easy | [code](./Math/easy/342-power-of-four) | [leetcode](https://leetcode.com/problems/power-of-four/) |
### Enumeration
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 900-reordered-power-of-2 | Medium | [code](./Enumeration/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |
| 2170-count-number-of-maximum-bitwise-or-subsets | Medium | [code](./Enumeration/medium/2170-count-number-of-maximum-bitwise-or-subsets) | [leetcode](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) |
| 3201-distribute-candies-among-children-ii | Medium | [code](./Enumeration/medium/3201-distribute-candies-among-children-ii) | [leetcode](https://leetcode.com/problems/distribute-candies-among-children-ii/) |
### Bucket Sort
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 347-top-k-frequent-elements | Medium | [code](./Bucket-Sort/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
### Quickselect
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 347-top-k-frequent-elements | Medium | [code](./Quickselect/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |
### Design
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 303-range-sum-query-immutable | Easy | [code](./Design/easy/303-range-sum-query-immutable) | [leetcode](https://leetcode.com/problems/range-sum-query-immutable/) |
| 937-online-stock-span | Medium | [code](./Design/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |
| 1995-finding-pairs-with-a-certain-sum | Medium | [code](./Design/medium/1995-finding-pairs-with-a-certain-sum) | [leetcode](https://leetcode.com/problems/finding-pairs-with-a-certain-sum/) |
| 155-min-stack | Medium | [code](./Design/medium/155-min-stack) | [leetcode](https://leetcode.com/problems/min-stack/) |
| 1023-time-based-key-value-store | Medium | [code](./Design/medium/1023-time-based-key-value-store) | [leetcode](https://leetcode.com/problems/time-based-key-value-store/) |
| 380-insert-delete-getrandom-o1 | Medium | [code](./Design/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |
### Prefix Sum
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 303-range-sum-query-immutable | Easy | [code](./Prefix-Sum/easy/303-range-sum-query-immutable) | [leetcode](https://leetcode.com/problems/range-sum-query-immutable/) |
| 238-product-of-array-except-self | Medium | [code](./Prefix-Sum/medium/238-product-of-array-except-self) | [leetcode](https://leetcode.com/problems/product-of-array-except-self/) |
| 1184-car-pooling | Medium | [code](./Prefix-Sum/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |
| 1966-frequency-of-the-most-frequent-element | Medium | [code](./Prefix-Sum/medium/1966-frequency-of-the-most-frequent-element) | [leetcode](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) |
### Stack
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 937-online-stock-span | Medium | [code](./Stack/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |
| 155-min-stack | Medium | [code](./Stack/medium/155-min-stack) | [leetcode](https://leetcode.com/problems/min-stack/) |
| 496-next-greater-element-i | Easy | [code](./Stack/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |
| 503-next-greater-element-ii | Medium | [code](./Stack/medium/503-next-greater-element-ii) | [leetcode](https://leetcode.com/problems/next-greater-element-ii/) |
| 883-car-fleet | Medium | [code](./Stack/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |
| 739-daily-temperatures | Medium | [code](./Stack/medium/739-daily-temperatures) | [leetcode](https://leetcode.com/problems/daily-temperatures/) |
| 150-evaluate-reverse-polish-notation | Medium | [code](./Stack/medium/150-evaluate-reverse-polish-notation) | [leetcode](https://leetcode.com/problems/evaluate-reverse-polish-notation/) |
| 735-asteroid-collision | Medium | [code](./Stack/medium/735-asteroid-collision) | [leetcode](https://leetcode.com/problems/asteroid-collision/) |
| 20-valid-parentheses | Easy | [code](./Stack/easy/20-valid-parentheses) | [leetcode](https://leetcode.com/problems/valid-parentheses/) |
| 71-simplify-path | Medium | [code](./Stack/medium/71-simplify-path) | [leetcode](https://leetcode.com/problems/simplify-path/) |
### Monotonic Stack
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 937-online-stock-span | Medium | [code](./Monotonic-Stack/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |
| 496-next-greater-element-i | Easy | [code](./Monotonic-Stack/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |
| 503-next-greater-element-ii | Medium | [code](./Monotonic-Stack/medium/503-next-greater-element-ii) | [leetcode](https://leetcode.com/problems/next-greater-element-ii/) |
| 883-car-fleet | Medium | [code](./Monotonic-Stack/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |
| 739-daily-temperatures | Medium | [code](./Monotonic-Stack/medium/739-daily-temperatures) | [leetcode](https://leetcode.com/problems/daily-temperatures/) |
### Data Stream
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 937-online-stock-span | Medium | [code](./Data-Stream/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |
### Binary Search
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 1023-time-based-key-value-store | Medium | [code](./Binary-Search/medium/1023-time-based-key-value-store) | [leetcode](https://leetcode.com/problems/time-based-key-value-store/) |
| 1753-path-with-minimum-effort | Medium | [code](./Binary-Search/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |
| 1966-frequency-of-the-most-frequent-element | Medium | [code](./Binary-Search/medium/1966-frequency-of-the-most-frequent-element) | [leetcode](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) |
| 2498-smallest-subarrays-with-maximum-bitwise-or | Medium | [code](./Binary-Search/medium/2498-smallest-subarrays-with-maximum-bitwise-or) | [leetcode](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/) |
| 792-binary-search | Easy | [code](./Binary-Search/easy/792-binary-search) | [leetcode](https://leetcode.com/problems/binary-search/) |
| 268-missing-number | Easy | [code](./Binary-Search/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |
| 74-search-a-2d-matrix | Medium | [code](./Binary-Search/medium/74-search-a-2d-matrix) | [leetcode](https://leetcode.com/problems/search-a-2d-matrix/) |
| 808-number-of-matching-subsequences | Medium | [code](./Binary-Search/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |
| 167-two-sum-ii-input-array-is-sorted | Medium | [code](./Binary-Search/medium/167-two-sum-ii-input-array-is-sorted) | [leetcode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) |
| 1621-number-of-subsequences-that-satisfy-the-given-sum-condition | Medium | [code](./Binary-Search/medium/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) | [leetcode](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) |
### Randomized
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 380-insert-delete-getrandom-o1 | Medium | [code](./Randomized/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |
### Linked List
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 206-reverse-linked-list | Easy | [code](./Linked-List/easy/206-reverse-linked-list) | [leetcode](https://leetcode.com/problems/reverse-linked-list/) |
| 141-linked-list-cycle | Easy | [code](./Linked-List/easy/141-linked-list-cycle) | [leetcode](https://leetcode.com/problems/linked-list-cycle/) |
| 21-merge-two-sorted-lists | Easy | [code](./Linked-List/easy/21-merge-two-sorted-lists) | [leetcode](https://leetcode.com/problems/merge-two-sorted-lists/) |
| 147-insertion-sort-list | Medium | [code](./Linked-List/medium/147-insertion-sort-list) | [leetcode](https://leetcode.com/problems/insertion-sort-list/) |
### Recursion
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 206-reverse-linked-list | Easy | [code](./Recursion/easy/206-reverse-linked-list) | [leetcode](https://leetcode.com/problems/reverse-linked-list/) |
| 21-merge-two-sorted-lists | Easy | [code](./Recursion/easy/21-merge-two-sorted-lists) | [leetcode](https://leetcode.com/problems/merge-two-sorted-lists/) |
| 231-power-of-two | Easy | [code](./Recursion/easy/231-power-of-two) | [leetcode](https://leetcode.com/problems/power-of-two/) |
| 273-integer-to-english-words | Hard | [code](./Recursion/hard/273-integer-to-english-words) | [leetcode](https://leetcode.com/problems/integer-to-english-words/) |
| 342-power-of-four | Easy | [code](./Recursion/easy/342-power-of-four) | [leetcode](https://leetcode.com/problems/power-of-four/) |
### Two Pointers
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 141-linked-list-cycle | Easy | [code](./Two-Pointers/easy/141-linked-list-cycle) | [leetcode](https://leetcode.com/problems/linked-list-cycle/) |
| 26-remove-duplicates-from-sorted-array | Easy | [code](./Two-Pointers/easy/26-remove-duplicates-from-sorted-array) | [leetcode](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) |
| 88-merge-sorted-array | Easy | [code](./Two-Pointers/easy/88-merge-sorted-array) | [leetcode](https://leetcode.com/problems/merge-sorted-array/) |
| 80-remove-duplicates-from-sorted-array-ii | Medium | [code](./Two-Pointers/medium/80-remove-duplicates-from-sorted-array-ii) | [leetcode](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) |
| 189-rotate-array | Medium | [code](./Two-Pointers/medium/189-rotate-array) | [leetcode](https://leetcode.com/problems/rotate-array/) |
| 75-sort-colors | Medium | [code](./Two-Pointers/medium/75-sort-colors) | [leetcode](https://leetcode.com/problems/sort-colors/) |
| 167-two-sum-ii-input-array-is-sorted | Medium | [code](./Two-Pointers/medium/167-two-sum-ii-input-array-is-sorted) | [leetcode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) |
| 11-container-with-most-water | Medium | [code](./Two-Pointers/medium/11-container-with-most-water) | [leetcode](https://leetcode.com/problems/container-with-most-water/) |
| 31-next-permutation | Medium | [code](./Two-Pointers/medium/31-next-permutation) | [leetcode](https://leetcode.com/problems/next-permutation/) |
| 15-3sum | Medium | [code](./Two-Pointers/medium/15-3sum) | [leetcode](https://leetcode.com/problems/3sum/) |
| 1621-number-of-subsequences-that-satisfy-the-given-sum-condition | Medium | [code](./Two-Pointers/medium/1621-number-of-subsequences-that-satisfy-the-given-sum-condition) | [leetcode](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) |
| 556-next-greater-element-iii | Medium | [code](./Two-Pointers/medium/556-next-greater-element-iii) | [leetcode](https://leetcode.com/problems/next-greater-element-iii/) |
| 28-find-the-index-of-the-first-occurrence-in-a-string | Easy | [code](./Two-Pointers/easy/28-find-the-index-of-the-first-occurrence-in-a-string) | [leetcode](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) |
| 125-valid-palindrome | Easy | [code](./Two-Pointers/easy/125-valid-palindrome) | [leetcode](https://leetcode.com/problems/valid-palindrome/) |
### Matrix
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 733-flood-fill | Easy | [code](./Matrix/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |
| 1753-path-with-minimum-effort | Medium | [code](./Matrix/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |
| 74-search-a-2d-matrix | Medium | [code](./Matrix/medium/74-search-a-2d-matrix) | [leetcode](https://leetcode.com/problems/search-a-2d-matrix/) |
| 36-valid-sudoku | Medium | [code](./Matrix/medium/36-valid-sudoku) | [leetcode](https://leetcode.com/problems/valid-sudoku/) |
### Trie
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 386-lexicographical-numbers | Medium | [code](./Trie/medium/386-lexicographical-numbers) | [leetcode](https://leetcode.com/problems/lexicographical-numbers/) |
| 1350-remove-sub-folders-from-the-filesystem | Medium | [code](./Trie/medium/1350-remove-sub-folders-from-the-filesystem) | [leetcode](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) |
| 808-number-of-matching-subsequences | Medium | [code](./Trie/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |
### Union Find
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 1753-path-with-minimum-effort | Medium | [code](./Union-Find/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |
| 128-longest-consecutive-sequence | Medium | [code](./Union-Find/medium/128-longest-consecutive-sequence) | [leetcode](https://leetcode.com/problems/longest-consecutive-sequence/) |
### Bit Manipulation
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2503-longest-subarray-with-maximum-bitwise-and | Medium | [code](./Bit-Manipulation/medium/2503-longest-subarray-with-maximum-bitwise-and) | [leetcode](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/) |
| 2498-smallest-subarrays-with-maximum-bitwise-or | Medium | [code](./Bit-Manipulation/medium/2498-smallest-subarrays-with-maximum-bitwise-or) | [leetcode](https://leetcode.com/problems/smallest-subarrays-with-maximum-bitwise-or/) |
| 231-power-of-two | Easy | [code](./Bit-Manipulation/easy/231-power-of-two) | [leetcode](https://leetcode.com/problems/power-of-two/) |
| 268-missing-number | Easy | [code](./Bit-Manipulation/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |
| 136-single-number | Easy | [code](./Bit-Manipulation/easy/136-single-number) | [leetcode](https://leetcode.com/problems/single-number/) |
| 2170-count-number-of-maximum-bitwise-or-subsets | Medium | [code](./Bit-Manipulation/medium/2170-count-number-of-maximum-bitwise-or-subsets) | [leetcode](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) |
| 934-bitwise-ors-of-subarrays | Medium | [code](./Bit-Manipulation/medium/934-bitwise-ors-of-subarrays) | [leetcode](https://leetcode.com/problems/bitwise-ors-of-subarrays/) |
| 800-letter-case-permutation | Medium | [code](./Bit-Manipulation/medium/800-letter-case-permutation) | [leetcode](https://leetcode.com/problems/letter-case-permutation/) |
| 1444-number-of-steps-to-reduce-a-number-to-zero | Easy | [code](./Bit-Manipulation/easy/1444-number-of-steps-to-reduce-a-number-to-zero) | [leetcode](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) |
| 342-power-of-four | Easy | [code](./Bit-Manipulation/easy/342-power-of-four) | [leetcode](https://leetcode.com/problems/power-of-four/) |
### Brainteaser
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2503-longest-subarray-with-maximum-bitwise-and | Medium | [code](./Brainteaser/medium/2503-longest-subarray-with-maximum-bitwise-and) | [leetcode](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/) |
### Simulation
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 1184-car-pooling | Medium | [code](./Simulation/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |
| 495-teemo-attacking | Easy | [code](./Simulation/easy/495-teemo-attacking) | [leetcode](https://leetcode.com/problems/teemo-attacking/) |
| 735-asteroid-collision | Medium | [code](./Simulation/medium/735-asteroid-collision) | [leetcode](https://leetcode.com/problems/asteroid-collision/) |
### Counting Sort
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 561-array-partition | Easy | [code](./Counting-Sort/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |
### Dynamic Programming
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2395-longest-binary-subsequence-less-than-or-equal-to-k | Medium | [code](./Dynamic-Programming/medium/2395-longest-binary-subsequence-less-than-or-equal-to-k) | [leetcode](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/) |
| 118-pascals-triangle | Easy | [code](./Dynamic-Programming/easy/118-pascals-triangle) | [leetcode](https://leetcode.com/problems/pascals-triangle/) |
| 121-best-time-to-buy-and-sell-stock | Easy | [code](./Dynamic-Programming/easy/121-best-time-to-buy-and-sell-stock) | [leetcode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
| 1669-minimum-cost-to-cut-a-stick | Hard | [code](./Dynamic-Programming/hard/1669-minimum-cost-to-cut-a-stick) | [leetcode](https://leetcode.com/problems/minimum-cost-to-cut-a-stick/) |
| 934-bitwise-ors-of-subarrays | Medium | [code](./Dynamic-Programming/medium/934-bitwise-ors-of-subarrays) | [leetcode](https://leetcode.com/problems/bitwise-ors-of-subarrays/) |
| 1130-last-stone-weight-ii | Medium | [code](./Dynamic-Programming/medium/1130-last-stone-weight-ii) | [leetcode](https://leetcode.com/problems/last-stone-weight-ii/) |
| 808-number-of-matching-subsequences | Medium | [code](./Dynamic-Programming/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |
| 55-jump-game | Medium | [code](./Dynamic-Programming/medium/55-jump-game) | [leetcode](https://leetcode.com/problems/jump-game/) |
| 53-maximum-subarray | Medium | [code](./Dynamic-Programming/medium/53-maximum-subarray) | [leetcode](https://leetcode.com/problems/maximum-subarray/) |
| 45-jump-game-ii | Medium | [code](./Dynamic-Programming/medium/45-jump-game-ii) | [leetcode](https://leetcode.com/problems/jump-game-ii/) |
### Memoization
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2395-longest-binary-subsequence-less-than-or-equal-to-k | Medium | [code](./Memoization/medium/2395-longest-binary-subsequence-less-than-or-equal-to-k) | [leetcode](https://leetcode.com/problems/longest-binary-subsequence-less-than-or-equal-to-k/) |
### Backtracking
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 2170-count-number-of-maximum-bitwise-or-subsets | Medium | [code](./Backtracking/medium/2170-count-number-of-maximum-bitwise-or-subsets) | [leetcode](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) |
| 800-letter-case-permutation | Medium | [code](./Backtracking/medium/800-letter-case-permutation) | [leetcode](https://leetcode.com/problems/letter-case-permutation/) |
| 17-letter-combinations-of-a-phone-number | Medium | [code](./Backtracking/medium/17-letter-combinations-of-a-phone-number) | [leetcode](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) |
### Combinatorics
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 3201-distribute-candies-among-children-ii | Medium | [code](./Combinatorics/medium/3201-distribute-candies-among-children-ii) | [leetcode](https://leetcode.com/problems/distribute-candies-among-children-ii/) |
### String Matching
| Problem | Difficulty | Code | LeetCode |
|---|---|---|---|
| 28-find-the-index-of-the-first-occurrence-in-a-string | Easy | [code](./String-Matching/easy/28-find-the-index-of-the-first-occurrence-in-a-string) | [leetcode](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) |