{"id":18675522,"url":"https://github.com/forhanshahriarfahim/leetcode_solutions","last_synced_at":"2026-06-24T06:34:23.280Z","repository":{"id":176011708,"uuid":"626275458","full_name":"ForhanShahriarFahim/LeetCode_Solutions","owner":"ForhanShahriarFahim","description":"Collection of LeetCode questions to ace the coding interview! ","archived":false,"fork":false,"pushed_at":"2025-03-07T06:09:57.000Z","size":696,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-18T12:08:20.146Z","etag":null,"topics":["cpp","data-structures-and-algorithms","leetcode","problem-solving"],"latest_commit_sha":null,"homepage":"","language":"C++","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/ForhanShahriarFahim.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}},"created_at":"2023-04-11T06:28:01.000Z","updated_at":"2025-03-07T06:10:01.000Z","dependencies_parsed_at":"2024-05-23T03:22:49.584Z","dependency_job_id":"783b3e54-c334-4170-be80-947f0a8b7f73","html_url":"https://github.com/ForhanShahriarFahim/LeetCode_Solutions","commit_stats":null,"previous_names":["forhanshahriarfahim/leetcode_solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ForhanShahriarFahim/LeetCode_Solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForhanShahriarFahim%2FLeetCode_Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForhanShahriarFahim%2FLeetCode_Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForhanShahriarFahim%2FLeetCode_Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForhanShahriarFahim%2FLeetCode_Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ForhanShahriarFahim","download_url":"https://codeload.github.com/ForhanShahriarFahim/LeetCode_Solutions/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ForhanShahriarFahim%2FLeetCode_Solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34720920,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-24T02:00:07.484Z","response_time":106,"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":["cpp","data-structures-and-algorithms","leetcode","problem-solving"],"created_at":"2024-11-07T09:25:18.400Z","updated_at":"2026-06-24T06:34:23.234Z","avatar_url":"https://github.com/ForhanShahriarFahim.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0001-two-sum) |\n| [0033-search-in-rotated-sorted-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0033-search-in-rotated-sorted-array) |\n| [0036-valid-sudoku](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0036-valid-sudoku) |\n| [0039-combination-sum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0040-combination-sum-ii) |\n| [0041-first-missing-positive](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0041-first-missing-positive) |\n| [0045-jump-game-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0045-jump-game-ii) |\n| [0046-permutations](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0046-permutations) |\n| [0048-rotate-image](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0048-rotate-image) |\n| [0049-group-anagrams](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0049-group-anagrams) |\n| [0073-set-matrix-zeroes](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0079-word-search](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0079-word-search) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0090-subsets-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0090-subsets-ii) |\n| [0139-word-break](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0139-word-break) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0162-find-peak-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0162-find-peak-element) |\n| [0169-majority-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0169-majority-element) |\n| [0198-house-robber](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0198-house-robber) |\n| [0215-kth-largest-element-in-an-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0239-sliding-window-maximum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0239-sliding-window-maximum) |\n| [0240-search-a-2d-matrix-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0268-missing-number) |\n| [0349-intersection-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0542-01-matrix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0542-01-matrix) |\n| [0643-maximum-average-subarray-i](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0643-maximum-average-subarray-i) |\n| [0665-non-decreasing-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0665-non-decreasing-array) |\n| [0724-find-pivot-index](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0724-find-pivot-index) |\n| [0733-flood-fill](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0733-flood-fill) |\n| [0739-daily-temperatures](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0739-daily-temperatures) |\n| [0747-min-cost-climbing-stairs](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0747-min-cost-climbing-stairs) |\n| [0779-max-chunks-to-make-sorted-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0779-max-chunks-to-make-sorted-ii) |\n| [0780-max-chunks-to-make-sorted](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0780-max-chunks-to-make-sorted) |\n| [0882-peak-index-in-a-mountain-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0882-peak-index-in-a-mountain-array) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1036-rotting-oranges](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1036-rotting-oranges) |\n| [1112-find-words-that-can-be-formed-by-characters](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1112-find-words-that-can-be-formed-by-characters) |\n| [1319-unique-number-of-occurrences](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1319-unique-number-of-occurrences) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1392-find-the-difference-of-two-arrays) |\n| [1477-product-of-the-last-k-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1477-product-of-the-last-k-numbers) |\n| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1876-map-of-highest-peak](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1876-map-of-highest-peak) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2047-find-a-peak-element-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2047-find-a-peak-element-ii) |\n| [2107-find-unique-binary-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2107-find-unique-binary-string) |\n| [2145-grid-game](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2145-grid-game) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |\n| [2792-neighboring-bitwise-xor](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2792-neighboring-bitwise-xor) |\n| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0005-longest-palindromic-substring](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0005-longest-palindromic-substring) |\n| [0008-string-to-integer-atoi](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0008-string-to-integer-atoi) |\n| [0013-roman-to-integer](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0014-longest-common-prefix) |\n| [0022-generate-parentheses](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0022-generate-parentheses) |\n| [0049-group-anagrams](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0049-group-anagrams) |\n| [0067-add-binary](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0067-add-binary) |\n| [0076-minimum-window-substring](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0076-minimum-window-substring) |\n| [0079-word-search](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0079-word-search) |\n| [0139-word-break](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0139-word-break) |\n| [0151-reverse-words-in-a-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0151-reverse-words-in-a-string) |\n| [0168-excel-sheet-column-title](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0168-excel-sheet-column-title) |\n| [0171-excel-sheet-column-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0171-excel-sheet-column-number) |\n| [0205-isomorphic-strings](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0205-isomorphic-strings) |\n| [0242-valid-anagram](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0242-valid-anagram) |\n| [0424-longest-repeating-character-replacement](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0424-longest-repeating-character-replacement) |\n| [0451-sort-characters-by-frequency](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0567-permutation-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0567-permutation-in-string) |\n| [0812-rotate-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0812-rotate-string) |\n| [0874-backspace-string-compare](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0874-backspace-string-compare) |\n| [1078-remove-outermost-parentheses](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1078-remove-outermost-parentheses) |\n| [1112-find-words-that-can-be-formed-by-characters](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1112-find-words-that-can-be-formed-by-characters) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n| [1320-remove-all-adjacent-duplicates-in-string-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii) |\n| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |\n| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [1777-determine-if-two-strings-are-close](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2032-largest-odd-number-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2032-largest-odd-number-in-string) |\n| [2107-find-unique-binary-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2107-find-unique-binary-string) |\n| [2470-removing-stars-from-a-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2470-removing-stars-from-a-string) |\n## Backtracking\n|  |\n| ------- |\n| [0022-generate-parentheses](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0022-generate-parentheses) |\n| [0039-combination-sum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0040-combination-sum-ii) |\n| [0046-permutations](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0046-permutations) |\n| [0079-word-search](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0079-word-search) |\n| [0090-subsets-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0090-subsets-ii) |\n| [1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n) |\n| [2107-find-unique-binary-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2107-find-unique-binary-string) |\n## Matrix\n|  |\n| ------- |\n| [0036-valid-sudoku](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0036-valid-sudoku) |\n| [0048-rotate-image](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0048-rotate-image) |\n| [0073-set-matrix-zeroes](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0079-word-search](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0079-word-search) |\n| [0240-search-a-2d-matrix-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0240-search-a-2d-matrix-ii) |\n| [0542-01-matrix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0542-01-matrix) |\n| [0733-flood-fill](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0733-flood-fill) |\n| [1036-rotting-oranges](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1036-rotting-oranges) |\n| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |\n| [1876-map-of-highest-peak](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1876-map-of-highest-peak) |\n| [2047-find-a-peak-element-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2047-find-a-peak-element-ii) |\n| [2145-grid-game](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2145-grid-game) |\n## Greedy\n|  |\n| ------- |\n| [0045-jump-game-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0045-jump-game-ii) |\n| [0779-max-chunks-to-make-sorted-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0779-max-chunks-to-make-sorted-ii) |\n| [0780-max-chunks-to-make-sorted](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0780-max-chunks-to-make-sorted) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2032-largest-odd-number-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2032-largest-odd-number-in-string) |\n| [2509-minimize-xor](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2509-minimize-xor) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n## Sorting\n|  |\n| ------- |\n| [0049-group-anagrams](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0049-group-anagrams) |\n| [0169-majority-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0169-majority-element) |\n| [0215-kth-largest-element-in-an-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0242-valid-anagram](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0268-missing-number) |\n| [0349-intersection-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0451-sort-characters-by-frequency](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0779-max-chunks-to-make-sorted-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0779-max-chunks-to-make-sorted-ii) |\n| [0780-max-chunks-to-make-sorted](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0780-max-chunks-to-make-sorted) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1777-determine-if-two-strings-are-close](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n## Stack\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0143-reorder-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0143-reorder-list) |\n| [0144-binary-tree-preorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0145-binary-tree-postorder-traversal) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0155-min-stack](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0155-min-stack) |\n| [0234-palindrome-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0234-palindrome-linked-list) |\n| [0739-daily-temperatures](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0739-daily-temperatures) |\n| [0779-max-chunks-to-make-sorted-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0779-max-chunks-to-make-sorted-ii) |\n| [0780-max-chunks-to-make-sorted](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0780-max-chunks-to-make-sorted) |\n| [0874-backspace-string-compare](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0874-backspace-string-compare) |\n| [1078-remove-outermost-parentheses](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1078-remove-outermost-parentheses) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n| [1320-remove-all-adjacent-duplicates-in-string-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |\n| [2470-removing-stars-from-a-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2470-removing-stars-from-a-string) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0100-same-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0110-balanced-binary-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0145-binary-tree-postorder-traversal) |\n| [0226-invert-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0226-invert-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0572-subtree-of-another-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0789-kth-largest-element-in-a-stream) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0110-balanced-binary-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0145-binary-tree-postorder-traversal) |\n| [0207-course-schedule](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0207-course-schedule) |\n| [0226-invert-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0226-invert-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0572-subtree-of-another-tree) |\n| [0733-flood-fill](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0733-flood-fill) |\n| [0801-is-graph-bipartite](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0801-is-graph-bipartite) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0100-same-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0110-balanced-binary-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0145-binary-tree-postorder-traversal) |\n| [0226-invert-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0226-invert-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0543-diameter-of-binary-tree) |\n| [0572-subtree-of-another-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0572-subtree-of-another-tree) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0789-kth-largest-element-in-a-stream) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0076-minimum-window-substring](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0076-minimum-window-substring) |\n| [0239-sliding-window-maximum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0239-sliding-window-maximum) |\n| [0424-longest-repeating-character-replacement](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0424-longest-repeating-character-replacement) |\n| [0567-permutation-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0567-permutation-in-string) |\n| [0643-maximum-average-subarray-i](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0643-maximum-average-subarray-i) |\n| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n## Prefix Sum\n|  |\n| ------- |\n| [0724-find-pivot-index](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0724-find-pivot-index) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1477-product-of-the-last-k-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1477-product-of-the-last-k-numbers) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2145-grid-game](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2145-grid-game) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0013-roman-to-integer](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0013-roman-to-integer) |\n| [0036-valid-sudoku](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0036-valid-sudoku) |\n| [0041-first-missing-positive](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0041-first-missing-positive) |\n| [0049-group-anagrams](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0049-group-anagrams) |\n| [0073-set-matrix-zeroes](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0073-set-matrix-zeroes) |\n| [0076-minimum-window-substring](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0076-minimum-window-substring) |\n| [0138-copy-list-with-random-pointer](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0138-copy-list-with-random-pointer) |\n| [0139-word-break](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0139-word-break) |\n| [0142-linked-list-cycle-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0169-majority-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0169-majority-element) |\n| [0205-isomorphic-strings](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0205-isomorphic-strings) |\n| [0242-valid-anagram](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0242-valid-anagram) |\n| [0268-missing-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0268-missing-number) |\n| [0349-intersection-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0424-longest-repeating-character-replacement](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0424-longest-repeating-character-replacement) |\n| [0451-sort-characters-by-frequency](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0567-permutation-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0567-permutation-in-string) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1112-find-words-that-can-be-formed-by-characters](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1112-find-words-that-can-be-formed-by-characters) |\n| [1319-unique-number-of-occurrences](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1319-unique-number-of-occurrences) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1392-find-the-difference-of-two-arrays) |\n| [1777-determine-if-two-strings-are-close](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2107-find-unique-binary-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2107-find-unique-binary-string) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0169-majority-element) |\n| [0451-sort-characters-by-frequency](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0451-sort-characters-by-frequency) |\n| [1112-find-words-that-can-be-formed-by-characters](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1112-find-words-that-can-be-formed-by-characters) |\n| [1777-determine-if-two-strings-are-close](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1777-determine-if-two-strings-are-close) |\n| [1890-sum-of-beauty-of-all-substrings](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n## Binary Search\n|  |\n| ------- |\n| [0033-search-in-rotated-sorted-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0033-search-in-rotated-sorted-array) |\n| [0074-search-a-2d-matrix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0162-find-peak-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0162-find-peak-element) |\n| [0240-search-a-2d-matrix-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0268-missing-number) |\n| [0349-intersection-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0882-peak-index-in-a-mountain-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0882-peak-index-in-a-mountain-array) |\n| [1966-frequency-of-the-most-frequent-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1966-frequency-of-the-most-frequent-element) |\n| [2047-find-a-peak-element-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2047-find-a-peak-element-ii) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0169-majority-element) |\n| [0215-kth-largest-element-in-an-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0240-search-a-2d-matrix-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0240-search-a-2d-matrix-ii) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0005-longest-palindromic-substring) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0061-rotate-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0061-rotate-list) |\n| [0142-linked-list-cycle-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0143-reorder-list) |\n| [0151-reverse-words-in-a-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0151-reverse-words-in-a-string) |\n| [0234-palindrome-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0234-palindrome-linked-list) |\n| [0349-intersection-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0349-intersection-of-two-arrays) |\n| [0567-permutation-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0567-permutation-in-string) |\n| [0874-backspace-string-compare](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0874-backspace-string-compare) |\n| [0908-middle-of-the-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0908-middle-of-the-linked-list) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0002-add-two-numbers) |\n| [0013-roman-to-integer](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0013-roman-to-integer) |\n| [0048-rotate-image](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0050-powx-n) |\n| [0067-add-binary](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0067-add-binary) |\n| [0070-climbing-stairs](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0070-climbing-stairs) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0168-excel-sheet-column-title](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0168-excel-sheet-column-title) |\n| [0171-excel-sheet-column-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0171-excel-sheet-column-number) |\n| [0231-power-of-two](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0268-missing-number) |\n| [1236-n-th-tribonacci-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1236-n-th-tribonacci-number) |\n| [1477-product-of-the-last-k-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1477-product-of-the-last-k-numbers) |\n| [2032-largest-odd-number-in-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2032-largest-odd-number-in-string) |\n| [2050-count-good-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2050-count-good-numbers) |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0014-longest-common-prefix) |\n| [0139-word-break](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0139-word-break) |\n## String Matching\n|  |\n| ------- |\n| [0572-subtree-of-another-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0572-subtree-of-another-tree) |\n| [0812-rotate-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0812-rotate-string) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0239-sliding-window-maximum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0239-sliding-window-maximum) |\n| [0451-sort-characters-by-frequency](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0451-sort-characters-by-frequency) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0789-kth-largest-element-in-a-stream) |\n| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |\n## Bucket Sort\n|  |\n| ------- |\n| [0451-sort-characters-by-frequency](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0451-sort-characters-by-frequency) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0005-longest-palindromic-substring) |\n| [0022-generate-parentheses](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0022-generate-parentheses) |\n| [0045-jump-game-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0045-jump-game-ii) |\n| [0070-climbing-stairs](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0070-climbing-stairs) |\n| [0139-word-break](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0139-word-break) |\n| [0198-house-robber](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0198-house-robber) |\n| [0542-01-matrix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0542-01-matrix) |\n| [0747-min-cost-climbing-stairs](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0747-min-cost-climbing-stairs) |\n| [1236-n-th-tribonacci-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1236-n-th-tribonacci-number) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0025-reverse-nodes-in-k-group](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0061-rotate-list) |\n| [0138-copy-list-with-random-pointer](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0138-copy-list-with-random-pointer) |\n| [0142-linked-list-cycle-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0143-reorder-list) |\n| [0203-remove-linked-list-elements](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0203-remove-linked-list-elements) |\n| [0206-reverse-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0234-palindrome-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0237-delete-node-in-a-linked-list) |\n| [0328-odd-even-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0328-odd-even-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0908-middle-of-the-linked-list) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |\n## Number Theory\n|  |\n| ------- |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |\n## Simulation\n|  |\n| ------- |\n| [0067-add-binary](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0067-add-binary) |\n| [0874-backspace-string-compare](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0874-backspace-string-compare) |\n| [2470-removing-stars-from-a-string](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2470-removing-stars-from-a-string) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0070-climbing-stairs) |\n| [0139-word-break](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0139-word-break) |\n| [1236-n-th-tribonacci-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1236-n-th-tribonacci-number) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0002-add-two-numbers) |\n| [0025-reverse-nodes-in-k-group](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0025-reverse-nodes-in-k-group) |\n| [0050-powx-n](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0050-powx-n) |\n| [0143-reorder-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0143-reorder-list) |\n| [0203-remove-linked-list-elements](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0203-remove-linked-list-elements) |\n| [0206-reverse-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0206-reverse-linked-list) |\n| [0231-power-of-two](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0231-power-of-two) |\n| [0234-palindrome-linked-list](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0234-palindrome-linked-list) |\n| [2050-count-good-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2050-count-good-numbers) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0067-add-binary](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0067-add-binary) |\n| [0090-subsets-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0090-subsets-ii) |\n| [0231-power-of-two](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0268-missing-number) |\n| [2509-minimize-xor](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2509-minimize-xor) |\n| [2766-find-the-prefix-common-array-of-two-arrays](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2766-find-the-prefix-common-array-of-two-arrays) |\n| [2792-neighboring-bitwise-xor](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/2792-neighboring-bitwise-xor) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0100-same-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0207-course-schedule](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0207-course-schedule) |\n| [0226-invert-binary-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0226-invert-binary-tree) |\n| [0542-01-matrix](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0542-01-matrix) |\n| [0733-flood-fill](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0733-flood-fill) |\n| [0801-is-graph-bipartite](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0801-is-graph-bipartite) |\n| [1036-rotting-oranges](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1036-rotting-oranges) |\n| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |\n| [1876-map-of-highest-peak](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1876-map-of-highest-peak) |\n## Quickselect\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0215-kth-largest-element-in-an-array) |\n## Design\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0155-min-stack) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0789-kth-largest-element-in-a-stream) |\n| [1477-product-of-the-last-k-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1477-product-of-the-last-k-numbers) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0789-kth-largest-element-in-a-stream](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0789-kth-largest-element-in-a-stream) |\n## Data Stream\n|  |\n| ------- |\n| [0789-kth-largest-element-in-a-stream](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0789-kth-largest-element-in-a-stream) |\n| [1477-product-of-the-last-k-numbers](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1477-product-of-the-last-k-numbers) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0739-daily-temperatures](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0739-daily-temperatures) |\n| [0779-max-chunks-to-make-sorted-ii](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0779-max-chunks-to-make-sorted-ii) |\n| [0780-max-chunks-to-make-sorted](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0780-max-chunks-to-make-sorted) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n## Queue\n|  |\n| ------- |\n| [0239-sliding-window-maximum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0239-sliding-window-maximum) |\n## Monotonic Queue\n|  |\n| ------- |\n| [0239-sliding-window-maximum](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0239-sliding-window-maximum) |\n## Hash Function\n|  |\n| ------- |\n| [0572-subtree-of-another-tree](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0572-subtree-of-another-tree) |\n## Graph\n|  |\n| ------- |\n| [0207-course-schedule](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0207-course-schedule) |\n| [0801-is-graph-bipartite](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0801-is-graph-bipartite) |\n| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |\n## Topological Sort\n|  |\n| ------- |\n| [0207-course-schedule](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0207-course-schedule) |\n## Shortest Path\n|  |\n| ------- |\n| [1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid) |\n## Union Find\n|  |\n| ------- |\n| [0801-is-graph-bipartite](https://github.com/ForhanShahriarFahim/LeetCode_Solutions/tree/master/0801-is-graph-bipartite) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fforhanshahriarfahim%2Fleetcode_solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fforhanshahriarfahim%2Fleetcode_solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fforhanshahriarfahim%2Fleetcode_solutions/lists"}