{"id":22354096,"url":"https://github.com/kunal-ladhani/leetcodesolutions","last_synced_at":"2026-05-01T15:39:44.304Z","repository":{"id":193255338,"uuid":"605245078","full_name":"Kunal-Ladhani/leetcodeSolutions","owner":"Kunal-Ladhani","description":"Collection of LeetCode questions to ace the coding interview!","archived":false,"fork":false,"pushed_at":"2026-04-24T16:35:59.000Z","size":378,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-04-24T18:26:33.848Z","etag":null,"topics":["dsa","dsa-algorithm","dsa-practice","dsalgo","java","leetcode-java","leetcode-solutions","leetocde"],"latest_commit_sha":null,"homepage":"","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/Kunal-Ladhani.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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2023-02-22T18:54:12.000Z","updated_at":"2026-04-24T16:36:00.000Z","dependencies_parsed_at":"2026-01-22T21:02:05.833Z","dependency_job_id":null,"html_url":"https://github.com/Kunal-Ladhani/leetcodeSolutions","commit_stats":null,"previous_names":["kunal-ladhani/leetcodesolutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Kunal-Ladhani/leetcodeSolutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kunal-Ladhani%2FleetcodeSolutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kunal-Ladhani%2FleetcodeSolutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kunal-Ladhani%2FleetcodeSolutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kunal-Ladhani%2FleetcodeSolutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Kunal-Ladhani","download_url":"https://codeload.github.com/Kunal-Ladhani/leetcodeSolutions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Kunal-Ladhani%2FleetcodeSolutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32503203,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-30T13:12:12.517Z","status":"online","status_checked_at":"2026-05-01T02:00:05.856Z","response_time":64,"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":["dsa","dsa-algorithm","dsa-practice","dsalgo","java","leetcode-java","leetcode-solutions","leetocde"],"created_at":"2024-12-04T13:11:25.463Z","updated_at":"2026-05-01T15:39:44.294Z","avatar_url":"https://github.com/Kunal-Ladhani.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcodeSolutions\nCollection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0014-longest-common-prefix) |\n| [0015-3sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0015-3sum) |\n| [0053-maximum-subarray](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0053-maximum-subarray) |\n| [0054-spiral-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0054-spiral-matrix) |\n| [0074-search-a-2d-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0075-sort-colors) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n| [0485-max-consecutive-ones](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0485-max-consecutive-ones) |\n| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |\n| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |\n| [0746-min-cost-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0746-min-cost-climbing-stairs) |\n| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |\n| [1046-last-stone-weight](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1046-last-stone-weight) |\n| [1464-maximum-product-of-two-elements-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1464-maximum-product-of-two-elements-in-an-array) |\n| [2149-rearrange-array-elements-by-sign](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/2149-rearrange-array-elements-by-sign) |\n## Two Pointers\n|  |\n| ------- |\n| [0015-3sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0015-3sum) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0075-sort-colors](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0075-sort-colors) |\n| [0141-linked-list-cycle](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0141-linked-list-cycle) |\n| [0151-reverse-words-in-a-string](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0151-reverse-words-in-a-string) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [2149-rearrange-array-elements-by-sign](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/2149-rearrange-array-elements-by-sign) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0015-3sum) |\n| [0075-sort-colors](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0075-sort-colors) |\n| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |\n| [1464-maximum-product-of-two-elements-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1464-maximum-product-of-two-elements-in-an-array) |\n## Binary Search\n|  |\n| ------- |\n| [0074-search-a-2d-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0074-search-a-2d-matrix) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |\n## Hash Table\n|  |\n| ------- |\n| [0012-integer-to-roman](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0013-roman-to-integer) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0141-linked-list-cycle](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0141-linked-list-cycle) |\n| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |\n| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |\n| [0053-maximum-subarray](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0053-maximum-subarray) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0191-number-of-1-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0191-number-of-1-bits) |\n| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |\n| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |\n| [1046-last-stone-weight](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1046-last-stone-weight) |\n| [1464-maximum-product-of-two-elements-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1464-maximum-product-of-two-elements-in-an-array) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n## Counting\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n## Quickselect\n|  |\n| ------- |\n| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |\n| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |\n| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0002-add-two-numbers) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |\n| [0024-swap-nodes-in-pairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0024-swap-nodes-in-pairs) |\n| [0141-linked-list-cycle](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0141-linked-list-cycle) |\n| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |\n| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |\n| [1290-convert-binary-number-in-a-linked-list-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1290-convert-binary-number-in-a-linked-list-to-integer) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0002-add-two-numbers) |\n| [0012-integer-to-roman](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0013-roman-to-integer) |\n| [0050-powx-n](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0050-powx-n) |\n| [0070-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0070-climbing-stairs) |\n| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |\n| [0326-power-of-three](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0326-power-of-three) |\n| [0342-power-of-four](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0342-power-of-four) |\n| [0371-sum-of-two-integers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0371-sum-of-two-integers) |\n| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |\n| [1290-convert-binary-number-in-a-linked-list-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1290-convert-binary-number-in-a-linked-list-to-integer) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0002-add-two-numbers) |\n| [0024-swap-nodes-in-pairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0024-swap-nodes-in-pairs) |\n| [0050-powx-n](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0050-powx-n) |\n| [0326-power-of-three](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0326-power-of-three) |\n| [0342-power-of-four](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0342-power-of-four) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0053-maximum-subarray](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0053-maximum-subarray) |\n| [0070-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0070-climbing-stairs) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0338-counting-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0338-counting-bits) |\n| [0746-min-cost-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0746-min-cost-climbing-stairs) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0191-number-of-1-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0191-number-of-1-bits) |\n| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |\n| [0338-counting-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0338-counting-bits) |\n| [0342-power-of-four](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0342-power-of-four) |\n| [0371-sum-of-two-integers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0371-sum-of-two-integers) |\n## Stack\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0155-min-stack) |\n| [1021-remove-outermost-parentheses](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1021-remove-outermost-parentheses) |\n## Design\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0155-min-stack) |\n| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |\n| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |\n| [0933-number-of-recent-calls](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0933-number-of-recent-calls) |\n## Matrix\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0054-spiral-matrix) |\n| [0074-search-a-2d-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0074-search-a-2d-matrix) |\n## Simulation\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0054-spiral-matrix) |\n| [2149-rearrange-array-elements-by-sign](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/2149-rearrange-array-elements-by-sign) |\n## String\n|  |\n| ------- |\n| [0012-integer-to-roman](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0014-longest-common-prefix) |\n| [0151-reverse-words-in-a-string](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0151-reverse-words-in-a-string) |\n| [1021-remove-outermost-parentheses](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1021-remove-outermost-parentheses) |\n## Hash Function\n|  |\n| ------- |\n| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |\n| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |\n## Queue\n|  |\n| ------- |\n| [0933-number-of-recent-calls](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0933-number-of-recent-calls) |\n## Data Stream\n|  |\n| ------- |\n| [0933-number-of-recent-calls](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0933-number-of-recent-calls) |\n## Tree\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0450-delete-node-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0450-delete-node-in-a-bst) |\n| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |\n| [0701-insert-into-a-binary-search-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0701-insert-into-a-binary-search-tree) |\n| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |\n## Depth-First Search\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |\n| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |\n| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0450-delete-node-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0450-delete-node-in-a-bst) |\n| [0701-insert-into-a-binary-search-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0701-insert-into-a-binary-search-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0450-delete-node-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0450-delete-node-in-a-bst) |\n| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |\n| [0701-insert-into-a-binary-search-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0701-insert-into-a-binary-search-tree) |\n| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |\n| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |\n| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |\n| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0014-longest-common-prefix) |\n## Geometry\n|  |\n| ------- |\n| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |\n## Merge Sort\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0070-climbing-stairs) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkunal-ladhani%2Fleetcodesolutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkunal-ladhani%2Fleetcodesolutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkunal-ladhani%2Fleetcodesolutions/lists"}