{"id":20670908,"url":"https://github.com/shuklaritvik06/leetcode","last_synced_at":"2026-04-24T13:02:18.478Z","repository":{"id":114242086,"uuid":"594103844","full_name":"shuklaritvik06/leetcode","owner":"shuklaritvik06","description":"Leetcode Questions that I solved using LEETHUB!","archived":false,"fork":false,"pushed_at":"2024-08-31T12:35:31.000Z","size":170,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-09T13:29:33.388Z","etag":null,"topics":["leetcode","leethub"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/shuklaritvik06.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2023-01-27T15:57:50.000Z","updated_at":"2024-08-31T12:35:34.000Z","dependencies_parsed_at":"2024-08-27T10:42:25.238Z","dependency_job_id":"07181444-ac9d-4dd3-8be7-7f178faaaccf","html_url":"https://github.com/shuklaritvik06/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/shuklaritvik06%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuklaritvik06%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuklaritvik06%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shuklaritvik06%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shuklaritvik06","download_url":"https://codeload.github.com/shuklaritvik06/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242889371,"owners_count":20201950,"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":["leetcode","leethub"],"created_at":"2024-11-16T20:24:04.142Z","updated_at":"2026-04-24T13:02:13.441Z","avatar_url":"https://github.com/shuklaritvik06.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcode\nLeetcode Questions that I solved using LEETHUB!\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/shuklaritvik06/leetcode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0015-3sum](https://github.com/shuklaritvik06/leetcode/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/shuklaritvik06/leetcode/tree/master/0016-3sum-closest) |\n| [0036-valid-sudoku](https://github.com/shuklaritvik06/leetcode/tree/master/0036-valid-sudoku) |\n| [0049-group-anagrams](https://github.com/shuklaritvik06/leetcode/tree/master/0049-group-anagrams) |\n| [0128-longest-consecutive-sequence](https://github.com/shuklaritvik06/leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0137-single-number-ii](https://github.com/shuklaritvik06/leetcode/tree/master/0137-single-number-ii) |\n| [0215-kth-largest-element-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/0215-kth-largest-element-in-an-array) |\n| [0217-contains-duplicate](https://github.com/shuklaritvik06/leetcode/tree/master/0217-contains-duplicate) |\n| [0238-product-of-array-except-self](https://github.com/shuklaritvik06/leetcode/tree/master/0238-product-of-array-except-self) |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0540-single-element-in-a-sorted-array](https://github.com/shuklaritvik06/leetcode/tree/master/0540-single-element-in-a-sorted-array) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/shuklaritvik06/leetcode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2727-number-of-senior-citizens](https://github.com/shuklaritvik06/leetcode/tree/master/2727-number-of-senior-citizens) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/shuklaritvik06/leetcode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0540-single-element-in-a-sorted-array](https://github.com/shuklaritvik06/leetcode/tree/master/0540-single-element-in-a-sorted-array) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0137-single-number-ii](https://github.com/shuklaritvik06/leetcode/tree/master/0137-single-number-ii) |\n## Hash Table\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/shuklaritvik06/leetcode/tree/master/0013-roman-to-integer) |\n| [0036-valid-sudoku](https://github.com/shuklaritvik06/leetcode/tree/master/0036-valid-sudoku) |\n| [0049-group-anagrams](https://github.com/shuklaritvik06/leetcode/tree/master/0049-group-anagrams) |\n| [0128-longest-consecutive-sequence](https://github.com/shuklaritvik06/leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0217-contains-duplicate](https://github.com/shuklaritvik06/leetcode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/shuklaritvik06/leetcode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/shuklaritvik06/leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/shuklaritvik06/leetcode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/shuklaritvik06/leetcode/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/shuklaritvik06/leetcode/tree/master/0016-3sum-closest) |\n| [0049-group-anagrams](https://github.com/shuklaritvik06/leetcode/tree/master/0049-group-anagrams) |\n| [0215-kth-largest-element-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/0215-kth-largest-element-in-an-array) |\n| [0217-contains-duplicate](https://github.com/shuklaritvik06/leetcode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/shuklaritvik06/leetcode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/shuklaritvik06/leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [1556-make-two-arrays-equal-by-reversing-subarrays](https://github.com/shuklaritvik06/leetcode/tree/master/1556-make-two-arrays-equal-by-reversing-subarrays) |\n## String\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/shuklaritvik06/leetcode/tree/master/0013-roman-to-integer) |\n| [0049-group-anagrams](https://github.com/shuklaritvik06/leetcode/tree/master/0049-group-anagrams) |\n| [0242-valid-anagram](https://github.com/shuklaritvik06/leetcode/tree/master/0242-valid-anagram) |\n| [0451-sort-characters-by-frequency](https://github.com/shuklaritvik06/leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2727-number-of-senior-citizens](https://github.com/shuklaritvik06/leetcode/tree/master/2727-number-of-senior-citizens) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/shuklaritvik06/leetcode/tree/master/0004-median-of-two-sorted-arrays) |\n| [0215-kth-largest-element-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/shuklaritvik06/leetcode/tree/master/0451-sort-characters-by-frequency) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/shuklaritvik06/leetcode/tree/master/0451-sort-characters-by-frequency) |\n## Counting\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/shuklaritvik06/leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n## Quickselect\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/shuklaritvik06/leetcode/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/shuklaritvik06/leetcode/tree/master/0347-top-k-frequent-elements) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/shuklaritvik06/leetcode/tree/master/0002-add-two-numbers) |\n| [0009-palindrome-number](https://github.com/shuklaritvik06/leetcode/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/shuklaritvik06/leetcode/tree/master/0013-roman-to-integer) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/shuklaritvik06/leetcode/tree/master/0128-longest-consecutive-sequence) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/shuklaritvik06/leetcode/tree/master/0238-product-of-array-except-self) |\n## Matrix\n|  |\n| ------- |\n| [0036-valid-sudoku](https://github.com/shuklaritvik06/leetcode/tree/master/0036-valid-sudoku) |\n## Two Pointers\n|  |\n| ------- |\n| [0015-3sum](https://github.com/shuklaritvik06/leetcode/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/shuklaritvik06/leetcode/tree/master/0016-3sum-closest) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/shuklaritvik06/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/shuklaritvik06/leetcode/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/shuklaritvik06/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0024-swap-nodes-in-pairs](https://github.com/shuklaritvik06/leetcode/tree/master/0024-swap-nodes-in-pairs) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/shuklaritvik06/leetcode/tree/master/0002-add-two-numbers) |\n| [0024-swap-nodes-in-pairs](https://github.com/shuklaritvik06/leetcode/tree/master/0024-swap-nodes-in-pairs) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshuklaritvik06%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshuklaritvik06%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshuklaritvik06%2Fleetcode/lists"}