{"id":30412890,"url":"https://github.com/labwhatever/leetcode","last_synced_at":"2025-08-22T02:13:23.191Z","repository":{"id":309047367,"uuid":"788991846","full_name":"labwhatever/Leetcode","owner":"labwhatever","description":"Collection of LeetCode questions to ace the coding interview!","archived":false,"fork":false,"pushed_at":"2025-04-24T07:23:15.000Z","size":246,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-09T14:41:58.416Z","etag":null,"topics":["data","data-structures-and-algorithms","dsa","leetcode-cpp","leetcode-solutions","structure","structure-learning"],"latest_commit_sha":null,"homepage":"https://smartcraze.online","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/labwhatever.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-04-19T13:44:23.000Z","updated_at":"2025-06-08T11:33:38.000Z","dependencies_parsed_at":"2025-08-09T14:42:02.386Z","dependency_job_id":"fee553eb-21ac-4710-a81d-bcb34237a0da","html_url":"https://github.com/labwhatever/Leetcode","commit_stats":null,"previous_names":["labwhatever/leetcode"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/labwhatever/Leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/labwhatever%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/labwhatever%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/labwhatever%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/labwhatever%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/labwhatever","download_url":"https://codeload.github.com/labwhatever/Leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/labwhatever%2FLeetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271574431,"owners_count":24783319,"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-08-22T02:00:08.480Z","response_time":65,"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":["data","data-structures-and-algorithms","dsa","leetcode-cpp","leetcode-solutions","structure","structure-learning"],"created_at":"2025-08-22T02:13:22.442Z","updated_at":"2025-08-22T02:13:23.184Z","avatar_url":"https://github.com/labwhatever.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/smartcraze/Leetcode/tree/master/0002-add-two-numbers) |\n| [0237-delete-node-in-a-linked-list](https://github.com/smartcraze/Leetcode/tree/master/0237-delete-node-in-a-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/smartcraze/Leetcode/tree/master/0908-middle-of-the-linked-list) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/smartcraze/Leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/smartcraze/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0014-longest-common-prefix](https://github.com/smartcraze/Leetcode/tree/master/0014-longest-common-prefix) |\n| [0242-valid-anagram](https://github.com/smartcraze/Leetcode/tree/master/0242-valid-anagram) |\n| [0412-fizz-buzz](https://github.com/smartcraze/Leetcode/tree/master/0412-fizz-buzz) |\n| [0686-repeated-string-match](https://github.com/smartcraze/Leetcode/tree/master/0686-repeated-string-match) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/smartcraze/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1651-shuffle-string](https://github.com/smartcraze/Leetcode/tree/master/1651-shuffle-string) |\n| [1797-goal-parser-interpretation](https://github.com/smartcraze/Leetcode/tree/master/1797-goal-parser-interpretation) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/smartcraze/Leetcode/tree/master/0014-longest-common-prefix) |\n## Array\n|  |\n| ------- |\n| [0066-plus-one](https://github.com/smartcraze/Leetcode/tree/master/0066-plus-one) |\n| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/smartcraze/Leetcode/tree/master/0217-contains-duplicate) |\n| [0643-maximum-average-subarray-i](https://github.com/smartcraze/Leetcode/tree/master/0643-maximum-average-subarray-i) |\n| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/smartcraze/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |\n| [1528-kids-with-the-greatest-number-of-candies](https://github.com/smartcraze/Leetcode/tree/master/1528-kids-with-the-greatest-number-of-candies) |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n| [1651-shuffle-string](https://github.com/smartcraze/Leetcode/tree/master/1651-shuffle-string) |\n| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/smartcraze/Leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |\n| [2265-partition-array-according-to-given-pivot](https://github.com/smartcraze/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |\n| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/smartcraze/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |\n| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |\n## String Matching\n|  |\n| ------- |\n| [0686-repeated-string-match](https://github.com/smartcraze/Leetcode/tree/master/0686-repeated-string-match) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/smartcraze/Leetcode/tree/master/0002-add-two-numbers) |\n| [0066-plus-one](https://github.com/smartcraze/Leetcode/tree/master/0066-plus-one) |\n| [0231-power-of-two](https://github.com/smartcraze/Leetcode/tree/master/0231-power-of-two) |\n| [0412-fizz-buzz](https://github.com/smartcraze/Leetcode/tree/master/0412-fizz-buzz) |\n| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/smartcraze/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/smartcraze/Leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n| [1889-check-if-number-is-a-sum-of-powers-of-three](https://github.com/smartcraze/Leetcode/tree/master/1889-check-if-number-is-a-sum-of-powers-of-three) |\n| [2610-closest-prime-numbers-in-range](https://github.com/smartcraze/Leetcode/tree/master/2610-closest-prime-numbers-in-range) |\n| [2649-count-total-number-of-colored-cells](https://github.com/smartcraze/Leetcode/tree/master/2649-count-total-number-of-colored-cells) |\n| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |\n## Dynamic Programming\n|  |\n| ------- |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/smartcraze/Leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |\n## Prefix Sum\n|  |\n| ------- |\n| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |\n## Two Pointers\n|  |\n| ------- |\n| [0908-middle-of-the-linked-list](https://github.com/smartcraze/Leetcode/tree/master/0908-middle-of-the-linked-list) |\n| [2265-partition-array-according-to-given-pivot](https://github.com/smartcraze/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |\n## Simulation\n|  |\n| ------- |\n| [0412-fizz-buzz](https://github.com/smartcraze/Leetcode/tree/master/0412-fizz-buzz) |\n| [2265-partition-array-according-to-given-pivot](https://github.com/smartcraze/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/smartcraze/Leetcode/tree/master/0002-add-two-numbers) |\n| [0231-power-of-two](https://github.com/smartcraze/Leetcode/tree/master/0231-power-of-two) |\n## Hash Table\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/smartcraze/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/smartcraze/Leetcode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/smartcraze/Leetcode/tree/master/0242-valid-anagram) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/smartcraze/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |\n## Matrix\n|  |\n| ------- |\n| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |\n## Sorting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/smartcraze/Leetcode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/smartcraze/Leetcode/tree/master/0242-valid-anagram) |\n## Number Theory\n|  |\n| ------- |\n| [2610-closest-prime-numbers-in-range](https://github.com/smartcraze/Leetcode/tree/master/2610-closest-prime-numbers-in-range) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/smartcraze/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0643-maximum-average-subarray-i](https://github.com/smartcraze/Leetcode/tree/master/0643-maximum-average-subarray-i) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/smartcraze/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0231-power-of-two](https://github.com/smartcraze/Leetcode/tree/master/0231-power-of-two) |\n## Binary Search\n|  |\n| ------- |\n| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/smartcraze/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |\n| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/smartcraze/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |\n## Greedy\n|  |\n| ------- |\n| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/smartcraze/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |\n\u003c!---LeetCode Topics End--\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flabwhatever%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flabwhatever%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flabwhatever%2Fleetcode/lists"}