KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#typescript #ai-agents #cli #claude-code #codex #developer-tools #dsh-plugin #deepseek-harness #windows #open-source #agent-skills #ai

LeetCode-Solutions

★ 97 Open GitHub ↗

This are the Collections of LeetCode , GFG questions that I have solved till now!! [Note: This repository gets updated daily with new questions]

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# LeetCode & GFG-Solutions
*This are the Collections of LeetCode , GFG questions that I have solved till now!! **[Note: This repository gets updated daily with new questions]***

## License

```
MIT License

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

```
Basically it means you can do whatever you want with this repo ;)

# LeetCode Topics
## Array
|  |
| ------- |
| [0152-maximum-product-subarray](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0152-maximum-product-subarray) |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
| [1207-delete-nodes-and-return-forest](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1240-stone-game-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [1720-crawler-log-folder](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1720-crawler-log-folder) |
| [1741-sort-array-by-increasing-frequency](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1741-sort-array-by-increasing-frequency) |
| [1803-average-waiting-time](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1803-average-waiting-time) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
| [2681-put-marbles-in-bags](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |
## Simulation
|  |
| ------- |
| [1803-average-waiting-time](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1803-average-waiting-time) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
## String
|  |
| ------- |
| [0273-integer-to-english-words](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0273-integer-to-english-words) |
| [1060-longest-repeating-substring](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1060-longest-repeating-substring) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1720-crawler-log-folder](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1756-minimum-deletions-to-make-string-balanced) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Stack
|  |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [1298-reverse-substrings-between-each-pair-of-parentheses](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1298-reverse-substrings-between-each-pair-of-parentheses) |
| [1720-crawler-log-folder](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1720-crawler-log-folder) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1756-minimum-deletions-to-make-string-balanced) |
## Math
|  |
| ------- |
| [0264-ugly-number-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [0273-integer-to-english-words](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0273-integer-to-english-words) |
| [1240-stone-game-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
## Recursion
|  |
| ------- |
| [0025-reverse-nodes-in-k-group](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0025-reverse-nodes-in-k-group) |
| [0273-integer-to-english-words](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0273-integer-to-english-words) |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
## Queue
|  |
| ------- |
| [1951-find-the-winner-of-the-circular-game](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1951-find-the-winner-of-the-circular-game) |
## Tree
|  |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [1207-delete-nodes-and-return-forest](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
## Depth-First Search
|  |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [1207-delete-nodes-and-return-forest](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
## Binary Tree
|  |
| ------- |
| [0145-binary-tree-postorder-traversal](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0145-binary-tree-postorder-traversal) |
| [1207-delete-nodes-and-return-forest](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1653-number-of-good-leaf-nodes-pairs](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1653-number-of-good-leaf-nodes-pairs) |
| [2217-step-by-step-directions-from-a-binary-tree-node-to-another](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2217-step-by-step-directions-from-a-binary-tree-node-to-another) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
## Hash Table
|  |
| ------- |
| [0138-copy-list-with-random-pointer](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0138-copy-list-with-random-pointer) |
| [0264-ugly-number-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [1207-delete-nodes-and-return-forest](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1207-delete-nodes-and-return-forest) |
| [1741-sort-array-by-increasing-frequency](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1741-sort-array-by-increasing-frequency) |
| [2306-create-binary-tree-from-descriptions](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2306-create-binary-tree-from-descriptions) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Sorting
|  |
| ------- |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
| [1741-sort-array-by-increasing-frequency](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1741-sort-array-by-increasing-frequency) |
| [2681-put-marbles-in-bags](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Dynamic Programming
|  |
| ------- |
| [0152-maximum-product-subarray](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0152-maximum-product-subarray) |
| [0264-ugly-number-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [1060-longest-repeating-substring](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1060-longest-repeating-substring) |
| [1240-stone-game-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [1756-minimum-deletions-to-make-string-balanced](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1756-minimum-deletions-to-make-string-balanced) |
## Graph
|  |
| ------- |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2803-modify-graph-edge-weights](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |
## Shortest Path
|  |
| ------- |
| [1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance) |
| [2803-modify-graph-edge-weights](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |
## Binary Search
|  |
| ------- |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
| [1060-longest-repeating-substring](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1060-longest-repeating-substring) |
## Rolling Hash
|  |
| ------- |
| [1060-longest-repeating-substring](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1060-longest-repeating-substring) |
## Suffix Array
|  |
| ------- |
| [1060-longest-repeating-substring](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1060-longest-repeating-substring) |
## Hash Function
|  |
| ------- |
| [1060-longest-repeating-substring](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1060-longest-repeating-substring) |
## Sliding Window
|  |
| ------- |
| [2255-minimum-swaps-to-group-all-1s-together-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2255-minimum-swaps-to-group-all-1s-together-ii) |
## Greedy
|  |
| ------- |
| [2681-put-marbles-in-bags](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Counting
|  |
| ------- |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Linked List
|  |
| ------- |
| [0025-reverse-nodes-in-k-group](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0025-reverse-nodes-in-k-group) |
| [0138-copy-list-with-random-pointer](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0138-copy-list-with-random-pointer) |
## Two Pointers
|  |
| ------- |
| [0719-find-k-th-smallest-pair-distance](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0719-find-k-th-smallest-pair-distance) |
## Heap (Priority Queue)
|  |
| ------- |
| [0264-ugly-number-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/0264-ugly-number-ii) |
| [2681-put-marbles-in-bags](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2681-put-marbles-in-bags) |
| [2803-modify-graph-edge-weights](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/2803-modify-graph-edge-weights) |
## Breadth-First Search
|  |
| ------- |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
## Matrix
|  |
| ------- |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
## Strongly Connected Component
|  |
| ------- |
| [1691-minimum-number-of-days-to-disconnect-island](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1691-minimum-number-of-days-to-disconnect-island) |
## Prefix Sum
|  |
| ------- |
| [1240-stone-game-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1240-stone-game-ii) |
## Game Theory
|  |
| ------- |
| [1240-stone-game-ii](https://github.com/Jatin-Shihora/LeetCode-Solutions/tree/master/1240-stone-game-ii) |

LeetCode-Solutions

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README