https://github.com/karthikrshet/karthik-leetcode-solutions
Solutions to LeetCode coding challenges solved during Software Engineering interview preparation. Includes Java implementations with optimized approaches and problem explanations.
https://github.com/karthikrshet/karthik-leetcode-solutions
dsa-algorithm dsa-learning-series dsa-practice leetcode leetcode-java leetcode-javascript leetcode-python leetcode-python3 leetcode-questions leetcode-solutions
Last synced: 1 day ago
JSON representation
Solutions to LeetCode coding challenges solved during Software Engineering interview preparation. Includes Java implementations with optimized approaches and problem explanations.
- Host: GitHub
- URL: https://github.com/karthikrshet/karthik-leetcode-solutions
- Owner: karthikrshet
- Created: 2026-07-01T15:16:09.000Z (23 days ago)
- Default Branch: main
- Last Pushed: 2026-07-16T20:56:54.000Z (8 days ago)
- Last Synced: 2026-07-16T21:11:04.617Z (8 days ago)
- Topics: dsa-algorithm, dsa-learning-series, dsa-practice, leetcode, leetcode-java, leetcode-javascript, leetcode-python, leetcode-python3, leetcode-questions, leetcode-solutions
- Language: Java
- Homepage: https://karthik-rajesh-shet.vercel.app/
- Size: 191 KB
- Stars: 1
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Solutions 🚀
Welcome to my LeetCode solutions repository!
This repository contains my solutions to LeetCode problems solved as part of my Data Structures & Algorithms (DSA) practice and Software Engineering interview preparation. The solutions are primarily implemented in **Java** and cover a wide range of topics including arrays, strings, linked lists, trees, graphs, dynamic programming, greedy algorithms, and more.
## 🎯 Objectives
* Strengthen problem-solving and analytical thinking skills
* Master Data Structures and Algorithms
* Prepare for Software Development Engineer (SDE) interviews
* Build consistency through daily coding practice
* Track learning progress over time
## 🛠️ Tech Stack
* Java
* Data Structures & Algorithms
* LeetCode Platform
* Git & GitHub
* LeetHub v2 (Automatic Solution Sync)
## 📚 Topics Covered
* Arrays & Strings
* Linked Lists
* Stacks & Queues
* Hash Tables
* Trees & Binary Trees
* Binary Search Trees
* Heaps & Priority Queues
* Graphs
* Recursion & Backtracking
* Dynamic Programming
* Greedy Algorithms
* Sliding Window
* Two Pointers
* Binary Search
* Bit Manipulation
* Sorting & Searching
## 📈 Progress
I continuously update this repository as I solve new problems and improve my understanding of algorithms and data structures.
## 🔗 Profiles
* GitHub: https://github.com/karthikrshet
* LinkedIn: https://www.linkedin.com/in/karthik-rajesh-shet
* Portfolio: https://karthik-rajesh-shet.vercel.app
## ⭐ Note
This repository serves as a personal learning archive and interview preparation resource. Solutions may include multiple approaches with varying time and space complexities where applicable.
Happy Coding! 🚀
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0011-container-with-most-water) |
| [0014-longest-common-prefix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0014-longest-common-prefix) |
| [0015-3sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0027-remove-element) |
| [0031-next-permutation](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0031-next-permutation) |
| [0033-search-in-rotated-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0035-search-insert-position) |
| [0036-valid-sudoku](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0040-combination-sum-ii) |
| [0041-first-missing-positive](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0041-first-missing-positive) |
| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0045-jump-game-ii) |
| [0047-permutations-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0047-permutations-ii) |
| [0048-rotate-image](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |
| [0051-n-queens](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0051-n-queens) |
| [0053-maximum-subarray](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0056-merge-intervals) |
| [0057-insert-interval](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0057-insert-interval) |
| [0059-spiral-matrix-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |
| [0063-unique-paths-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0064-minimum-path-sum) |
| [0066-plus-one](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0066-plus-one) |
| [0068-text-justification](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0068-text-justification) |
| [0073-set-matrix-zeroes](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0075-sort-colors) |
| [0078-subsets](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0084-largest-rectangle-in-histogram](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |
| [0088-merge-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0088-merge-sorted-array) |
| [0090-subsets-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0090-subsets-ii) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |
| [1260-shift-2d-grid](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1260-shift-2d-grid) |
| [1288-remove-covered-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1288-remove-covered-intervals) |
| [1301-number-of-paths-with-max-score](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1301-number-of-paths-with-max-score) |
| [1979-find-greatest-common-divisor-of-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1979-find-greatest-common-divisor-of-array) |
| [2126-destroying-asteroids](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2126-destroying-asteroids) |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |
| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |
| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0033-search-in-rotated-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0069-sqrtx) |
| [0074-search-a-2d-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |
| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |
| [0053-maximum-subarray](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0053-maximum-subarray) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0190-reverse-bits](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0190-reverse-bits) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0086-partition-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0086-partition-list) |
| [0088-merge-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0088-merge-sorted-array) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |
## String
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0005-longest-palindromic-substring) |
| [0006-zigzag-conversion](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0006-zigzag-conversion) |
| [0008-string-to-integer-atoi](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0008-string-to-integer-atoi) |
| [0010-regular-expression-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0010-regular-expression-matching) |
| [0012-integer-to-roman](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0014-longest-common-prefix) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0020-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0020-valid-parentheses) |
| [0022-generate-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0030-substring-with-concatenation-of-all-words](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0030-substring-with-concatenation-of-all-words) |
| [0032-longest-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0032-longest-valid-parentheses) |
| [0038-count-and-say](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0038-count-and-say) |
| [0043-multiply-strings](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0043-multiply-strings) |
| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |
| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |
| [0058-length-of-last-word](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0058-length-of-last-word) |
| [0065-valid-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0065-valid-number) |
| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |
| [0068-text-justification](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0068-text-justification) |
| [0071-simplify-path](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0071-simplify-path) |
| [0072-edit-distance](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0072-edit-distance) |
| [0076-minimum-window-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0076-minimum-window-substring) |
| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |
| [0087-scramble-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0087-scramble-string) |
| [0091-decode-ways](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0091-decode-ways) |
| [0093-restore-ip-addresses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0093-restore-ip-addresses) |
| [0097-interleaving-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0097-interleaving-string) |
| [0168-excel-sheet-column-title](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0168-excel-sheet-column-title) |
| [0227-basic-calculator-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0227-basic-calculator-ii) |
| [3499-maximize-active-section-with-trade-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3499-maximize-active-section-with-trade-i) |
| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |
| [3756-concatenate-non-zero-digits-and-multiply-by-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0005-longest-palindromic-substring) |
| [0010-regular-expression-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0010-regular-expression-matching) |
| [0022-generate-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0022-generate-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |
| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0045-jump-game-ii) |
| [0053-maximum-subarray](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0055-jump-game) |
| [0062-unique-paths](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0062-unique-paths) |
| [0063-unique-paths-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0064-minimum-path-sum) |
| [0070-climbing-stairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0070-climbing-stairs) |
| [0072-edit-distance](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0072-edit-distance) |
| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |
| [0087-scramble-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0087-scramble-string) |
| [0091-decode-ways](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0091-decode-ways) |
| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |
| [0097-interleaving-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0097-interleaving-string) |
| [1301-number-of-paths-with-max-score](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1301-number-of-paths-with-max-score) |
| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
## Math
| |
| ------- |
| [0007-reverse-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0009-palindrome-number) |
| [0012-integer-to-roman](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0029-divide-two-integers) |
| [0043-multiply-strings](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0043-multiply-strings) |
| [0048-rotate-image](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0050-powx-n) |
| [0060-permutation-sequence](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0060-permutation-sequence) |
| [0062-unique-paths](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0062-unique-paths) |
| [0066-plus-one](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |
| [0069-sqrtx](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0070-climbing-stairs) |
| [0089-gray-code](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0089-gray-code) |
| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |
| [0168-excel-sheet-column-title](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0168-excel-sheet-column-title) |
| [0227-basic-calculator-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0227-basic-calculator-ii) |
| [1979-find-greatest-common-divisor-of-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1979-find-greatest-common-divisor-of-array) |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |
| [3658-gcd-of-odd-and-even-sums](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3658-gcd-of-odd-and-even-sums) |
| [3754-concatenate-non-zero-digits-and-multiply-by-sum-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3754-concatenate-non-zero-digits-and-multiply-by-sum-i) |
| [3756-concatenate-non-zero-digits-and-multiply-by-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii) |
| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |
## Recursion
| |
| ------- |
| [0010-regular-expression-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0010-regular-expression-matching) |
| [0021-merge-two-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0025-reverse-nodes-in-k-group) |
| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |
| [0050-powx-n](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0050-powx-n) |
| [0060-permutation-sequence](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0060-permutation-sequence) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0011-container-with-most-water) |
| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |
| [0045-jump-game-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0055-jump-game) |
| [2126-destroying-asteroids](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2126-destroying-asteroids) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0001-two-sum) |
| [0012-integer-to-roman](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0030-substring-with-concatenation-of-all-words](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0030-substring-with-concatenation-of-all-words) |
| [0036-valid-sudoku](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |
| [0041-first-missing-positive](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0041-first-missing-positive) |
| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |
| [0073-set-matrix-zeroes](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0073-set-matrix-zeroes) |
| [0076-minimum-window-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0076-minimum-window-substring) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0014-longest-common-prefix) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0018-4sum) |
| [0047-permutations-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0047-permutations-ii) |
| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |
| [0056-merge-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0056-merge-intervals) |
| [0075-sort-colors](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0088-merge-sorted-array) |
| [1288-remove-covered-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1288-remove-covered-intervals) |
| [2126-destroying-asteroids](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2126-destroying-asteroids) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |
## Backtracking
| |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0022-generate-parentheses) |
| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |
| [0039-combination-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0040-combination-sum-ii) |
| [0047-permutations-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0047-permutations-ii) |
| [0051-n-queens](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0051-n-queens) |
| [0052-n-queens-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0052-n-queens-ii) |
| [0077-combinations](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0077-combinations) |
| [0078-subsets](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0078-subsets) |
| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |
| [0089-gray-code](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0089-gray-code) |
| [0090-subsets-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0090-subsets-ii) |
| [0093-restore-ip-addresses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0093-restore-ip-addresses) |
| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |
## Linked List
| |
| ------- |
| [0019-remove-nth-node-from-end-of-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0021-merge-two-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |
| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0025-reverse-nodes-in-k-group) |
| [0061-rotate-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0086-partition-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0086-partition-list) |
| [0092-reverse-linked-list-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0092-reverse-linked-list-ii) |
| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |
## Depth-First Search
| |
| ------- |
| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |
| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0129-sum-root-to-leaf-numbers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0129-sum-root-to-leaf-numbers) |
| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |
## Union-Find
| |
| ------- |
| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |
| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |
## Matrix
| |
| ------- |
| [0036-valid-sudoku](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0036-valid-sudoku) |
| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |
| [0048-rotate-image](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |
| [0063-unique-paths-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0063-unique-paths-ii) |
| [0064-minimum-path-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0064-minimum-path-sum) |
| [0073-set-matrix-zeroes](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |
| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |
| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |
| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |
| [1260-shift-2d-grid](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1260-shift-2d-grid) |
| [1301-number-of-paths-with-max-score](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1301-number-of-paths-with-max-score) |
## Design
| |
| ------- |
| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |
## Doubly-Linked List
| |
| ------- |
| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |
## Prefix Sum
| |
| ------- |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
| [3756-concatenate-non-zero-digits-and-multiply-by-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii) |
## Graph Theory
| |
| ------- |
| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |
| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |
| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0029-divide-two-integers) |
| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |
| [0078-subsets](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0078-subsets) |
| [0089-gray-code](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0089-gray-code) |
| [0090-subsets-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0090-subsets-ii) |
| [0190-reverse-bits](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0190-reverse-bits) |
| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0020-valid-parentheses) |
| [0032-longest-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0032-longest-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |
| [0071-simplify-path](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0071-simplify-path) |
| [0084-largest-rectangle-in-histogram](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |
| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0227-basic-calculator-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0227-basic-calculator-ii) |
## Enumeration
| |
| ------- |
| [1291-sequential-digits](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1291-sequential-digits) |
| [3499-maximize-active-section-with-trade-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3499-maximize-active-section-with-trade-i) |
## Number Theory
| |
| ------- |
| [1979-find-greatest-common-divisor-of-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1979-find-greatest-common-divisor-of-array) |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |
| [3658-gcd-of-odd-and-even-sums](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3658-gcd-of-odd-and-even-sums) |
| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |
## Simulation
| |
| ------- |
| [0043-multiply-strings](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0043-multiply-strings) |
| [0054-spiral-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |
| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |
| [0068-text-justification](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0068-text-justification) |
| [1260-shift-2d-grid](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1260-shift-2d-grid) |
| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |
## Combinatorics
| |
| ------- |
| [0062-unique-paths](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0062-unique-paths) |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
## Counting
| |
| ------- |
| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0129-sum-root-to-leaf-numbers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0129-sum-root-to-leaf-numbers) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |
| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |
| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0129-sum-root-to-leaf-numbers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0129-sum-root-to-leaf-numbers) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0070-climbing-stairs) |
## Segment Tree
| |
| ------- |
| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
## Sliding Window
| |
| ------- |
| [0030-substring-with-concatenation-of-all-words](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0030-substring-with-concatenation-of-all-words) |
| [0076-minimum-window-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0076-minimum-window-substring) |
## Binary Search Tree
| |
| ------- |
| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |
| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |
| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |