{"id":23962994,"url":"https://github.com/gkamboj/leetcode","last_synced_at":"2025-06-11T00:33:57.049Z","repository":{"id":122153681,"uuid":"444534827","full_name":"gkamboj/LeetCode","owner":"gkamboj","description":"Collection of LeetCode questions to ace the coding interview!","archived":false,"fork":false,"pushed_at":"2025-05-18T18:31:30.000Z","size":3273,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-18T18:31:32.383Z","etag":null,"topics":["data-structures","java","leetcode","python"],"latest_commit_sha":null,"homepage":"","language":"Python","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/gkamboj.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":"2022-01-04T19:10:17.000Z","updated_at":"2025-05-18T18:31:31.000Z","dependencies_parsed_at":"2024-01-02T14:24:19.409Z","dependency_job_id":"25573b9d-0c89-47b6-a17f-b35e5c2009b8","html_url":"https://github.com/gkamboj/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gkamboj%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gkamboj%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gkamboj%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gkamboj%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gkamboj","download_url":"https://codeload.github.com/gkamboj/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gkamboj%2FLeetCode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259175999,"owners_count":22817095,"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","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-structures","java","leetcode","python"],"created_at":"2025-01-06T20:59:03.325Z","updated_at":"2025-06-11T00:33:57.034Z","avatar_url":"https://github.com/gkamboj.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode\nCollection of LeetCode questions \n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/gkamboj/LeetCode/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/gkamboj/LeetCode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0011-container-with-most-water](https://github.com/gkamboj/LeetCode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/gkamboj/LeetCode/tree/master/0015-3sum) |\n| [0036-valid-sudoku](https://github.com/gkamboj/LeetCode/tree/master/0036-valid-sudoku) |\n| [0041-first-missing-positive](https://github.com/gkamboj/LeetCode/tree/master/0041-first-missing-positive) |\n| [0042-trapping-rain-water](https://github.com/gkamboj/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0049-group-anagrams](https://github.com/gkamboj/LeetCode/tree/master/0049-group-anagrams) |\n| [0053-maximum-subarray](https://github.com/gkamboj/LeetCode/tree/master/0053-maximum-subarray) |\n| [0074-search-a-2d-matrix](https://github.com/gkamboj/LeetCode/tree/master/0074-search-a-2d-matrix) |\n| [0128-longest-consecutive-sequence](https://github.com/gkamboj/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/gkamboj/LeetCode/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/gkamboj/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0217-contains-duplicate](https://github.com/gkamboj/LeetCode/tree/master/0217-contains-duplicate) |\n| [0238-product-of-array-except-self](https://github.com/gkamboj/LeetCode/tree/master/0238-product-of-array-except-self) |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [0739-daily-temperatures](https://github.com/gkamboj/LeetCode/tree/master/0739-daily-temperatures) |\n| [0792-binary-search](https://github.com/gkamboj/LeetCode/tree/master/0792-binary-search) |\n| [0883-car-fleet](https://github.com/gkamboj/LeetCode/tree/master/0883-car-fleet) |\n| [0907-koko-eating-bananas](https://github.com/gkamboj/LeetCode/tree/master/0907-koko-eating-bananas) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/gkamboj/LeetCode/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/gkamboj/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0036-valid-sudoku](https://github.com/gkamboj/LeetCode/tree/master/0036-valid-sudoku) |\n| [0041-first-missing-positive](https://github.com/gkamboj/LeetCode/tree/master/0041-first-missing-positive) |\n| [0049-group-anagrams](https://github.com/gkamboj/LeetCode/tree/master/0049-group-anagrams) |\n| [0128-longest-consecutive-sequence](https://github.com/gkamboj/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n| [0141-linked-list-cycle](https://github.com/gkamboj/LeetCode/tree/master/0141-linked-list-cycle) |\n| [0217-contains-duplicate](https://github.com/gkamboj/LeetCode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/gkamboj/LeetCode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [1023-time-based-key-value-store](https://github.com/gkamboj/LeetCode/tree/master/1023-time-based-key-value-store) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/gkamboj/LeetCode/tree/master/0015-3sum) |\n| [0049-group-anagrams](https://github.com/gkamboj/LeetCode/tree/master/0049-group-anagrams) |\n| [0217-contains-duplicate](https://github.com/gkamboj/LeetCode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/gkamboj/LeetCode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [0883-car-fleet](https://github.com/gkamboj/LeetCode/tree/master/0883-car-fleet) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/gkamboj/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0006-zigzag-conversion](https://github.com/gkamboj/LeetCode/tree/master/0006-zigzag-conversion) |\n| [0020-valid-parentheses](https://github.com/gkamboj/LeetCode/tree/master/0020-valid-parentheses) |\n| [0022-generate-parentheses](https://github.com/gkamboj/LeetCode/tree/master/0022-generate-parentheses) |\n| [0049-group-anagrams](https://github.com/gkamboj/LeetCode/tree/master/0049-group-anagrams) |\n| [0125-valid-palindrome](https://github.com/gkamboj/LeetCode/tree/master/0125-valid-palindrome) |\n| [0242-valid-anagram](https://github.com/gkamboj/LeetCode/tree/master/0242-valid-anagram) |\n| [1023-time-based-key-value-store](https://github.com/gkamboj/LeetCode/tree/master/1023-time-based-key-value-store) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/gkamboj/LeetCode/tree/master/0238-product-of-array-except-self) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/gkamboj/LeetCode/tree/master/0128-longest-consecutive-sequence) |\n## Linked List\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/gkamboj/LeetCode/tree/master/0021-merge-two-sorted-lists) |\n| [0141-linked-list-cycle](https://github.com/gkamboj/LeetCode/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/gkamboj/LeetCode/tree/master/0143-reorder-list) |\n| [0206-reverse-linked-list](https://github.com/gkamboj/LeetCode/tree/master/0206-reverse-linked-list) |\n## Two Pointers\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/gkamboj/LeetCode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/gkamboj/LeetCode/tree/master/0015-3sum) |\n| [0042-trapping-rain-water](https://github.com/gkamboj/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0125-valid-palindrome](https://github.com/gkamboj/LeetCode/tree/master/0125-valid-palindrome) |\n| [0141-linked-list-cycle](https://github.com/gkamboj/LeetCode/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/gkamboj/LeetCode/tree/master/0143-reorder-list) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/gkamboj/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/gkamboj/LeetCode/tree/master/0020-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/gkamboj/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0143-reorder-list](https://github.com/gkamboj/LeetCode/tree/master/0143-reorder-list) |\n| [0155-min-stack](https://github.com/gkamboj/LeetCode/tree/master/0155-min-stack) |\n| [0739-daily-temperatures](https://github.com/gkamboj/LeetCode/tree/master/0739-daily-temperatures) |\n| [0883-car-fleet](https://github.com/gkamboj/LeetCode/tree/master/0883-car-fleet) |\n## Recursion\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/gkamboj/LeetCode/tree/master/0021-merge-two-sorted-lists) |\n| [0143-reorder-list](https://github.com/gkamboj/LeetCode/tree/master/0143-reorder-list) |\n| [0206-reverse-linked-list](https://github.com/gkamboj/LeetCode/tree/master/0206-reverse-linked-list) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/gkamboj/LeetCode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0053-maximum-subarray](https://github.com/gkamboj/LeetCode/tree/master/0053-maximum-subarray) |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Counting\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Quickselect\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/gkamboj/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Matrix\n|  |\n| ------- |\n| [0036-valid-sudoku](https://github.com/gkamboj/LeetCode/tree/master/0036-valid-sudoku) |\n| [0074-search-a-2d-matrix](https://github.com/gkamboj/LeetCode/tree/master/0074-search-a-2d-matrix) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/gkamboj/LeetCode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0074-search-a-2d-matrix](https://github.com/gkamboj/LeetCode/tree/master/0074-search-a-2d-matrix) |\n| [0153-find-minimum-in-rotated-sorted-array](https://github.com/gkamboj/LeetCode/tree/master/0153-find-minimum-in-rotated-sorted-array) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/gkamboj/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0792-binary-search](https://github.com/gkamboj/LeetCode/tree/master/0792-binary-search) |\n| [0907-koko-eating-bananas](https://github.com/gkamboj/LeetCode/tree/master/0907-koko-eating-bananas) |\n| [1023-time-based-key-value-store](https://github.com/gkamboj/LeetCode/tree/master/1023-time-based-key-value-store) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/gkamboj/LeetCode/tree/master/0011-container-with-most-water) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0022-generate-parentheses](https://github.com/gkamboj/LeetCode/tree/master/0022-generate-parentheses) |\n| [0042-trapping-rain-water](https://github.com/gkamboj/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0053-maximum-subarray](https://github.com/gkamboj/LeetCode/tree/master/0053-maximum-subarray) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/gkamboj/LeetCode/tree/master/0042-trapping-rain-water) |\n| [0739-daily-temperatures](https://github.com/gkamboj/LeetCode/tree/master/0739-daily-temperatures) |\n| [0883-car-fleet](https://github.com/gkamboj/LeetCode/tree/master/0883-car-fleet) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/gkamboj/LeetCode/tree/master/0003-longest-substring-without-repeating-characters) |\n## Design\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/gkamboj/LeetCode/tree/master/0155-min-stack) |\n| [1023-time-based-key-value-store](https://github.com/gkamboj/LeetCode/tree/master/1023-time-based-key-value-store) |\n## Backtracking\n|  |\n| ------- |\n| [0022-generate-parentheses](https://github.com/gkamboj/LeetCode/tree/master/0022-generate-parentheses) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgkamboj%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgkamboj%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgkamboj%2Fleetcode/lists"}