{"id":19611288,"url":"https://github.com/kms1601/leetcode","last_synced_at":"2026-03-16T21:36:58.946Z","repository":{"id":251579132,"uuid":"800257754","full_name":"kms1601/Leetcode","owner":"kms1601","description":"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":"2024-08-30T06:13:08.000Z","size":229,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-11-11T10:45:23.212Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/kms1601.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-05-14T02:00:21.000Z","updated_at":"2024-08-30T06:18:22.000Z","dependencies_parsed_at":"2024-11-11T10:49:40.342Z","dependency_job_id":null,"html_url":"https://github.com/kms1601/Leetcode","commit_stats":null,"previous_names":["kms1601/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kms1601%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kms1601%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kms1601%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kms1601%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kms1601","download_url":"https://codeload.github.com/kms1601/Leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":233170012,"owners_count":18635611,"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":[],"created_at":"2024-11-11T10:37:50.621Z","updated_at":"2025-09-15T23:31:00.621Z","avatar_url":"https://github.com/kms1601.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode\nCollection 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| [0075-sort-colors](https://github.com/kms1601/Leetcode/tree/master/0075-sort-colors) |\n# Two Pointers\n|  |\n| ------- |\n| [0075-sort-colors](https://github.com/kms1601/Leetcode/tree/master/0075-sort-colors) |\n# Sorting\n|  |\n| ------- |\n| [0075-sort-colors](https://github.com/kms1601/Leetcode/tree/master/0075-sort-colors) |\n# Database\n|  |\n| ------- |\n| [0584-find-customer-referee](https://github.com/kms1601/Leetcode/tree/master/0584-find-customer-referee) |\n| [0595-big-countries](https://github.com/kms1601/Leetcode/tree/master/0595-big-countries) |\n| [1258-article-views-i](https://github.com/kms1601/Leetcode/tree/master/1258-article-views-i) |\n| [1827-invalid-tweets](https://github.com/kms1601/Leetcode/tree/master/1827-invalid-tweets) |\n| [1908-recyclable-and-low-fat-products](https://github.com/kms1601/Leetcode/tree/master/1908-recyclable-and-low-fat-products) |\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/kms1601/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/kms1601/Leetcode/tree/master/0783-search-in-a-binary-search-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/kms1601/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |\n| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |\n| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/kms1601/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/kms1601/Leetcode/tree/master/0783-search-in-a-binary-search-tree) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |\n| [0783-search-in-a-binary-search-tree](https://github.com/kms1601/Leetcode/tree/master/0783-search-in-a-binary-search-tree) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |\n| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |\n| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |\n## Array\n|  |\n| ------- |\n| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |\n| [0118-pascals-triangle](https://github.com/kms1601/Leetcode/tree/master/0118-pascals-triangle) |\n| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |\n| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |\n| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |\n| [0747-min-cost-climbing-stairs](https://github.com/kms1601/Leetcode/tree/master/0747-min-cost-climbing-stairs) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |\n| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2398-check-if-matrix-is-x-matrix](https://github.com/kms1601/Leetcode/tree/master/2398-check-if-matrix-is-x-matrix) |\n| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |\n| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |\n## Hash Table\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |\n| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |\n## String\n|  |\n| ------- |\n| [0058-length-of-last-word](https://github.com/kms1601/Leetcode/tree/master/0058-length-of-last-word) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n## Counting\n|  |\n| ------- |\n| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |\n| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |\n## Queue\n|  |\n| ------- |\n| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |\n## Sliding Window\n|  |\n| ------- |\n| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |\n## Prefix Sum\n|  |\n| ------- |\n| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |\n## Math\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/kms1601/Leetcode/tree/master/0070-climbing-stairs) |\n| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |\n| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n## Design\n|  |\n| ------- |\n| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n## Randomized\n|  |\n| ------- |\n| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |\n## Matrix\n|  |\n| ------- |\n| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |\n| [2398-check-if-matrix-is-x-matrix](https://github.com/kms1601/Leetcode/tree/master/2398-check-if-matrix-is-x-matrix) |\n## Two Pointers\n|  |\n| ------- |\n| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/kms1601/Leetcode/tree/master/0070-climbing-stairs) |\n| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |\n| [0118-pascals-triangle](https://github.com/kms1601/Leetcode/tree/master/0118-pascals-triangle) |\n| [0747-min-cost-climbing-stairs](https://github.com/kms1601/Leetcode/tree/master/0747-min-cost-climbing-stairs) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |\n## Stack\n|  |\n| ------- |\n| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |\n| [0094-binary-tree-inorder-traversal](https://github.com/kms1601/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |\n## Greedy\n|  |\n| ------- |\n| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |\n| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |\n| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |\n## Sorting\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |\n| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |\n| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |\n| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |\n## Counting Sort\n|  |\n| ------- |\n| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |\n## Graph\n|  |\n| ------- |\n| [1916-find-center-of-star-graph](https://github.com/kms1601/Leetcode/tree/master/1916-find-center-of-star-graph) |\n| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n## Union Find\n|  |\n| ------- |\n| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/kms1601/Leetcode/tree/master/0070-climbing-stairs) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkms1601%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkms1601%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkms1601%2Fleetcode/lists"}