{"id":31693445,"url":"https://github.com/himudigonda/leetcode-old","last_synced_at":"2025-10-08T15:19:20.432Z","repository":{"id":302021474,"uuid":"929404934","full_name":"himudigonda/leetcode-old","owner":"himudigonda","description":"My LeetCode Journey","archived":false,"fork":false,"pushed_at":"2025-08-22T00:14:53.000Z","size":374,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-29T06:15:41.944Z","etag":null,"topics":["algorithms-and-data-structures","data-structures-and-algorithms","dsa","dsa-practice","python","sql"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/himudigonda.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-02-08T13:27:05.000Z","updated_at":"2025-08-24T15:01:42.000Z","dependencies_parsed_at":"2025-06-30T06:39:36.255Z","dependency_job_id":"228d5145-02e2-4566-8864-15b5857bbbc4","html_url":"https://github.com/himudigonda/leetcode-old","commit_stats":null,"previous_names":["himudigonda/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/himudigonda/leetcode-old","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himudigonda%2Fleetcode-old","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himudigonda%2Fleetcode-old/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himudigonda%2Fleetcode-old/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himudigonda%2Fleetcode-old/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/himudigonda","download_url":"https://codeload.github.com/himudigonda/leetcode-old/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/himudigonda%2Fleetcode-old/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":278965835,"owners_count":26076971,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-08T02:00:06.501Z","response_time":56,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms-and-data-structures","data-structures-and-algorithms","dsa","dsa-practice","python","sql"],"created_at":"2025-10-08T15:19:17.001Z","updated_at":"2025-10-08T15:19:20.422Z","avatar_url":"https://github.com/himudigonda.png","language":"Python","readme":"# LeetCode Solutions Overview\n\n## 🧮 Summary Stats\n\n**Total Problems Solved:** 118\n\n**By Difficulty:**\n\n| Difficulty | Count |\n|---|---|\n| Easy | 56 |\n| Medium | 60 |\n| Hard | 2 |\n\n**By Tag:**\n\n| Tag | Count |\n|---|---|\n| Array | 68 |\n| Hash Table | 28 |\n| String | 27 |\n| Sorting | 22 |\n| Math | 17 |\n| Two Pointers | 14 |\n| Greedy | 11 |\n| Depth-First Search | 10 |\n| Stack | 10 |\n| Binary Search | 10 |\n| Bit Manipulation | 10 |\n| Dynamic Programming | 10 |\n| Database | 8 |\n| Counting | 8 |\n| Tree | 7 |\n| Binary Tree | 7 |\n| Sliding Window | 7 |\n| Heap (Priority Queue) | 7 |\n| Breadth-First Search | 6 |\n| Design | 6 |\n| Monotonic Stack | 5 |\n| Recursion | 5 |\n| Prefix Sum | 4 |\n| Linked List | 4 |\n| Matrix | 4 |\n| Binary Search Tree | 3 |\n| Divide and Conquer | 3 |\n| Enumeration | 3 |\n| Trie | 3 |\n| Simulation | 3 |\n| Backtracking | 3 |\n| Union Find | 2 |\n| Bucket Sort | 1 |\n| Quickselect | 1 |\n| Data Stream | 1 |\n| Randomized | 1 |\n| Brainteaser | 1 |\n| Counting Sort | 1 |\n| Memoization | 1 |\n| Combinatorics | 1 |\n| String Matching | 1 |\n\n## Solutions by Tag\n\n### Tree\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 100-same-tree | Easy | [code](./Tree/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |\n| 101-symmetric-tree | Easy | [code](./Tree/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 98-validate-binary-search-tree | Medium | [code](./Tree/medium/98-validate-binary-search-tree) | [leetcode](https://leetcode.com/problems/validate-binary-search-tree/) |\n| 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/) |\n\n### Depth-First Search\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 100-same-tree | Easy | [code](./Depth-First-Search/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |\n| 101-symmetric-tree | Easy | [code](./Depth-First-Search/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 733-flood-fill | Easy | [code](./Depth-First-Search/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |\n| 386-lexicographical-numbers | Medium | [code](./Depth-First-Search/medium/386-lexicographical-numbers) | [leetcode](https://leetcode.com/problems/lexicographical-numbers/) |\n| 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/) |\n| 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/) |\n\n### Breadth-First Search\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 100-same-tree | Easy | [code](./Breadth-First-Search/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |\n| 101-symmetric-tree | Easy | [code](./Breadth-First-Search/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |\n| 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/) |\n| 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/) |\n| 733-flood-fill | Easy | [code](./Breadth-First-Search/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |\n| 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/) |\n\n### Binary Tree\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 100-same-tree | Easy | [code](./Binary-Tree/easy/100-same-tree) | [leetcode](https://leetcode.com/problems/same-tree/) |\n| 101-symmetric-tree | Easy | [code](./Binary-Tree/easy/101-symmetric-tree) | [leetcode](https://leetcode.com/problems/symmetric-tree/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 98-validate-binary-search-tree | Medium | [code](./Binary-Tree/medium/98-validate-binary-search-tree) | [leetcode](https://leetcode.com/problems/validate-binary-search-tree/) |\n| 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/) |\n\n### Binary Search Tree\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 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/) |\n| 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/) |\n\n### Database\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 1827-invalid-tweets | Easy | [code](./Database/easy/1827-invalid-tweets) | [leetcode](https://leetcode.com/problems/invalid-tweets/) |\n| 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/) |\n| 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/) |\n| 595-big-countries | Easy | [code](./Database/easy/595-big-countries) | [leetcode](https://leetcode.com/problems/big-countries/) |\n| 584-find-customer-referee | Easy | [code](./Database/easy/584-find-customer-referee) | [leetcode](https://leetcode.com/problems/find-customer-referee/) |\n| 197-rising-temperature | Easy | [code](./Database/easy/197-rising-temperature) | [leetcode](https://leetcode.com/problems/rising-temperature/) |\n| 1153-product-sales-analysis-i | Easy | [code](./Database/easy/1153-product-sales-analysis-i) | [leetcode](https://leetcode.com/problems/product-sales-analysis-i/) |\n\n### Hash Table\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 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/) |\n| 594-longest-harmonious-subsequence | Easy | [code](./Hash-Table/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |\n| 169-majority-element | Easy | [code](./Hash-Table/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |\n| 778-reorganize-string | Medium | [code](./Hash-Table/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |\n| 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/) |\n| 900-reordered-power-of-2 | Medium | [code](./Hash-Table/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |\n| 347-top-k-frequent-elements | Medium | [code](./Hash-Table/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |\n| 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/) |\n| 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/) |\n| 380-insert-delete-getrandom-o1 | Medium | [code](./Hash-Table/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |\n| 141-linked-list-cycle | Easy | [code](./Hash-Table/easy/141-linked-list-cycle) | [leetcode](https://leetcode.com/problems/linked-list-cycle/) |\n| 496-next-greater-element-i | Easy | [code](./Hash-Table/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |\n| 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/) |\n| 1813-maximum-erasure-value | Medium | [code](./Hash-Table/medium/1813-maximum-erasure-value) | [leetcode](https://leetcode.com/problems/maximum-erasure-value/) |\n| 1-two-sum | Easy | [code](./Hash-Table/easy/1-two-sum) | [leetcode](https://leetcode.com/problems/two-sum/) |\n| 268-missing-number | Easy | [code](./Hash-Table/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |\n| 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/) |\n| 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/) |\n| 500-keyboard-row | Easy | [code](./Hash-Table/easy/500-keyboard-row) | [leetcode](https://leetcode.com/problems/keyboard-row/) |\n| 128-longest-consecutive-sequence | Medium | [code](./Hash-Table/medium/128-longest-consecutive-sequence) | [leetcode](https://leetcode.com/problems/longest-consecutive-sequence/) |\n| 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/) |\n| 808-number-of-matching-subsequences | Medium | [code](./Hash-Table/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |\n| 49-group-anagrams | Medium | [code](./Hash-Table/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |\n| 36-valid-sudoku | Medium | [code](./Hash-Table/medium/36-valid-sudoku) | [leetcode](https://leetcode.com/problems/valid-sudoku/) |\n| 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/) |\n| 12-integer-to-roman | Medium | [code](./Hash-Table/medium/12-integer-to-roman) | [leetcode](https://leetcode.com/problems/integer-to-roman/) |\n| 409-longest-palindrome | Easy | [code](./Hash-Table/easy/409-longest-palindrome) | [leetcode](https://leetcode.com/problems/longest-palindrome/) |\n\n### String\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 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/) |\n| 778-reorganize-string | Medium | [code](./String/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 1751-slowest-key | Easy | [code](./String/easy/1751-slowest-key) | [leetcode](https://leetcode.com/problems/slowest-key/) |\n| 500-keyboard-row | Easy | [code](./String/easy/500-keyboard-row) | [leetcode](https://leetcode.com/problems/keyboard-row/) |\n| 808-number-of-matching-subsequences | Medium | [code](./String/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |\n| 49-group-anagrams | Medium | [code](./String/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |\n| 273-integer-to-english-words | Hard | [code](./String/hard/273-integer-to-english-words) | [leetcode](https://leetcode.com/problems/integer-to-english-words/) |\n| 800-letter-case-permutation | Medium | [code](./String/medium/800-letter-case-permutation) | [leetcode](https://leetcode.com/problems/letter-case-permutation/) |\n| 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/) |\n| 556-next-greater-element-iii | Medium | [code](./String/medium/556-next-greater-element-iii) | [leetcode](https://leetcode.com/problems/next-greater-element-iii/) |\n| 12-integer-to-roman | Medium | [code](./String/medium/12-integer-to-roman) | [leetcode](https://leetcode.com/problems/integer-to-roman/) |\n| 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/) |\n| 125-valid-palindrome | Easy | [code](./String/easy/125-valid-palindrome) | [leetcode](https://leetcode.com/problems/valid-palindrome/) |\n| 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/) |\n| 409-longest-palindrome | Easy | [code](./String/easy/409-longest-palindrome) | [leetcode](https://leetcode.com/problems/longest-palindrome/) |\n| 2496-count-days-spent-together | Easy | [code](./String/easy/2496-count-days-spent-together) | [leetcode](https://leetcode.com/problems/count-days-spent-together/) |\n| 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/) |\n| 20-valid-parentheses | Easy | [code](./String/easy/20-valid-parentheses) | [leetcode](https://leetcode.com/problems/valid-parentheses/) |\n| 3396-valid-word | Easy | [code](./String/easy/3396-valid-word) | [leetcode](https://leetcode.com/problems/valid-word/) |\n| 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/) |\n| 71-simplify-path | Medium | [code](./String/medium/71-simplify-path) | [leetcode](https://leetcode.com/problems/simplify-path/) |\n\n### Counting\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 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/) |\n| 594-longest-harmonious-subsequence | Easy | [code](./Counting/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |\n| 169-majority-element | Easy | [code](./Counting/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |\n| 778-reorganize-string | Medium | [code](./Counting/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |\n| 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/) |\n| 900-reordered-power-of-2 | Medium | [code](./Counting/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |\n| 347-top-k-frequent-elements | Medium | [code](./Counting/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |\n\n### Array\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 594-longest-harmonious-subsequence | Easy | [code](./Array/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |\n| 169-majority-element | Easy | [code](./Array/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |\n| 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/) |\n| 347-top-k-frequent-elements | Medium | [code](./Array/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |\n| 303-range-sum-query-immutable | Easy | [code](./Array/easy/303-range-sum-query-immutable) | [leetcode](https://leetcode.com/problems/range-sum-query-immutable/) |\n| 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/) |\n| 380-insert-delete-getrandom-o1 | Medium | [code](./Array/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |\n| 733-flood-fill | Easy | [code](./Array/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |\n| 1753-path-with-minimum-effort | Medium | [code](./Array/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |\n| 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/) |\n| 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/) |\n| 496-next-greater-element-i | Easy | [code](./Array/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |\n| 503-next-greater-element-ii | Medium | [code](./Array/medium/503-next-greater-element-ii) | [leetcode](https://leetcode.com/problems/next-greater-element-ii/) |\n| 883-car-fleet | Medium | [code](./Array/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |\n| 739-daily-temperatures | Medium | [code](./Array/medium/739-daily-temperatures) | [leetcode](https://leetcode.com/problems/daily-temperatures/) |\n| 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/) |\n| 1184-car-pooling | Medium | [code](./Array/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |\n| 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/) |\n| 561-array-partition | Easy | [code](./Array/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |\n| 1813-maximum-erasure-value | Medium | [code](./Array/medium/1813-maximum-erasure-value) | [leetcode](https://leetcode.com/problems/maximum-erasure-value/) |\n| 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/) |\n| 792-binary-search | Easy | [code](./Array/easy/792-binary-search) | [leetcode](https://leetcode.com/problems/binary-search/) |\n| 1-two-sum | Easy | [code](./Array/easy/1-two-sum) | [leetcode](https://leetcode.com/problems/two-sum/) |\n| 506-relative-ranks | Easy | [code](./Array/easy/506-relative-ranks) | [leetcode](https://leetcode.com/problems/relative-ranks/) |\n| 268-missing-number | Easy | [code](./Array/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |\n| 1127-last-stone-weight | Easy | [code](./Array/easy/1127-last-stone-weight) | [leetcode](https://leetcode.com/problems/last-stone-weight/) |\n| 495-teemo-attacking | Easy | [code](./Array/easy/495-teemo-attacking) | [leetcode](https://leetcode.com/problems/teemo-attacking/) |\n| 414-third-maximum-number | Easy | [code](./Array/easy/414-third-maximum-number) | [leetcode](https://leetcode.com/problems/third-maximum-number/) |\n| 485-max-consecutive-ones | Easy | [code](./Array/easy/485-max-consecutive-ones) | [leetcode](https://leetcode.com/problems/max-consecutive-ones/) |\n| 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/) |\n| 1751-slowest-key | Easy | [code](./Array/easy/1751-slowest-key) | [leetcode](https://leetcode.com/problems/slowest-key/) |\n| 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/) |\n| 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/) |\n| 118-pascals-triangle | Easy | [code](./Array/easy/118-pascals-triangle) | [leetcode](https://leetcode.com/problems/pascals-triangle/) |\n| 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/) |\n| 500-keyboard-row | Easy | [code](./Array/easy/500-keyboard-row) | [leetcode](https://leetcode.com/problems/keyboard-row/) |\n| 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/) |\n| 136-single-number | Easy | [code](./Array/easy/136-single-number) | [leetcode](https://leetcode.com/problems/single-number/) |\n| 88-merge-sorted-array | Easy | [code](./Array/easy/88-merge-sorted-array) | [leetcode](https://leetcode.com/problems/merge-sorted-array/) |\n| 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/) |\n| 228-summary-ranges | Easy | [code](./Array/easy/228-summary-ranges) | [leetcode](https://leetcode.com/problems/summary-ranges/) |\n| 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/) |\n| 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/) |\n| 189-rotate-array | Medium | [code](./Array/medium/189-rotate-array) | [leetcode](https://leetcode.com/problems/rotate-array/) |\n| 128-longest-consecutive-sequence | Medium | [code](./Array/medium/128-longest-consecutive-sequence) | [leetcode](https://leetcode.com/problems/longest-consecutive-sequence/) |\n| 150-evaluate-reverse-polish-notation | Medium | [code](./Array/medium/150-evaluate-reverse-polish-notation) | [leetcode](https://leetcode.com/problems/evaluate-reverse-polish-notation/) |\n| 74-search-a-2d-matrix | Medium | [code](./Array/medium/74-search-a-2d-matrix) | [leetcode](https://leetcode.com/problems/search-a-2d-matrix/) |\n| 75-sort-colors | Medium | [code](./Array/medium/75-sort-colors) | [leetcode](https://leetcode.com/problems/sort-colors/) |\n| 3430-count-days-without-meetings | Medium | [code](./Array/medium/3430-count-days-without-meetings) | [leetcode](https://leetcode.com/problems/count-days-without-meetings/) |\n| 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/) |\n| 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/) |\n| 934-bitwise-ors-of-subarrays | Medium | [code](./Array/medium/934-bitwise-ors-of-subarrays) | [leetcode](https://leetcode.com/problems/bitwise-ors-of-subarrays/) |\n| 1130-last-stone-weight-ii | Medium | [code](./Array/medium/1130-last-stone-weight-ii) | [leetcode](https://leetcode.com/problems/last-stone-weight-ii/) |\n| 808-number-of-matching-subsequences | Medium | [code](./Array/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |\n| 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/) |\n| 55-jump-game | Medium | [code](./Array/medium/55-jump-game) | [leetcode](https://leetcode.com/problems/jump-game/) |\n| 53-maximum-subarray | Medium | [code](./Array/medium/53-maximum-subarray) | [leetcode](https://leetcode.com/problems/maximum-subarray/) |\n| 11-container-with-most-water | Medium | [code](./Array/medium/11-container-with-most-water) | [leetcode](https://leetcode.com/problems/container-with-most-water/) |\n| 134-gas-station | Medium | [code](./Array/medium/134-gas-station) | [leetcode](https://leetcode.com/problems/gas-station/) |\n| 49-group-anagrams | Medium | [code](./Array/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |\n| 31-next-permutation | Medium | [code](./Array/medium/31-next-permutation) | [leetcode](https://leetcode.com/problems/next-permutation/) |\n| 15-3sum | Medium | [code](./Array/medium/15-3sum) | [leetcode](https://leetcode.com/problems/3sum/) |\n| 36-valid-sudoku | Medium | [code](./Array/medium/36-valid-sudoku) | [leetcode](https://leetcode.com/problems/valid-sudoku/) |\n| 45-jump-game-ii | Medium | [code](./Array/medium/45-jump-game-ii) | [leetcode](https://leetcode.com/problems/jump-game-ii/) |\n| 735-asteroid-collision | Medium | [code](./Array/medium/735-asteroid-collision) | [leetcode](https://leetcode.com/problems/asteroid-collision/) |\n| 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/) |\n| 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/) |\n\n### Sliding Window\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 594-longest-harmonious-subsequence | Easy | [code](./Sliding-Window/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |\n| 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/) |\n| 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/) |\n| 1813-maximum-erasure-value | Medium | [code](./Sliding-Window/medium/1813-maximum-erasure-value) | [leetcode](https://leetcode.com/problems/maximum-erasure-value/) |\n| 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/) |\n| 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/) |\n| 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/) |\n\n### Sorting\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 594-longest-harmonious-subsequence | Easy | [code](./Sorting/easy/594-longest-harmonious-subsequence) | [leetcode](https://leetcode.com/problems/longest-harmonious-subsequence/) |\n| 169-majority-element | Easy | [code](./Sorting/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |\n| 778-reorganize-string | Medium | [code](./Sorting/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |\n| 900-reordered-power-of-2 | Medium | [code](./Sorting/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |\n| 347-top-k-frequent-elements | Medium | [code](./Sorting/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |\n| 147-insertion-sort-list | Medium | [code](./Sorting/medium/147-insertion-sort-list) | [leetcode](https://leetcode.com/problems/insertion-sort-list/) |\n| 883-car-fleet | Medium | [code](./Sorting/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |\n| 1184-car-pooling | Medium | [code](./Sorting/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |\n| 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/) |\n| 561-array-partition | Easy | [code](./Sorting/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |\n| 506-relative-ranks | Easy | [code](./Sorting/easy/506-relative-ranks) | [leetcode](https://leetcode.com/problems/relative-ranks/) |\n| 268-missing-number | Easy | [code](./Sorting/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |\n| 414-third-maximum-number | Easy | [code](./Sorting/easy/414-third-maximum-number) | [leetcode](https://leetcode.com/problems/third-maximum-number/) |\n| 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/) |\n| 88-merge-sorted-array | Easy | [code](./Sorting/easy/88-merge-sorted-array) | [leetcode](https://leetcode.com/problems/merge-sorted-array/) |\n| 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/) |\n| 75-sort-colors | Medium | [code](./Sorting/medium/75-sort-colors) | [leetcode](https://leetcode.com/problems/sort-colors/) |\n| 3430-count-days-without-meetings | Medium | [code](./Sorting/medium/3430-count-days-without-meetings) | [leetcode](https://leetcode.com/problems/count-days-without-meetings/) |\n| 808-number-of-matching-subsequences | Medium | [code](./Sorting/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |\n| 49-group-anagrams | Medium | [code](./Sorting/medium/49-group-anagrams) | [leetcode](https://leetcode.com/problems/group-anagrams/) |\n| 15-3sum | Medium | [code](./Sorting/medium/15-3sum) | [leetcode](https://leetcode.com/problems/3sum/) |\n| 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/) |\n\n### Divide and Conquer\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 169-majority-element | Easy | [code](./Divide-and-Conquer/easy/169-majority-element) | [leetcode](https://leetcode.com/problems/majority-element/) |\n| 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/) |\n| 53-maximum-subarray | Medium | [code](./Divide-and-Conquer/medium/53-maximum-subarray) | [leetcode](https://leetcode.com/problems/maximum-subarray/) |\n\n### Greedy\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 778-reorganize-string | Medium | [code](./Greedy/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |\n| 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/) |\n| 561-array-partition | Easy | [code](./Greedy/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |\n| 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/) |\n| 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/) |\n| 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/) |\n| 55-jump-game | Medium | [code](./Greedy/medium/55-jump-game) | [leetcode](https://leetcode.com/problems/jump-game/) |\n| 11-container-with-most-water | Medium | [code](./Greedy/medium/11-container-with-most-water) | [leetcode](https://leetcode.com/problems/container-with-most-water/) |\n| 134-gas-station | Medium | [code](./Greedy/medium/134-gas-station) | [leetcode](https://leetcode.com/problems/gas-station/) |\n| 45-jump-game-ii | Medium | [code](./Greedy/medium/45-jump-game-ii) | [leetcode](https://leetcode.com/problems/jump-game-ii/) |\n| 409-longest-palindrome | Easy | [code](./Greedy/easy/409-longest-palindrome) | [leetcode](https://leetcode.com/problems/longest-palindrome/) |\n\n### Heap (Priority Queue)\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 778-reorganize-string | Medium | [code](./Heap-Priority-Queue/medium/778-reorganize-string) | [leetcode](https://leetcode.com/problems/reorganize-string/) |\n| 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/) |\n| 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/) |\n| 1184-car-pooling | Medium | [code](./Heap-Priority-Queue/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |\n| 506-relative-ranks | Easy | [code](./Heap-Priority-Queue/easy/506-relative-ranks) | [leetcode](https://leetcode.com/problems/relative-ranks/) |\n| 1127-last-stone-weight | Easy | [code](./Heap-Priority-Queue/easy/1127-last-stone-weight) | [leetcode](https://leetcode.com/problems/last-stone-weight/) |\n| 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/) |\n\n### Math\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 900-reordered-power-of-2 | Medium | [code](./Math/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |\n| 380-insert-delete-getrandom-o1 | Medium | [code](./Math/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |\n| 231-power-of-two | Easy | [code](./Math/easy/231-power-of-two) | [leetcode](https://leetcode.com/problems/power-of-two/) |\n| 268-missing-number | Easy | [code](./Math/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |\n| 189-rotate-array | Medium | [code](./Math/medium/189-rotate-array) | [leetcode](https://leetcode.com/problems/rotate-array/) |\n| 150-evaluate-reverse-polish-notation | Medium | [code](./Math/medium/150-evaluate-reverse-polish-notation) | [leetcode](https://leetcode.com/problems/evaluate-reverse-polish-notation/) |\n| 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/) |\n| 273-integer-to-english-words | Hard | [code](./Math/hard/273-integer-to-english-words) | [leetcode](https://leetcode.com/problems/integer-to-english-words/) |\n| 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/) |\n| 9-palindrome-number | Easy | [code](./Math/easy/9-palindrome-number) | [leetcode](https://leetcode.com/problems/palindrome-number/) |\n| 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/) |\n| 7-reverse-integer | Medium | [code](./Math/medium/7-reverse-integer) | [leetcode](https://leetcode.com/problems/reverse-integer/) |\n| 556-next-greater-element-iii | Medium | [code](./Math/medium/556-next-greater-element-iii) | [leetcode](https://leetcode.com/problems/next-greater-element-iii/) |\n| 12-integer-to-roman | Medium | [code](./Math/medium/12-integer-to-roman) | [leetcode](https://leetcode.com/problems/integer-to-roman/) |\n| 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/) |\n| 2496-count-days-spent-together | Easy | [code](./Math/easy/2496-count-days-spent-together) | [leetcode](https://leetcode.com/problems/count-days-spent-together/) |\n| 342-power-of-four | Easy | [code](./Math/easy/342-power-of-four) | [leetcode](https://leetcode.com/problems/power-of-four/) |\n\n### Enumeration\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 900-reordered-power-of-2 | Medium | [code](./Enumeration/medium/900-reordered-power-of-2) | [leetcode](https://leetcode.com/problems/reordered-power-of-2/) |\n| 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/) |\n| 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/) |\n\n### Bucket Sort\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 347-top-k-frequent-elements | Medium | [code](./Bucket-Sort/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |\n\n### Quickselect\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 347-top-k-frequent-elements | Medium | [code](./Quickselect/medium/347-top-k-frequent-elements) | [leetcode](https://leetcode.com/problems/top-k-frequent-elements/) |\n\n### Design\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 303-range-sum-query-immutable | Easy | [code](./Design/easy/303-range-sum-query-immutable) | [leetcode](https://leetcode.com/problems/range-sum-query-immutable/) |\n| 937-online-stock-span | Medium | [code](./Design/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |\n| 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/) |\n| 155-min-stack | Medium | [code](./Design/medium/155-min-stack) | [leetcode](https://leetcode.com/problems/min-stack/) |\n| 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/) |\n| 380-insert-delete-getrandom-o1 | Medium | [code](./Design/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |\n\n### Prefix Sum\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 303-range-sum-query-immutable | Easy | [code](./Prefix-Sum/easy/303-range-sum-query-immutable) | [leetcode](https://leetcode.com/problems/range-sum-query-immutable/) |\n| 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/) |\n| 1184-car-pooling | Medium | [code](./Prefix-Sum/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |\n| 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/) |\n\n### Stack\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 937-online-stock-span | Medium | [code](./Stack/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |\n| 155-min-stack | Medium | [code](./Stack/medium/155-min-stack) | [leetcode](https://leetcode.com/problems/min-stack/) |\n| 496-next-greater-element-i | Easy | [code](./Stack/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |\n| 503-next-greater-element-ii | Medium | [code](./Stack/medium/503-next-greater-element-ii) | [leetcode](https://leetcode.com/problems/next-greater-element-ii/) |\n| 883-car-fleet | Medium | [code](./Stack/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |\n| 739-daily-temperatures | Medium | [code](./Stack/medium/739-daily-temperatures) | [leetcode](https://leetcode.com/problems/daily-temperatures/) |\n| 150-evaluate-reverse-polish-notation | Medium | [code](./Stack/medium/150-evaluate-reverse-polish-notation) | [leetcode](https://leetcode.com/problems/evaluate-reverse-polish-notation/) |\n| 735-asteroid-collision | Medium | [code](./Stack/medium/735-asteroid-collision) | [leetcode](https://leetcode.com/problems/asteroid-collision/) |\n| 20-valid-parentheses | Easy | [code](./Stack/easy/20-valid-parentheses) | [leetcode](https://leetcode.com/problems/valid-parentheses/) |\n| 71-simplify-path | Medium | [code](./Stack/medium/71-simplify-path) | [leetcode](https://leetcode.com/problems/simplify-path/) |\n\n### Monotonic Stack\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 937-online-stock-span | Medium | [code](./Monotonic-Stack/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |\n| 496-next-greater-element-i | Easy | [code](./Monotonic-Stack/easy/496-next-greater-element-i) | [leetcode](https://leetcode.com/problems/next-greater-element-i/) |\n| 503-next-greater-element-ii | Medium | [code](./Monotonic-Stack/medium/503-next-greater-element-ii) | [leetcode](https://leetcode.com/problems/next-greater-element-ii/) |\n| 883-car-fleet | Medium | [code](./Monotonic-Stack/medium/883-car-fleet) | [leetcode](https://leetcode.com/problems/car-fleet/) |\n| 739-daily-temperatures | Medium | [code](./Monotonic-Stack/medium/739-daily-temperatures) | [leetcode](https://leetcode.com/problems/daily-temperatures/) |\n\n### Data Stream\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 937-online-stock-span | Medium | [code](./Data-Stream/medium/937-online-stock-span) | [leetcode](https://leetcode.com/problems/online-stock-span/) |\n\n### Binary Search\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 1753-path-with-minimum-effort | Medium | [code](./Binary-Search/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |\n| 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/) |\n| 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/) |\n| 792-binary-search | Easy | [code](./Binary-Search/easy/792-binary-search) | [leetcode](https://leetcode.com/problems/binary-search/) |\n| 268-missing-number | Easy | [code](./Binary-Search/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |\n| 74-search-a-2d-matrix | Medium | [code](./Binary-Search/medium/74-search-a-2d-matrix) | [leetcode](https://leetcode.com/problems/search-a-2d-matrix/) |\n| 808-number-of-matching-subsequences | Medium | [code](./Binary-Search/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |\n| 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/) |\n| 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/) |\n\n### Randomized\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 380-insert-delete-getrandom-o1 | Medium | [code](./Randomized/medium/380-insert-delete-getrandom-o1) | [leetcode](https://leetcode.com/problems/insert-delete-getrandom-o1/) |\n\n### Linked List\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 206-reverse-linked-list | Easy | [code](./Linked-List/easy/206-reverse-linked-list) | [leetcode](https://leetcode.com/problems/reverse-linked-list/) |\n| 141-linked-list-cycle | Easy | [code](./Linked-List/easy/141-linked-list-cycle) | [leetcode](https://leetcode.com/problems/linked-list-cycle/) |\n| 21-merge-two-sorted-lists | Easy | [code](./Linked-List/easy/21-merge-two-sorted-lists) | [leetcode](https://leetcode.com/problems/merge-two-sorted-lists/) |\n| 147-insertion-sort-list | Medium | [code](./Linked-List/medium/147-insertion-sort-list) | [leetcode](https://leetcode.com/problems/insertion-sort-list/) |\n\n### Recursion\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 206-reverse-linked-list | Easy | [code](./Recursion/easy/206-reverse-linked-list) | [leetcode](https://leetcode.com/problems/reverse-linked-list/) |\n| 21-merge-two-sorted-lists | Easy | [code](./Recursion/easy/21-merge-two-sorted-lists) | [leetcode](https://leetcode.com/problems/merge-two-sorted-lists/) |\n| 231-power-of-two | Easy | [code](./Recursion/easy/231-power-of-two) | [leetcode](https://leetcode.com/problems/power-of-two/) |\n| 273-integer-to-english-words | Hard | [code](./Recursion/hard/273-integer-to-english-words) | [leetcode](https://leetcode.com/problems/integer-to-english-words/) |\n| 342-power-of-four | Easy | [code](./Recursion/easy/342-power-of-four) | [leetcode](https://leetcode.com/problems/power-of-four/) |\n\n### Two Pointers\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 141-linked-list-cycle | Easy | [code](./Two-Pointers/easy/141-linked-list-cycle) | [leetcode](https://leetcode.com/problems/linked-list-cycle/) |\n| 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/) |\n| 88-merge-sorted-array | Easy | [code](./Two-Pointers/easy/88-merge-sorted-array) | [leetcode](https://leetcode.com/problems/merge-sorted-array/) |\n| 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/) |\n| 189-rotate-array | Medium | [code](./Two-Pointers/medium/189-rotate-array) | [leetcode](https://leetcode.com/problems/rotate-array/) |\n| 75-sort-colors | Medium | [code](./Two-Pointers/medium/75-sort-colors) | [leetcode](https://leetcode.com/problems/sort-colors/) |\n| 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/) |\n| 11-container-with-most-water | Medium | [code](./Two-Pointers/medium/11-container-with-most-water) | [leetcode](https://leetcode.com/problems/container-with-most-water/) |\n| 31-next-permutation | Medium | [code](./Two-Pointers/medium/31-next-permutation) | [leetcode](https://leetcode.com/problems/next-permutation/) |\n| 15-3sum | Medium | [code](./Two-Pointers/medium/15-3sum) | [leetcode](https://leetcode.com/problems/3sum/) |\n| 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/) |\n| 556-next-greater-element-iii | Medium | [code](./Two-Pointers/medium/556-next-greater-element-iii) | [leetcode](https://leetcode.com/problems/next-greater-element-iii/) |\n| 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/) |\n| 125-valid-palindrome | Easy | [code](./Two-Pointers/easy/125-valid-palindrome) | [leetcode](https://leetcode.com/problems/valid-palindrome/) |\n\n### Matrix\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 733-flood-fill | Easy | [code](./Matrix/easy/733-flood-fill) | [leetcode](https://leetcode.com/problems/flood-fill/) |\n| 1753-path-with-minimum-effort | Medium | [code](./Matrix/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |\n| 74-search-a-2d-matrix | Medium | [code](./Matrix/medium/74-search-a-2d-matrix) | [leetcode](https://leetcode.com/problems/search-a-2d-matrix/) |\n| 36-valid-sudoku | Medium | [code](./Matrix/medium/36-valid-sudoku) | [leetcode](https://leetcode.com/problems/valid-sudoku/) |\n\n### Trie\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 386-lexicographical-numbers | Medium | [code](./Trie/medium/386-lexicographical-numbers) | [leetcode](https://leetcode.com/problems/lexicographical-numbers/) |\n| 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/) |\n| 808-number-of-matching-subsequences | Medium | [code](./Trie/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |\n\n### Union Find\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 1753-path-with-minimum-effort | Medium | [code](./Union-Find/medium/1753-path-with-minimum-effort) | [leetcode](https://leetcode.com/problems/path-with-minimum-effort/) |\n| 128-longest-consecutive-sequence | Medium | [code](./Union-Find/medium/128-longest-consecutive-sequence) | [leetcode](https://leetcode.com/problems/longest-consecutive-sequence/) |\n\n### Bit Manipulation\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 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/) |\n| 231-power-of-two | Easy | [code](./Bit-Manipulation/easy/231-power-of-two) | [leetcode](https://leetcode.com/problems/power-of-two/) |\n| 268-missing-number | Easy | [code](./Bit-Manipulation/easy/268-missing-number) | [leetcode](https://leetcode.com/problems/missing-number/) |\n| 136-single-number | Easy | [code](./Bit-Manipulation/easy/136-single-number) | [leetcode](https://leetcode.com/problems/single-number/) |\n| 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/) |\n| 934-bitwise-ors-of-subarrays | Medium | [code](./Bit-Manipulation/medium/934-bitwise-ors-of-subarrays) | [leetcode](https://leetcode.com/problems/bitwise-ors-of-subarrays/) |\n| 800-letter-case-permutation | Medium | [code](./Bit-Manipulation/medium/800-letter-case-permutation) | [leetcode](https://leetcode.com/problems/letter-case-permutation/) |\n| 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/) |\n| 342-power-of-four | Easy | [code](./Bit-Manipulation/easy/342-power-of-four) | [leetcode](https://leetcode.com/problems/power-of-four/) |\n\n### Brainteaser\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n\n### Simulation\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 1184-car-pooling | Medium | [code](./Simulation/medium/1184-car-pooling) | [leetcode](https://leetcode.com/problems/car-pooling/) |\n| 495-teemo-attacking | Easy | [code](./Simulation/easy/495-teemo-attacking) | [leetcode](https://leetcode.com/problems/teemo-attacking/) |\n| 735-asteroid-collision | Medium | [code](./Simulation/medium/735-asteroid-collision) | [leetcode](https://leetcode.com/problems/asteroid-collision/) |\n\n### Counting Sort\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 561-array-partition | Easy | [code](./Counting-Sort/easy/561-array-partition) | [leetcode](https://leetcode.com/problems/array-partition/) |\n\n### Dynamic Programming\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 118-pascals-triangle | Easy | [code](./Dynamic-Programming/easy/118-pascals-triangle) | [leetcode](https://leetcode.com/problems/pascals-triangle/) |\n| 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/) |\n| 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/) |\n| 934-bitwise-ors-of-subarrays | Medium | [code](./Dynamic-Programming/medium/934-bitwise-ors-of-subarrays) | [leetcode](https://leetcode.com/problems/bitwise-ors-of-subarrays/) |\n| 1130-last-stone-weight-ii | Medium | [code](./Dynamic-Programming/medium/1130-last-stone-weight-ii) | [leetcode](https://leetcode.com/problems/last-stone-weight-ii/) |\n| 808-number-of-matching-subsequences | Medium | [code](./Dynamic-Programming/medium/808-number-of-matching-subsequences) | [leetcode](https://leetcode.com/problems/number-of-matching-subsequences/) |\n| 55-jump-game | Medium | [code](./Dynamic-Programming/medium/55-jump-game) | [leetcode](https://leetcode.com/problems/jump-game/) |\n| 53-maximum-subarray | Medium | [code](./Dynamic-Programming/medium/53-maximum-subarray) | [leetcode](https://leetcode.com/problems/maximum-subarray/) |\n| 45-jump-game-ii | Medium | [code](./Dynamic-Programming/medium/45-jump-game-ii) | [leetcode](https://leetcode.com/problems/jump-game-ii/) |\n\n### Memoization\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n\n### Backtracking\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n| 800-letter-case-permutation | Medium | [code](./Backtracking/medium/800-letter-case-permutation) | [leetcode](https://leetcode.com/problems/letter-case-permutation/) |\n| 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/) |\n\n### Combinatorics\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n\n### String Matching\n\n| Problem | Difficulty | Code | LeetCode |\n|---|---|---|---|\n| 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/) |\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhimudigonda%2Fleetcode-old","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhimudigonda%2Fleetcode-old","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhimudigonda%2Fleetcode-old/lists"}