{"id":24216495,"url":"https://github.com/anshulkansal121/leetcode","last_synced_at":"2025-09-12T07:42:14.444Z","repository":{"id":252019507,"uuid":"839147798","full_name":"anshulkansal121/LeetCode","owner":"anshulkansal121","description":null,"archived":false,"fork":false,"pushed_at":"2025-02-05T11:37:56.000Z","size":344,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-03T18:48:21.393Z","etag":null,"topics":["cpp","dsa","leetcode-cpp","leetcode-solutions","potd-leetcode"],"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/anshulkansal121.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}},"created_at":"2024-08-07T04:16:20.000Z","updated_at":"2025-02-05T11:37:59.000Z","dependencies_parsed_at":"2024-08-07T07:58:25.851Z","dependency_job_id":"248c044b-0d8f-4722-ac59-a2329d6485b8","html_url":"https://github.com/anshulkansal121/LeetCode","commit_stats":null,"previous_names":["anshulkansal121/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/anshulkansal121/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anshulkansal121%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anshulkansal121%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anshulkansal121%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anshulkansal121%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anshulkansal121","download_url":"https://codeload.github.com/anshulkansal121/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anshulkansal121%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274777673,"owners_count":25347648,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-12T02:00:09.324Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp","dsa","leetcode-cpp","leetcode-solutions","potd-leetcode"],"created_at":"2025-01-14T04:15:34.819Z","updated_at":"2025-09-12T07:42:14.420Z","avatar_url":"https://github.com/anshulkansal121.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0018-4sum](https://github.com/anshulkansal121/LeetCode/tree/master/0018-4sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0033-search-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/anshulkansal121/LeetCode/tree/master/0035-search-insert-position) |\n| [0039-combination-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0040-combination-sum-ii) |\n| [0046-permutations](https://github.com/anshulkansal121/LeetCode/tree/master/0046-permutations) |\n| [0047-permutations-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0047-permutations-ii) |\n| [0048-rotate-image](https://github.com/anshulkansal121/LeetCode/tree/master/0048-rotate-image) |\n| [0051-n-queens](https://github.com/anshulkansal121/LeetCode/tree/master/0051-n-queens) |\n| [0054-spiral-matrix](https://github.com/anshulkansal121/LeetCode/tree/master/0054-spiral-matrix) |\n| [0078-subsets](https://github.com/anshulkansal121/LeetCode/tree/master/0078-subsets) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0090-subsets-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0090-subsets-ii) |\n| [0128-longest-consecutive-sequence](https://github.com/anshulkansal121/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/anshulkansal121/LeetCode/tree/master/0162-find-peak-element) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anshulkansal121/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0189-rotate-array](https://github.com/anshulkansal121/LeetCode/tree/master/0189-rotate-array) |\n| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |\n| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0216-combination-sum-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0216-combination-sum-iii) |\n| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |\n| [0485-max-consecutive-ones](https://github.com/anshulkansal121/LeetCode/tree/master/0485-max-consecutive-ones) |\n| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0503-next-greater-element-ii) |\n| [0540-single-element-in-a-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |\n| [0560-subarray-sum-equals-k](https://github.com/anshulkansal121/LeetCode/tree/master/0560-subarray-sum-equals-k) |\n| [0624-maximum-distance-in-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/0624-maximum-distance-in-arrays) |\n| [0643-maximum-average-subarray-i](https://github.com/anshulkansal121/LeetCode/tree/master/0643-maximum-average-subarray-i) |\n| [0724-find-pivot-index](https://github.com/anshulkansal121/LeetCode/tree/master/0724-find-pivot-index) |\n| [0735-asteroid-collision](https://github.com/anshulkansal121/LeetCode/tree/master/0735-asteroid-collision) |\n| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |\n| [0890-lemonade-change](https://github.com/anshulkansal121/LeetCode/tree/master/0890-lemonade-change) |\n| [0921-spiral-matrix-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0921-spiral-matrix-iii) |\n| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |\n| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [1002-maximum-width-ramp](https://github.com/anshulkansal121/LeetCode/tree/master/1002-maximum-width-ramp) |\n| [1063-best-sightseeing-pair](https://github.com/anshulkansal121/LeetCode/tree/master/1063-best-sightseeing-pair) |\n| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/1392-find-the-difference-of-two-arrays) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/anshulkansal121/LeetCode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/anshulkansal121/LeetCode/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [1694-make-sum-divisible-by-p](https://github.com/anshulkansal121/LeetCode/tree/master/1694-make-sum-divisible-by-p) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |\n| [1833-find-the-highest-altitude](https://github.com/anshulkansal121/LeetCode/tree/master/1833-find-the-highest-altitude) |\n| [1878-check-if-array-is-sorted-and-rotated](https://github.com/anshulkansal121/LeetCode/tree/master/1878-check-if-array-is-sorted-and-rotated) |\n| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |\n| [2067-maximum-number-of-points-with-cost](https://github.com/anshulkansal121/LeetCode/tree/master/2067-maximum-number-of-points-with-cost) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/anshulkansal121/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2227-sum-of-subarray-ranges](https://github.com/anshulkansal121/LeetCode/tree/master/2227-sum-of-subarray-ranges) |\n| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |\n| [2616-maximal-score-after-applying-k-operations](https://github.com/anshulkansal121/LeetCode/tree/master/2616-maximal-score-after-applying-k-operations) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |\n| [3427-special-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/3427-special-array-ii) |\n| [3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i](https://github.com/anshulkansal121/LeetCode/tree/master/3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i) |\n## Matrix\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/anshulkansal121/LeetCode/tree/master/0048-rotate-image) |\n| [0054-spiral-matrix](https://github.com/anshulkansal121/LeetCode/tree/master/0054-spiral-matrix) |\n| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |\n| [0921-spiral-matrix-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0921-spiral-matrix-iii) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/anshulkansal121/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |\n| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |\n| [3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i](https://github.com/anshulkansal121/LeetCode/tree/master/3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i) |\n## Simulation\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/anshulkansal121/LeetCode/tree/master/0054-spiral-matrix) |\n| [0735-asteroid-collision](https://github.com/anshulkansal121/LeetCode/tree/master/0735-asteroid-collision) |\n| [0921-spiral-matrix-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0921-spiral-matrix-iii) |\n| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |\n| [2132-convert-1d-array-into-2d-array](https://github.com/anshulkansal121/LeetCode/tree/master/2132-convert-1d-array-into-2d-array) |\n| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n## Math\n|  |\n| ------- |\n| [0029-divide-two-integers](https://github.com/anshulkansal121/LeetCode/tree/master/0029-divide-two-integers) |\n| [0048-rotate-image](https://github.com/anshulkansal121/LeetCode/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/anshulkansal121/LeetCode/tree/master/0050-powx-n) |\n| [0070-climbing-stairs](https://github.com/anshulkansal121/LeetCode/tree/master/0070-climbing-stairs) |\n| [0189-rotate-array](https://github.com/anshulkansal121/LeetCode/tree/master/0189-rotate-array) |\n| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |\n| [0231-power-of-two](https://github.com/anshulkansal121/LeetCode/tree/master/0231-power-of-two) |\n| [0273-integer-to-english-words](https://github.com/anshulkansal121/LeetCode/tree/master/0273-integer-to-english-words) |\n| [0650-2-keys-keyboard](https://github.com/anshulkansal121/LeetCode/tree/master/0650-2-keys-keyboard) |\n| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |\n| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/anshulkansal121/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0008-string-to-integer-atoi](https://github.com/anshulkansal121/LeetCode/tree/master/0008-string-to-integer-atoi) |\n| [0022-generate-parentheses](https://github.com/anshulkansal121/LeetCode/tree/master/0022-generate-parentheses) |\n| [0072-edit-distance](https://github.com/anshulkansal121/LeetCode/tree/master/0072-edit-distance) |\n| [0131-palindrome-partitioning](https://github.com/anshulkansal121/LeetCode/tree/master/0131-palindrome-partitioning) |\n| [0151-reverse-words-in-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/0151-reverse-words-in-a-string) |\n| [0273-integer-to-english-words](https://github.com/anshulkansal121/LeetCode/tree/master/0273-integer-to-english-words) |\n| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |\n| [0424-longest-repeating-character-replacement](https://github.com/anshulkansal121/LeetCode/tree/master/0424-longest-repeating-character-replacement) |\n| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/anshulkansal121/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/anshulkansal121/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/anshulkansal121/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |\n| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/anshulkansal121/LeetCode/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |\n| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/anshulkansal121/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/anshulkansal121/LeetCode/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |\n## Recursion\n|  |\n| ------- |\n| [0025-reverse-nodes-in-k-group](https://github.com/anshulkansal121/LeetCode/tree/master/0025-reverse-nodes-in-k-group) |\n| [0050-powx-n](https://github.com/anshulkansal121/LeetCode/tree/master/0050-powx-n) |\n| [0231-power-of-two](https://github.com/anshulkansal121/LeetCode/tree/master/0231-power-of-two) |\n| [0273-integer-to-english-words](https://github.com/anshulkansal121/LeetCode/tree/master/0273-integer-to-english-words) |\n## Prefix Sum\n|  |\n| ------- |\n| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0560-subarray-sum-equals-k](https://github.com/anshulkansal121/LeetCode/tree/master/0560-subarray-sum-equals-k) |\n| [0724-find-pivot-index](https://github.com/anshulkansal121/LeetCode/tree/master/0724-find-pivot-index) |\n| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/anshulkansal121/LeetCode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1694-make-sum-divisible-by-p](https://github.com/anshulkansal121/LeetCode/tree/master/1694-make-sum-divisible-by-p) |\n| [1833-find-the-highest-altitude](https://github.com/anshulkansal121/LeetCode/tree/master/1833-find-the-highest-altitude) |\n| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |\n| [3427-special-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/3427-special-array-ii) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/anshulkansal121/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0424-longest-repeating-character-replacement](https://github.com/anshulkansal121/LeetCode/tree/master/0424-longest-repeating-character-replacement) |\n| [0643-maximum-average-subarray-i](https://github.com/anshulkansal121/LeetCode/tree/master/0643-maximum-average-subarray-i) |\n| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/anshulkansal121/LeetCode/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/anshulkansal121/LeetCode/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0022-generate-parentheses](https://github.com/anshulkansal121/LeetCode/tree/master/0022-generate-parentheses) |\n| [0070-climbing-stairs](https://github.com/anshulkansal121/LeetCode/tree/master/0070-climbing-stairs) |\n| [0072-edit-distance](https://github.com/anshulkansal121/LeetCode/tree/master/0072-edit-distance) |\n| [0131-palindrome-partitioning](https://github.com/anshulkansal121/LeetCode/tree/master/0131-palindrome-partitioning) |\n| [0650-2-keys-keyboard](https://github.com/anshulkansal121/LeetCode/tree/master/0650-2-keys-keyboard) |\n| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |\n| [1063-best-sightseeing-pair](https://github.com/anshulkansal121/LeetCode/tree/master/1063-best-sightseeing-pair) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/anshulkansal121/LeetCode/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n| [2067-maximum-number-of-points-with-cost](https://github.com/anshulkansal121/LeetCode/tree/master/2067-maximum-number-of-points-with-cost) |\n## Hash Table\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/anshulkansal121/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0128-longest-consecutive-sequence](https://github.com/anshulkansal121/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n| [0160-intersection-of-two-linked-lists](https://github.com/anshulkansal121/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |\n| [0424-longest-repeating-character-replacement](https://github.com/anshulkansal121/LeetCode/tree/master/0424-longest-repeating-character-replacement) |\n| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |\n| [0560-subarray-sum-equals-k](https://github.com/anshulkansal121/LeetCode/tree/master/0560-subarray-sum-equals-k) |\n| [0870-magic-squares-in-grid](https://github.com/anshulkansal121/LeetCode/tree/master/0870-magic-squares-in-grid) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/anshulkansal121/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0966-binary-subarrays-with-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0966-binary-subarrays-with-sum) |\n| [1370-count-number-of-nice-subarrays](https://github.com/anshulkansal121/LeetCode/tree/master/1370-count-number-of-nice-subarrays) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/1392-find-the-difference-of-two-arrays) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1694-make-sum-divisible-by-p](https://github.com/anshulkansal121/LeetCode/tree/master/1694-make-sum-divisible-by-p) |\n| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/anshulkansal121/LeetCode/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |\n| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/anshulkansal121/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n| [2428-equal-row-and-column-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/2428-equal-row-and-column-pairs) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n## Two Pointers\n|  |\n| ------- |\n| [0018-4sum](https://github.com/anshulkansal121/LeetCode/tree/master/0018-4sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0061-rotate-list](https://github.com/anshulkansal121/LeetCode/tree/master/0061-rotate-list) |\n| [0086-partition-list](https://github.com/anshulkansal121/LeetCode/tree/master/0086-partition-list) |\n| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |\n| [0151-reverse-words-in-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/0151-reverse-words-in-a-string) |\n| [0160-intersection-of-two-linked-lists](https://github.com/anshulkansal121/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anshulkansal121/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0189-rotate-array](https://github.com/anshulkansal121/LeetCode/tree/master/0189-rotate-array) |\n| [0528-swapping-nodes-in-a-linked-list](https://github.com/anshulkansal121/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/anshulkansal121/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |\n| [2232-adding-spaces-to-a-string](https://github.com/anshulkansal121/LeetCode/tree/master/2232-adding-spaces-to-a-string) |\n| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/anshulkansal121/LeetCode/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |\n| [3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i](https://github.com/anshulkansal121/LeetCode/tree/master/3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i) |\n## Sorting\n|  |\n| ------- |\n| [0018-4sum](https://github.com/anshulkansal121/LeetCode/tree/master/0018-4sum) |\n| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |\n| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |\n| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/anshulkansal121/LeetCode/tree/master/1798-max-number-of-k-sum-pairs) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n## Counting\n|  |\n| ------- |\n| [0229-majority-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0229-majority-element-ii) |\n| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/anshulkansal121/LeetCode/tree/master/0920-uncommon-words-from-two-sentences) |\n| [1777-determine-if-two-strings-are-close](https://github.com/anshulkansal121/LeetCode/tree/master/1777-determine-if-two-strings-are-close) |\n| [1915-check-if-one-string-swap-can-make-strings-equal](https://github.com/anshulkansal121/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/anshulkansal121/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/anshulkansal121/LeetCode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |\n| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |\n## Linked List\n|  |\n| ------- |\n| [0025-reverse-nodes-in-k-group](https://github.com/anshulkansal121/LeetCode/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/anshulkansal121/LeetCode/tree/master/0061-rotate-list) |\n| [0086-partition-list](https://github.com/anshulkansal121/LeetCode/tree/master/0086-partition-list) |\n| [0092-reverse-linked-list-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0092-reverse-linked-list-ii) |\n| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/anshulkansal121/LeetCode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0328-odd-even-linked-list](https://github.com/anshulkansal121/LeetCode/tree/master/0328-odd-even-linked-list) |\n| [0528-swapping-nodes-in-a-linked-list](https://github.com/anshulkansal121/LeetCode/tree/master/0528-swapping-nodes-in-a-linked-list) |\n## Tree\n|  |\n| ------- |\n| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |\n| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |\n| [0776-n-ary-tree-postorder-traversal](https://github.com/anshulkansal121/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |\n## Depth-First Search\n|  |\n| ------- |\n| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |\n| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |\n| [0776-n-ary-tree-postorder-traversal](https://github.com/anshulkansal121/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |\n| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |\n| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/anshulkansal121/LeetCode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |\n| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |\n| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |\n| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/anshulkansal121/LeetCode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |\n| [2764-maximum-number-of-fish-in-a-grid](https://github.com/anshulkansal121/LeetCode/tree/master/2764-maximum-number-of-fish-in-a-grid) |\n## Binary Tree\n|  |\n| ------- |\n| [0112-path-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0112-path-sum) |\n| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |\n## Backtracking\n|  |\n| ------- |\n| [0022-generate-parentheses](https://github.com/anshulkansal121/LeetCode/tree/master/0022-generate-parentheses) |\n| [0039-combination-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0040-combination-sum-ii) |\n| [0046-permutations](https://github.com/anshulkansal121/LeetCode/tree/master/0046-permutations) |\n| [0047-permutations-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0047-permutations-ii) |\n| [0051-n-queens](https://github.com/anshulkansal121/LeetCode/tree/master/0051-n-queens) |\n| [0078-subsets](https://github.com/anshulkansal121/LeetCode/tree/master/0078-subsets) |\n| [0090-subsets-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0090-subsets-ii) |\n| [0113-path-sum-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0113-path-sum-ii) |\n| [0131-palindrome-partitioning](https://github.com/anshulkansal121/LeetCode/tree/master/0131-palindrome-partitioning) |\n| [0216-combination-sum-iii](https://github.com/anshulkansal121/LeetCode/tree/master/0216-combination-sum-iii) |\n| [1715-split-a-string-into-the-max-number-of-unique-substrings](https://github.com/anshulkansal121/LeetCode/tree/master/1715-split-a-string-into-the-max-number-of-unique-substrings) |\n## Strongly Connected Component\n|  |\n| ------- |\n| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/anshulkansal121/LeetCode/tree/master/1691-minimum-number-of-days-to-disconnect-island) |\n## Binary Search\n|  |\n| ------- |\n| [0033-search-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/anshulkansal121/LeetCode/tree/master/0035-search-insert-position) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0162-find-peak-element](https://github.com/anshulkansal121/LeetCode/tree/master/0162-find-peak-element) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anshulkansal121/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0209-minimum-size-subarray-sum](https://github.com/anshulkansal121/LeetCode/tree/master/0209-minimum-size-subarray-sum) |\n| [0540-single-element-in-a-sorted-array](https://github.com/anshulkansal121/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |\n| [1468-check-if-n-and-its-double-exist](https://github.com/anshulkansal121/LeetCode/tree/master/1468-check-if-n-and-its-double-exist) |\n| [2006-find-the-student-that-will-replace-the-chalk](https://github.com/anshulkansal121/LeetCode/tree/master/2006-find-the-student-that-will-replace-the-chalk) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n| [3427-special-array-ii](https://github.com/anshulkansal121/LeetCode/tree/master/3427-special-array-ii) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |\n## Merge Sort\n|  |\n| ------- |\n| [0148-sort-list](https://github.com/anshulkansal121/LeetCode/tree/master/0148-sort-list) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n| [2616-maximal-score-after-applying-k-operations](https://github.com/anshulkansal121/LeetCode/tree/master/2616-maximal-score-after-applying-k-operations) |\n| [2695-find-score-of-an-array-after-marking-all-elements](https://github.com/anshulkansal121/LeetCode/tree/master/2695-find-score-of-an-array-after-marking-all-elements) |\n## Bucket Sort\n|  |\n| ------- |\n| [0451-sort-characters-by-frequency](https://github.com/anshulkansal121/LeetCode/tree/master/0451-sort-characters-by-frequency) |\n## Stack\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/anshulkansal121/LeetCode/tree/master/0155-min-stack) |\n| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |\n| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0503-next-greater-element-ii) |\n| [0735-asteroid-collision](https://github.com/anshulkansal121/LeetCode/tree/master/0735-asteroid-collision) |\n| [0776-n-ary-tree-postorder-traversal](https://github.com/anshulkansal121/LeetCode/tree/master/0776-n-ary-tree-postorder-traversal) |\n| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/anshulkansal121/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1002-maximum-width-ramp](https://github.com/anshulkansal121/LeetCode/tree/master/1002-maximum-width-ramp) |\n| [2227-sum-of-subarray-ranges](https://github.com/anshulkansal121/LeetCode/tree/master/2227-sum-of-subarray-ranges) |\n## Design\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/anshulkansal121/LeetCode/tree/master/0155-min-stack) |\n## Greedy\n|  |\n| ------- |\n| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |\n| [0624-maximum-distance-in-arrays](https://github.com/anshulkansal121/LeetCode/tree/master/0624-maximum-distance-in-arrays) |\n| [0890-lemonade-change](https://github.com/anshulkansal121/LeetCode/tree/master/0890-lemonade-change) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/anshulkansal121/LeetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [2616-maximal-score-after-applying-k-operations](https://github.com/anshulkansal121/LeetCode/tree/master/2616-maximal-score-after-applying-k-operations) |\n| [2640-maximum-number-of-integers-to-choose-from-a-range-i](https://github.com/anshulkansal121/LeetCode/tree/master/2640-maximum-number-of-integers-to-choose-from-a-range-i) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0402-remove-k-digits](https://github.com/anshulkansal121/LeetCode/tree/master/0402-remove-k-digits) |\n| [0496-next-greater-element-i](https://github.com/anshulkansal121/LeetCode/tree/master/0496-next-greater-element-i) |\n| [0503-next-greater-element-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0503-next-greater-element-ii) |\n| [0943-sum-of-subarray-minimums](https://github.com/anshulkansal121/LeetCode/tree/master/0943-sum-of-subarray-minimums) |\n| [1002-maximum-width-ramp](https://github.com/anshulkansal121/LeetCode/tree/master/1002-maximum-width-ramp) |\n| [2227-sum-of-subarray-ranges](https://github.com/anshulkansal121/LeetCode/tree/master/2227-sum-of-subarray-ranges) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0029-divide-two-integers](https://github.com/anshulkansal121/LeetCode/tree/master/0029-divide-two-integers) |\n| [0078-subsets](https://github.com/anshulkansal121/LeetCode/tree/master/0078-subsets) |\n| [0090-subsets-ii](https://github.com/anshulkansal121/LeetCode/tree/master/0090-subsets-ii) |\n| [0231-power-of-two](https://github.com/anshulkansal121/LeetCode/tree/master/0231-power-of-two) |\n| [2323-minimum-bit-flips-to-convert-number](https://github.com/anshulkansal121/LeetCode/tree/master/2323-minimum-bit-flips-to-convert-number) |\n## Enumeration\n|  |\n| ------- |\n| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |\n## Number Theory\n|  |\n| ------- |\n| [0204-count-primes](https://github.com/anshulkansal121/LeetCode/tree/master/0204-count-primes) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/anshulkansal121/LeetCode/tree/master/0070-climbing-stairs) |\n## String Matching\n|  |\n| ------- |\n| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/anshulkansal121/LeetCode/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |\n## Graph\n|  |\n| ------- |\n| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |\n| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |\n| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/anshulkansal121/LeetCode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |\n| [2583-divide-nodes-into-the-maximum-number-of-groups](https://github.com/anshulkansal121/LeetCode/tree/master/2583-divide-nodes-into-the-maximum-number-of-groups) |\n## Topological Sort\n|  |\n| ------- |\n| [0820-find-eventual-safe-states](https://github.com/anshulkansal121/LeetCode/tree/master/0820-find-eventual-safe-states) |\n| [1558-course-schedule-iv](https://github.com/anshulkansal121/LeetCode/tree/master/1558-course-schedule-iv) |\n| [2246-maximum-employees-to-be-invited-to-a-meeting](https://github.com/anshulkansal121/LeetCode/tree/master/2246-maximum-employees-to-be-invited-to-a-meeting) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanshulkansal121%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanshulkansal121%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanshulkansal121%2Fleetcode/lists"}