{"id":40259201,"url":"https://github.com/rohit141914/leetcode","last_synced_at":"2026-01-20T02:03:31.471Z","repository":{"id":231376615,"uuid":"780064747","full_name":"rohit141914/LeetCode","owner":"rohit141914","description":"Collection of LeetCode questions ","archived":false,"fork":false,"pushed_at":"2026-01-14T18:54:09.000Z","size":2174,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-01-14T21:31:34.756Z","etag":null,"topics":["arrays","cpp","data-structures-and-algorithms","graph-algorithms","hashing","queue","stack","string","tree-structure","vector"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/RohitNain/","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/rohit141914.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":"2024-03-31T15:50:13.000Z","updated_at":"2026-01-14T18:54:12.000Z","dependencies_parsed_at":"2025-04-18T17:53:24.607Z","dependency_job_id":"58b05b23-4a11-4d26-8971-8da998043477","html_url":"https://github.com/rohit141914/LeetCode","commit_stats":null,"previous_names":["rohit141914/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rohit141914/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohit141914%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohit141914%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohit141914%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohit141914%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rohit141914","download_url":"https://codeload.github.com/rohit141914/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rohit141914%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28593838,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-20T01:57:22.592Z","status":"online","status_checked_at":"2026-01-20T02:00:07.325Z","response_time":117,"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":["arrays","cpp","data-structures-and-algorithms","graph-algorithms","hashing","queue","stack","string","tree-structure","vector"],"created_at":"2026-01-20T02:03:28.732Z","updated_at":"2026-01-20T02:03:31.445Z","avatar_url":"https://github.com/rohit141914.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\nCollection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\n\n# Array\n|  |\n| ------- |\n| [0503-next-greater-element-ii](https://github.com/rohit141914/LeetCode/tree/master/0503-next-greater-element-ii) |\n# Stack\n|  |\n| ------- |\n| [0503-next-greater-element-ii](https://github.com/rohit141914/LeetCode/tree/master/0503-next-greater-element-ii) |\n# Monotonic Stack\n|  |\n| ------- |\n| [0503-next-greater-element-ii](https://github.com/rohit141914/LeetCode/tree/master/0503-next-greater-element-ii) |\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/rohit141914/LeetCode/tree/master/0001-two-sum) |\n| [0011-container-with-most-water](https://github.com/rohit141914/LeetCode/tree/master/0011-container-with-most-water) |\n| [0045-jump-game-ii](https://github.com/rohit141914/LeetCode/tree/master/0045-jump-game-ii) |\n| [0055-jump-game](https://github.com/rohit141914/LeetCode/tree/master/0055-jump-game) |\n| [0056-merge-intervals](https://github.com/rohit141914/LeetCode/tree/master/0056-merge-intervals) |\n| [0090-subsets-ii](https://github.com/rohit141914/LeetCode/tree/master/0090-subsets-ii) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0118-pascals-triangle](https://github.com/rohit141914/LeetCode/tree/master/0118-pascals-triangle) |\n| [0119-pascals-triangle-ii](https://github.com/rohit141914/LeetCode/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/rohit141914/LeetCode/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/rohit141914/LeetCode/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0162-find-peak-element](https://github.com/rohit141914/LeetCode/tree/master/0162-find-peak-element) |\n| [0217-contains-duplicate](https://github.com/rohit141914/LeetCode/tree/master/0217-contains-duplicate) |\n| [0219-contains-duplicate-ii](https://github.com/rohit141914/LeetCode/tree/master/0219-contains-duplicate-ii) |\n| [0229-majority-element-ii](https://github.com/rohit141914/LeetCode/tree/master/0229-majority-element-ii) |\n| [0300-longest-increasing-subsequence](https://github.com/rohit141914/LeetCode/tree/master/0300-longest-increasing-subsequence) |\n| [0318-maximum-product-of-word-lengths](https://github.com/rohit141914/LeetCode/tree/master/0318-maximum-product-of-word-lengths) |\n| [0322-coin-change](https://github.com/rohit141914/LeetCode/tree/master/0322-coin-change) |\n| [0334-increasing-triplet-subsequence](https://github.com/rohit141914/LeetCode/tree/master/0334-increasing-triplet-subsequence) |\n| [0347-top-k-frequent-elements](https://github.com/rohit141914/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/rohit141914/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0380-insert-delete-getrandom-o1](https://github.com/rohit141914/LeetCode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/rohit141914/LeetCode/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |\n| [0435-non-overlapping-intervals](https://github.com/rohit141914/LeetCode/tree/master/0435-non-overlapping-intervals) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/rohit141914/LeetCode/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/rohit141914/LeetCode/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |\n| [0453-minimum-moves-to-equal-array-elements](https://github.com/rohit141914/LeetCode/tree/master/0453-minimum-moves-to-equal-array-elements) |\n| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/rohit141914/LeetCode/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |\n| [0518-coin-change-ii](https://github.com/rohit141914/LeetCode/tree/master/0518-coin-change-ii) |\n| [0524-longest-word-in-dictionary-through-deleting](https://github.com/rohit141914/LeetCode/tree/master/0524-longest-word-in-dictionary-through-deleting) |\n| [0566-reshape-the-matrix](https://github.com/rohit141914/LeetCode/tree/master/0566-reshape-the-matrix) |\n| [0646-maximum-length-of-pair-chain](https://github.com/rohit141914/LeetCode/tree/master/0646-maximum-length-of-pair-chain) |\n| [0665-non-decreasing-array](https://github.com/rohit141914/LeetCode/tree/master/0665-non-decreasing-array) |\n| [0673-number-of-longest-increasing-subsequence](https://github.com/rohit141914/LeetCode/tree/master/0673-number-of-longest-increasing-subsequence) |\n| [0674-longest-continuous-increasing-subsequence](https://github.com/rohit141914/LeetCode/tree/master/0674-longest-continuous-increasing-subsequence) |\n| [0682-baseball-game](https://github.com/rohit141914/LeetCode/tree/master/0682-baseball-game) |\n| [0692-top-k-frequent-words](https://github.com/rohit141914/LeetCode/tree/master/0692-top-k-frequent-words) |\n| [0720-longest-word-in-dictionary](https://github.com/rohit141914/LeetCode/tree/master/0720-longest-word-in-dictionary) |\n| [0735-asteroid-collision](https://github.com/rohit141914/LeetCode/tree/master/0735-asteroid-collision) |\n| [0745-find-smallest-letter-greater-than-target](https://github.com/rohit141914/LeetCode/tree/master/0745-find-smallest-letter-greater-than-target) |\n| [0748-largest-number-at-least-twice-of-others](https://github.com/rohit141914/LeetCode/tree/master/0748-largest-number-at-least-twice-of-others) |\n| [0860-design-circular-queue](https://github.com/rohit141914/LeetCode/tree/master/0860-design-circular-queue) |\n| [0875-longest-mountain-in-array](https://github.com/rohit141914/LeetCode/tree/master/0875-longest-mountain-in-array) |\n| [0882-peak-index-in-a-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/0882-peak-index-in-a-mountain-array) |\n| [0890-lemonade-change](https://github.com/rohit141914/LeetCode/tree/master/0890-lemonade-change) |\n| [0952-word-subsets](https://github.com/rohit141914/LeetCode/tree/master/0952-word-subsets) |\n| [0958-sort-array-by-parity-ii](https://github.com/rohit141914/LeetCode/tree/master/0958-sort-array-by-parity-ii) |\n| [0978-valid-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/0978-valid-mountain-array) |\n| [1002-maximum-width-ramp](https://github.com/rohit141914/LeetCode/tree/master/1002-maximum-width-ramp) |\n| [1014-k-closest-points-to-origin](https://github.com/rohit141914/LeetCode/tree/master/1014-k-closest-points-to-origin) |\n| [1018-largest-perimeter-triangle](https://github.com/rohit141914/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n| [1037-valid-boomerang](https://github.com/rohit141914/LeetCode/tree/master/1037-valid-boomerang) |\n| [1054-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1054-distant-barcodes) |\n| [1062-partition-array-into-three-parts-with-equal-sum](https://github.com/rohit141914/LeetCode/tree/master/1062-partition-array-into-three-parts-with-equal-sum) |\n| [1063-best-sightseeing-pair](https://github.com/rohit141914/LeetCode/tree/master/1063-best-sightseeing-pair) |\n| [1071-binary-prefix-divisible-by-5](https://github.com/rohit141914/LeetCode/tree/master/1071-binary-prefix-divisible-by-5) |\n| [1127-last-stone-weight](https://github.com/rohit141914/LeetCode/tree/master/1127-last-stone-weight) |\n| [1140-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1140-distant-barcodes) |\n| [1185-find-in-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/1185-find-in-mountain-array) |\n| [1222-remove-covered-intervals](https://github.com/rohit141914/LeetCode/tree/master/1222-remove-covered-intervals) |\n| [1227-number-of-equivalent-domino-pairs](https://github.com/rohit141914/LeetCode/tree/master/1227-number-of-equivalent-domino-pairs) |\n| [1256-rank-transform-of-an-array](https://github.com/rohit141914/LeetCode/tree/master/1256-rank-transform-of-an-array) |\n| [1275-find-winner-on-a-tic-tac-toe-game](https://github.com/rohit141914/LeetCode/tree/master/1275-find-winner-on-a-tic-tac-toe-game) |\n| [1293-three-consecutive-odds](https://github.com/rohit141914/LeetCode/tree/master/1293-three-consecutive-odds) |\n| [1335-maximum-candies-allocated-to-k-children](https://github.com/rohit141914/LeetCode/tree/master/1335-maximum-candies-allocated-to-k-children) |\n| [1353-find-resultant-array-after-removing-anagrams](https://github.com/rohit141914/LeetCode/tree/master/1353-find-resultant-array-after-removing-anagrams) |\n| [1354-find-players-with-zero-or-one-losses](https://github.com/rohit141914/LeetCode/tree/master/1354-find-players-with-zero-or-one-losses) |\n| [1355-minimum-deletions-to-make-array-beautiful](https://github.com/rohit141914/LeetCode/tree/master/1355-minimum-deletions-to-make-array-beautiful) |\n| [1390-four-divisors](https://github.com/rohit141914/LeetCode/tree/master/1390-four-divisors) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/rohit141914/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/rohit141914/LeetCode/tree/master/1478-maximum-number-of-events-that-can-be-attended) |\n| [1496-lucky-numbers-in-a-matrix](https://github.com/rohit141914/LeetCode/tree/master/1496-lucky-numbers-in-a-matrix) |\n| [1497-design-a-stack-with-increment-operation](https://github.com/rohit141914/LeetCode/tree/master/1497-design-a-stack-with-increment-operation) |\n| [1524-string-matching-in-an-array](https://github.com/rohit141914/LeetCode/tree/master/1524-string-matching-in-an-array) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/rohit141914/LeetCode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/rohit141914/LeetCode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/rohit141914/LeetCode/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers](https://github.com/rohit141914/LeetCode/tree/master/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/rohit141914/LeetCode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/rohit141914/LeetCode/tree/master/1741-sort-array-by-increasing-frequency) |\n| [1755-defuse-the-bomb](https://github.com/rohit141914/LeetCode/tree/master/1755-defuse-the-bomb) |\n| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/rohit141914/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1829-maximum-units-on-a-truck](https://github.com/rohit141914/LeetCode/tree/master/1829-maximum-units-on-a-truck) |\n| [1923-sentence-similarity-iii](https://github.com/rohit141914/LeetCode/tree/master/1923-sentence-similarity-iii) |\n| [1988-minimize-maximum-pair-sum-in-array](https://github.com/rohit141914/LeetCode/tree/master/1988-minimize-maximum-pair-sum-in-array) |\n| [2093-check-if-string-is-a-prefix-of-array](https://github.com/rohit141914/LeetCode/tree/master/2093-check-if-string-is-a-prefix-of-array) |\n| [2102-find-the-middle-index-in-array](https://github.com/rohit141914/LeetCode/tree/master/2102-find-the-middle-index-in-array) |\n| [2122-count-special-quadruplets](https://github.com/rohit141914/LeetCode/tree/master/2122-count-special-quadruplets) |\n| [2126-destroying-asteroids](https://github.com/rohit141914/LeetCode/tree/master/2126-destroying-asteroids) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/rohit141914/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/rohit141914/LeetCode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |\n| [2179-most-beautiful-item-for-each-query](https://github.com/rohit141914/LeetCode/tree/master/2179-most-beautiful-item-for-each-query) |\n| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/rohit141914/LeetCode/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |\n| [2205-find-good-days-to-rob-the-bank](https://github.com/rohit141914/LeetCode/tree/master/2205-find-good-days-to-rob-the-bank) |\n| [2212-removing-minimum-and-maximum-from-array](https://github.com/rohit141914/LeetCode/tree/master/2212-removing-minimum-and-maximum-from-array) |\n| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/rohit141914/LeetCode/tree/master/2220-find-all-possible-recipes-from-given-supplies) |\n| [2232-adding-spaces-to-a-string](https://github.com/rohit141914/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/rohit141914/LeetCode/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/rohit141914/LeetCode/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |\n| [2262-solving-questions-with-brainpower](https://github.com/rohit141914/LeetCode/tree/master/2262-solving-questions-with-brainpower) |\n| [2265-partition-array-according-to-given-pivot](https://github.com/rohit141914/LeetCode/tree/master/2265-partition-array-according-to-given-pivot) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/rohit141914/LeetCode/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/rohit141914/LeetCode/tree/master/2274-keep-multiplying-found-values-by-two) |\n| [2283-sort-even-and-odd-indices-independently](https://github.com/rohit141914/LeetCode/tree/master/2283-sort-even-and-odd-indices-independently) |\n| [2292-counting-words-with-a-given-prefix](https://github.com/rohit141914/LeetCode/tree/master/2292-counting-words-with-a-given-prefix) |\n| [2308-divide-array-into-equal-pairs](https://github.com/rohit141914/LeetCode/tree/master/2308-divide-array-into-equal-pairs) |\n| [2312-most-frequent-number-following-key-in-an-array](https://github.com/rohit141914/LeetCode/tree/master/2312-most-frequent-number-following-key-in-an-array) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/rohit141914/LeetCode/tree/master/2324-find-triangular-sum-of-an-array) |\n| [2331-intersection-of-multiple-arrays](https://github.com/rohit141914/LeetCode/tree/master/2331-intersection-of-multiple-arrays) |\n| [2341-count-prefixes-of-a-given-string](https://github.com/rohit141914/LeetCode/tree/master/2341-count-prefixes-of-a-given-string) |\n| [2347-best-poker-hand](https://github.com/rohit141914/LeetCode/tree/master/2347-best-poker-hand) |\n| [2358-number-of-ways-to-split-array](https://github.com/rohit141914/LeetCode/tree/master/2358-number-of-ways-to-split-array) |\n| [2366-maximum-bags-with-full-capacity-of-rocks](https://github.com/rohit141914/LeetCode/tree/master/2366-maximum-bags-with-full-capacity-of-rocks) |\n| [2378-sender-with-largest-word-count](https://github.com/rohit141914/LeetCode/tree/master/2378-sender-with-largest-word-count) |\n| [2386-min-max-game](https://github.com/rohit141914/LeetCode/tree/master/2386-min-max-game) |\n| [2411-spiral-matrix-iv](https://github.com/rohit141914/LeetCode/tree/master/2411-spiral-matrix-iv) |\n| [2421-maximum-number-of-pairs-in-array](https://github.com/rohit141914/LeetCode/tree/master/2421-maximum-number-of-pairs-in-array) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/rohit141914/LeetCode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2465-shifting-letters-ii](https://github.com/rohit141914/LeetCode/tree/master/2465-shifting-letters-ii) |\n| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/rohit141914/LeetCode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |\n| [2478-longest-nice-subarray](https://github.com/rohit141914/LeetCode/tree/master/2478-longest-nice-subarray) |\n| [2486-most-frequent-even-element](https://github.com/rohit141914/LeetCode/tree/master/2486-most-frequent-even-element) |\n| [2497-maximum-matching-of-players-with-trainers](https://github.com/rohit141914/LeetCode/tree/master/2497-maximum-matching-of-players-with-trainers) |\n| [2504-find-all-good-indices](https://github.com/rohit141914/LeetCode/tree/master/2504-find-all-good-indices) |\n| [2533-bitwise-xor-of-all-pairings](https://github.com/rohit141914/LeetCode/tree/master/2533-bitwise-xor-of-all-pairings) |\n| [2536-determine-if-two-events-have-conflict](https://github.com/rohit141914/LeetCode/tree/master/2536-determine-if-two-events-have-conflict) |\n| [2542-average-value-of-even-numbers-that-are-divisible-by-three](https://github.com/rohit141914/LeetCode/tree/master/2542-average-value-of-even-numbers-that-are-divisible-by-three) |\n| [2551-apply-operations-to-an-array](https://github.com/rohit141914/LeetCode/tree/master/2551-apply-operations-to-an-array) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/rohit141914/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2588-maximum-number-of-points-from-grid-queries](https://github.com/rohit141914/LeetCode/tree/master/2588-maximum-number-of-points-from-grid-queries) |\n| [2606-difference-between-ones-and-zeros-in-row-and-column](https://github.com/rohit141914/LeetCode/tree/master/2606-difference-between-ones-and-zeros-in-row-and-column) |\n| [2665-minimum-time-to-repair-cars](https://github.com/rohit141914/LeetCode/tree/master/2665-minimum-time-to-repair-cars) |\n| [2669-find-the-substring-with-maximum-cost](https://github.com/rohit141914/LeetCode/tree/master/2669-find-the-substring-with-maximum-cost) |\n| [2681-put-marbles-in-bags](https://github.com/rohit141914/LeetCode/tree/master/2681-put-marbles-in-bags) |\n| [2685-first-completely-painted-row-or-column](https://github.com/rohit141914/LeetCode/tree/master/2685-first-completely-painted-row-or-column) |\n| [2690-house-robber-iv](https://github.com/rohit141914/LeetCode/tree/master/2690-house-robber-iv) |\n| [2691-count-vowel-strings-in-ranges](https://github.com/rohit141914/LeetCode/tree/master/2691-count-vowel-strings-in-ranges) |\n| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/rohit141914/LeetCode/tree/master/2707-merge-two-2d-arrays-by-summing-values) |\n| [2712-find-the-maximum-number-of-marked-indices](https://github.com/rohit141914/LeetCode/tree/master/2712-find-the-maximum-number-of-marked-indices) |\n| [2721-sum-of-distances](https://github.com/rohit141914/LeetCode/tree/master/2721-sum-of-distances) |\n| [2727-number-of-senior-citizens](https://github.com/rohit141914/LeetCode/tree/master/2727-number-of-senior-citizens) |\n| [2888-minimum-index-of-a-valid-split](https://github.com/rohit141914/LeetCode/tree/master/2888-minimum-index-of-a-valid-split) |\n| [3001-apply-operations-to-maximize-score](https://github.com/rohit141914/LeetCode/tree/master/3001-apply-operations-to-maximize-score) |\n| [3081-minimum-array-length-after-pair-removals](https://github.com/rohit141914/LeetCode/tree/master/3081-minimum-array-length-after-pair-removals) |\n| [3114-beautiful-towers-i](https://github.com/rohit141914/LeetCode/tree/master/3114-beautiful-towers-i) |\n| [3154-maximum-value-of-an-ordered-triplet-i](https://github.com/rohit141914/LeetCode/tree/master/3154-maximum-value-of-an-ordered-triplet-i) |\n| [3176-minimum-sum-of-mountain-triplets-i](https://github.com/rohit141914/LeetCode/tree/master/3176-minimum-sum-of-mountain-triplets-i) |\n| [3178-minimum-increment-operations-to-make-array-beautiful](https://github.com/rohit141914/LeetCode/tree/master/3178-minimum-increment-operations-to-make-array-beautiful) |\n| [3227-find-missing-and-repeated-values](https://github.com/rohit141914/LeetCode/tree/master/3227-find-missing-and-repeated-values) |\n| [3291-find-if-array-can-be-sorted](https://github.com/rohit141914/LeetCode/tree/master/3291-find-if-array-can-be-sorted) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/rohit141914/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/rohit141914/LeetCode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |\n| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/rohit141914/LeetCode/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |\n| [3390-minimum-rectangles-to-cover-points](https://github.com/rohit141914/LeetCode/tree/master/3390-minimum-rectangles-to-cover-points) |\n| [3429-special-array-i](https://github.com/rohit141914/LeetCode/tree/master/3429-special-array-i) |\n| [3430-count-days-without-meetings](https://github.com/rohit141914/LeetCode/tree/master/3430-count-days-without-meetings) |\n| [3469-maximum-height-of-a-triangle](https://github.com/rohit141914/LeetCode/tree/master/3469-maximum-height-of-a-triangle) |\n| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/rohit141914/LeetCode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |\n| [3476-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/rohit141914/LeetCode/tree/master/3476-find-minimum-operations-to-make-all-elements-divisible-by-three) |\n| [3483-alternating-groups-ii](https://github.com/rohit141914/LeetCode/tree/master/3483-alternating-groups-ii) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/rohit141914/LeetCode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n| [3515-find-if-digit-game-can-be-won](https://github.com/rohit141914/LeetCode/tree/master/3515-find-if-digit-game-can-be-won) |\n| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/rohit141914/LeetCode/tree/master/3581-the-two-sneaky-numbers-of-digitville) |\n| [3582-find-indices-of-stable-mountains](https://github.com/rohit141914/LeetCode/tree/master/3582-find-indices-of-stable-mountains) |\n| [3643-zero-array-transformation-ii](https://github.com/rohit141914/LeetCode/tree/master/3643-zero-array-transformation-ii) |\n| [3647-zero-array-transformation-iii](https://github.com/rohit141914/LeetCode/tree/master/3647-zero-array-transformation-iii) |\n| [3657-check-if-grid-can-be-cut-into-sections](https://github.com/rohit141914/LeetCode/tree/master/3657-check-if-grid-can-be-cut-into-sections) |\n| [3736-minimum-moves-to-equal-array-elements-iii](https://github.com/rohit141914/LeetCode/tree/master/3736-minimum-moves-to-equal-array-elements-iii) |\n| [3747-maximum-difference-between-adjacent-elements-in-a-circular-array](https://github.com/rohit141914/LeetCode/tree/master/3747-maximum-difference-between-adjacent-elements-in-a-circular-array) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/rohit141914/LeetCode/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/rohit141914/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0012-integer-to-roman](https://github.com/rohit141914/LeetCode/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/rohit141914/LeetCode/tree/master/0013-roman-to-integer) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0142-linked-list-cycle-ii](https://github.com/rohit141914/LeetCode/tree/master/0142-linked-list-cycle-ii) |\n| [0202-happy-number](https://github.com/rohit141914/LeetCode/tree/master/0202-happy-number) |\n| [0217-contains-duplicate](https://github.com/rohit141914/LeetCode/tree/master/0217-contains-duplicate) |\n| [0219-contains-duplicate-ii](https://github.com/rohit141914/LeetCode/tree/master/0219-contains-duplicate-ii) |\n| [0229-majority-element-ii](https://github.com/rohit141914/LeetCode/tree/master/0229-majority-element-ii) |\n| [0242-valid-anagram](https://github.com/rohit141914/LeetCode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/rohit141914/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/rohit141914/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0355-design-twitter](https://github.com/rohit141914/LeetCode/tree/master/0355-design-twitter) |\n| [0380-insert-delete-getrandom-o1](https://github.com/rohit141914/LeetCode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/rohit141914/LeetCode/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/rohit141914/LeetCode/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [0451-sort-characters-by-frequency](https://github.com/rohit141914/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [0676-implement-magic-dictionary](https://github.com/rohit141914/LeetCode/tree/master/0676-implement-magic-dictionary) |\n| [0692-top-k-frequent-words](https://github.com/rohit141914/LeetCode/tree/master/0692-top-k-frequent-words) |\n| [0720-longest-word-in-dictionary](https://github.com/rohit141914/LeetCode/tree/master/0720-longest-word-in-dictionary) |\n| [0768-partition-labels](https://github.com/rohit141914/LeetCode/tree/master/0768-partition-labels) |\n| [0778-reorganize-string](https://github.com/rohit141914/LeetCode/tree/master/0778-reorganize-string) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/rohit141914/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0952-word-subsets](https://github.com/rohit141914/LeetCode/tree/master/0952-word-subsets) |\n| [1010-powerful-integers](https://github.com/rohit141914/LeetCode/tree/master/1010-powerful-integers) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1054-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1054-distant-barcodes) |\n| [1140-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1140-distant-barcodes) |\n| [1227-number-of-equivalent-domino-pairs](https://github.com/rohit141914/LeetCode/tree/master/1227-number-of-equivalent-domino-pairs) |\n| [1256-rank-transform-of-an-array](https://github.com/rohit141914/LeetCode/tree/master/1256-rank-transform-of-an-array) |\n| [1275-find-winner-on-a-tic-tac-toe-game](https://github.com/rohit141914/LeetCode/tree/master/1275-find-winner-on-a-tic-tac-toe-game) |\n| [1353-find-resultant-array-after-removing-anagrams](https://github.com/rohit141914/LeetCode/tree/master/1353-find-resultant-array-after-removing-anagrams) |\n| [1354-find-players-with-zero-or-one-losses](https://github.com/rohit141914/LeetCode/tree/master/1354-find-players-with-zero-or-one-losses) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/rohit141914/LeetCode/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/rohit141914/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1469-minimum-number-of-steps-to-make-two-strings-anagram](https://github.com/rohit141914/LeetCode/tree/master/1469-minimum-number-of-steps-to-make-two-strings-anagram) |\n| [1502-construct-k-palindrome-strings](https://github.com/rohit141914/LeetCode/tree/master/1502-construct-k-palindrome-strings) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/rohit141914/LeetCode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers](https://github.com/rohit141914/LeetCode/tree/master/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/rohit141914/LeetCode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/rohit141914/LeetCode/tree/master/1741-sort-array-by-increasing-frequency) |\n| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/rohit141914/LeetCode/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/rohit141914/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1904-second-largest-digit-in-a-string](https://github.com/rohit141914/LeetCode/tree/master/1904-second-largest-digit-in-a-string) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/rohit141914/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2122-count-special-quadruplets](https://github.com/rohit141914/LeetCode/tree/master/2122-count-special-quadruplets) |\n| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/rohit141914/LeetCode/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |\n| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/rohit141914/LeetCode/tree/master/2220-find-all-possible-recipes-from-given-supplies) |\n| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/rohit141914/LeetCode/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/rohit141914/LeetCode/tree/master/2274-keep-multiplying-found-values-by-two) |\n| [2293-minimum-number-of-steps-to-make-two-strings-anagram-ii](https://github.com/rohit141914/LeetCode/tree/master/2293-minimum-number-of-steps-to-make-two-strings-anagram-ii) |\n| [2308-divide-array-into-equal-pairs](https://github.com/rohit141914/LeetCode/tree/master/2308-divide-array-into-equal-pairs) |\n| [2312-most-frequent-number-following-key-in-an-array](https://github.com/rohit141914/LeetCode/tree/master/2312-most-frequent-number-following-key-in-an-array) |\n| [2331-intersection-of-multiple-arrays](https://github.com/rohit141914/LeetCode/tree/master/2331-intersection-of-multiple-arrays) |\n| [2347-best-poker-hand](https://github.com/rohit141914/LeetCode/tree/master/2347-best-poker-hand) |\n| [2372-rearrange-characters-to-make-target-string](https://github.com/rohit141914/LeetCode/tree/master/2372-rearrange-characters-to-make-target-string) |\n| [2378-sender-with-largest-word-count](https://github.com/rohit141914/LeetCode/tree/master/2378-sender-with-largest-word-count) |\n| [2421-maximum-number-of-pairs-in-array](https://github.com/rohit141914/LeetCode/tree/master/2421-maximum-number-of-pairs-in-array) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/rohit141914/LeetCode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/rohit141914/LeetCode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |\n| [2486-most-frequent-even-element](https://github.com/rohit141914/LeetCode/tree/master/2486-most-frequent-even-element) |\n| [2532-remove-letter-to-equalize-frequency](https://github.com/rohit141914/LeetCode/tree/master/2532-remove-letter-to-equalize-frequency) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/rohit141914/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2669-find-the-substring-with-maximum-cost](https://github.com/rohit141914/LeetCode/tree/master/2669-find-the-substring-with-maximum-cost) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/rohit141914/LeetCode/tree/master/2677-cousins-in-binary-tree-ii) |\n| [2685-first-completely-painted-row-or-column](https://github.com/rohit141914/LeetCode/tree/master/2685-first-completely-painted-row-or-column) |\n| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/rohit141914/LeetCode/tree/master/2707-merge-two-2d-arrays-by-summing-values) |\n| [2721-sum-of-distances](https://github.com/rohit141914/LeetCode/tree/master/2721-sum-of-distances) |\n| [2888-minimum-index-of-a-valid-split](https://github.com/rohit141914/LeetCode/tree/master/2888-minimum-index-of-a-valid-split) |\n| [3081-minimum-array-length-after-pair-removals](https://github.com/rohit141914/LeetCode/tree/master/3081-minimum-array-length-after-pair-removals) |\n| [3227-find-missing-and-repeated-values](https://github.com/rohit141914/LeetCode/tree/master/3227-find-missing-and-repeated-values) |\n| [3412-permutation-difference-between-two-strings](https://github.com/rohit141914/LeetCode/tree/master/3412-permutation-difference-between-two-strings) |\n| [3455-minimum-length-of-string-after-operations](https://github.com/rohit141914/LeetCode/tree/master/3455-minimum-length-of-string-after-operations) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/rohit141914/LeetCode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/rohit141914/LeetCode/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |\n| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/rohit141914/LeetCode/tree/master/3581-the-two-sneaky-numbers-of-digitville) |\n| [3678-design-task-manager](https://github.com/rohit141914/LeetCode/tree/master/3678-design-task-manager) |\n| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/rohit141914/LeetCode/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |\n## Two Pointers\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/rohit141914/LeetCode/tree/master/0011-container-with-most-water) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/rohit141914/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0061-rotate-list](https://github.com/rohit141914/LeetCode/tree/master/0061-rotate-list) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/rohit141914/LeetCode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0086-partition-list](https://github.com/rohit141914/LeetCode/tree/master/0086-partition-list) |\n| [0142-linked-list-cycle-ii](https://github.com/rohit141914/LeetCode/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/rohit141914/LeetCode/tree/master/0143-reorder-list) |\n| [0202-happy-number](https://github.com/rohit141914/LeetCode/tree/master/0202-happy-number) |\n| [0295-find-median-from-data-stream](https://github.com/rohit141914/LeetCode/tree/master/0295-find-median-from-data-stream) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/rohit141914/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0443-string-compression](https://github.com/rohit141914/LeetCode/tree/master/0443-string-compression) |\n| [0524-longest-word-in-dictionary-through-deleting](https://github.com/rohit141914/LeetCode/tree/master/0524-longest-word-in-dictionary-through-deleting) |\n| [0768-partition-labels](https://github.com/rohit141914/LeetCode/tree/master/0768-partition-labels) |\n| [0875-longest-mountain-in-array](https://github.com/rohit141914/LeetCode/tree/master/0875-longest-mountain-in-array) |\n| [0958-sort-array-by-parity-ii](https://github.com/rohit141914/LeetCode/tree/master/0958-sort-array-by-parity-ii) |\n| [0961-long-pressed-name](https://github.com/rohit141914/LeetCode/tree/master/0961-long-pressed-name) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/rohit141914/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/rohit141914/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |\n| [1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers](https://github.com/rohit141914/LeetCode/tree/master/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers) |\n| [1894-merge-strings-alternately](https://github.com/rohit141914/LeetCode/tree/master/1894-merge-strings-alternately) |\n| [1923-sentence-similarity-iii](https://github.com/rohit141914/LeetCode/tree/master/1923-sentence-similarity-iii) |\n| [1988-minimize-maximum-pair-sum-in-array](https://github.com/rohit141914/LeetCode/tree/master/1988-minimize-maximum-pair-sum-in-array) |\n| [2093-check-if-string-is-a-prefix-of-array](https://github.com/rohit141914/LeetCode/tree/master/2093-check-if-string-is-a-prefix-of-array) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/rohit141914/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2128-reverse-prefix-of-word](https://github.com/rohit141914/LeetCode/tree/master/2128-reverse-prefix-of-word) |\n| [2232-adding-spaces-to-a-string](https://github.com/rohit141914/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [2265-partition-array-according-to-given-pivot](https://github.com/rohit141914/LeetCode/tree/master/2265-partition-array-according-to-given-pivot) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/rohit141914/LeetCode/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2497-maximum-matching-of-players-with-trainers](https://github.com/rohit141914/LeetCode/tree/master/2497-maximum-matching-of-players-with-trainers) |\n| [2551-apply-operations-to-an-array](https://github.com/rohit141914/LeetCode/tree/master/2551-apply-operations-to-an-array) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/rohit141914/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2588-maximum-number-of-points-from-grid-queries](https://github.com/rohit141914/LeetCode/tree/master/2588-maximum-number-of-points-from-grid-queries) |\n| [2707-merge-two-2d-arrays-by-summing-values](https://github.com/rohit141914/LeetCode/tree/master/2707-merge-two-2d-arrays-by-summing-values) |\n| [2712-find-the-maximum-number-of-marked-indices](https://github.com/rohit141914/LeetCode/tree/master/2712-find-the-maximum-number-of-marked-indices) |\n| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/rohit141914/LeetCode/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |\n| [3081-minimum-array-length-after-pair-removals](https://github.com/rohit141914/LeetCode/tree/master/3081-minimum-array-length-after-pair-removals) |\n## Binary Search\n|  |\n| ------- |\n| [0162-find-peak-element](https://github.com/rohit141914/LeetCode/tree/master/0162-find-peak-element) |\n| [0300-longest-increasing-subsequence](https://github.com/rohit141914/LeetCode/tree/master/0300-longest-increasing-subsequence) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/rohit141914/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0745-find-smallest-letter-greater-than-target](https://github.com/rohit141914/LeetCode/tree/master/0745-find-smallest-letter-greater-than-target) |\n| [0882-peak-index-in-a-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/0882-peak-index-in-a-mountain-array) |\n| [1185-find-in-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/1185-find-in-mountain-array) |\n| [1335-maximum-candies-allocated-to-k-children](https://github.com/rohit141914/LeetCode/tree/master/1335-maximum-candies-allocated-to-k-children) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/rohit141914/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |\n| [2179-most-beautiful-item-for-each-query](https://github.com/rohit141914/LeetCode/tree/master/2179-most-beautiful-item-for-each-query) |\n| [2665-minimum-time-to-repair-cars](https://github.com/rohit141914/LeetCode/tree/master/2665-minimum-time-to-repair-cars) |\n| [2690-house-robber-iv](https://github.com/rohit141914/LeetCode/tree/master/2690-house-robber-iv) |\n| [2712-find-the-maximum-number-of-marked-indices](https://github.com/rohit141914/LeetCode/tree/master/2712-find-the-maximum-number-of-marked-indices) |\n| [3081-minimum-array-length-after-pair-removals](https://github.com/rohit141914/LeetCode/tree/master/3081-minimum-array-length-after-pair-removals) |\n| [3643-zero-array-transformation-ii](https://github.com/rohit141914/LeetCode/tree/master/3643-zero-array-transformation-ii) |\n## Sorting\n|  |\n| ------- |\n| [0056-merge-intervals](https://github.com/rohit141914/LeetCode/tree/master/0056-merge-intervals) |\n| [0217-contains-duplicate](https://github.com/rohit141914/LeetCode/tree/master/0217-contains-duplicate) |\n| [0229-majority-element-ii](https://github.com/rohit141914/LeetCode/tree/master/0229-majority-element-ii) |\n| [0242-valid-anagram](https://github.com/rohit141914/LeetCode/tree/master/0242-valid-anagram) |\n| [0295-find-median-from-data-stream](https://github.com/rohit141914/LeetCode/tree/master/0295-find-median-from-data-stream) |\n| [0347-top-k-frequent-elements](https://github.com/rohit141914/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/rohit141914/LeetCode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0435-non-overlapping-intervals](https://github.com/rohit141914/LeetCode/tree/master/0435-non-overlapping-intervals) |\n| [0451-sort-characters-by-frequency](https://github.com/rohit141914/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/rohit141914/LeetCode/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |\n| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/rohit141914/LeetCode/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |\n| [0524-longest-word-in-dictionary-through-deleting](https://github.com/rohit141914/LeetCode/tree/master/0524-longest-word-in-dictionary-through-deleting) |\n| [0646-maximum-length-of-pair-chain](https://github.com/rohit141914/LeetCode/tree/master/0646-maximum-length-of-pair-chain) |\n| [0692-top-k-frequent-words](https://github.com/rohit141914/LeetCode/tree/master/0692-top-k-frequent-words) |\n| [0720-longest-word-in-dictionary](https://github.com/rohit141914/LeetCode/tree/master/0720-longest-word-in-dictionary) |\n| [0748-largest-number-at-least-twice-of-others](https://github.com/rohit141914/LeetCode/tree/master/0748-largest-number-at-least-twice-of-others) |\n| [0778-reorganize-string](https://github.com/rohit141914/LeetCode/tree/master/0778-reorganize-string) |\n| [0958-sort-array-by-parity-ii](https://github.com/rohit141914/LeetCode/tree/master/0958-sort-array-by-parity-ii) |\n| [1014-k-closest-points-to-origin](https://github.com/rohit141914/LeetCode/tree/master/1014-k-closest-points-to-origin) |\n| [1018-largest-perimeter-triangle](https://github.com/rohit141914/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1054-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1054-distant-barcodes) |\n| [1140-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1140-distant-barcodes) |\n| [1222-remove-covered-intervals](https://github.com/rohit141914/LeetCode/tree/master/1222-remove-covered-intervals) |\n| [1256-rank-transform-of-an-array](https://github.com/rohit141914/LeetCode/tree/master/1256-rank-transform-of-an-array) |\n| [1353-find-resultant-array-after-removing-anagrams](https://github.com/rohit141914/LeetCode/tree/master/1353-find-resultant-array-after-removing-anagrams) |\n| [1354-find-players-with-zero-or-one-losses](https://github.com/rohit141914/LeetCode/tree/master/1354-find-players-with-zero-or-one-losses) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/rohit141914/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/rohit141914/LeetCode/tree/master/1478-maximum-number-of-events-that-can-be-attended) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/rohit141914/LeetCode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/rohit141914/LeetCode/tree/master/1741-sort-array-by-increasing-frequency) |\n| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/rohit141914/LeetCode/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |\n| [1829-maximum-units-on-a-truck](https://github.com/rohit141914/LeetCode/tree/master/1829-maximum-units-on-a-truck) |\n| [1970-sorting-the-sentence](https://github.com/rohit141914/LeetCode/tree/master/1970-sorting-the-sentence) |\n| [1988-minimize-maximum-pair-sum-in-array](https://github.com/rohit141914/LeetCode/tree/master/1988-minimize-maximum-pair-sum-in-array) |\n| [2126-destroying-asteroids](https://github.com/rohit141914/LeetCode/tree/master/2126-destroying-asteroids) |\n| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/rohit141914/LeetCode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |\n| [2179-most-beautiful-item-for-each-query](https://github.com/rohit141914/LeetCode/tree/master/2179-most-beautiful-item-for-each-query) |\n| [2204-find-subsequence-of-length-k-with-the-largest-sum](https://github.com/rohit141914/LeetCode/tree/master/2204-find-subsequence-of-length-k-with-the-largest-sum) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/rohit141914/LeetCode/tree/master/2274-keep-multiplying-found-values-by-two) |\n| [2283-sort-even-and-odd-indices-independently](https://github.com/rohit141914/LeetCode/tree/master/2283-sort-even-and-odd-indices-independently) |\n| [2327-largest-number-after-digit-swaps-by-parity](https://github.com/rohit141914/LeetCode/tree/master/2327-largest-number-after-digit-swaps-by-parity) |\n| [2331-intersection-of-multiple-arrays](https://github.com/rohit141914/LeetCode/tree/master/2331-intersection-of-multiple-arrays) |\n| [2366-maximum-bags-with-full-capacity-of-rocks](https://github.com/rohit141914/LeetCode/tree/master/2366-maximum-bags-with-full-capacity-of-rocks) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/rohit141914/LeetCode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2473-max-sum-of-a-pair-with-equal-sum-of-digits](https://github.com/rohit141914/LeetCode/tree/master/2473-max-sum-of-a-pair-with-equal-sum-of-digits) |\n| [2497-maximum-matching-of-players-with-trainers](https://github.com/rohit141914/LeetCode/tree/master/2497-maximum-matching-of-players-with-trainers) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/rohit141914/LeetCode/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2588-maximum-number-of-points-from-grid-queries](https://github.com/rohit141914/LeetCode/tree/master/2588-maximum-number-of-points-from-grid-queries) |\n| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/2646-kth-largest-sum-in-a-binary-tree) |\n| [2681-put-marbles-in-bags](https://github.com/rohit141914/LeetCode/tree/master/2681-put-marbles-in-bags) |\n| [2712-find-the-maximum-number-of-marked-indices](https://github.com/rohit141914/LeetCode/tree/master/2712-find-the-maximum-number-of-marked-indices) |\n| [2888-minimum-index-of-a-valid-split](https://github.com/rohit141914/LeetCode/tree/master/2888-minimum-index-of-a-valid-split) |\n| [3001-apply-operations-to-maximize-score](https://github.com/rohit141914/LeetCode/tree/master/3001-apply-operations-to-maximize-score) |\n| [3291-find-if-array-can-be-sorted](https://github.com/rohit141914/LeetCode/tree/master/3291-find-if-array-can-be-sorted) |\n| [3390-minimum-rectangles-to-cover-points](https://github.com/rohit141914/LeetCode/tree/master/3390-minimum-rectangles-to-cover-points) |\n| [3430-count-days-without-meetings](https://github.com/rohit141914/LeetCode/tree/master/3430-count-days-without-meetings) |\n| [3647-zero-array-transformation-iii](https://github.com/rohit141914/LeetCode/tree/master/3647-zero-array-transformation-iii) |\n| [3657-check-if-grid-can-be-cut-into-sections](https://github.com/rohit141914/LeetCode/tree/master/3657-check-if-grid-can-be-cut-into-sections) |\n## Counting\n|  |\n| ------- |\n| [0229-majority-element-ii](https://github.com/rohit141914/LeetCode/tree/master/0229-majority-element-ii) |\n| [0347-top-k-frequent-elements](https://github.com/rohit141914/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/rohit141914/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [0692-top-k-frequent-words](https://github.com/rohit141914/LeetCode/tree/master/0692-top-k-frequent-words) |\n| [0778-reorganize-string](https://github.com/rohit141914/LeetCode/tree/master/0778-reorganize-string) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/rohit141914/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |\n| [1054-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1054-distant-barcodes) |\n| [1140-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1140-distant-barcodes) |\n| [1227-number-of-equivalent-domino-pairs](https://github.com/rohit141914/LeetCode/tree/master/1227-number-of-equivalent-domino-pairs) |\n| [1354-find-players-with-zero-or-one-losses](https://github.com/rohit141914/LeetCode/tree/master/1354-find-players-with-zero-or-one-losses) |\n| [1469-minimum-number-of-steps-to-make-two-strings-anagram](https://github.com/rohit141914/LeetCode/tree/master/1469-minimum-number-of-steps-to-make-two-strings-anagram) |\n| [1502-construct-k-palindrome-strings](https://github.com/rohit141914/LeetCode/tree/master/1502-construct-k-palindrome-strings) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/rohit141914/LeetCode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1708-design-parking-system](https://github.com/rohit141914/LeetCode/tree/master/1708-design-parking-system) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/rohit141914/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/rohit141914/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2293-minimum-number-of-steps-to-make-two-strings-anagram-ii](https://github.com/rohit141914/LeetCode/tree/master/2293-minimum-number-of-steps-to-make-two-strings-anagram-ii) |\n| [2308-divide-array-into-equal-pairs](https://github.com/rohit141914/LeetCode/tree/master/2308-divide-array-into-equal-pairs) |\n| [2312-most-frequent-number-following-key-in-an-array](https://github.com/rohit141914/LeetCode/tree/master/2312-most-frequent-number-following-key-in-an-array) |\n| [2331-intersection-of-multiple-arrays](https://github.com/rohit141914/LeetCode/tree/master/2331-intersection-of-multiple-arrays) |\n| [2347-best-poker-hand](https://github.com/rohit141914/LeetCode/tree/master/2347-best-poker-hand) |\n| [2372-rearrange-characters-to-make-target-string](https://github.com/rohit141914/LeetCode/tree/master/2372-rearrange-characters-to-make-target-string) |\n| [2378-sender-with-largest-word-count](https://github.com/rohit141914/LeetCode/tree/master/2378-sender-with-largest-word-count) |\n| [2421-maximum-number-of-pairs-in-array](https://github.com/rohit141914/LeetCode/tree/master/2421-maximum-number-of-pairs-in-array) |\n| [2486-most-frequent-even-element](https://github.com/rohit141914/LeetCode/tree/master/2486-most-frequent-even-element) |\n| [2532-remove-letter-to-equalize-frequency](https://github.com/rohit141914/LeetCode/tree/master/2532-remove-letter-to-equalize-frequency) |\n| [3081-minimum-array-length-after-pair-removals](https://github.com/rohit141914/LeetCode/tree/master/3081-minimum-array-length-after-pair-removals) |\n| [3455-minimum-length-of-string-after-operations](https://github.com/rohit141914/LeetCode/tree/master/3455-minimum-length-of-string-after-operations) |\n| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/rohit141914/LeetCode/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |\n## Matrix\n|  |\n| ------- |\n| [0566-reshape-the-matrix](https://github.com/rohit141914/LeetCode/tree/master/0566-reshape-the-matrix) |\n| [1275-find-winner-on-a-tic-tac-toe-game](https://github.com/rohit141914/LeetCode/tree/master/1275-find-winner-on-a-tic-tac-toe-game) |\n| [1496-lucky-numbers-in-a-matrix](https://github.com/rohit141914/LeetCode/tree/master/1496-lucky-numbers-in-a-matrix) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/rohit141914/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/rohit141914/LeetCode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/rohit141914/LeetCode/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/rohit141914/LeetCode/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |\n| [2411-spiral-matrix-iv](https://github.com/rohit141914/LeetCode/tree/master/2411-spiral-matrix-iv) |\n| [2588-maximum-number-of-points-from-grid-queries](https://github.com/rohit141914/LeetCode/tree/master/2588-maximum-number-of-points-from-grid-queries) |\n| [2606-difference-between-ones-and-zeros-in-row-and-column](https://github.com/rohit141914/LeetCode/tree/master/2606-difference-between-ones-and-zeros-in-row-and-column) |\n| [2685-first-completely-painted-row-or-column](https://github.com/rohit141914/LeetCode/tree/master/2685-first-completely-painted-row-or-column) |\n| [3227-find-missing-and-repeated-values](https://github.com/rohit141914/LeetCode/tree/master/3227-find-missing-and-repeated-values) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/rohit141914/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0006-zigzag-conversion](https://github.com/rohit141914/LeetCode/tree/master/0006-zigzag-conversion) |\n| [0008-string-to-integer-atoi](https://github.com/rohit141914/LeetCode/tree/master/0008-string-to-integer-atoi) |\n| [0012-integer-to-roman](https://github.com/rohit141914/LeetCode/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/rohit141914/LeetCode/tree/master/0013-roman-to-integer) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/rohit141914/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0043-multiply-strings](https://github.com/rohit141914/LeetCode/tree/master/0043-multiply-strings) |\n| [0067-add-binary](https://github.com/rohit141914/LeetCode/tree/master/0067-add-binary) |\n| [0072-edit-distance](https://github.com/rohit141914/LeetCode/tree/master/0072-edit-distance) |\n| [0168-excel-sheet-column-title](https://github.com/rohit141914/LeetCode/tree/master/0168-excel-sheet-column-title) |\n| [0171-excel-sheet-column-number](https://github.com/rohit141914/LeetCode/tree/master/0171-excel-sheet-column-number) |\n| [0242-valid-anagram](https://github.com/rohit141914/LeetCode/tree/master/0242-valid-anagram) |\n| [0257-binary-tree-paths](https://github.com/rohit141914/LeetCode/tree/master/0257-binary-tree-paths) |\n| [0318-maximum-product-of-word-lengths](https://github.com/rohit141914/LeetCode/tree/master/0318-maximum-product-of-word-lengths) |\n| [0443-string-compression](https://github.com/rohit141914/LeetCode/tree/master/0443-string-compression) |\n| [0451-sort-characters-by-frequency](https://github.com/rohit141914/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [0516-longest-palindromic-subsequence](https://github.com/rohit141914/LeetCode/tree/master/0516-longest-palindromic-subsequence) |\n| [0524-longest-word-in-dictionary-through-deleting](https://github.com/rohit141914/LeetCode/tree/master/0524-longest-word-in-dictionary-through-deleting) |\n| [0583-delete-operation-for-two-strings](https://github.com/rohit141914/LeetCode/tree/master/0583-delete-operation-for-two-strings) |\n| [0676-implement-magic-dictionary](https://github.com/rohit141914/LeetCode/tree/master/0676-implement-magic-dictionary) |\n| [0692-top-k-frequent-words](https://github.com/rohit141914/LeetCode/tree/master/0692-top-k-frequent-words) |\n| [0720-longest-word-in-dictionary](https://github.com/rohit141914/LeetCode/tree/master/0720-longest-word-in-dictionary) |\n| [0768-partition-labels](https://github.com/rohit141914/LeetCode/tree/master/0768-partition-labels) |\n| [0778-reorganize-string](https://github.com/rohit141914/LeetCode/tree/master/0778-reorganize-string) |\n| [0812-rotate-string](https://github.com/rohit141914/LeetCode/tree/master/0812-rotate-string) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/rohit141914/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0952-word-subsets](https://github.com/rohit141914/LeetCode/tree/master/0952-word-subsets) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/rohit141914/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [0961-long-pressed-name](https://github.com/rohit141914/LeetCode/tree/master/0961-long-pressed-name) |\n| [1302-delete-characters-to-make-fancy-string](https://github.com/rohit141914/LeetCode/tree/master/1302-delete-characters-to-make-fancy-string) |\n| [1353-find-resultant-array-after-removing-anagrams](https://github.com/rohit141914/LeetCode/tree/master/1353-find-resultant-array-after-removing-anagrams) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/rohit141914/LeetCode/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1469-minimum-number-of-steps-to-make-two-strings-anagram](https://github.com/rohit141914/LeetCode/tree/master/1469-minimum-number-of-steps-to-make-two-strings-anagram) |\n| [1502-construct-k-palindrome-strings](https://github.com/rohit141914/LeetCode/tree/master/1502-construct-k-palindrome-strings) |\n| [1524-string-matching-in-an-array](https://github.com/rohit141914/LeetCode/tree/master/1524-string-matching-in-an-array) |\n| [1537-maximum-score-after-splitting-a-string](https://github.com/rohit141914/LeetCode/tree/master/1537-maximum-score-after-splitting-a-string) |\n| [1542-consecutive-characters](https://github.com/rohit141914/LeetCode/tree/master/1542-consecutive-characters) |\n| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/rohit141914/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |\n| [1636-number-of-substrings-with-only-1s](https://github.com/rohit141914/LeetCode/tree/master/1636-number-of-substrings-with-only-1s) |\n| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/rohit141914/LeetCode/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/rohit141914/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1885-count-number-of-homogenous-substrings](https://github.com/rohit141914/LeetCode/tree/master/1885-count-number-of-homogenous-substrings) |\n| [1894-merge-strings-alternately](https://github.com/rohit141914/LeetCode/tree/master/1894-merge-strings-alternately) |\n| [1904-second-largest-digit-in-a-string](https://github.com/rohit141914/LeetCode/tree/master/1904-second-largest-digit-in-a-string) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/rohit141914/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [1923-sentence-similarity-iii](https://github.com/rohit141914/LeetCode/tree/master/1923-sentence-similarity-iii) |\n| [1970-sorting-the-sentence](https://github.com/rohit141914/LeetCode/tree/master/1970-sorting-the-sentence) |\n| [2076-sum-of-digits-of-string-after-convert](https://github.com/rohit141914/LeetCode/tree/master/2076-sum-of-digits-of-string-after-convert) |\n| [2086-minimum-number-of-food-buckets-to-feed-the-hamsters](https://github.com/rohit141914/LeetCode/tree/master/2086-minimum-number-of-food-buckets-to-feed-the-hamsters) |\n| [2088-minimum-time-to-type-word-using-special-typewriter](https://github.com/rohit141914/LeetCode/tree/master/2088-minimum-time-to-type-word-using-special-typewriter) |\n| [2093-check-if-string-is-a-prefix-of-array](https://github.com/rohit141914/LeetCode/tree/master/2093-check-if-string-is-a-prefix-of-array) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/rohit141914/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2128-reverse-prefix-of-word](https://github.com/rohit141914/LeetCode/tree/master/2128-reverse-prefix-of-word) |\n| [2168-check-if-numbers-are-ascending-in-a-sentence](https://github.com/rohit141914/LeetCode/tree/master/2168-check-if-numbers-are-ascending-in-a-sentence) |\n| [2220-find-all-possible-recipes-from-given-supplies](https://github.com/rohit141914/LeetCode/tree/master/2220-find-all-possible-recipes-from-given-supplies) |\n| [2232-adding-spaces-to-a-string](https://github.com/rohit141914/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [2243-check-if-all-as-appears-before-all-bs](https://github.com/rohit141914/LeetCode/tree/master/2243-check-if-all-as-appears-before-all-bs) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/rohit141914/LeetCode/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2269-find-the-k-beauty-of-a-number](https://github.com/rohit141914/LeetCode/tree/master/2269-find-the-k-beauty-of-a-number) |\n| [2292-counting-words-with-a-given-prefix](https://github.com/rohit141914/LeetCode/tree/master/2292-counting-words-with-a-given-prefix) |\n| [2293-minimum-number-of-steps-to-make-two-strings-anagram-ii](https://github.com/rohit141914/LeetCode/tree/master/2293-minimum-number-of-steps-to-make-two-strings-anagram-ii) |\n| [2304-cells-in-a-range-on-an-excel-sheet](https://github.com/rohit141914/LeetCode/tree/master/2304-cells-in-a-range-on-an-excel-sheet) |\n| [2337-remove-digit-from-number-to-maximize-result](https://github.com/rohit141914/LeetCode/tree/master/2337-remove-digit-from-number-to-maximize-result) |\n| [2341-count-prefixes-of-a-given-string](https://github.com/rohit141914/LeetCode/tree/master/2341-count-prefixes-of-a-given-string) |\n| [2361-calculate-digit-sum-of-a-string](https://github.com/rohit141914/LeetCode/tree/master/2361-calculate-digit-sum-of-a-string) |\n| [2365-percentage-of-letter-in-string](https://github.com/rohit141914/LeetCode/tree/master/2365-percentage-of-letter-in-string) |\n| [2372-rearrange-characters-to-make-target-string](https://github.com/rohit141914/LeetCode/tree/master/2372-rearrange-characters-to-make-target-string) |\n| [2378-sender-with-largest-word-count](https://github.com/rohit141914/LeetCode/tree/master/2378-sender-with-largest-word-count) |\n| [2463-minimum-recolors-to-get-k-consecutive-black-blocks](https://github.com/rohit141914/LeetCode/tree/master/2463-minimum-recolors-to-get-k-consecutive-black-blocks) |\n| [2465-shifting-letters-ii](https://github.com/rohit141914/LeetCode/tree/master/2465-shifting-letters-ii) |\n| [2532-remove-letter-to-equalize-frequency](https://github.com/rohit141914/LeetCode/tree/master/2532-remove-letter-to-equalize-frequency) |\n| [2536-determine-if-two-events-have-conflict](https://github.com/rohit141914/LeetCode/tree/master/2536-determine-if-two-events-have-conflict) |\n| [2580-circular-sentence](https://github.com/rohit141914/LeetCode/tree/master/2580-circular-sentence) |\n| [2669-find-the-substring-with-maximum-cost](https://github.com/rohit141914/LeetCode/tree/master/2669-find-the-substring-with-maximum-cost) |\n| [2691-count-vowel-strings-in-ranges](https://github.com/rohit141914/LeetCode/tree/master/2691-count-vowel-strings-in-ranges) |\n| [2727-number-of-senior-citizens](https://github.com/rohit141914/LeetCode/tree/master/2727-number-of-senior-citizens) |\n| [2800-minimum-string-length-after-removing-substrings](https://github.com/rohit141914/LeetCode/tree/master/2800-minimum-string-length-after-removing-substrings) |\n| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/rohit141914/LeetCode/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |\n| [3168-minimum-number-of-chairs-in-a-waiting-room](https://github.com/rohit141914/LeetCode/tree/master/3168-minimum-number-of-chairs-in-a-waiting-room) |\n| [3274-check-if-two-chessboard-squares-have-the-same-color](https://github.com/rohit141914/LeetCode/tree/master/3274-check-if-two-chessboard-squares-have-the-same-color) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/rohit141914/LeetCode/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n| [3412-permutation-difference-between-two-strings](https://github.com/rohit141914/LeetCode/tree/master/3412-permutation-difference-between-two-strings) |\n| [3447-clear-digits](https://github.com/rohit141914/LeetCode/tree/master/3447-clear-digits) |\n| [3451-string-compression-iii](https://github.com/rohit141914/LeetCode/tree/master/3451-string-compression-iii) |\n| [3455-minimum-length-of-string-after-operations](https://github.com/rohit141914/LeetCode/tree/master/3455-minimum-length-of-string-after-operations) |\n| [3461-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/rohit141914/LeetCode/tree/master/3461-check-if-digits-are-equal-in-string-after-operations-i) |\n| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/rohit141914/LeetCode/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |\n| [3636-check-balanced-string](https://github.com/rohit141914/LeetCode/tree/master/3636-check-balanced-string) |\n| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/rohit141914/LeetCode/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/rohit141914/LeetCode/tree/master/0002-add-two-numbers) |\n| [0012-integer-to-roman](https://github.com/rohit141914/LeetCode/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/rohit141914/LeetCode/tree/master/0013-roman-to-integer) |\n| [0043-multiply-strings](https://github.com/rohit141914/LeetCode/tree/master/0043-multiply-strings) |\n| [0067-add-binary](https://github.com/rohit141914/LeetCode/tree/master/0067-add-binary) |\n| [0070-climbing-stairs](https://github.com/rohit141914/LeetCode/tree/master/0070-climbing-stairs) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/rohit141914/LeetCode/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0168-excel-sheet-column-title](https://github.com/rohit141914/LeetCode/tree/master/0168-excel-sheet-column-title) |\n| [0171-excel-sheet-column-number](https://github.com/rohit141914/LeetCode/tree/master/0171-excel-sheet-column-number) |\n| [0202-happy-number](https://github.com/rohit141914/LeetCode/tree/master/0202-happy-number) |\n| [0258-add-digits](https://github.com/rohit141914/LeetCode/tree/master/0258-add-digits) |\n| [0263-ugly-number](https://github.com/rohit141914/LeetCode/tree/master/0263-ugly-number) |\n| [0343-integer-break](https://github.com/rohit141914/LeetCode/tree/master/0343-integer-break) |\n| [0371-sum-of-two-integers](https://github.com/rohit141914/LeetCode/tree/master/0371-sum-of-two-integers) |\n| [0380-insert-delete-getrandom-o1](https://github.com/rohit141914/LeetCode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0381-insert-delete-getrandom-o1-duplicates-allowed](https://github.com/rohit141914/LeetCode/tree/master/0381-insert-delete-getrandom-o1-duplicates-allowed) |\n| [0382-linked-list-random-node](https://github.com/rohit141914/LeetCode/tree/master/0382-linked-list-random-node) |\n| [0390-elimination-game](https://github.com/rohit141914/LeetCode/tree/master/0390-elimination-game) |\n| [0445-add-two-numbers-ii](https://github.com/rohit141914/LeetCode/tree/master/0445-add-two-numbers-ii) |\n| [0453-minimum-moves-to-equal-array-elements](https://github.com/rohit141914/LeetCode/tree/master/0453-minimum-moves-to-equal-array-elements) |\n| [0462-minimum-moves-to-equal-array-elements-ii](https://github.com/rohit141914/LeetCode/tree/master/0462-minimum-moves-to-equal-array-elements-ii) |\n| [1010-powerful-integers](https://github.com/rohit141914/LeetCode/tree/master/1010-powerful-integers) |\n| [1014-k-closest-points-to-origin](https://github.com/rohit141914/LeetCode/tree/master/1014-k-closest-points-to-origin) |\n| [1018-largest-perimeter-triangle](https://github.com/rohit141914/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n| [1037-valid-boomerang](https://github.com/rohit141914/LeetCode/tree/master/1037-valid-boomerang) |\n| [1390-four-divisors](https://github.com/rohit141914/LeetCode/tree/master/1390-four-divisors) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/rohit141914/LeetCode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n| [1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers](https://github.com/rohit141914/LeetCode/tree/master/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers) |\n| [1636-number-of-substrings-with-only-1s](https://github.com/rohit141914/LeetCode/tree/master/1636-number-of-substrings-with-only-1s) |\n| [1885-count-number-of-homogenous-substrings](https://github.com/rohit141914/LeetCode/tree/master/1885-count-number-of-homogenous-substrings) |\n| [1889-check-if-number-is-a-sum-of-powers-of-three](https://github.com/rohit141914/LeetCode/tree/master/1889-check-if-number-is-a-sum-of-powers-of-three) |\n| [2160-minimum-operations-to-make-a-uni-value-grid](https://github.com/rohit141914/LeetCode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid) |\n| [2244-number-of-laser-beams-in-a-bank](https://github.com/rohit141914/LeetCode/tree/master/2244-number-of-laser-beams-in-a-bank) |\n| [2269-find-the-k-beauty-of-a-number](https://github.com/rohit141914/LeetCode/tree/master/2269-find-the-k-beauty-of-a-number) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/rohit141914/LeetCode/tree/master/2324-find-triangular-sum-of-an-array) |\n| [2525-categorize-box-according-to-criteria](https://github.com/rohit141914/LeetCode/tree/master/2525-categorize-box-according-to-criteria) |\n| [2542-average-value-of-even-numbers-that-are-divisible-by-three](https://github.com/rohit141914/LeetCode/tree/master/2542-average-value-of-even-numbers-that-are-divisible-by-three) |\n| [2610-closest-prime-numbers-in-range](https://github.com/rohit141914/LeetCode/tree/master/2610-closest-prime-numbers-in-range) |\n| [2630-alternating-digit-sum](https://github.com/rohit141914/LeetCode/tree/master/2630-alternating-digit-sum) |\n| [2649-count-total-number-of-colored-cells](https://github.com/rohit141914/LeetCode/tree/master/2649-count-total-number-of-colored-cells) |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/rohit141914/LeetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |\n| [3001-apply-operations-to-maximize-score](https://github.com/rohit141914/LeetCode/tree/master/3001-apply-operations-to-maximize-score) |\n| [3227-find-missing-and-repeated-values](https://github.com/rohit141914/LeetCode/tree/master/3227-find-missing-and-repeated-values) |\n| [3274-check-if-two-chessboard-squares-have-the-same-color](https://github.com/rohit141914/LeetCode/tree/master/3274-check-if-two-chessboard-squares-have-the-same-color) |\n| [3371-harshad-number](https://github.com/rohit141914/LeetCode/tree/master/3371-harshad-number) |\n| [3461-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/rohit141914/LeetCode/tree/master/3461-check-if-digits-are-equal-in-string-after-operations-i) |\n| [3476-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/rohit141914/LeetCode/tree/master/3476-find-minimum-operations-to-make-all-elements-divisible-by-three) |\n| [3515-find-if-digit-game-can-be-won](https://github.com/rohit141914/LeetCode/tree/master/3515-find-if-digit-game-can-be-won) |\n| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/rohit141914/LeetCode/tree/master/3581-the-two-sneaky-numbers-of-digitville) |\n| [3600-find-the-k-th-character-in-string-game-i](https://github.com/rohit141914/LeetCode/tree/master/3600-find-the-k-th-character-in-string-game-i) |\n| [3736-minimum-moves-to-equal-array-elements-iii](https://github.com/rohit141914/LeetCode/tree/master/3736-minimum-moves-to-equal-array-elements-iii) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/rohit141914/LeetCode/tree/master/0011-container-with-most-water) |\n| [0045-jump-game-ii](https://github.com/rohit141914/LeetCode/tree/master/0045-jump-game-ii) |\n| [0055-jump-game](https://github.com/rohit141914/LeetCode/tree/master/0055-jump-game) |\n| [0334-increasing-triplet-subsequence](https://github.com/rohit141914/LeetCode/tree/master/0334-increasing-triplet-subsequence) |\n| [0397-integer-replacement](https://github.com/rohit141914/LeetCode/tree/master/0397-integer-replacement) |\n| [0435-non-overlapping-intervals](https://github.com/rohit141914/LeetCode/tree/master/0435-non-overlapping-intervals) |\n| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/rohit141914/LeetCode/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |\n| [0646-maximum-length-of-pair-chain](https://github.com/rohit141914/LeetCode/tree/master/0646-maximum-length-of-pair-chain) |\n| [0768-partition-labels](https://github.com/rohit141914/LeetCode/tree/master/0768-partition-labels) |\n| [0778-reorganize-string](https://github.com/rohit141914/LeetCode/tree/master/0778-reorganize-string) |\n| [0890-lemonade-change](https://github.com/rohit141914/LeetCode/tree/master/0890-lemonade-change) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/rohit141914/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1018-largest-perimeter-triangle](https://github.com/rohit141914/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n| [1054-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1054-distant-barcodes) |\n| [1062-partition-array-into-three-parts-with-equal-sum](https://github.com/rohit141914/LeetCode/tree/master/1062-partition-array-into-three-parts-with-equal-sum) |\n| [1140-distant-barcodes](https://github.com/rohit141914/LeetCode/tree/master/1140-distant-barcodes) |\n| [1355-minimum-deletions-to-make-array-beautiful](https://github.com/rohit141914/LeetCode/tree/master/1355-minimum-deletions-to-make-array-beautiful) |\n| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/rohit141914/LeetCode/tree/master/1478-maximum-number-of-events-that-can-be-attended) |\n| [1502-construct-k-palindrome-strings](https://github.com/rohit141914/LeetCode/tree/master/1502-construct-k-palindrome-strings) |\n| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/rohit141914/LeetCode/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |\n| [1770-minimum-deletions-to-make-character-frequencies-unique](https://github.com/rohit141914/LeetCode/tree/master/1770-minimum-deletions-to-make-character-frequencies-unique) |\n| [1829-maximum-units-on-a-truck](https://github.com/rohit141914/LeetCode/tree/master/1829-maximum-units-on-a-truck) |\n| [1988-minimize-maximum-pair-sum-in-array](https://github.com/rohit141914/LeetCode/tree/master/1988-minimize-maximum-pair-sum-in-array) |\n| [2086-minimum-number-of-food-buckets-to-feed-the-hamsters](https://github.com/rohit141914/LeetCode/tree/master/2086-minimum-number-of-food-buckets-to-feed-the-hamsters) |\n| [2088-minimum-time-to-type-word-using-special-typewriter](https://github.com/rohit141914/LeetCode/tree/master/2088-minimum-time-to-type-word-using-special-typewriter) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/rohit141914/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2126-destroying-asteroids](https://github.com/rohit141914/LeetCode/tree/master/2126-destroying-asteroids) |\n| [2212-removing-minimum-and-maximum-from-array](https://github.com/rohit141914/LeetCode/tree/master/2212-removing-minimum-and-maximum-from-array) |\n| [2337-remove-digit-from-number-to-maximize-result](https://github.com/rohit141914/LeetCode/tree/master/2337-remove-digit-from-number-to-maximize-result) |\n| [2366-maximum-bags-with-full-capacity-of-rocks](https://github.com/rohit141914/LeetCode/tree/master/2366-maximum-bags-with-full-capacity-of-rocks) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/rohit141914/LeetCode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2497-maximum-matching-of-players-with-trainers](https://github.com/rohit141914/LeetCode/tree/master/2497-maximum-matching-of-players-with-trainers) |\n| [2681-put-marbles-in-bags](https://github.com/rohit141914/LeetCode/tree/master/2681-put-marbles-in-bags) |\n| [2712-find-the-maximum-number-of-marked-indices](https://github.com/rohit141914/LeetCode/tree/master/2712-find-the-maximum-number-of-marked-indices) |\n| [3001-apply-operations-to-maximize-score](https://github.com/rohit141914/LeetCode/tree/master/3001-apply-operations-to-maximize-score) |\n| [3081-minimum-array-length-after-pair-removals](https://github.com/rohit141914/LeetCode/tree/master/3081-minimum-array-length-after-pair-removals) |\n| [3390-minimum-rectangles-to-cover-points](https://github.com/rohit141914/LeetCode/tree/master/3390-minimum-rectangles-to-cover-points) |\n| [3647-zero-array-transformation-iii](https://github.com/rohit141914/LeetCode/tree/master/3647-zero-array-transformation-iii) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0067-add-binary](https://github.com/rohit141914/LeetCode/tree/master/0067-add-binary) |\n| [0090-subsets-ii](https://github.com/rohit141914/LeetCode/tree/master/0090-subsets-ii) |\n| [0190-reverse-bits](https://github.com/rohit141914/LeetCode/tree/master/0190-reverse-bits) |\n| [0318-maximum-product-of-word-lengths](https://github.com/rohit141914/LeetCode/tree/master/0318-maximum-product-of-word-lengths) |\n| [0371-sum-of-two-integers](https://github.com/rohit141914/LeetCode/tree/master/0371-sum-of-two-integers) |\n| [0397-integer-replacement](https://github.com/rohit141914/LeetCode/tree/master/0397-integer-replacement) |\n| [0476-number-complement](https://github.com/rohit141914/LeetCode/tree/master/0476-number-complement) |\n| [1071-binary-prefix-divisible-by-5](https://github.com/rohit141914/LeetCode/tree/master/1071-binary-prefix-divisible-by-5) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/rohit141914/LeetCode/tree/master/1786-count-the-number-of-consistent-strings) |\n| [2308-divide-array-into-equal-pairs](https://github.com/rohit141914/LeetCode/tree/master/2308-divide-array-into-equal-pairs) |\n| [2323-minimum-bit-flips-to-convert-number](https://github.com/rohit141914/LeetCode/tree/master/2323-minimum-bit-flips-to-convert-number) |\n| [2478-longest-nice-subarray](https://github.com/rohit141914/LeetCode/tree/master/2478-longest-nice-subarray) |\n| [2533-bitwise-xor-of-all-pairings](https://github.com/rohit141914/LeetCode/tree/master/2533-bitwise-xor-of-all-pairings) |\n| [3291-find-if-array-can-be-sorted](https://github.com/rohit141914/LeetCode/tree/master/3291-find-if-array-can-be-sorted) |\n| [3348-minimum-cost-walk-in-weighted-graph](https://github.com/rohit141914/LeetCode/tree/master/3348-minimum-cost-walk-in-weighted-graph) |\n| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/rohit141914/LeetCode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |\n| [3600-find-the-k-th-character-in-string-game-i](https://github.com/rohit141914/LeetCode/tree/master/3600-find-the-k-th-character-in-string-game-i) |\n## Stack\n|  |\n| ------- |\n| [0143-reorder-list](https://github.com/rohit141914/LeetCode/tree/master/0143-reorder-list) |\n| [0145-binary-tree-postorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/rohit141914/LeetCode/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0155-min-stack](https://github.com/rohit141914/LeetCode/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/rohit141914/LeetCode/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/rohit141914/LeetCode/tree/master/0232-implement-queue-using-stacks) |\n| [0445-add-two-numbers-ii](https://github.com/rohit141914/LeetCode/tree/master/0445-add-two-numbers-ii) |\n| [0589-n-ary-tree-preorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0589-n-ary-tree-preorder-traversal) |\n| [0682-baseball-game](https://github.com/rohit141914/LeetCode/tree/master/0682-baseball-game) |\n| [0735-asteroid-collision](https://github.com/rohit141914/LeetCode/tree/master/0735-asteroid-collision) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/rohit141914/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1002-maximum-width-ramp](https://github.com/rohit141914/LeetCode/tree/master/1002-maximum-width-ramp) |\n| [1355-minimum-deletions-to-make-array-beautiful](https://github.com/rohit141914/LeetCode/tree/master/1355-minimum-deletions-to-make-array-beautiful) |\n| [1497-design-a-stack-with-increment-operation](https://github.com/rohit141914/LeetCode/tree/master/1497-design-a-stack-with-increment-operation) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/rohit141914/LeetCode/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/rohit141914/LeetCode/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2128-reverse-prefix-of-word](https://github.com/rohit141914/LeetCode/tree/master/2128-reverse-prefix-of-word) |\n| [2800-minimum-string-length-after-removing-substrings](https://github.com/rohit141914/LeetCode/tree/master/2800-minimum-string-length-after-removing-substrings) |\n| [3001-apply-operations-to-maximize-score](https://github.com/rohit141914/LeetCode/tree/master/3001-apply-operations-to-maximize-score) |\n| [3114-beautiful-towers-i](https://github.com/rohit141914/LeetCode/tree/master/3114-beautiful-towers-i) |\n| [3447-clear-digits](https://github.com/rohit141914/LeetCode/tree/master/3447-clear-digits) |\n## Tree\n|  |\n| ------- |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0110-balanced-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0110-balanced-binary-tree) |\n| [0113-path-sum-ii](https://github.com/rohit141914/LeetCode/tree/master/0113-path-sum-ii) |\n| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/rohit141914/LeetCode/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |\n| [0145-binary-tree-postorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0226-invert-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0226-invert-binary-tree) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/rohit141914/LeetCode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0257-binary-tree-paths](https://github.com/rohit141914/LeetCode/tree/master/0257-binary-tree-paths) |\n| [0404-sum-of-left-leaves](https://github.com/rohit141914/LeetCode/tree/master/0404-sum-of-left-leaves) |\n| [0429-n-ary-tree-level-order-traversal](https://github.com/rohit141914/LeetCode/tree/master/0429-n-ary-tree-level-order-traversal) |\n| [0515-find-largest-value-in-each-tree-row](https://github.com/rohit141914/LeetCode/tree/master/0515-find-largest-value-in-each-tree-row) |\n| [0543-diameter-of-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0543-diameter-of-binary-tree) |\n| [0589-n-ary-tree-preorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0589-n-ary-tree-preorder-traversal) |\n| [0623-add-one-row-to-tree](https://github.com/rohit141914/LeetCode/tree/master/0623-add-one-row-to-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0671-second-minimum-node-in-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0671-second-minimum-node-in-a-binary-tree) |\n| [0814-binary-tree-pruning](https://github.com/rohit141914/LeetCode/tree/master/0814-binary-tree-pruning) |\n| [0938-range-sum-of-bst](https://github.com/rohit141914/LeetCode/tree/master/0938-range-sum-of-bst) |\n| [0965-univalued-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0965-univalued-binary-tree) |\n| [1026-maximum-difference-between-node-and-ancestor](https://github.com/rohit141914/LeetCode/tree/master/1026-maximum-difference-between-node-and-ancestor) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1035-cousins-in-binary-tree) |\n| [1609-even-odd-tree](https://github.com/rohit141914/LeetCode/tree/master/1609-even-odd-tree) |\n| [2493-reverse-odd-levels-of-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/2493-reverse-odd-levels-of-binary-tree) |\n| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/rohit141914/LeetCode/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |\n| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/2646-kth-largest-sum-in-a-binary-tree) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/rohit141914/LeetCode/tree/master/2677-cousins-in-binary-tree-ii) |\n## Depth-First Search\n|  |\n| ------- |\n| [0110-balanced-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0110-balanced-binary-tree) |\n| [0113-path-sum-ii](https://github.com/rohit141914/LeetCode/tree/master/0113-path-sum-ii) |\n| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/rohit141914/LeetCode/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |\n| [0145-binary-tree-postorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0226-invert-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0226-invert-binary-tree) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/rohit141914/LeetCode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0257-binary-tree-paths](https://github.com/rohit141914/LeetCode/tree/master/0257-binary-tree-paths) |\n| [0404-sum-of-left-leaves](https://github.com/rohit141914/LeetCode/tree/master/0404-sum-of-left-leaves) |\n| [0515-find-largest-value-in-each-tree-row](https://github.com/rohit141914/LeetCode/tree/master/0515-find-largest-value-in-each-tree-row) |\n| [0543-diameter-of-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0543-diameter-of-binary-tree) |\n| [0589-n-ary-tree-preorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0589-n-ary-tree-preorder-traversal) |\n| [0623-add-one-row-to-tree](https://github.com/rohit141914/LeetCode/tree/master/0623-add-one-row-to-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0671-second-minimum-node-in-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0671-second-minimum-node-in-a-binary-tree) |\n| [0676-implement-magic-dictionary](https://github.com/rohit141914/LeetCode/tree/master/0676-implement-magic-dictionary) |\n| [0814-binary-tree-pruning](https://github.com/rohit141914/LeetCode/tree/master/0814-binary-tree-pruning) |\n| [0938-range-sum-of-bst](https://github.com/rohit141914/LeetCode/tree/master/0938-range-sum-of-bst) |\n| [0965-univalued-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0965-univalued-binary-tree) |\n| [1026-maximum-difference-between-node-and-ancestor](https://github.com/rohit141914/LeetCode/tree/master/1026-maximum-difference-between-node-and-ancestor) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1035-cousins-in-binary-tree) |\n| [2493-reverse-odd-levels-of-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/2493-reverse-odd-levels-of-binary-tree) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/rohit141914/LeetCode/tree/master/2677-cousins-in-binary-tree-ii) |\n| [2793-count-the-number-of-complete-components](https://github.com/rohit141914/LeetCode/tree/master/2793-count-the-number-of-complete-components) |\n## Binary Tree\n|  |\n| ------- |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0110-balanced-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0110-balanced-binary-tree) |\n| [0113-path-sum-ii](https://github.com/rohit141914/LeetCode/tree/master/0113-path-sum-ii) |\n| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/rohit141914/LeetCode/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |\n| [0145-binary-tree-postorder-traversal](https://github.com/rohit141914/LeetCode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0226-invert-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0226-invert-binary-tree) |\n| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/rohit141914/LeetCode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0257-binary-tree-paths](https://github.com/rohit141914/LeetCode/tree/master/0257-binary-tree-paths) |\n| [0404-sum-of-left-leaves](https://github.com/rohit141914/LeetCode/tree/master/0404-sum-of-left-leaves) |\n| [0515-find-largest-value-in-each-tree-row](https://github.com/rohit141914/LeetCode/tree/master/0515-find-largest-value-in-each-tree-row) |\n| [0543-diameter-of-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0543-diameter-of-binary-tree) |\n| [0623-add-one-row-to-tree](https://github.com/rohit141914/LeetCode/tree/master/0623-add-one-row-to-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0671-second-minimum-node-in-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0671-second-minimum-node-in-a-binary-tree) |\n| [0814-binary-tree-pruning](https://github.com/rohit141914/LeetCode/tree/master/0814-binary-tree-pruning) |\n| [0938-range-sum-of-bst](https://github.com/rohit141914/LeetCode/tree/master/0938-range-sum-of-bst) |\n| [0965-univalued-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/0965-univalued-binary-tree) |\n| [1026-maximum-difference-between-node-and-ancestor](https://github.com/rohit141914/LeetCode/tree/master/1026-maximum-difference-between-node-and-ancestor) |\n| [1029-vertical-order-traversal-of-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1029-vertical-order-traversal-of-a-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/1035-cousins-in-binary-tree) |\n| [1609-even-odd-tree](https://github.com/rohit141914/LeetCode/tree/master/1609-even-odd-tree) |\n| [2493-reverse-odd-levels-of-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/2493-reverse-odd-levels-of-binary-tree) |\n| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/rohit141914/LeetCode/tree/master/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level) |\n| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/rohit141914/LeetCode/tree/master/2646-kth-largest-sum-in-a-binary-tree) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/rohit141914/LeetCode/tree/master/2677-cousins-in-binary-tree-ii) |\n## Simulation\n|  |\n| ------- |\n| [0043-multiply-strings](https://github.com/rohit141914/LeetCode/tree/master/0043-multiply-strings) |\n| [0067-add-binary](https://github.com/rohit141914/LeetCode/tree/master/0067-add-binary) |\n| [0258-add-digits](https://github.com/rohit141914/LeetCode/tree/master/0258-add-digits) |\n| [0566-reshape-the-matrix](https://github.com/rohit141914/LeetCode/tree/master/0566-reshape-the-matrix) |\n| [0682-baseball-game](https://github.com/rohit141914/LeetCode/tree/master/0682-baseball-game) |\n| [0735-asteroid-collision](https://github.com/rohit141914/LeetCode/tree/master/0735-asteroid-collision) |\n| [1275-find-winner-on-a-tic-tac-toe-game](https://github.com/rohit141914/LeetCode/tree/master/1275-find-winner-on-a-tic-tac-toe-game) |\n| [1708-design-parking-system](https://github.com/rohit141914/LeetCode/tree/master/1708-design-parking-system) |\n| [2076-sum-of-digits-of-string-after-convert](https://github.com/rohit141914/LeetCode/tree/master/2076-sum-of-digits-of-string-after-convert) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/rohit141914/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2232-adding-spaces-to-a-string](https://github.com/rohit141914/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [2265-partition-array-according-to-given-pivot](https://github.com/rohit141914/LeetCode/tree/master/2265-partition-array-according-to-given-pivot) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/rohit141914/LeetCode/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2274-keep-multiplying-found-values-by-two](https://github.com/rohit141914/LeetCode/tree/master/2274-keep-multiplying-found-values-by-two) |\n| [2324-find-triangular-sum-of-an-array](https://github.com/rohit141914/LeetCode/tree/master/2324-find-triangular-sum-of-an-array) |\n| [2361-calculate-digit-sum-of-a-string](https://github.com/rohit141914/LeetCode/tree/master/2361-calculate-digit-sum-of-a-string) |\n| [2386-min-max-game](https://github.com/rohit141914/LeetCode/tree/master/2386-min-max-game) |\n| [2411-spiral-matrix-iv](https://github.com/rohit141914/LeetCode/tree/master/2411-spiral-matrix-iv) |\n| [2436-make-array-zero-by-subtracting-equal-amounts](https://github.com/rohit141914/LeetCode/tree/master/2436-make-array-zero-by-subtracting-equal-amounts) |\n| [2551-apply-operations-to-an-array](https://github.com/rohit141914/LeetCode/tree/master/2551-apply-operations-to-an-array) |\n| [2606-difference-between-ones-and-zeros-in-row-and-column](https://github.com/rohit141914/LeetCode/tree/master/2606-difference-between-ones-and-zeros-in-row-and-column) |\n| [2800-minimum-string-length-after-removing-substrings](https://github.com/rohit141914/LeetCode/tree/master/2800-minimum-string-length-after-removing-substrings) |\n| [3168-minimum-number-of-chairs-in-a-waiting-room](https://github.com/rohit141914/LeetCode/tree/master/3168-minimum-number-of-chairs-in-a-waiting-room) |\n| [3447-clear-digits](https://github.com/rohit141914/LeetCode/tree/master/3447-clear-digits) |\n| [3461-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/rohit141914/LeetCode/tree/master/3461-check-if-digits-are-equal-in-string-after-operations-i) |\n| [3600-find-the-k-th-character-in-string-game-i](https://github.com/rohit141914/LeetCode/tree/master/3600-find-the-k-th-character-in-string-game-i) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/rohit141914/LeetCode/tree/master/0002-add-two-numbers) |\n| [0023-merge-k-sorted-lists](https://github.com/rohit141914/LeetCode/tree/master/0023-merge-k-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/rohit141914/LeetCode/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/rohit141914/LeetCode/tree/master/0061-rotate-list) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/rohit141914/LeetCode/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0086-partition-list](https://github.com/rohit141914/LeetCode/tree/master/0086-partition-list) |\n| [0092-reverse-linked-list-ii](https://github.com/rohit141914/LeetCode/tree/master/0092-reverse-linked-list-ii) |\n| [0117-populating-next-right-pointers-in-each-node-ii](https://github.com/rohit141914/LeetCode/tree/master/0117-populating-next-right-pointers-in-each-node-ii) |\n| [0142-linked-list-cycle-ii](https://github.com/rohit141914/LeetCode/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/rohit141914/LeetCode/tree/master/0143-reorder-list) |\n| [0355-design-twitter](https://github.com/rohit141914/LeetCode/tree/master/0355-design-twitter) |\n| [0382-linked-list-random-node](https://github.com/rohit141914/LeetCode/tree/master/0382-linked-list-random-node) |\n| [0445-add-two-numbers-ii](https://github.com/rohit141914/LeetCode/tree/master/0445-add-two-numbers-ii) |\n| [0860-design-circular-queue](https://github.com/rohit141914/LeetCode/tree/master/0860-design-circular-queue) |\n| [1337-design-skiplist](https://github.com/rohit141914/LeetCode/tree/master/1337-design-skiplist) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/rohit141914/LeetCode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n| [2411-spiral-matrix-iv](https://github.com/rohit141914/LeetCode/tree/master/2411-spiral-matrix-iv) |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/rohit141914/LeetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/rohit141914/LeetCode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n## Number Theory\n|  |\n| ------- |\n| [0258-add-digits](https://github.com/rohit141914/LeetCode/tree/master/0258-add-digits) |\n| [2610-closest-prime-numbers-in-range](https://github.com/rohit141914/LeetCode/tree/master/2610-closest-prime-numbers-in-range) |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/rohit141914/LeetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frohit141914%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frohit141914%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frohit141914%2Fleetcode/lists"}