{"id":18792508,"url":"https://github.com/sahilsrivastava25/dsa","last_synced_at":"2026-04-28T23:33:57.226Z","repository":{"id":246080750,"uuid":"819770495","full_name":"sahilsrivastava25/DSA","owner":"sahilsrivastava25","description":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)","archived":false,"fork":false,"pushed_at":"2025-06-11T17:03:23.000Z","size":1083,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-11T18:15:14.496Z","etag":null,"topics":["cpp","java","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sahilsrivastava25.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2024-06-25T07:06:25.000Z","updated_at":"2025-06-11T17:03:27.000Z","dependencies_parsed_at":"2024-07-22T21:44:58.506Z","dependency_job_id":"4668aa22-298c-4e9c-bac0-3126220fef34","html_url":"https://github.com/sahilsrivastava25/DSA","commit_stats":null,"previous_names":["sahilsrivastava25/dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sahilsrivastava25/DSA","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilsrivastava25%2FDSA","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilsrivastava25%2FDSA/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilsrivastava25%2FDSA/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilsrivastava25%2FDSA/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sahilsrivastava25","download_url":"https://codeload.github.com/sahilsrivastava25/DSA/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sahilsrivastava25%2FDSA/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32404340,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-28T19:38:08.556Z","status":"ssl_error","status_checked_at":"2026-04-28T19:37:55.688Z","response_time":56,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp","java","leetcode-solutions"],"created_at":"2024-11-07T21:20:16.112Z","updated_at":"2026-04-28T23:33:57.216Z","avatar_url":"https://github.com/sahilsrivastava25.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA\nA collection 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| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n| [1528-kids-with-the-greatest-number-of-candies](https://github.com/sahilsrivastava25/DSA/tree/master/1528-kids-with-the-greatest-number-of-candies) |\n| [1580-shuffle-the-array](https://github.com/sahilsrivastava25/DSA/tree/master/1580-shuffle-the-array) |\n# Hash Table\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n# Math\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n# Binary Search\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n# Bit Manipulation\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n# Sorting\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n# Matrix\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |\n# Simulation\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0002-add-two-numbers) |\n| [0048-rotate-image](https://github.com/sahilsrivastava25/DSA/tree/master/0048-rotate-image) |\n| [0189-rotate-array](https://github.com/sahilsrivastava25/DSA/tree/master/0189-rotate-array) |\n| [0231-power-of-two](https://github.com/sahilsrivastava25/DSA/tree/master/0231-power-of-two) |\n| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |\n| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n| [0273-integer-to-english-words](https://github.com/sahilsrivastava25/DSA/tree/master/0273-integer-to-english-words) |\n| [0412-fizz-buzz](https://github.com/sahilsrivastava25/DSA/tree/master/0412-fizz-buzz) |\n| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |\n| [0564-find-the-closest-palindrome](https://github.com/sahilsrivastava25/DSA/tree/master/0564-find-the-closest-palindrome) |\n| [0592-fraction-addition-and-subtraction](https://github.com/sahilsrivastava25/DSA/tree/master/0592-fraction-addition-and-subtraction) |\n| [0650-2-keys-keyboard](https://github.com/sahilsrivastava25/DSA/tree/master/0650-2-keys-keyboard) |\n| [0670-maximum-swap](https://github.com/sahilsrivastava25/DSA/tree/master/0670-maximum-swap) |\n| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |\n| [1240-stone-game-ii](https://github.com/sahilsrivastava25/DSA/tree/master/1240-stone-game-ii) |\n| [1642-water-bottles](https://github.com/sahilsrivastava25/DSA/tree/master/1642-water-bottles) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [2155-find-missing-observations](https://github.com/sahilsrivastava25/DSA/tree/master/2155-find-missing-observations) |\n| [2571-find-the-pivot-integer](https://github.com/sahilsrivastava25/DSA/tree/master/2571-find-the-pivot-integer) |\n| [2610-closest-prime-numbers-in-range](https://github.com/sahilsrivastava25/DSA/tree/master/2610-closest-prime-numbers-in-range) |\n| [2645-pass-the-pillow](https://github.com/sahilsrivastava25/DSA/tree/master/2645-pass-the-pillow) |\n| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |\n| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0136-single-number](https://github.com/sahilsrivastava25/DSA/tree/master/0136-single-number) |\n| [0231-power-of-two](https://github.com/sahilsrivastava25/DSA/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n| [0476-number-complement](https://github.com/sahilsrivastava25/DSA/tree/master/0476-number-complement) |\n| [1435-xor-queries-of-a-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/1435-xor-queries-of-a-subarray) |\n| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/sahilsrivastava25/DSA/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1940-maximum-xor-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/1940-maximum-xor-for-each-query) |\n| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/sahilsrivastava25/DSA/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |\n| [2323-minimum-bit-flips-to-convert-number](https://github.com/sahilsrivastava25/DSA/tree/master/2323-minimum-bit-flips-to-convert-number) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/sahilsrivastava25/DSA/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n| [3291-find-if-array-can-be-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/3291-find-if-array-can-be-sorted) |\n| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |\n| [3394-minimum-array-end](https://github.com/sahilsrivastava25/DSA/tree/master/3394-minimum-array-end) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/sahilsrivastava25/DSA/tree/master/0025-reverse-nodes-in-k-group) |\n| [0206-reverse-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0206-reverse-linked-list) |\n| [0231-power-of-two](https://github.com/sahilsrivastava25/DSA/tree/master/0231-power-of-two) |\n| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |\n| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |\n| [0273-integer-to-english-words](https://github.com/sahilsrivastava25/DSA/tree/master/0273-integer-to-english-words) |\n| [1197-parsing-a-boolean-expression](https://github.com/sahilsrivastava25/DSA/tree/master/1197-parsing-a-boolean-expression) |\n| [1667-find-kth-bit-in-nth-binary-string](https://github.com/sahilsrivastava25/DSA/tree/master/1667-find-kth-bit-in-nth-binary-string) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [2573-remove-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2573-remove-nodes-from-linked-list) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0015-3sum](https://github.com/sahilsrivastava25/DSA/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/sahilsrivastava25/DSA/tree/master/0018-4sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0031-next-permutation](https://github.com/sahilsrivastava25/DSA/tree/master/0031-next-permutation) |\n| [0033-search-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/sahilsrivastava25/DSA/tree/master/0035-search-insert-position) |\n| [0040-combination-sum-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0040-combination-sum-ii) |\n| [0048-rotate-image](https://github.com/sahilsrivastava25/DSA/tree/master/0048-rotate-image) |\n| [0053-maximum-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/0053-maximum-subarray) |\n| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |\n| [0073-set-matrix-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/sahilsrivastava25/DSA/tree/master/0075-sort-colors) |\n| [0118-pascals-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/0118-pascals-triangle) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/sahilsrivastava25/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0128-longest-consecutive-sequence](https://github.com/sahilsrivastava25/DSA/tree/master/0128-longest-consecutive-sequence) |\n| [0136-single-number](https://github.com/sahilsrivastava25/DSA/tree/master/0136-single-number) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/sahilsrivastava25/DSA/tree/master/0162-find-peak-element) |\n| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |\n| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |\n| [0189-rotate-array](https://github.com/sahilsrivastava25/DSA/tree/master/0189-rotate-array) |\n| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |\n| [0238-product-of-array-except-self](https://github.com/sahilsrivastava25/DSA/tree/master/0238-product-of-array-except-self) |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n| [0283-move-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0283-move-zeroes) |\n| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0485-max-consecutive-ones](https://github.com/sahilsrivastava25/DSA/tree/master/0485-max-consecutive-ones) |\n| [0494-target-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0494-target-sum) |\n| [0496-next-greater-element-i](https://github.com/sahilsrivastava25/DSA/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0503-next-greater-element-ii) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |\n| [0540-single-element-in-a-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0540-single-element-in-a-sorted-array) |\n| [0560-subarray-sum-equals-k](https://github.com/sahilsrivastava25/DSA/tree/master/0560-subarray-sum-equals-k) |\n| [0624-maximum-distance-in-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0624-maximum-distance-in-arrays) |\n| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |\n| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |\n| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |\n| [0729-my-calendar-i](https://github.com/sahilsrivastava25/DSA/tree/master/0729-my-calendar-i) |\n| [0731-my-calendar-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0731-my-calendar-ii) |\n| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |\n| [0787-sliding-puzzle](https://github.com/sahilsrivastava25/DSA/tree/master/0787-sliding-puzzle) |\n| [0792-binary-search](https://github.com/sahilsrivastava25/DSA/tree/master/0792-binary-search) |\n| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |\n| [0859-design-circular-deque](https://github.com/sahilsrivastava25/DSA/tree/master/0859-design-circular-deque) |\n| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |\n| [0890-lemonade-change](https://github.com/sahilsrivastava25/DSA/tree/master/0890-lemonade-change) |\n| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |\n| [0906-walking-robot-simulation](https://github.com/sahilsrivastava25/DSA/tree/master/0906-walking-robot-simulation) |\n| [0921-spiral-matrix-iii](https://github.com/sahilsrivastava25/DSA/tree/master/0921-spiral-matrix-iii) |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n| [0966-binary-subarrays-with-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0966-binary-subarrays-with-sum) |\n| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |\n| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |\n| [1002-maximum-width-ramp](https://github.com/sahilsrivastava25/DSA/tree/master/1002-maximum-width-ramp) |\n| [1025-minimum-cost-for-tickets](https://github.com/sahilsrivastava25/DSA/tree/master/1025-minimum-cost-for-tickets) |\n| [1063-best-sightseeing-pair](https://github.com/sahilsrivastava25/DSA/tree/master/1063-best-sightseeing-pair) |\n| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/sahilsrivastava25/DSA/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |\n| [1196-filling-bookcase-shelves](https://github.com/sahilsrivastava25/DSA/tree/master/1196-filling-bookcase-shelves) |\n| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [1240-stone-game-ii](https://github.com/sahilsrivastava25/DSA/tree/master/1240-stone-game-ii) |\n| [1256-rank-transform-of-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1256-rank-transform-of-an-array) |\n| [1293-three-consecutive-odds](https://github.com/sahilsrivastava25/DSA/tree/master/1293-three-consecutive-odds) |\n| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |\n| [1333-sort-the-jumbled-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/1333-sort-the-jumbled-numbers) |\n| [1350-remove-sub-folders-from-the-filesystem](https://github.com/sahilsrivastava25/DSA/tree/master/1350-remove-sub-folders-from-the-filesystem) |\n| [1402-count-square-submatrices-with-all-ones](https://github.com/sahilsrivastava25/DSA/tree/master/1402-count-square-submatrices-with-all-ones) |\n| [1435-xor-queries-of-a-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/1435-xor-queries-of-a-subarray) |\n| [1496-lucky-numbers-in-a-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/1496-lucky-numbers-in-a-matrix) |\n| [1497-design-a-stack-with-increment-operation](https://github.com/sahilsrivastava25/DSA/tree/master/1497-design-a-stack-with-increment-operation) |\n| [1511-count-number-of-teams](https://github.com/sahilsrivastava25/DSA/tree/master/1511-count-number-of-teams) |\n| [1524-string-matching-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1524-string-matching-in-an-array) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/sahilsrivastava25/DSA/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [1582-design-browser-history](https://github.com/sahilsrivastava25/DSA/tree/master/1582-design-browser-history) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/sahilsrivastava25/DSA/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/sahilsrivastava25/DSA/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [1694-make-sum-divisible-by-p](https://github.com/sahilsrivastava25/DSA/tree/master/1694-make-sum-divisible-by-p) |\n| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |\n| [1720-crawler-log-folder](https://github.com/sahilsrivastava25/DSA/tree/master/1720-crawler-log-folder) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/1741-sort-array-by-increasing-frequency) |\n| [1755-defuse-the-bomb](https://github.com/sahilsrivastava25/DSA/tree/master/1755-defuse-the-bomb) |\n| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1803-average-waiting-time](https://github.com/sahilsrivastava25/DSA/tree/master/1803-average-waiting-time) |\n| [1878-check-if-array-is-sorted-and-rotated](https://github.com/sahilsrivastava25/DSA/tree/master/1878-check-if-array-is-sorted-and-rotated) |\n| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/sahilsrivastava25/DSA/tree/master/1886-minimum-limit-of-balls-in-a-bag) |\n| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/sahilsrivastava25/DSA/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |\n| [1917-maximum-average-pass-ratio](https://github.com/sahilsrivastava25/DSA/tree/master/1917-maximum-average-pass-ratio) |\n| [1923-sentence-similarity-iii](https://github.com/sahilsrivastava25/DSA/tree/master/1923-sentence-similarity-iii) |\n| [1940-maximum-xor-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/1940-maximum-xor-for-each-query) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [1972-rotating-the-box](https://github.com/sahilsrivastava25/DSA/tree/master/1972-rotating-the-box) |\n| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/sahilsrivastava25/DSA/tree/master/2006-find-the-student-that-will-replace-the-chalk) |\n| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/tree/master/2035-count-sub-islands) |\n| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/sahilsrivastava25/DSA/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |\n| [2067-maximum-number-of-points-with-cost](https://github.com/sahilsrivastava25/DSA/tree/master/2067-maximum-number-of-points-with-cost) |\n| [2089-maximum-matrix-sum](https://github.com/sahilsrivastava25/DSA/tree/master/2089-maximum-matrix-sum) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/sahilsrivastava25/DSA/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2155-find-missing-observations](https://github.com/sahilsrivastava25/DSA/tree/master/2155-find-missing-observations) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |\n| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/sahilsrivastava25/DSA/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |\n| [2179-most-beautiful-item-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/2179-most-beautiful-item-for-each-query) |\n| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/sahilsrivastava25/DSA/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |\n| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |\n| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/sahilsrivastava25/DSA/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |\n| [2343-count-unguarded-cells-in-the-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2343-count-unguarded-cells-in-the-grid) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |\n| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |\n| [2465-shifting-letters-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2465-shifting-letters-ii) |\n| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |\n| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |\n| [2494-sum-of-prefix-scores-of-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2494-sum-of-prefix-scores-of-strings) |\n| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/sahilsrivastava25/DSA/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |\n| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/sahilsrivastava25/DSA/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |\n| [2554-minimum-total-distance-traveled](https://github.com/sahilsrivastava25/DSA/tree/master/2554-minimum-total-distance-traveled) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |\n| [2616-maximal-score-after-applying-k-operations](https://github.com/sahilsrivastava25/DSA/tree/master/2616-maximal-score-after-applying-k-operations) |\n| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |\n| [2691-count-vowel-strings-in-ranges](https://github.com/sahilsrivastava25/DSA/tree/master/2691-count-vowel-strings-in-ranges) |\n| [2692-take-gifts-from-the-richest-pile](https://github.com/sahilsrivastava25/DSA/tree/master/2692-take-gifts-from-the-richest-pile) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |\n| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |\n| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |\n| [2727-number-of-senior-citizens](https://github.com/sahilsrivastava25/DSA/tree/master/2727-number-of-senior-citizens) |\n| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |\n| [2794-maximum-number-of-moves-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2794-maximum-number-of-moves-in-a-grid) |\n| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |\n| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |\n| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |\n| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |\n| [3242-count-elements-with-maximum-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/3242-count-elements-with-maximum-frequency) |\n| [3291-find-if-array-can-be-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/3291-find-if-array-can-be-sorted) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/sahilsrivastava25/DSA/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/sahilsrivastava25/DSA/tree/master/3329-find-the-length-of-the-longest-common-prefix) |\n| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |\n| [3427-special-array-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3427-special-array-ii) |\n| [3429-special-array-i](https://github.com/sahilsrivastava25/DSA/tree/master/3429-special-array-i) |\n| [3469-maximum-height-of-a-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/3469-maximum-height-of-a-triangle) |\n| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/sahilsrivastava25/DSA/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/sahilsrivastava25/DSA/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/sahilsrivastava25/DSA/tree/master/3517-shortest-distance-after-road-addition-queries-i) |\n| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/sahilsrivastava25/DSA/tree/master/3522-find-the-power-of-k-size-subarrays-i) |\n| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0053-maximum-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/0053-maximum-subarray) |\n| [0118-pascals-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/0118-pascals-triangle) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/sahilsrivastava25/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |\n| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |\n| [0494-target-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0494-target-sum) |\n| [0650-2-keys-keyboard](https://github.com/sahilsrivastava25/DSA/tree/master/0650-2-keys-keyboard) |\n| [0664-strange-printer](https://github.com/sahilsrivastava25/DSA/tree/master/0664-strange-printer) |\n| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |\n| [1025-minimum-cost-for-tickets](https://github.com/sahilsrivastava25/DSA/tree/master/1025-minimum-cost-for-tickets) |\n| [1063-best-sightseeing-pair](https://github.com/sahilsrivastava25/DSA/tree/master/1063-best-sightseeing-pair) |\n| [1196-filling-bookcase-shelves](https://github.com/sahilsrivastava25/DSA/tree/master/1196-filling-bookcase-shelves) |\n| [1240-stone-game-ii](https://github.com/sahilsrivastava25/DSA/tree/master/1240-stone-game-ii) |\n| [1402-count-square-submatrices-with-all-ones](https://github.com/sahilsrivastava25/DSA/tree/master/1402-count-square-submatrices-with-all-ones) |\n| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/sahilsrivastava25/DSA/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |\n| [1511-count-number-of-teams](https://github.com/sahilsrivastava25/DSA/tree/master/1511-count-number-of-teams) |\n| [1756-minimum-deletions-to-make-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/1756-minimum-deletions-to-make-string-balanced) |\n| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |\n| [2067-maximum-number-of-points-with-cost](https://github.com/sahilsrivastava25/DSA/tree/master/2067-maximum-number-of-points-with-cost) |\n| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |\n| [2554-minimum-total-distance-traveled](https://github.com/sahilsrivastava25/DSA/tree/master/2554-minimum-total-distance-traveled) |\n| [2562-count-ways-to-build-good-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2562-count-ways-to-build-good-strings) |\n| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |\n| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |\n| [2794-maximum-number-of-moves-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2794-maximum-number-of-moves-in-a-grid) |\n| [3490-find-the-maximum-length-of-valid-subsequence-i](https://github.com/sahilsrivastava25/DSA/tree/master/3490-find-the-maximum-length-of-valid-subsequence-i) |\n## Two Pointers\n|  |\n| ------- |\n| [0015-3sum](https://github.com/sahilsrivastava25/DSA/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/sahilsrivastava25/DSA/tree/master/0018-4sum) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/sahilsrivastava25/DSA/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0031-next-permutation](https://github.com/sahilsrivastava25/DSA/tree/master/0031-next-permutation) |\n| [0061-rotate-list](https://github.com/sahilsrivastava25/DSA/tree/master/0061-rotate-list) |\n| [0075-sort-colors](https://github.com/sahilsrivastava25/DSA/tree/master/0075-sort-colors) |\n| [0141-linked-list-cycle](https://github.com/sahilsrivastava25/DSA/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0142-linked-list-cycle-ii) |\n| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0160-intersection-of-two-linked-lists) |\n| [0189-rotate-array](https://github.com/sahilsrivastava25/DSA/tree/master/0189-rotate-array) |\n| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |\n| [0283-move-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0283-move-zeroes) |\n| [0344-reverse-string](https://github.com/sahilsrivastava25/DSA/tree/master/0344-reverse-string) |\n| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |\n| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |\n| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |\n| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |\n| [0908-middle-of-the-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0908-middle-of-the-linked-list) |\n| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |\n| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/sahilsrivastava25/DSA/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |\n| [1850-minimum-length-of-string-after-deleting-similar-ends](https://github.com/sahilsrivastava25/DSA/tree/master/1850-minimum-length-of-string-after-deleting-similar-ends) |\n| [1923-sentence-similarity-iii](https://github.com/sahilsrivastava25/DSA/tree/master/1923-sentence-similarity-iii) |\n| [1972-rotating-the-box](https://github.com/sahilsrivastava25/DSA/tree/master/1972-rotating-the-box) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/sahilsrivastava25/DSA/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |\n| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |\n| [3195-separate-black-and-white-balls](https://github.com/sahilsrivastava25/DSA/tree/master/3195-separate-black-and-white-balls) |\n## Simulation\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |\n| [0412-fizz-buzz](https://github.com/sahilsrivastava25/DSA/tree/master/0412-fizz-buzz) |\n| [0592-fraction-addition-and-subtraction](https://github.com/sahilsrivastava25/DSA/tree/master/0592-fraction-addition-and-subtraction) |\n| [0906-walking-robot-simulation](https://github.com/sahilsrivastava25/DSA/tree/master/0906-walking-robot-simulation) |\n| [0921-spiral-matrix-iii](https://github.com/sahilsrivastava25/DSA/tree/master/0921-spiral-matrix-iii) |\n| [1642-water-bottles](https://github.com/sahilsrivastava25/DSA/tree/master/1642-water-bottles) |\n| [1667-find-kth-bit-in-nth-binary-string](https://github.com/sahilsrivastava25/DSA/tree/master/1667-find-kth-bit-in-nth-binary-string) |\n| [1803-average-waiting-time](https://github.com/sahilsrivastava25/DSA/tree/master/1803-average-waiting-time) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/sahilsrivastava25/DSA/tree/master/2006-find-the-student-that-will-replace-the-chalk) |\n| [2076-sum-of-digits-of-string-after-convert](https://github.com/sahilsrivastava25/DSA/tree/master/2076-sum-of-digits-of-string-after-convert) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/sahilsrivastava25/DSA/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2155-find-missing-observations](https://github.com/sahilsrivastava25/DSA/tree/master/2155-find-missing-observations) |\n| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/sahilsrivastava25/DSA/tree/master/2271-rearrange-array-elements-by-sign) |\n| [2299-merge-nodes-in-between-zeros](https://github.com/sahilsrivastava25/DSA/tree/master/2299-merge-nodes-in-between-zeros) |\n| [2343-count-unguarded-cells-in-the-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2343-count-unguarded-cells-in-the-grid) |\n| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |\n| [2645-pass-the-pillow](https://github.com/sahilsrivastava25/DSA/tree/master/2645-pass-the-pillow) |\n| [2692-take-gifts-from-the-richest-pile](https://github.com/sahilsrivastava25/DSA/tree/master/2692-take-gifts-from-the-richest-pile) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n| [2800-minimum-string-length-after-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/2800-minimum-string-length-after-removing-substrings) |\n| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |\n| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0001-two-sum) |\n| [0073-set-matrix-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0073-set-matrix-zeroes) |\n| [0128-longest-consecutive-sequence](https://github.com/sahilsrivastava25/DSA/tree/master/0128-longest-consecutive-sequence) |\n| [0138-copy-list-with-random-pointer](https://github.com/sahilsrivastava25/DSA/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/sahilsrivastava25/DSA/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0160-intersection-of-two-linked-lists) |\n| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |\n| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0432-all-oone-data-structure](https://github.com/sahilsrivastava25/DSA/tree/master/0432-all-oone-data-structure) |\n| [0496-next-greater-element-i](https://github.com/sahilsrivastava25/DSA/tree/master/0496-next-greater-element-i) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0560-subarray-sum-equals-k](https://github.com/sahilsrivastava25/DSA/tree/master/0560-subarray-sum-equals-k) |\n| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |\n| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |\n| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |\n| [0807-custom-sort-string](https://github.com/sahilsrivastava25/DSA/tree/master/0807-custom-sort-string) |\n| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |\n| [0906-walking-robot-simulation](https://github.com/sahilsrivastava25/DSA/tree/master/0906-walking-robot-simulation) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/sahilsrivastava25/DSA/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0966-binary-subarrays-with-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0966-binary-subarrays-with-sum) |\n| [0984-most-stones-removed-with-same-row-or-column](https://github.com/sahilsrivastava25/DSA/tree/master/0984-most-stones-removed-with-same-row-or-column) |\n| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |\n| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/sahilsrivastava25/DSA/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |\n| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [1256-rank-transform-of-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1256-rank-transform-of-an-array) |\n| [1267-remove-zero-sum-consecutive-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/1267-remove-zero-sum-consecutive-nodes-from-linked-list) |\n| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/sahilsrivastava25/DSA/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/sahilsrivastava25/DSA/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1694-make-sum-divisible-by-p](https://github.com/sahilsrivastava25/DSA/tree/master/1694-make-sum-divisible-by-p) |\n| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/1741-sort-array-by-increasing-frequency) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1904-second-largest-digit-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/1904-second-largest-digit-in-a-string) |\n| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/sahilsrivastava25/DSA/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |\n| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |\n| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/sahilsrivastava25/DSA/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |\n| [2599-take-k-of-each-character-from-left-and-right](https://github.com/sahilsrivastava25/DSA/tree/master/2599-take-k-of-each-character-from-left-and-right) |\n| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |\n| [3242-count-elements-with-maximum-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/3242-count-elements-with-maximum-frequency) |\n| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |\n| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |\n| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/sahilsrivastava25/DSA/tree/master/3329-find-the-length-of-the-longest-common-prefix) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/sahilsrivastava25/DSA/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/sahilsrivastava25/DSA/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |\n| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/sahilsrivastava25/DSA/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0033-search-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/sahilsrivastava25/DSA/tree/master/0035-search-insert-position) |\n| [0074-search-a-2d-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0074-search-a-2d-matrix) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/sahilsrivastava25/DSA/tree/master/0162-find-peak-element) |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0540-single-element-in-a-sorted-array](https://github.com/sahilsrivastava25/DSA/tree/master/0540-single-element-in-a-sorted-array) |\n| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |\n| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |\n| [0729-my-calendar-i](https://github.com/sahilsrivastava25/DSA/tree/master/0729-my-calendar-i) |\n| [0731-my-calendar-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0731-my-calendar-ii) |\n| [0792-binary-search](https://github.com/sahilsrivastava25/DSA/tree/master/0792-binary-search) |\n| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |\n| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |\n| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |\n| [1886-minimum-limit-of-balls-in-a-bag](https://github.com/sahilsrivastava25/DSA/tree/master/1886-minimum-limit-of-balls-in-a-bag) |\n| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/sahilsrivastava25/DSA/tree/master/2006-find-the-student-that-will-replace-the-chalk) |\n| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |\n| [2179-most-beautiful-item-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/2179-most-beautiful-item-for-each-query) |\n| [2188-minimized-maximum-of-products-distributed-to-any-store](https://github.com/sahilsrivastava25/DSA/tree/master/2188-minimized-maximum-of-products-distributed-to-any-store) |\n| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |\n| [2634-minimum-common-value](https://github.com/sahilsrivastava25/DSA/tree/master/2634-minimum-common-value) |\n| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |\n| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |\n| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |\n| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |\n| [3427-special-array-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3427-special-array-ii) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/sahilsrivastava25/DSA/tree/master/0015-3sum) |\n| [0018-4sum](https://github.com/sahilsrivastava25/DSA/tree/master/0018-4sum) |\n| [0075-sort-colors](https://github.com/sahilsrivastava25/DSA/tree/master/0075-sort-colors) |\n| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |\n| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |\n| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |\n| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |\n| [0268-missing-number](https://github.com/sahilsrivastava25/DSA/tree/master/0268-missing-number) |\n| [0349-intersection-of-two-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0349-intersection-of-two-arrays) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |\n| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |\n| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |\n| [0719-find-k-th-smallest-pair-distance](https://github.com/sahilsrivastava25/DSA/tree/master/0719-find-k-th-smallest-pair-distance) |\n| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |\n| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |\n| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |\n| [0807-custom-sort-string](https://github.com/sahilsrivastava25/DSA/tree/master/0807-custom-sort-string) |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |\n| [1256-rank-transform-of-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1256-rank-transform-of-an-array) |\n| [1333-sort-the-jumbled-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/1333-sort-the-jumbled-numbers) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/sahilsrivastava25/DSA/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/1741-sort-array-by-increasing-frequency) |\n| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |\n| [2179-most-beautiful-item-for-each-query](https://github.com/sahilsrivastava25/DSA/tree/master/2179-most-beautiful-item-for-each-query) |\n| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |\n| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |\n| [2554-minimum-total-distance-traveled](https://github.com/sahilsrivastava25/DSA/tree/master/2554-minimum-total-distance-traveled) |\n| [2581-divide-players-into-teams-of-equal-skill](https://github.com/sahilsrivastava25/DSA/tree/master/2581-divide-players-into-teams-of-equal-skill) |\n| [2586-longest-square-streak-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2586-longest-square-streak-in-an-array) |\n| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/2646-kth-largest-sum-in-a-binary-tree) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n| [2699-count-the-number-of-fair-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2699-count-the-number-of-fair-pairs) |\n| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |\n| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |\n| [3291-find-if-array-can-be-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/3291-find-if-array-can-be-sorted) |\n## Greedy\n|  |\n| ------- |\n| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |\n| [0624-maximum-distance-in-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0624-maximum-distance-in-arrays) |\n| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |\n| [0670-maximum-swap](https://github.com/sahilsrivastava25/DSA/tree/master/0670-maximum-swap) |\n| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |\n| [0890-lemonade-change](https://github.com/sahilsrivastava25/DSA/tree/master/0890-lemonade-change) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/sahilsrivastava25/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [0985-bag-of-tokens](https://github.com/sahilsrivastava25/DSA/tree/master/0985-bag-of-tokens) |\n| [1304-longest-happy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1304-longest-happy-string) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/sahilsrivastava25/DSA/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |\n| [1766-minimum-number-of-removals-to-make-mountain-array](https://github.com/sahilsrivastava25/DSA/tree/master/1766-minimum-number-of-removals-to-make-mountain-array) |\n| [1818-maximum-score-from-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1818-maximum-score-from-removing-substrings) |\n| [1917-maximum-average-pass-ratio](https://github.com/sahilsrivastava25/DSA/tree/master/1917-maximum-average-pass-ratio) |\n| [2089-maximum-matrix-sum](https://github.com/sahilsrivastava25/DSA/tree/master/2089-maximum-matrix-sum) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |\n| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |\n| [2616-maximal-score-after-applying-k-operations](https://github.com/sahilsrivastava25/DSA/tree/master/2616-maximal-score-after-applying-k-operations) |\n| [2716-prime-subtraction-operation](https://github.com/sahilsrivastava25/DSA/tree/master/2716-prime-subtraction-operation) |\n| [3195-separate-black-and-white-balls](https://github.com/sahilsrivastava25/DSA/tree/master/3195-separate-black-and-white-balls) |\n| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/sahilsrivastava25/DSA/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0021-merge-two-sorted-lists) |\n| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/sahilsrivastava25/DSA/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/sahilsrivastava25/DSA/tree/master/0061-rotate-list) |\n| [0138-copy-list-with-random-pointer](https://github.com/sahilsrivastava25/DSA/tree/master/0138-copy-list-with-random-pointer) |\n| [0141-linked-list-cycle](https://github.com/sahilsrivastava25/DSA/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0142-linked-list-cycle-ii) |\n| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0160-intersection-of-two-linked-lists) |\n| [0206-reverse-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0237-delete-node-in-a-linked-list) |\n| [0328-odd-even-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0328-odd-even-linked-list) |\n| [0432-all-oone-data-structure](https://github.com/sahilsrivastava25/DSA/tree/master/0432-all-oone-data-structure) |\n| [0725-split-linked-list-in-parts](https://github.com/sahilsrivastava25/DSA/tree/master/0725-split-linked-list-in-parts) |\n| [0859-design-circular-deque](https://github.com/sahilsrivastava25/DSA/tree/master/0859-design-circular-deque) |\n| [0908-middle-of-the-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0908-middle-of-the-linked-list) |\n| [1267-remove-zero-sum-consecutive-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/1267-remove-zero-sum-consecutive-nodes-from-linked-list) |\n| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |\n| [1582-design-browser-history](https://github.com/sahilsrivastava25/DSA/tree/master/1582-design-browser-history) |\n| [2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points](https://github.com/sahilsrivastava25/DSA/tree/master/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2299-merge-nodes-in-between-zeros](https://github.com/sahilsrivastava25/DSA/tree/master/2299-merge-nodes-in-between-zeros) |\n| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |\n| [2573-remove-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2573-remove-nodes-from-linked-list) |\n| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/sahilsrivastava25/DSA/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n## Matrix\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/sahilsrivastava25/DSA/tree/master/0048-rotate-image) |\n| [0054-spiral-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0054-spiral-matrix) |\n| [0073-set-matrix-zeroes](https://github.com/sahilsrivastava25/DSA/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/0074-search-a-2d-matrix) |\n| [0787-sliding-puzzle](https://github.com/sahilsrivastava25/DSA/tree/master/0787-sliding-puzzle) |\n| [0870-magic-squares-in-grid](https://github.com/sahilsrivastava25/DSA/tree/master/0870-magic-squares-in-grid) |\n| [0921-spiral-matrix-iii](https://github.com/sahilsrivastava25/DSA/tree/master/0921-spiral-matrix-iii) |\n| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |\n| [1147-flip-columns-for-maximum-number-of-equal-rows](https://github.com/sahilsrivastava25/DSA/tree/master/1147-flip-columns-for-maximum-number-of-equal-rows) |\n| [1402-count-square-submatrices-with-all-ones](https://github.com/sahilsrivastava25/DSA/tree/master/1402-count-square-submatrices-with-all-ones) |\n| [1496-lucky-numbers-in-a-matrix](https://github.com/sahilsrivastava25/DSA/tree/master/1496-lucky-numbers-in-a-matrix) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [1711-find-valid-matrix-given-row-and-column-sums](https://github.com/sahilsrivastava25/DSA/tree/master/1711-find-valid-matrix-given-row-and-column-sums) |\n| [1972-rotating-the-box](https://github.com/sahilsrivastava25/DSA/tree/master/1972-rotating-the-box) |\n| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/tree/master/2035-count-sub-islands) |\n| [2089-maximum-matrix-sum](https://github.com/sahilsrivastava25/DSA/tree/master/2089-maximum-matrix-sum) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/sahilsrivastava25/DSA/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2343-count-unguarded-cells-in-the-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2343-count-unguarded-cells-in-the-grid) |\n| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |\n| [2411-spiral-matrix-iv](https://github.com/sahilsrivastava25/DSA/tree/master/2411-spiral-matrix-iv) |\n| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |\n| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |\n| [2794-maximum-number-of-moves-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2794-maximum-number-of-moves-in-a-grid) |\n## Enumeration\n|  |\n| ------- |\n| [2170-count-number-of-maximum-bitwise-or-subsets](https://github.com/sahilsrivastava25/DSA/tree/master/2170-count-number-of-maximum-bitwise-or-subsets) |\n| [3469-maximum-height-of-a-triangle](https://github.com/sahilsrivastava25/DSA/tree/master/3469-maximum-height-of-a-triangle) |\n| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |\n## Queue\n|  |\n| ------- |\n| [0225-implement-stack-using-queues](https://github.com/sahilsrivastava25/DSA/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/sahilsrivastava25/DSA/tree/master/0232-implement-queue-using-stacks) |\n| [0859-design-circular-deque](https://github.com/sahilsrivastava25/DSA/tree/master/0859-design-circular-deque) |\n| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/sahilsrivastava25/DSA/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |\n## String\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0020-valid-parentheses) |\n| [0179-largest-number](https://github.com/sahilsrivastava25/DSA/tree/master/0179-largest-number) |\n| [0214-shortest-palindrome](https://github.com/sahilsrivastava25/DSA/tree/master/0214-shortest-palindrome) |\n| [0241-different-ways-to-add-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0241-different-ways-to-add-parentheses) |\n| [0273-integer-to-english-words](https://github.com/sahilsrivastava25/DSA/tree/master/0273-integer-to-english-words) |\n| [0344-reverse-string](https://github.com/sahilsrivastava25/DSA/tree/master/0344-reverse-string) |\n| [0412-fizz-buzz](https://github.com/sahilsrivastava25/DSA/tree/master/0412-fizz-buzz) |\n| [0539-minimum-time-difference](https://github.com/sahilsrivastava25/DSA/tree/master/0539-minimum-time-difference) |\n| [0564-find-the-closest-palindrome](https://github.com/sahilsrivastava25/DSA/tree/master/0564-find-the-closest-palindrome) |\n| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |\n| [0592-fraction-addition-and-subtraction](https://github.com/sahilsrivastava25/DSA/tree/master/0592-fraction-addition-and-subtraction) |\n| [0664-strange-printer](https://github.com/sahilsrivastava25/DSA/tree/master/0664-strange-printer) |\n| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |\n| [0807-custom-sort-string](https://github.com/sahilsrivastava25/DSA/tree/master/0807-custom-sort-string) |\n| [0812-rotate-string](https://github.com/sahilsrivastava25/DSA/tree/master/0812-rotate-string) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/sahilsrivastava25/DSA/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/sahilsrivastava25/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1197-parsing-a-boolean-expression](https://github.com/sahilsrivastava25/DSA/tree/master/1197-parsing-a-boolean-expression) |\n| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |\n| [1302-delete-characters-to-make-fancy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1302-delete-characters-to-make-fancy-string) |\n| [1304-longest-happy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1304-longest-happy-string) |\n| [1350-remove-sub-folders-from-the-filesystem](https://github.com/sahilsrivastava25/DSA/tree/master/1350-remove-sub-folders-from-the-filesystem) |\n| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/sahilsrivastava25/DSA/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |\n| [1524-string-matching-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/1524-string-matching-in-an-array) |\n| [1537-maximum-score-after-splitting-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/1537-maximum-score-after-splitting-a-string) |\n| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/sahilsrivastava25/DSA/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |\n| [1667-find-kth-bit-in-nth-binary-string](https://github.com/sahilsrivastava25/DSA/tree/master/1667-find-kth-bit-in-nth-binary-string) |\n| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |\n| [1720-crawler-log-folder](https://github.com/sahilsrivastava25/DSA/tree/master/1720-crawler-log-folder) |\n| [1756-minimum-deletions-to-make-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/1756-minimum-deletions-to-make-string-balanced) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1818-maximum-score-from-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1818-maximum-score-from-removing-substrings) |\n| [1850-minimum-length-of-string-after-deleting-similar-ends](https://github.com/sahilsrivastava25/DSA/tree/master/1850-minimum-length-of-string-after-deleting-similar-ends) |\n| [1895-minimum-number-of-operations-to-move-all-balls-to-each-box](https://github.com/sahilsrivastava25/DSA/tree/master/1895-minimum-number-of-operations-to-move-all-balls-to-each-box) |\n| [1904-second-largest-digit-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/1904-second-largest-digit-in-a-string) |\n| [1923-sentence-similarity-iii](https://github.com/sahilsrivastava25/DSA/tree/master/1923-sentence-similarity-iii) |\n| [2076-sum-of-digits-of-string-after-convert](https://github.com/sahilsrivastava25/DSA/tree/master/2076-sum-of-digits-of-string-after-convert) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n| [2232-adding-spaces-to-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2232-adding-spaces-to-a-string) |\n| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |\n| [2465-shifting-letters-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2465-shifting-letters-ii) |\n| [2494-sum-of-prefix-scores-of-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2494-sum-of-prefix-scores-of-strings) |\n| [2502-sort-the-people](https://github.com/sahilsrivastava25/DSA/tree/master/2502-sort-the-people) |\n| [2580-circular-sentence](https://github.com/sahilsrivastava25/DSA/tree/master/2580-circular-sentence) |\n| [2599-take-k-of-each-character-from-left-and-right](https://github.com/sahilsrivastava25/DSA/tree/master/2599-take-k-of-each-character-from-left-and-right) |\n| [2691-count-vowel-strings-in-ranges](https://github.com/sahilsrivastava25/DSA/tree/master/2691-count-vowel-strings-in-ranges) |\n| [2727-number-of-senior-citizens](https://github.com/sahilsrivastava25/DSA/tree/master/2727-number-of-senior-citizens) |\n| [2755-extra-characters-in-a-string](https://github.com/sahilsrivastava25/DSA/tree/master/2755-extra-characters-in-a-string) |\n| [2800-minimum-string-length-after-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/2800-minimum-string-length-after-removing-substrings) |\n| [3174-minimum-number-of-changes-to-make-binary-string-beautiful](https://github.com/sahilsrivastava25/DSA/tree/master/3174-minimum-number-of-changes-to-make-binary-string-beautiful) |\n| [3195-separate-black-and-white-balls](https://github.com/sahilsrivastava25/DSA/tree/master/3195-separate-black-and-white-balls) |\n| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |\n| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |\n| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |\n| [3309-count-prefix-and-suffix-pairs-i](https://github.com/sahilsrivastava25/DSA/tree/master/3309-count-prefix-and-suffix-pairs-i) |\n| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/sahilsrivastava25/DSA/tree/master/3329-find-the-length-of-the-longest-common-prefix) |\n| [3451-string-compression-iii](https://github.com/sahilsrivastava25/DSA/tree/master/3451-string-compression-iii) |\n| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |\n| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/sahilsrivastava25/DSA/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |\n| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/0020-valid-parentheses) |\n| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0155-min-stack](https://github.com/sahilsrivastava25/DSA/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/sahilsrivastava25/DSA/tree/master/0225-implement-stack-using-queues) |\n| [0232-implement-queue-using-stacks](https://github.com/sahilsrivastava25/DSA/tree/master/0232-implement-queue-using-stacks) |\n| [0234-palindrome-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/0234-palindrome-linked-list) |\n| [0496-next-greater-element-i](https://github.com/sahilsrivastava25/DSA/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0503-next-greater-element-ii) |\n| [0726-number-of-atoms](https://github.com/sahilsrivastava25/DSA/tree/master/0726-number-of-atoms) |\n| [0776-n-ary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0776-n-ary-tree-postorder-traversal) |\n| [0780-max-chunks-to-make-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/0780-max-chunks-to-make-sorted) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/sahilsrivastava25/DSA/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1002-maximum-width-ramp](https://github.com/sahilsrivastava25/DSA/tree/master/1002-maximum-width-ramp) |\n| [1197-parsing-a-boolean-expression](https://github.com/sahilsrivastava25/DSA/tree/master/1197-parsing-a-boolean-expression) |\n| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/sahilsrivastava25/DSA/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |\n| [1497-design-a-stack-with-increment-operation](https://github.com/sahilsrivastava25/DSA/tree/master/1497-design-a-stack-with-increment-operation) |\n| [1570-final-prices-with-a-special-discount-in-a-shop](https://github.com/sahilsrivastava25/DSA/tree/master/1570-final-prices-with-a-special-discount-in-a-shop) |\n| [1582-design-browser-history](https://github.com/sahilsrivastava25/DSA/tree/master/1582-design-browser-history) |\n| [1679-shortest-subarray-to-be-removed-to-make-array-sorted](https://github.com/sahilsrivastava25/DSA/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted) |\n| [1720-crawler-log-folder](https://github.com/sahilsrivastava25/DSA/tree/master/1720-crawler-log-folder) |\n| [1756-minimum-deletions-to-make-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/1756-minimum-deletions-to-make-string-balanced) |\n| [1818-maximum-score-from-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/1818-maximum-score-from-removing-substrings) |\n| [2095-minimum-number-of-swaps-to-make-the-string-balanced](https://github.com/sahilsrivastava25/DSA/tree/master/2095-minimum-number-of-swaps-to-make-the-string-balanced) |\n| [2573-remove-nodes-from-linked-list](https://github.com/sahilsrivastava25/DSA/tree/master/2573-remove-nodes-from-linked-list) |\n| [2800-minimum-string-length-after-removing-substrings](https://github.com/sahilsrivastava25/DSA/tree/master/2800-minimum-string-length-after-removing-substrings) |\n| [2846-robot-collisions](https://github.com/sahilsrivastava25/DSA/tree/master/2846-robot-collisions) |\n| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |\n## Sliding Window\n|  |\n| ------- |\n| [0567-permutation-in-string](https://github.com/sahilsrivastava25/DSA/tree/master/0567-permutation-in-string) |\n| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |\n| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |\n| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |\n| [0966-binary-subarrays-with-sum](https://github.com/sahilsrivastava25/DSA/tree/master/0966-binary-subarrays-with-sum) |\n| [1755-defuse-the-bomb](https://github.com/sahilsrivastava25/DSA/tree/master/1755-defuse-the-bomb) |\n| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |\n| [2552-maximum-sum-of-distinct-subarrays-with-length-k](https://github.com/sahilsrivastava25/DSA/tree/master/2552-maximum-sum-of-distinct-subarrays-with-length-k) |\n| [2599-take-k-of-each-character-from-left-and-right](https://github.com/sahilsrivastava25/DSA/tree/master/2599-take-k-of-each-character-from-left-and-right) |\n| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |\n| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |\n| [3380-shortest-subarray-with-or-at-least-k-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3380-shortest-subarray-with-or-at-least-k-ii) |\n| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/sahilsrivastava25/DSA/tree/master/3522-find-the-power-of-k-size-subarrays-i) |\n| [3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii) |\n| [3761-maximum-difference-between-even-and-odd-frequency-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3761-maximum-difference-between-even-and-odd-frequency-ii) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |\n| [0264-ugly-number-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0264-ugly-number-ii) |\n| [0632-smallest-range-covering-elements-from-k-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0632-smallest-range-covering-elements-from-k-lists) |\n| [0658-find-k-closest-elements](https://github.com/sahilsrivastava25/DSA/tree/master/0658-find-k-closest-elements) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/sahilsrivastava25/DSA/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0802-k-th-smallest-prime-fraction](https://github.com/sahilsrivastava25/DSA/tree/master/0802-k-th-smallest-prime-fraction) |\n| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/sahilsrivastava25/DSA/tree/master/0892-shortest-subarray-with-sum-at-least-k) |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n| [1304-longest-happy-string](https://github.com/sahilsrivastava25/DSA/tree/master/1304-longest-happy-string) |\n| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |\n| [1917-maximum-average-pass-ratio](https://github.com/sahilsrivastava25/DSA/tree/master/1917-maximum-average-pass-ratio) |\n| [2054-the-number-of-the-smallest-unoccupied-chair](https://github.com/sahilsrivastava25/DSA/tree/master/2054-the-number-of-the-smallest-unoccupied-chair) |\n| [2164-two-best-non-overlapping-events](https://github.com/sahilsrivastava25/DSA/tree/master/2164-two-best-non-overlapping-events) |\n| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |\n| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |\n| [2488-divide-intervals-into-minimum-number-of-groups](https://github.com/sahilsrivastava25/DSA/tree/master/2488-divide-intervals-into-minimum-number-of-groups) |\n| [2616-maximal-score-after-applying-k-operations](https://github.com/sahilsrivastava25/DSA/tree/master/2616-maximal-score-after-applying-k-operations) |\n| [2692-take-gifts-from-the-richest-pile](https://github.com/sahilsrivastava25/DSA/tree/master/2692-take-gifts-from-the-richest-pile) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/sahilsrivastava25/DSA/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |\n| [2803-modify-graph-edge-weights](https://github.com/sahilsrivastava25/DSA/tree/master/2803-modify-graph-edge-weights) |\n| [2868-continuous-subarrays](https://github.com/sahilsrivastava25/DSA/tree/master/2868-continuous-subarrays) |\n| [3181-find-building-where-alice-and-bob-can-meet](https://github.com/sahilsrivastava25/DSA/tree/master/3181-find-building-where-alice-and-bob-can-meet) |\n| [3555-final-array-state-after-k-multiplication-operations-i](https://github.com/sahilsrivastava25/DSA/tree/master/3555-final-array-state-after-k-multiplication-operations-i) |\n## Tree\n|  |\n| ------- |\n| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0776-n-ary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0776-n-ary-tree-postorder-traversal) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/sahilsrivastava25/DSA/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |\n| [0988-flip-equivalent-binary-trees](https://github.com/sahilsrivastava25/DSA/tree/master/0988-flip-equivalent-binary-trees) |\n| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |\n| [1653-number-of-good-leaf-nodes-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/1653-number-of-good-leaf-nodes-pairs) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |\n| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |\n| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/sahilsrivastava25/DSA/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/sahilsrivastava25/DSA/tree/master/2646-kth-largest-sum-in-a-binary-tree) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |\n| [3058-maximum-number-of-k-divisible-components](https://github.com/sahilsrivastava25/DSA/tree/master/3058-maximum-number-of-k-divisible-components) |\n## Binary Tree\n|  |\n| ------- |\n| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0789-kth-largest-element-in-a-stream](https://github.com/sahilsrivastava25/DSA/tree/master/0789-kth-largest-element-in-a-stream) |\n| [0988-flip-equivalent-binary-trees](https://github.com/sahilsrivastava25/DSA/tree/master/0988-flip-equivalent-binary-trees) |\n| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |\n| [1653-number-of-good-leaf-nodes-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/1653-number-of-good-leaf-nodes-pairs) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n| [2306-create-binary-tree-from-descriptions](https://github.com/sahilsrivastava25/DSA/tree/master/2306-create-binary-tree-from-descriptions) |\n| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |\n| [2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level](https://github.com/sahilsrivastava25/DSA/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/sahilsrivastava25/DSA/tree/master/2646-kth-largest-sum-in-a-binary-tree) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |\n## Depth-First Search\n|  |\n| ------- |\n| [0145-binary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0386-lexicographical-numbers](https://github.com/sahilsrivastava25/DSA/tree/master/0386-lexicographical-numbers) |\n| [0776-n-ary-tree-postorder-traversal](https://github.com/sahilsrivastava25/DSA/tree/master/0776-n-ary-tree-postorder-traversal) |\n| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |\n| [0984-most-stones-removed-with-same-row-or-column](https://github.com/sahilsrivastava25/DSA/tree/master/0984-most-stones-removed-with-same-row-or-column) |\n| [0988-flip-equivalent-binary-trees](https://github.com/sahilsrivastava25/DSA/tree/master/0988-flip-equivalent-binary-trees) |\n| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |\n| [1207-delete-nodes-and-return-forest](https://github.com/sahilsrivastava25/DSA/tree/master/1207-delete-nodes-and-return-forest) |\n| [1350-remove-sub-folders-from-the-filesystem](https://github.com/sahilsrivastava25/DSA/tree/master/1350-remove-sub-folders-from-the-filesystem) |\n| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |\n| [1653-number-of-good-leaf-nodes-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/1653-number-of-good-leaf-nodes-pairs) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/tree/master/2035-count-sub-islands) |\n| [2201-valid-arrangement-of-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2201-valid-arrangement-of-pairs) |\n| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/sahilsrivastava25/DSA/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |\n| [2545-height-of-binary-tree-after-subtree-removal-queries](https://github.com/sahilsrivastava25/DSA/tree/master/2545-height-of-binary-tree-after-subtree-removal-queries) |\n| [2677-cousins-in-binary-tree-ii](https://github.com/sahilsrivastava25/DSA/tree/master/2677-cousins-in-binary-tree-ii) |\n| [3058-maximum-number-of-k-divisible-components](https://github.com/sahilsrivastava25/DSA/tree/master/3058-maximum-number-of-k-divisible-components) |\n## Graph\n|  |\n| ------- |\n| [0863-sum-of-distances-in-tree](https://github.com/sahilsrivastava25/DSA/tree/master/0863-sum-of-distances-in-tree) |\n| [0984-most-stones-removed-with-same-row-or-column](https://github.com/sahilsrivastava25/DSA/tree/master/0984-most-stones-removed-with-same-row-or-column) |\n| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |\n| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/sahilsrivastava25/DSA/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |\n| [2171-second-minimum-time-to-reach-destination](https://github.com/sahilsrivastava25/DSA/tree/master/2171-second-minimum-time-to-reach-destination) |\n| [2201-valid-arrangement-of-pairs](https://github.com/sahilsrivastava25/DSA/tree/master/2201-valid-arrangement-of-pairs) |\n| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |\n| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |\n| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |\n| [2803-modify-graph-edge-weights](https://github.com/sahilsrivastava25/DSA/tree/master/2803-modify-graph-edge-weights) |\n| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |\n| [3517-shortest-distance-after-road-addition-queries-i](https://github.com/sahilsrivastava25/DSA/tree/master/3517-shortest-distance-after-road-addition-queries-i) |\n## Topological Sort\n|  |\n| ------- |\n| [2472-build-a-matrix-with-conditions](https://github.com/sahilsrivastava25/DSA/tree/master/2472-build-a-matrix-with-conditions) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/sahilsrivastava25/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |\n| [0053-maximum-subarray](https://github.com/sahilsrivastava25/DSA/tree/master/0053-maximum-subarray) |\n| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |\n| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n## Merge Sort\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/sahilsrivastava25/DSA/tree/master/0023-merge-k-sorted-lists) |\n| [0148-sort-list](https://github.com/sahilsrivastava25/DSA/tree/master/0148-sort-list) |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n## Bucket Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n## Radix Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n## Counting Sort\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/sahilsrivastava25/DSA/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/sahilsrivastava25/DSA/tree/master/0229-majority-element-ii) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/sahilsrivastava25/DSA/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0948-sort-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/0948-sort-an-array) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/sahilsrivastava25/DSA/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/sahilsrivastava25/DSA/tree/master/1786-count-the-number-of-consistent-strings) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/sahilsrivastava25/DSA/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2300-construct-string-with-repeat-limit](https://github.com/sahilsrivastava25/DSA/tree/master/2300-construct-string-with-repeat-limit) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/sahilsrivastava25/DSA/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2494-sum-of-prefix-scores-of-strings](https://github.com/sahilsrivastava25/DSA/tree/master/2494-sum-of-prefix-scores-of-strings) |\n| [3242-count-elements-with-maximum-frequency](https://github.com/sahilsrivastava25/DSA/tree/master/3242-count-elements-with-maximum-frequency) |\n| [3267-find-longest-special-substring-that-occurs-thrice-i](https://github.com/sahilsrivastava25/DSA/tree/master/3267-find-longest-special-substring-that-occurs-thrice-i) |\n| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/sahilsrivastava25/DSA/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |\n| [3753-maximum-difference-between-even-and-odd-frequency-i](https://github.com/sahilsrivastava25/DSA/tree/master/3753-maximum-difference-between-even-and-odd-frequency-i) |\n## Shortest Path\n|  |\n| ------- |\n| [1325-path-with-maximum-probability](https://github.com/sahilsrivastava25/DSA/tree/master/1325-path-with-maximum-probability) |\n| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/sahilsrivastava25/DSA/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |\n| [2171-second-minimum-time-to-reach-destination](https://github.com/sahilsrivastava25/DSA/tree/master/2171-second-minimum-time-to-reach-destination) |\n| [2375-minimum-obstacle-removal-to-reach-corner](https://github.com/sahilsrivastava25/DSA/tree/master/2375-minimum-obstacle-removal-to-reach-corner) |\n| [2711-minimum-time-to-visit-a-cell-in-a-grid](https://github.com/sahilsrivastava25/DSA/tree/master/2711-minimum-time-to-visit-a-cell-in-a-grid) |\n| [2803-modify-graph-edge-weights](https://github.com/sahilsrivastava25/DSA/tree/master/2803-modify-graph-edge-weights) |\n| [3235-minimum-cost-to-convert-string-i](https://github.com/sahilsrivastava25/DSA/tree/master/3235-minimum-cost-to-convert-string-i) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0787-sliding-puzzle](https://github.com/sahilsrivastava25/DSA/tree/master/0787-sliding-puzzle) |\n| [0999-regions-cut-by-slashes](https://github.com/sahilsrivastava25/DSA/tree/master/0999-regions-cut-by-slashes) |\n| [1484-linked-list-in-binary-tree](https://github.com/sahilsrivastava25/DSA/tree/master/1484-linked-list-in-binary-tree) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/sahilsrivastava25/DSA/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [2035-count-sub-islands](https://github.com/sahilsrivastava25/DSA/t","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilsrivastava25%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsahilsrivastava25%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsahilsrivastava25%2Fdsa/lists"}