LeetCode Solutions 📝

Welcome to my curated repository of LeetCode solutions! 💻🚀

📂 Directory Structure

Organized by language and topics for easier navigation:

leetcode/
├── cpp/                 ⚙️ C++ Solutions
│   ├── array/           📊 Array problems
│   ├── binary-search/   🔍 Binary Search problems
│   ├── dp/              🧠 Dynamic Programming
│   └── ...              🔄 Other categories
├── python/              🐍 Python Solutions
├── sql/                 🗄️ SQL Solutions
├── js/                  📜 JavaScript Solutions
└── README.md            📝 Project overview

💡 Run the included organize_workspace.bat script to automatically organize files by language!

🚀 How to Use

Clone the repo:

git clone https://github.com/LSUDOKO/leetcode.git
cd leetcode

Run the organization script:
```
organize_workspace.bat
```
Run your solution:
- C++: g++ -std=c++17 cpp/array/1-Two-Sum.cpp -o TwoSum && TwoSum
- Python: python python/1-Two-Sum.py
- SQL: Open .sql file in your database client
- JavaScript: node js/2667-Create-Hello-World-Function.js

💡 Problem Categories

Array Problems 📊

Dynamic Programming 🧠

0152-maximum-product-subarray

Binary Search 🔍

🤝 Contribute

Want to contribute? That's great! Here's how:

Fork this repo ❤️
Create a branch: git checkout -b feat/new-solution
Add your solution into the correct folder ✨
Commit & push 🎉
Open a Pull Request 👍

🏆 My LeetCode Stats

📄 License

This project is licensed under the MIT License 🔓

LeetCode Topics

Tree


0098-validate-binary-search-tree
0099-recover-binary-search-tree
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Binary Search Tree


0098-validate-binary-search-tree
0099-recover-binary-search-tree
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Binary Tree


0098-validate-binary-search-tree
0099-recover-binary-search-tree
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Depth-First Search


0098-validate-binary-search-tree
0099-recover-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0547-number-of-provinces
0799-minimum-distance-between-bst-nodes
0871-keys-and-rooms
0933-increasing-order-search-tree
0975-range-sum-of-bst

Breadth-First Search


0530-minimum-absolute-difference-in-bst
0547-number-of-provinces
0799-minimum-distance-between-bst-nodes
0871-keys-and-rooms
3271-count-the-number-of-houses-at-a-certain-distance-i

Stack


0173-binary-search-tree-iterator
0933-increasing-order-search-tree
1021-remove-outermost-parentheses
1208-maximum-nesting-depth-of-two-valid-parentheses-strings
1541-minimum-insertions-to-balance-a-parentheses-string
1737-maximum-nesting-depth-of-the-parentheses

Binary Lifting


0235-lowest-common-ancestor-of-a-binary-search-tree

Lowest Common Ancestor


0235-lowest-common-ancestor-of-a-binary-search-tree

Design


0173-binary-search-tree-iterator

Iterator


0173-binary-search-tree-iterator

Graph Theory


0547-number-of-provinces
0871-keys-and-rooms
3271-count-the-number-of-houses-at-a-certain-distance-i

Union-Find


0547-number-of-provinces

Hash Table


1644-maximum-number-of-non-overlapping-substrings
4020-lexicographically-smallest-permutation-greater-than-target

String


1021-remove-outermost-parentheses
1208-maximum-nesting-depth-of-two-valid-parentheses-strings
1341-split-a-string-in-balanced-strings
1541-minimum-insertions-to-balance-a-parentheses-string
1644-maximum-number-of-non-overlapping-substrings
1737-maximum-nesting-depth-of-the-parentheses
4020-lexicographically-smallest-permutation-greater-than-target
4037-lexicographically-smallest-palindromic-permutation-greater-than-target

Greedy


1341-split-a-string-in-balanced-strings
1541-minimum-insertions-to-balance-a-parentheses-string
1644-maximum-number-of-non-overlapping-substrings
4020-lexicographically-smallest-permutation-greater-than-target

Counting


1341-split-a-string-in-balanced-strings
4020-lexicographically-smallest-permutation-greater-than-target

Enumeration


4020-lexicographically-smallest-permutation-greater-than-target
4037-lexicographically-smallest-palindromic-permutation-greater-than-target

Two Pointers


4037-lexicographically-smallest-palindromic-permutation-greater-than-target

Linked List


2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points

Prefix Sum


3271-count-the-number-of-houses-at-a-certain-distance-i

Math


0866-rectangle-overlap
1501-circle-and-rectangle-overlapping
4245-count-commas-in-range
4248-count-commas-in-range-ii

Geometry


0866-rectangle-overlap
1501-circle-and-rectangle-overlapping

Sorting


1644-maximum-number-of-non-overlapping-substrings

Bracket Sequences


1021-remove-outermost-parentheses
1208-maximum-nesting-depth-of-two-valid-parentheses-strings
1541-minimum-insertions-to-balance-a-parentheses-string
1737-maximum-nesting-depth-of-the-parentheses

Name		Name	Last commit message	Last commit date
0022-generate-parentheses		0022-generate-parentheses
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position		0035-search-insert-position
0056-merge-intervals		0056-merge-intervals
0057-insert-interval		0057-insert-interval
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0099-recover-binary-search-tree		0099-recover-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0122-best-time-to-buy-and-sell-stock-ii		0122-best-time-to-buy-and-sell-stock-ii
0130-surrounded-regions		0130-surrounded-regions
0152-maximum-product-subarray		0152-maximum-product-subarray
0173-binary-search-tree-iterator		0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree		0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst		0450-delete-node-in-a-bst
0455-assign-cookies		0455-assign-cookies
0493-reverse-pairs		0493-reverse-pairs
0501-find-mode-in-binary-search-tree		0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst		0530-minimum-absolute-difference-in-bst
0542-01-matrix		0542-01-matrix
0547-number-of-provinces		0547-number-of-provinces
0678-valid-parenthesis-string		0678-valid-parenthesis-string
0733-flood-fill		0733-flood-fill
0792-binary-search		0792-binary-search
0799-minimum-distance-between-bst-nodes		0799-minimum-distance-between-bst-nodes
0866-rectangle-overlap		0866-rectangle-overlap
0871-keys-and-rooms		0871-keys-and-rooms
0890-lemonade-change		0890-lemonade-change
0933-increasing-order-search-tree		0933-increasing-order-search-tree
0975-range-sum-of-bst		0975-range-sum-of-bst
0977-distinct-subsequences-ii		0977-distinct-subsequences-ii
1021-remove-outermost-parentheses		1021-remove-outermost-parentheses
1036-rotting-oranges		1036-rotting-oranges
1050-construct-binary-search-tree-from-preorder-traversal		1050-construct-binary-search-tree-from-preorder-traversal
1073-number-of-enclaves		1073-number-of-enclaves
1117-as-far-from-land-as-possible		1117-as-far-from-land-as-possible
1208-maximum-nesting-depth-of-two-valid-parentheses-strings		1208-maximum-nesting-depth-of-two-valid-parentheses-strings
1298-reverse-substrings-between-each-pair-of-parentheses		1298-reverse-substrings-between-each-pair-of-parentheses
1341-split-a-string-in-balanced-strings		1341-split-a-string-in-balanced-strings
1349-check-if-it-is-a-straight-line		1349-check-if-it-is-a-straight-line
1501-circle-and-rectangle-overlapping		1501-circle-and-rectangle-overlapping
1541-minimum-insertions-to-balance-a-parentheses-string		1541-minimum-insertions-to-balance-a-parentheses-string
1644-maximum-number-of-non-overlapping-substrings		1644-maximum-number-of-non-overlapping-substrings
1725-number-of-sets-of-k-non-overlapping-line-segments		1725-number-of-sets-of-k-non-overlapping-line-segments
1737-maximum-nesting-depth-of-the-parentheses		1737-maximum-nesting-depth-of-the-parentheses
1829-maximum-units-on-a-truck		1829-maximum-units-on-a-truck
2002-stone-game-viii		2002-stone-game-viii
2035-count-sub-islands		2035-count-sub-islands
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points		2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2333-minimum-sum-of-squared-difference		2333-minimum-sum-of-squared-difference
2349-check-if-there-is-a-valid-parentheses-string-path		2349-check-if-there-is-a-valid-parentheses-string-path
2367-minimum-lines-to-represent-a-line-chart		2367-minimum-lines-to-represent-a-line-chart
2559-maximum-number-of-non-overlapping-palindrome-substrings		2559-maximum-number-of-non-overlapping-palindrome-substrings
2778-sum-of-squares-of-special-elements		2778-sum-of-squares-of-special-elements
3219-make-lexicographically-smallest-array-by-swapping-elements		3219-make-lexicographically-smallest-array-by-swapping-elements
3271-count-the-number-of-houses-at-a-certain-distance-i		3271-count-the-number-of-houses-at-a-certain-distance-i
3799-unique-3-digit-even-numbers		3799-unique-3-digit-even-numbers
3840-find-x-value-of-array-ii		3840-find-x-value-of-array-ii
3869-smallest-index-with-digit-sum-equal-to-index		3869-smallest-index-with-digit-sum-equal-to-index
4020-lexicographically-smallest-permutation-greater-than-target		4020-lexicographically-smallest-permutation-greater-than-target
4037-lexicographically-smallest-palindromic-permutation-greater-than-target		4037-lexicographically-smallest-palindromic-permutation-greater-than-target
4080-smallest-missing-multiple-of-k		4080-smallest-missing-multiple-of-k
4245-count-commas-in-range		4245-count-commas-in-range
4248-count-commas-in-range-ii		4248-count-commas-in-range-ii
4256-construct-uniform-parity-array-i		4256-construct-uniform-parity-array-i
4258-construct-uniform-parity-array-ii		4258-construct-uniform-parity-array-ii
4285-smallest-stable-index-ii		4285-smallest-stable-index-ii
cpp		cpp
js		js
python		python
sql		sql
100-same-tree.cpp		100-same-tree.cpp
1006_vowel_spellchecker.cpp		1006_vowel_spellchecker.cpp
1008-construct-binary-search-tree-from-preorder-traversal.cpp		1008-construct-binary-search-tree-from-preorder-traversal.cpp
101-symmetric-tree.cpp		101-symmetric-tree.cpp
1018_largest_perimeter_triangle.cpp		1018_largest_perimeter_triangle.cpp
1020-number-of-enclaves.cpp		1020-number-of-enclaves.cpp
1021-remove-outermost-parentheses.cpp		1021-remove-outermost-parentheses.cpp
103-binary-tree-zigzag-level-order-traversal.cpp		103-binary-tree-zigzag-level-order-traversal.cpp
1046-last-stone-weight.cpp		1046-last-stone-weight.cpp
1056_capacity_to_ship_packages_within_d_days.cpp		1056_capacity_to_ship_packages_within_d_days.cpp
107-binary-tree-level-order-traversal-ii.cpp		107-binary-tree-level-order-traversal-ii.cpp
1078_remove_outermost_parentheses.cpp		1078_remove_outermost_parentheses.cpp
108-convert-sorted-array-to-binary-search-tree.cpp		108-convert-sorted-array-to-binary-search-tree.cpp
110-balanced-binary-tree.cpp		110-balanced-binary-tree.cpp
111-minimum-depth-of-binary-tree.cpp		111-minimum-depth-of-binary-tree.cpp
1111-maximum-nesting-depth-of-two-valid-parentheses-strings.cpp		1111-maximum-nesting-depth-of-two-valid-parentheses-strings.cpp
1111_minimum_score_triangulation_of_polygon.cpp		1111_minimum_score_triangulation_of_polygon.cpp
112-path-sum.cpp		112-path-sum.cpp
1140-stone-game-ii.cpp		1140-stone-game-ii.cpp
1146_greatest_common_divisor_of_strings.cpp		1146_greatest_common_divisor_of_strings.cpp
115-distinct-subsequences.cpp		115-distinct-subsequences.cpp
116-populating-next-right-pointers-in-each-node.cpp		116-populating-next-right-pointers-in-each-node.cpp
1162-as-far-from-land-as-possible.cpp		1162-as-far-from-land-as-possible.cpp
1190-reverse-substrings-between-each-pair-of-parentheses.cpp		1190-reverse-substrings-between-each-pair-of-parentheses.cpp
1208_maximum_nesting_depth_of_two_valid_parentheses_strings.cpp		1208_maximum_nesting_depth_of_two_valid_parentheses_strings.cpp
122-best-time-to-buy-and-sell-stock-ii.cpp		122-best-time-to-buy-and-sell-stock-ii.cpp
1221-split-a-string-in-balanced-strings.cpp		1221-split-a-string-in-balanced-strings.cpp
1232-check-if-it-is-a-straight-line.cpp		1232-check-if-it-is-a-straight-line.cpp
1264_maximum_number_of_words_you_can_type.cpp		1264_maximum_number_of_words_you_can_type.cpp

Latest commit

History

Folders and files

Repository files navigation