https://github.com/kunal-ladhani/leetcodesolutions
Collection of LeetCode questions to ace the coding interview!
https://github.com/kunal-ladhani/leetcodesolutions
dsa dsa-algorithm dsa-practice dsalgo java leetcode-java leetcode-solutions leetocde
Last synced: about 1 month ago
JSON representation
Collection of LeetCode questions to ace the coding interview!
- Host: GitHub
- URL: https://github.com/kunal-ladhani/leetcodesolutions
- Owner: Kunal-Ladhani
- Created: 2023-02-22T18:54:12.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2026-04-24T16:35:59.000Z (about 1 month ago)
- Last Synced: 2026-04-24T18:26:33.848Z (about 1 month ago)
- Topics: dsa, dsa-algorithm, dsa-practice, dsalgo, java, leetcode-java, leetcode-solutions, leetocde
- Language: Java
- Homepage:
- Size: 369 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# leetcodeSolutions
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)
# LeetCode Topics
## Array
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0014-longest-common-prefix) |
| [0015-3sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0015-3sum) |
| [0053-maximum-subarray](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0054-spiral-matrix) |
| [0074-search-a-2d-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0075-sort-colors) |
| [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) |
| [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) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
| [0485-max-consecutive-ones](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0485-max-consecutive-ones) |
| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |
| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |
| [0746-min-cost-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0746-min-cost-climbing-stairs) |
| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |
| [1046-last-stone-weight](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1046-last-stone-weight) |
| [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) |
| [2149-rearrange-array-elements-by-sign](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/2149-rearrange-array-elements-by-sign) |
## Two Pointers
| |
| ------- |
| [0015-3sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0015-3sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0075-sort-colors](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0075-sort-colors) |
| [0141-linked-list-cycle](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0141-linked-list-cycle) |
| [0151-reverse-words-in-a-string](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0151-reverse-words-in-a-string) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [2149-rearrange-array-elements-by-sign](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/2149-rearrange-array-elements-by-sign) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0015-3sum) |
| [0075-sort-colors](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0075-sort-colors) |
| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |
| [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) |
## Binary Search
| |
| ------- |
| [0074-search-a-2d-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0074-search-a-2d-matrix) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |
## Hash Table
| |
| ------- |
| [0012-integer-to-roman](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0013-roman-to-integer) |
| [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) |
| [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) |
| [0141-linked-list-cycle](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0141-linked-list-cycle) |
| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |
| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |
## Divide and Conquer
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |
| [0053-maximum-subarray](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0053-maximum-subarray) |
| [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) |
| [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) |
| [0191-number-of-1-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0191-number-of-1-bits) |
| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |
| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |
| [1046-last-stone-weight](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1046-last-stone-weight) |
| [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) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
## Counting
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
## Quickselect
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0347-top-k-frequent-elements) |
| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |
| [0024-swap-nodes-in-pairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0024-swap-nodes-in-pairs) |
| [0141-linked-list-cycle](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0141-linked-list-cycle) |
| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |
| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |
| [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) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0002-add-two-numbers) |
| [0012-integer-to-roman](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0013-roman-to-integer) |
| [0050-powx-n](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0050-powx-n) |
| [0070-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0070-climbing-stairs) |
| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |
| [0326-power-of-three](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0342-power-of-four) |
| [0371-sum-of-two-integers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0371-sum-of-two-integers) |
| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |
| [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) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0002-add-two-numbers) |
| [0024-swap-nodes-in-pairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0024-swap-nodes-in-pairs) |
| [0050-powx-n](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0050-powx-n) |
| [0326-power-of-three](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0326-power-of-three) |
| [0342-power-of-four](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0342-power-of-four) |
## Dynamic Programming
| |
| ------- |
| [0053-maximum-subarray](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0053-maximum-subarray) |
| [0070-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0070-climbing-stairs) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0338-counting-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0338-counting-bits) |
| [0746-min-cost-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0746-min-cost-climbing-stairs) |
## Bit Manipulation
| |
| ------- |
| [0191-number-of-1-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0191-number-of-1-bits) |
| [0268-missing-number](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0268-missing-number) |
| [0338-counting-bits](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0338-counting-bits) |
| [0342-power-of-four](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0342-power-of-four) |
| [0371-sum-of-two-integers](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0371-sum-of-two-integers) |
## Stack
| |
| ------- |
| [0155-min-stack](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0155-min-stack) |
| [1021-remove-outermost-parentheses](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1021-remove-outermost-parentheses) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0155-min-stack) |
| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |
| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |
| [0933-number-of-recent-calls](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0933-number-of-recent-calls) |
## Matrix
| |
| ------- |
| [0054-spiral-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0054-spiral-matrix) |
| [0074-search-a-2d-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0074-search-a-2d-matrix) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0054-spiral-matrix) |
| [2149-rearrange-array-elements-by-sign](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/2149-rearrange-array-elements-by-sign) |
## String
| |
| ------- |
| [0012-integer-to-roman](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0014-longest-common-prefix) |
| [0151-reverse-words-in-a-string](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0151-reverse-words-in-a-string) |
| [1021-remove-outermost-parentheses](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1021-remove-outermost-parentheses) |
## Hash Function
| |
| ------- |
| [0705-design-hashset](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0705-design-hashset) |
| [0706-design-hashmap](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0706-design-hashmap) |
## Queue
| |
| ------- |
| [0933-number-of-recent-calls](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0933-number-of-recent-calls) |
## Data Stream
| |
| ------- |
| [0933-number-of-recent-calls](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0933-number-of-recent-calls) |
## Tree
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |
| [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) |
| [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) |
| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0450-delete-node-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0450-delete-node-in-a-bst) |
| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |
| [0701-insert-into-a-binary-search-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0701-insert-into-a-binary-search-tree) |
| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |
## Depth-First Search
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |
| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |
| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |
## Binary Search Tree
| |
| ------- |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0450-delete-node-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0450-delete-node-in-a-bst) |
| [0701-insert-into-a-binary-search-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0701-insert-into-a-binary-search-tree) |
## Binary Tree
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |
| [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) |
| [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) |
| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0450-delete-node-in-a-bst](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0450-delete-node-in-a-bst) |
| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |
| [0701-insert-into-a-binary-search-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0701-insert-into-a-binary-search-tree) |
| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |
## Breadth-First Search
| |
| ------- |
| [0101-symmetric-tree](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0101-symmetric-tree) |
| [0112-path-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0112-path-sum) |
| [0617-merge-two-binary-trees](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0617-merge-two-binary-trees) |
| [1302-deepest-leaves-sum](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/1302-deepest-leaves-sum) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0014-longest-common-prefix) |
## Geometry
| |
| ------- |
| [0973-k-closest-points-to-origin](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0973-k-closest-points-to-origin) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0023-merge-k-sorted-lists) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/Kunal-Ladhani/leetcodeSolutions/tree/master/0070-climbing-stairs) |