https://github.com/mohith1306/leet_code
My leet code solutions
https://github.com/mohith1306/leet_code
c datastructures-algorithms java python3
Last synced: 2 months ago
JSON representation
My leet code solutions
- Host: GitHub
- URL: https://github.com/mohith1306/leet_code
- Owner: mohith1306
- Created: 2025-04-14T08:47:17.000Z (2 months ago)
- Default Branch: main
- Last Pushed: 2025-04-22T17:01:25.000Z (2 months ago)
- Last Synced: 2025-04-23T21:15:48.257Z (2 months ago)
- Topics: c, datastructures-algorithms, java, python3
- Language: Java
- Homepage:
- Size: 645 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 🚀 LeetCode Solutions
Welcome to my collection of **LeetCode** solutions! This repository contains efficient, clean, and well-documented solutions to problems I've solved on [LeetCode](https://leetcode.com/).
---
## 📚 About
This repo is my personal journey of solving LeetCode problems in preparation for coding interviews, improving problem-solving skills, and mastering data structures and algorithms.
Each solution includes:
- ✅ A clean, working implementation
- 🧠Explanation or strategy (where needed)
---
## 🛠Languages Used
- **Java** (Primary)
- Python (occasionally)
- C(occasionally)
---
# LeetCode Topics
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/mohith1306/Leet_code/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/mohith1306/Leet_code/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0024-swap-nodes-in-pairs](https://github.com/mohith1306/Leet_code/tree/master/0024-swap-nodes-in-pairs) |
| [0061-rotate-list](https://github.com/mohith1306/Leet_code/tree/master/0061-rotate-list) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/mohith1306/Leet_code/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0086-partition-list](https://github.com/mohith1306/Leet_code/tree/master/0086-partition-list) |
| [0141-linked-list-cycle](https://github.com/mohith1306/Leet_code/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/mohith1306/Leet_code/tree/master/0143-reorder-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/mohith1306/Leet_code/tree/master/0160-intersection-of-two-linked-lists) |
| [0203-remove-linked-list-elements](https://github.com/mohith1306/Leet_code/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0328-odd-even-linked-list) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/mohith1306/Leet_code/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/mohith1306/Leet_code/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/mohith1306/Leet_code/tree/master/0009-palindrome-number) |
| [0013-roman-to-integer](https://github.com/mohith1306/Leet_code/tree/master/0013-roman-to-integer) |
| [0043-multiply-strings](https://github.com/mohith1306/Leet_code/tree/master/0043-multiply-strings) |
| [0048-rotate-image](https://github.com/mohith1306/Leet_code/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/mohith1306/Leet_code/tree/master/0050-powx-n) |
| [0062-unique-paths](https://github.com/mohith1306/Leet_code/tree/master/0062-unique-paths) |
| [0066-plus-one](https://github.com/mohith1306/Leet_code/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/mohith1306/Leet_code/tree/master/0067-add-binary) |
| [0069-sqrtx](https://github.com/mohith1306/Leet_code/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/mohith1306/Leet_code/tree/master/0070-climbing-stairs) |
| [0150-evaluate-reverse-polish-notation](https://github.com/mohith1306/Leet_code/tree/master/0150-evaluate-reverse-polish-notation) |
| [0189-rotate-array](https://github.com/mohith1306/Leet_code/tree/master/0189-rotate-array) |
| [0224-basic-calculator](https://github.com/mohith1306/Leet_code/tree/master/0224-basic-calculator) |
| [0231-power-of-two](https://github.com/mohith1306/Leet_code/tree/master/0231-power-of-two) |
| [0233-number-of-digit-one](https://github.com/mohith1306/Leet_code/tree/master/0233-number-of-digit-one) |
| [0258-add-digits](https://github.com/mohith1306/Leet_code/tree/master/0258-add-digits) |
| [0268-missing-number](https://github.com/mohith1306/Leet_code/tree/master/0268-missing-number) |
| [0326-power-of-three](https://github.com/mohith1306/Leet_code/tree/master/0326-power-of-three) |
| [0412-fizz-buzz](https://github.com/mohith1306/Leet_code/tree/master/0412-fizz-buzz) |
| [0564-find-the-closest-palindrome](https://github.com/mohith1306/Leet_code/tree/master/0564-find-the-closest-palindrome) |
| [0633-sum-of-square-numbers](https://github.com/mohith1306/Leet_code/tree/master/0633-sum-of-square-numbers) |
| [0728-self-dividing-numbers](https://github.com/mohith1306/Leet_code/tree/master/0728-self-dividing-numbers) |
| [1013-fibonacci-number](https://github.com/mohith1306/Leet_code/tree/master/1013-fibonacci-number) |
| [3553-check-if-two-chessboard-squares-have-the-same-color](https://github.com/mohith1306/Leet_code/tree/master/3553-check-if-two-chessboard-squares-have-the-same-color) |
| [3567-convert-date-to-binary](https://github.com/mohith1306/Leet_code/tree/master/3567-convert-date-to-binary) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/mohith1306/Leet_code/tree/master/0002-add-two-numbers) |
| [0024-swap-nodes-in-pairs](https://github.com/mohith1306/Leet_code/tree/master/0024-swap-nodes-in-pairs) |
| [0050-powx-n](https://github.com/mohith1306/Leet_code/tree/master/0050-powx-n) |
| [0143-reorder-list](https://github.com/mohith1306/Leet_code/tree/master/0143-reorder-list) |
| [0203-remove-linked-list-elements](https://github.com/mohith1306/Leet_code/tree/master/0203-remove-linked-list-elements) |
| [0206-reverse-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0206-reverse-linked-list) |
| [0224-basic-calculator](https://github.com/mohith1306/Leet_code/tree/master/0224-basic-calculator) |
| [0231-power-of-two](https://github.com/mohith1306/Leet_code/tree/master/0231-power-of-two) |
| [0233-number-of-digit-one](https://github.com/mohith1306/Leet_code/tree/master/0233-number-of-digit-one) |
| [0234-palindrome-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0234-palindrome-linked-list) |
| [0326-power-of-three](https://github.com/mohith1306/Leet_code/tree/master/0326-power-of-three) |
| [1013-fibonacci-number](https://github.com/mohith1306/Leet_code/tree/master/1013-fibonacci-number) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/mohith1306/Leet_code/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/mohith1306/Leet_code/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/mohith1306/Leet_code/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/mohith1306/Leet_code/tree/master/0015-3sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/mohith1306/Leet_code/tree/master/0027-remove-element) |
| [0033-search-in-rotated-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/mohith1306/Leet_code/tree/master/0035-search-insert-position) |
| [0036-valid-sudoku](https://github.com/mohith1306/Leet_code/tree/master/0036-valid-sudoku) |
| [0039-combination-sum](https://github.com/mohith1306/Leet_code/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/mohith1306/Leet_code/tree/master/0040-combination-sum-ii) |
| [0041-first-missing-positive](https://github.com/mohith1306/Leet_code/tree/master/0041-first-missing-positive) |
| [0047-permutations-ii](https://github.com/mohith1306/Leet_code/tree/master/0047-permutations-ii) |
| [0048-rotate-image](https://github.com/mohith1306/Leet_code/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/mohith1306/Leet_code/tree/master/0049-group-anagrams) |
| [0054-spiral-matrix](https://github.com/mohith1306/Leet_code/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/mohith1306/Leet_code/tree/master/0055-jump-game) |
| [0057-insert-interval](https://github.com/mohith1306/Leet_code/tree/master/0057-insert-interval) |
| [0059-spiral-matrix-ii](https://github.com/mohith1306/Leet_code/tree/master/0059-spiral-matrix-ii) |
| [0063-unique-paths-ii](https://github.com/mohith1306/Leet_code/tree/master/0063-unique-paths-ii) |
| [0066-plus-one](https://github.com/mohith1306/Leet_code/tree/master/0066-plus-one) |
| [0073-set-matrix-zeroes](https://github.com/mohith1306/Leet_code/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/mohith1306/Leet_code/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/mohith1306/Leet_code/tree/master/0075-sort-colors) |
| [0078-subsets](https://github.com/mohith1306/Leet_code/tree/master/0078-subsets) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/mohith1306/Leet_code/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0088-merge-sorted-array) |
| [0090-subsets-ii](https://github.com/mohith1306/Leet_code/tree/master/0090-subsets-ii) |
| [0118-pascals-triangle](https://github.com/mohith1306/Leet_code/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/mohith1306/Leet_code/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0128-longest-consecutive-sequence](https://github.com/mohith1306/Leet_code/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/mohith1306/Leet_code/tree/master/0130-surrounded-regions) |
| [0136-single-number](https://github.com/mohith1306/Leet_code/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/mohith1306/Leet_code/tree/master/0137-single-number-ii) |
| [0150-evaluate-reverse-polish-notation](https://github.com/mohith1306/Leet_code/tree/master/0150-evaluate-reverse-polish-notation) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/mohith1306/Leet_code/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/mohith1306/Leet_code/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/mohith1306/Leet_code/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/mohith1306/Leet_code/tree/master/0189-rotate-array) |
| [0198-house-robber](https://github.com/mohith1306/Leet_code/tree/master/0198-house-robber) |
| [0209-minimum-size-subarray-sum](https://github.com/mohith1306/Leet_code/tree/master/0209-minimum-size-subarray-sum) |
| [0215-kth-largest-element-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/mohith1306/Leet_code/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/mohith1306/Leet_code/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/mohith1306/Leet_code/tree/master/0238-product-of-array-except-self) |
| [0239-sliding-window-maximum](https://github.com/mohith1306/Leet_code/tree/master/0239-sliding-window-maximum) |
| [0240-search-a-2d-matrix-ii](https://github.com/mohith1306/Leet_code/tree/master/0240-search-a-2d-matrix-ii) |
| [0260-single-number-iii](https://github.com/mohith1306/Leet_code/tree/master/0260-single-number-iii) |
| [0268-missing-number](https://github.com/mohith1306/Leet_code/tree/master/0268-missing-number) |
| [0283-move-zeroes](https://github.com/mohith1306/Leet_code/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/mohith1306/Leet_code/tree/master/0287-find-the-duplicate-number) |
| [0322-coin-change](https://github.com/mohith1306/Leet_code/tree/master/0322-coin-change) |
| [0334-increasing-triplet-subsequence](https://github.com/mohith1306/Leet_code/tree/master/0334-increasing-triplet-subsequence) |
| [0349-intersection-of-two-arrays](https://github.com/mohith1306/Leet_code/tree/master/0349-intersection-of-two-arrays) |
| [0416-partition-equal-subset-sum](https://github.com/mohith1306/Leet_code/tree/master/0416-partition-equal-subset-sum) |
| [0442-find-all-duplicates-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0442-find-all-duplicates-in-an-array) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0494-target-sum](https://github.com/mohith1306/Leet_code/tree/master/0494-target-sum) |
| [0518-coin-change-ii](https://github.com/mohith1306/Leet_code/tree/master/0518-coin-change-ii) |
| [0540-single-element-in-a-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0540-single-element-in-a-sorted-array) |
| [0542-01-matrix](https://github.com/mohith1306/Leet_code/tree/master/0542-01-matrix) |
| [0682-baseball-game](https://github.com/mohith1306/Leet_code/tree/master/0682-baseball-game) |
| [0724-find-pivot-index](https://github.com/mohith1306/Leet_code/tree/master/0724-find-pivot-index) |
| [0733-flood-fill](https://github.com/mohith1306/Leet_code/tree/master/0733-flood-fill) |
| [0735-asteroid-collision](https://github.com/mohith1306/Leet_code/tree/master/0735-asteroid-collision) |
| [0792-binary-search](https://github.com/mohith1306/Leet_code/tree/master/0792-binary-search) |
| [0878-shifting-letters](https://github.com/mohith1306/Leet_code/tree/master/0878-shifting-letters) |
| [0890-lemonade-change](https://github.com/mohith1306/Leet_code/tree/master/0890-lemonade-change) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/mohith1306/Leet_code/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/mohith1306/Leet_code/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/mohith1306/Leet_code/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/mohith1306/Leet_code/tree/master/0003-longest-substring-without-repeating-characters) |
| [0013-roman-to-integer](https://github.com/mohith1306/Leet_code/tree/master/0013-roman-to-integer) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/mohith1306/Leet_code/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0036-valid-sudoku](https://github.com/mohith1306/Leet_code/tree/master/0036-valid-sudoku) |
| [0041-first-missing-positive](https://github.com/mohith1306/Leet_code/tree/master/0041-first-missing-positive) |
| [0049-group-anagrams](https://github.com/mohith1306/Leet_code/tree/master/0049-group-anagrams) |
| [0073-set-matrix-zeroes](https://github.com/mohith1306/Leet_code/tree/master/0073-set-matrix-zeroes) |
| [0076-minimum-window-substring](https://github.com/mohith1306/Leet_code/tree/master/0076-minimum-window-substring) |
| [0128-longest-consecutive-sequence](https://github.com/mohith1306/Leet_code/tree/master/0128-longest-consecutive-sequence) |
| [0141-linked-list-cycle](https://github.com/mohith1306/Leet_code/tree/master/0141-linked-list-cycle) |
| [0160-intersection-of-two-linked-lists](https://github.com/mohith1306/Leet_code/tree/master/0160-intersection-of-two-linked-lists) |
| [0169-majority-element](https://github.com/mohith1306/Leet_code/tree/master/0169-majority-element) |
| [0205-isomorphic-strings](https://github.com/mohith1306/Leet_code/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/mohith1306/Leet_code/tree/master/0208-implement-trie-prefix-tree) |
| [0217-contains-duplicate](https://github.com/mohith1306/Leet_code/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/mohith1306/Leet_code/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/mohith1306/Leet_code/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/mohith1306/Leet_code/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/mohith1306/Leet_code/tree/master/0349-intersection-of-two-arrays) |
| [0383-ransom-note](https://github.com/mohith1306/Leet_code/tree/master/0383-ransom-note) |
| [0438-find-all-anagrams-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0438-find-all-anagrams-in-a-string) |
| [0442-find-all-duplicates-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0442-find-all-duplicates-in-an-array) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0451-sort-characters-by-frequency](https://github.com/mohith1306/Leet_code/tree/master/0451-sort-characters-by-frequency) |
| [0567-permutation-in-string](https://github.com/mohith1306/Leet_code/tree/master/0567-permutation-in-string) |
| [0782-jewels-and-stones](https://github.com/mohith1306/Leet_code/tree/master/0782-jewels-and-stones) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/mohith1306/Leet_code/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/mohith1306/Leet_code/tree/master/0003-longest-substring-without-repeating-characters) |
| [0005-longest-palindromic-substring](https://github.com/mohith1306/Leet_code/tree/master/0005-longest-palindromic-substring) |
| [0008-string-to-integer-atoi](https://github.com/mohith1306/Leet_code/tree/master/0008-string-to-integer-atoi) |
| [0013-roman-to-integer](https://github.com/mohith1306/Leet_code/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/mohith1306/Leet_code/tree/master/0014-longest-common-prefix) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/mohith1306/Leet_code/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0020-valid-parentheses](https://github.com/mohith1306/Leet_code/tree/master/0020-valid-parentheses) |
| [0022-generate-parentheses](https://github.com/mohith1306/Leet_code/tree/master/0022-generate-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0038-count-and-say](https://github.com/mohith1306/Leet_code/tree/master/0038-count-and-say) |
| [0043-multiply-strings](https://github.com/mohith1306/Leet_code/tree/master/0043-multiply-strings) |
| [0049-group-anagrams](https://github.com/mohith1306/Leet_code/tree/master/0049-group-anagrams) |
| [0058-length-of-last-word](https://github.com/mohith1306/Leet_code/tree/master/0058-length-of-last-word) |
| [0067-add-binary](https://github.com/mohith1306/Leet_code/tree/master/0067-add-binary) |
| [0076-minimum-window-substring](https://github.com/mohith1306/Leet_code/tree/master/0076-minimum-window-substring) |
| [0125-valid-palindrome](https://github.com/mohith1306/Leet_code/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0151-reverse-words-in-a-string) |
| [0165-compare-version-numbers](https://github.com/mohith1306/Leet_code/tree/master/0165-compare-version-numbers) |
| [0205-isomorphic-strings](https://github.com/mohith1306/Leet_code/tree/master/0205-isomorphic-strings) |
| [0208-implement-trie-prefix-tree](https://github.com/mohith1306/Leet_code/tree/master/0208-implement-trie-prefix-tree) |
| [0224-basic-calculator](https://github.com/mohith1306/Leet_code/tree/master/0224-basic-calculator) |
| [0242-valid-anagram](https://github.com/mohith1306/Leet_code/tree/master/0242-valid-anagram) |
| [0257-binary-tree-paths](https://github.com/mohith1306/Leet_code/tree/master/0257-binary-tree-paths) |
| [0344-reverse-string](https://github.com/mohith1306/Leet_code/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/mohith1306/Leet_code/tree/master/0345-reverse-vowels-of-a-string) |
| [0383-ransom-note](https://github.com/mohith1306/Leet_code/tree/master/0383-ransom-note) |
| [0392-is-subsequence](https://github.com/mohith1306/Leet_code/tree/master/0392-is-subsequence) |
| [0402-remove-k-digits](https://github.com/mohith1306/Leet_code/tree/master/0402-remove-k-digits) |
| [0412-fizz-buzz](https://github.com/mohith1306/Leet_code/tree/master/0412-fizz-buzz) |
| [0438-find-all-anagrams-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0438-find-all-anagrams-in-a-string) |
| [0443-string-compression](https://github.com/mohith1306/Leet_code/tree/master/0443-string-compression) |
| [0451-sort-characters-by-frequency](https://github.com/mohith1306/Leet_code/tree/master/0451-sort-characters-by-frequency) |
| [0468-validate-ip-address](https://github.com/mohith1306/Leet_code/tree/master/0468-validate-ip-address) |
| [0564-find-the-closest-palindrome](https://github.com/mohith1306/Leet_code/tree/master/0564-find-the-closest-palindrome) |
| [0567-permutation-in-string](https://github.com/mohith1306/Leet_code/tree/master/0567-permutation-in-string) |
| [0678-valid-parenthesis-string](https://github.com/mohith1306/Leet_code/tree/master/0678-valid-parenthesis-string) |
| [0742-to-lower-case](https://github.com/mohith1306/Leet_code/tree/master/0742-to-lower-case) |
| [0782-jewels-and-stones](https://github.com/mohith1306/Leet_code/tree/master/0782-jewels-and-stones) |
| [0874-backspace-string-compare](https://github.com/mohith1306/Leet_code/tree/master/0874-backspace-string-compare) |
| [0878-shifting-letters](https://github.com/mohith1306/Leet_code/tree/master/0878-shifting-letters) |
| [3553-check-if-two-chessboard-squares-have-the-same-color](https://github.com/mohith1306/Leet_code/tree/master/3553-check-if-two-chessboard-squares-have-the-same-color) |
| [3567-convert-date-to-binary](https://github.com/mohith1306/Leet_code/tree/master/3567-convert-date-to-binary) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/mohith1306/Leet_code/tree/master/0003-longest-substring-without-repeating-characters) |
| [0076-minimum-window-substring](https://github.com/mohith1306/Leet_code/tree/master/0076-minimum-window-substring) |
| [0209-minimum-size-subarray-sum](https://github.com/mohith1306/Leet_code/tree/master/0209-minimum-size-subarray-sum) |
| [0239-sliding-window-maximum](https://github.com/mohith1306/Leet_code/tree/master/0239-sliding-window-maximum) |
| [0438-find-all-anagrams-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0438-find-all-anagrams-in-a-string) |
| [0567-permutation-in-string](https://github.com/mohith1306/Leet_code/tree/master/0567-permutation-in-string) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/mohith1306/Leet_code/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/mohith1306/Leet_code/tree/master/0004-median-of-two-sorted-arrays) |
| [0033-search-in-rotated-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/mohith1306/Leet_code/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/mohith1306/Leet_code/tree/master/0069-sqrtx) |
| [0074-search-a-2d-matrix](https://github.com/mohith1306/Leet_code/tree/master/0074-search-a-2d-matrix) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/mohith1306/Leet_code/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/mohith1306/Leet_code/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/mohith1306/Leet_code/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0209-minimum-size-subarray-sum](https://github.com/mohith1306/Leet_code/tree/master/0209-minimum-size-subarray-sum) |
| [0240-search-a-2d-matrix-ii](https://github.com/mohith1306/Leet_code/tree/master/0240-search-a-2d-matrix-ii) |
| [0268-missing-number](https://github.com/mohith1306/Leet_code/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/mohith1306/Leet_code/tree/master/0287-find-the-duplicate-number) |
| [0349-intersection-of-two-arrays](https://github.com/mohith1306/Leet_code/tree/master/0349-intersection-of-two-arrays) |
| [0540-single-element-in-a-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0540-single-element-in-a-sorted-array) |
| [0633-sum-of-square-numbers](https://github.com/mohith1306/Leet_code/tree/master/0633-sum-of-square-numbers) |
| [0792-binary-search](https://github.com/mohith1306/Leet_code/tree/master/0792-binary-search) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/mohith1306/Leet_code/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/mohith1306/Leet_code/tree/master/0004-median-of-two-sorted-arrays) |
| [0169-majority-element](https://github.com/mohith1306/Leet_code/tree/master/0169-majority-element) |
| [0191-number-of-1-bits](https://github.com/mohith1306/Leet_code/tree/master/0191-number-of-1-bits) |
| [0215-kth-largest-element-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0215-kth-largest-element-in-an-array) |
| [0240-search-a-2d-matrix-ii](https://github.com/mohith1306/Leet_code/tree/master/0240-search-a-2d-matrix-ii) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/mohith1306/Leet_code/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/mohith1306/Leet_code/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/mohith1306/Leet_code/tree/master/0015-3sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/mohith1306/Leet_code/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/mohith1306/Leet_code/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0061-rotate-list](https://github.com/mohith1306/Leet_code/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/mohith1306/Leet_code/tree/master/0075-sort-colors) |
| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/mohith1306/Leet_code/tree/master/0082-remove-duplicates-from-sorted-list-ii) |
| [0086-partition-list](https://github.com/mohith1306/Leet_code/tree/master/0086-partition-list) |
| [0088-merge-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/mohith1306/Leet_code/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/mohith1306/Leet_code/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/mohith1306/Leet_code/tree/master/0143-reorder-list) |
| [0151-reverse-words-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/mohith1306/Leet_code/tree/master/0160-intersection-of-two-linked-lists) |
| [0165-compare-version-numbers](https://github.com/mohith1306/Leet_code/tree/master/0165-compare-version-numbers) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/mohith1306/Leet_code/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/mohith1306/Leet_code/tree/master/0189-rotate-array) |
| [0234-palindrome-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/mohith1306/Leet_code/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/mohith1306/Leet_code/tree/master/0287-find-the-duplicate-number) |
| [0344-reverse-string](https://github.com/mohith1306/Leet_code/tree/master/0344-reverse-string) |
| [0345-reverse-vowels-of-a-string](https://github.com/mohith1306/Leet_code/tree/master/0345-reverse-vowels-of-a-string) |
| [0349-intersection-of-two-arrays](https://github.com/mohith1306/Leet_code/tree/master/0349-intersection-of-two-arrays) |
| [0392-is-subsequence](https://github.com/mohith1306/Leet_code/tree/master/0392-is-subsequence) |
| [0443-string-compression](https://github.com/mohith1306/Leet_code/tree/master/0443-string-compression) |
| [0567-permutation-in-string](https://github.com/mohith1306/Leet_code/tree/master/0567-permutation-in-string) |
| [0633-sum-of-square-numbers](https://github.com/mohith1306/Leet_code/tree/master/0633-sum-of-square-numbers) |
| [0874-backspace-string-compare](https://github.com/mohith1306/Leet_code/tree/master/0874-backspace-string-compare) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/mohith1306/Leet_code/tree/master/0005-longest-palindromic-substring) |
| [0022-generate-parentheses](https://github.com/mohith1306/Leet_code/tree/master/0022-generate-parentheses) |
| [0055-jump-game](https://github.com/mohith1306/Leet_code/tree/master/0055-jump-game) |
| [0062-unique-paths](https://github.com/mohith1306/Leet_code/tree/master/0062-unique-paths) |
| [0063-unique-paths-ii](https://github.com/mohith1306/Leet_code/tree/master/0063-unique-paths-ii) |
| [0070-climbing-stairs](https://github.com/mohith1306/Leet_code/tree/master/0070-climbing-stairs) |
| [0118-pascals-triangle](https://github.com/mohith1306/Leet_code/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/mohith1306/Leet_code/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0198-house-robber](https://github.com/mohith1306/Leet_code/tree/master/0198-house-robber) |
| [0233-number-of-digit-one](https://github.com/mohith1306/Leet_code/tree/master/0233-number-of-digit-one) |
| [0322-coin-change](https://github.com/mohith1306/Leet_code/tree/master/0322-coin-change) |
| [0392-is-subsequence](https://github.com/mohith1306/Leet_code/tree/master/0392-is-subsequence) |
| [0416-partition-equal-subset-sum](https://github.com/mohith1306/Leet_code/tree/master/0416-partition-equal-subset-sum) |
| [0494-target-sum](https://github.com/mohith1306/Leet_code/tree/master/0494-target-sum) |
| [0518-coin-change-ii](https://github.com/mohith1306/Leet_code/tree/master/0518-coin-change-ii) |
| [0542-01-matrix](https://github.com/mohith1306/Leet_code/tree/master/0542-01-matrix) |
| [0678-valid-parenthesis-string](https://github.com/mohith1306/Leet_code/tree/master/0678-valid-parenthesis-string) |
| [1013-fibonacci-number](https://github.com/mohith1306/Leet_code/tree/master/1013-fibonacci-number) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/mohith1306/Leet_code/tree/master/0011-container-with-most-water) |
| [0055-jump-game](https://github.com/mohith1306/Leet_code/tree/master/0055-jump-game) |
| [0334-increasing-triplet-subsequence](https://github.com/mohith1306/Leet_code/tree/master/0334-increasing-triplet-subsequence) |
| [0402-remove-k-digits](https://github.com/mohith1306/Leet_code/tree/master/0402-remove-k-digits) |
| [0678-valid-parenthesis-string](https://github.com/mohith1306/Leet_code/tree/master/0678-valid-parenthesis-string) |
| [0890-lemonade-change](https://github.com/mohith1306/Leet_code/tree/master/0890-lemonade-change) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/mohith1306/Leet_code/tree/master/0014-longest-common-prefix) |
| [0208-implement-trie-prefix-tree](https://github.com/mohith1306/Leet_code/tree/master/0208-implement-trie-prefix-tree) |
| [0386-lexicographical-numbers](https://github.com/mohith1306/Leet_code/tree/master/0386-lexicographical-numbers) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/mohith1306/Leet_code/tree/master/0015-3sum) |
| [0047-permutations-ii](https://github.com/mohith1306/Leet_code/tree/master/0047-permutations-ii) |
| [0049-group-anagrams](https://github.com/mohith1306/Leet_code/tree/master/0049-group-anagrams) |
| [0075-sort-colors](https://github.com/mohith1306/Leet_code/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/mohith1306/Leet_code/tree/master/0088-merge-sorted-array) |
| [0169-majority-element](https://github.com/mohith1306/Leet_code/tree/master/0169-majority-element) |
| [0215-kth-largest-element-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/mohith1306/Leet_code/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/mohith1306/Leet_code/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/mohith1306/Leet_code/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/mohith1306/Leet_code/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/mohith1306/Leet_code/tree/master/0349-intersection-of-two-arrays) |
| [0451-sort-characters-by-frequency](https://github.com/mohith1306/Leet_code/tree/master/0451-sort-characters-by-frequency) |
## Backtracking
| |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/mohith1306/Leet_code/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0022-generate-parentheses](https://github.com/mohith1306/Leet_code/tree/master/0022-generate-parentheses) |
| [0039-combination-sum](https://github.com/mohith1306/Leet_code/tree/master/0039-combination-sum) |
| [0040-combination-sum-ii](https://github.com/mohith1306/Leet_code/tree/master/0040-combination-sum-ii) |
| [0047-permutations-ii](https://github.com/mohith1306/Leet_code/tree/master/0047-permutations-ii) |
| [0077-combinations](https://github.com/mohith1306/Leet_code/tree/master/0077-combinations) |
| [0078-subsets](https://github.com/mohith1306/Leet_code/tree/master/0078-subsets) |
| [0090-subsets-ii](https://github.com/mohith1306/Leet_code/tree/master/0090-subsets-ii) |
| [0257-binary-tree-paths](https://github.com/mohith1306/Leet_code/tree/master/0257-binary-tree-paths) |
| [0494-target-sum](https://github.com/mohith1306/Leet_code/tree/master/0494-target-sum) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/mohith1306/Leet_code/tree/master/0020-valid-parentheses) |
| [0094-binary-tree-inorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0094-binary-tree-inorder-traversal) |
| [0143-reorder-list](https://github.com/mohith1306/Leet_code/tree/master/0143-reorder-list) |
| [0144-binary-tree-preorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0145-binary-tree-postorder-traversal) |
| [0150-evaluate-reverse-polish-notation](https://github.com/mohith1306/Leet_code/tree/master/0150-evaluate-reverse-polish-notation) |
| [0155-min-stack](https://github.com/mohith1306/Leet_code/tree/master/0155-min-stack) |
| [0224-basic-calculator](https://github.com/mohith1306/Leet_code/tree/master/0224-basic-calculator) |
| [0234-palindrome-linked-list](https://github.com/mohith1306/Leet_code/tree/master/0234-palindrome-linked-list) |
| [0402-remove-k-digits](https://github.com/mohith1306/Leet_code/tree/master/0402-remove-k-digits) |
| [0678-valid-parenthesis-string](https://github.com/mohith1306/Leet_code/tree/master/0678-valid-parenthesis-string) |
| [0682-baseball-game](https://github.com/mohith1306/Leet_code/tree/master/0682-baseball-game) |
| [0735-asteroid-collision](https://github.com/mohith1306/Leet_code/tree/master/0735-asteroid-collision) |
| [0874-backspace-string-compare](https://github.com/mohith1306/Leet_code/tree/master/0874-backspace-string-compare) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/mohith1306/Leet_code/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
## Simulation
| |
| ------- |
| [0043-multiply-strings](https://github.com/mohith1306/Leet_code/tree/master/0043-multiply-strings) |
| [0054-spiral-matrix](https://github.com/mohith1306/Leet_code/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/mohith1306/Leet_code/tree/master/0059-spiral-matrix-ii) |
| [0067-add-binary](https://github.com/mohith1306/Leet_code/tree/master/0067-add-binary) |
| [0258-add-digits](https://github.com/mohith1306/Leet_code/tree/master/0258-add-digits) |
| [0412-fizz-buzz](https://github.com/mohith1306/Leet_code/tree/master/0412-fizz-buzz) |
| [0682-baseball-game](https://github.com/mohith1306/Leet_code/tree/master/0682-baseball-game) |
| [0735-asteroid-collision](https://github.com/mohith1306/Leet_code/tree/master/0735-asteroid-collision) |
| [0874-backspace-string-compare](https://github.com/mohith1306/Leet_code/tree/master/0874-backspace-string-compare) |
## Matrix
| |
| ------- |
| [0036-valid-sudoku](https://github.com/mohith1306/Leet_code/tree/master/0036-valid-sudoku) |
| [0048-rotate-image](https://github.com/mohith1306/Leet_code/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/mohith1306/Leet_code/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/mohith1306/Leet_code/tree/master/0059-spiral-matrix-ii) |
| [0063-unique-paths-ii](https://github.com/mohith1306/Leet_code/tree/master/0063-unique-paths-ii) |
| [0073-set-matrix-zeroes](https://github.com/mohith1306/Leet_code/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/mohith1306/Leet_code/tree/master/0074-search-a-2d-matrix) |
| [0130-surrounded-regions](https://github.com/mohith1306/Leet_code/tree/master/0130-surrounded-regions) |
| [0240-search-a-2d-matrix-ii](https://github.com/mohith1306/Leet_code/tree/master/0240-search-a-2d-matrix-ii) |
| [0542-01-matrix](https://github.com/mohith1306/Leet_code/tree/master/0542-01-matrix) |
| [0733-flood-fill](https://github.com/mohith1306/Leet_code/tree/master/0733-flood-fill) |
| [2254-check-if-every-row-and-column-contains-all-numbers](https://github.com/mohith1306/Leet_code/tree/master/2254-check-if-every-row-and-column-contains-all-numbers) |
## Combinatorics
| |
| ------- |
| [0062-unique-paths](https://github.com/mohith1306/Leet_code/tree/master/0062-unique-paths) |
## Bit Manipulation
| |
| ------- |
| [0067-add-binary](https://github.com/mohith1306/Leet_code/tree/master/0067-add-binary) |
| [0078-subsets](https://github.com/mohith1306/Leet_code/tree/master/0078-subsets) |
| [0090-subsets-ii](https://github.com/mohith1306/Leet_code/tree/master/0090-subsets-ii) |
| [0136-single-number](https://github.com/mohith1306/Leet_code/tree/master/0136-single-number) |
| [0137-single-number-ii](https://github.com/mohith1306/Leet_code/tree/master/0137-single-number-ii) |
| [0191-number-of-1-bits](https://github.com/mohith1306/Leet_code/tree/master/0191-number-of-1-bits) |
| [0231-power-of-two](https://github.com/mohith1306/Leet_code/tree/master/0231-power-of-two) |
| [0260-single-number-iii](https://github.com/mohith1306/Leet_code/tree/master/0260-single-number-iii) |
| [0268-missing-number](https://github.com/mohith1306/Leet_code/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/mohith1306/Leet_code/tree/master/0287-find-the-duplicate-number) |
| [0476-number-complement](https://github.com/mohith1306/Leet_code/tree/master/0476-number-complement) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/mohith1306/Leet_code/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/mohith1306/Leet_code/tree/master/1013-fibonacci-number) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/mohith1306/Leet_code/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/mohith1306/Leet_code/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/mohith1306/Leet_code/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/mohith1306/Leet_code/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0110-balanced-binary-tree) |
| [0144-binary-tree-preorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/mohith1306/Leet_code/tree/master/0199-binary-tree-right-side-view) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/mohith1306/Leet_code/tree/master/0257-binary-tree-paths) |
| [0450-delete-node-in-a-bst](https://github.com/mohith1306/Leet_code/tree/master/0450-delete-node-in-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0784-insert-into-a-binary-search-tree) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/mohith1306/Leet_code/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/mohith1306/Leet_code/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0110-balanced-binary-tree) |
| [0130-surrounded-regions](https://github.com/mohith1306/Leet_code/tree/master/0130-surrounded-regions) |
| [0144-binary-tree-preorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/mohith1306/Leet_code/tree/master/0199-binary-tree-right-side-view) |
| [0207-course-schedule](https://github.com/mohith1306/Leet_code/tree/master/0207-course-schedule) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/mohith1306/Leet_code/tree/master/0257-binary-tree-paths) |
| [0386-lexicographical-numbers](https://github.com/mohith1306/Leet_code/tree/master/0386-lexicographical-numbers) |
| [0547-number-of-provinces](https://github.com/mohith1306/Leet_code/tree/master/0547-number-of-provinces) |
| [0733-flood-fill](https://github.com/mohith1306/Leet_code/tree/master/0733-flood-fill) |
| [0820-find-eventual-safe-states](https://github.com/mohith1306/Leet_code/tree/master/0820-find-eventual-safe-states) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0098-validate-binary-search-tree) |
| [0100-same-tree](https://github.com/mohith1306/Leet_code/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/mohith1306/Leet_code/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/mohith1306/Leet_code/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/mohith1306/Leet_code/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0110-balanced-binary-tree) |
| [0144-binary-tree-preorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/mohith1306/Leet_code/tree/master/0145-binary-tree-postorder-traversal) |
| [0199-binary-tree-right-side-view](https://github.com/mohith1306/Leet_code/tree/master/0199-binary-tree-right-side-view) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0257-binary-tree-paths](https://github.com/mohith1306/Leet_code/tree/master/0257-binary-tree-paths) |
| [0450-delete-node-in-a-bst](https://github.com/mohith1306/Leet_code/tree/master/0450-delete-node-in-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0784-insert-into-a-binary-search-tree) |
## Binary Search Tree
| |
| ------- |
| [0098-validate-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0098-validate-binary-search-tree) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0450-delete-node-in-a-bst](https://github.com/mohith1306/Leet_code/tree/master/0450-delete-node-in-a-bst) |
| [0783-search-in-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0783-search-in-a-binary-search-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/mohith1306/Leet_code/tree/master/0784-insert-into-a-binary-search-tree) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/mohith1306/Leet_code/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/mohith1306/Leet_code/tree/master/0101-symmetric-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/mohith1306/Leet_code/tree/master/0102-binary-tree-level-order-traversal) |
| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/mohith1306/Leet_code/tree/master/0103-binary-tree-zigzag-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/mohith1306/Leet_code/tree/master/0104-maximum-depth-of-binary-tree) |
| [0130-surrounded-regions](https://github.com/mohith1306/Leet_code/tree/master/0130-surrounded-regions) |
| [0199-binary-tree-right-side-view](https://github.com/mohith1306/Leet_code/tree/master/0199-binary-tree-right-side-view) |
| [0207-course-schedule](https://github.com/mohith1306/Leet_code/tree/master/0207-course-schedule) |
| [0322-coin-change](https://github.com/mohith1306/Leet_code/tree/master/0322-coin-change) |
| [0542-01-matrix](https://github.com/mohith1306/Leet_code/tree/master/0542-01-matrix) |
| [0547-number-of-provinces](https://github.com/mohith1306/Leet_code/tree/master/0547-number-of-provinces) |
| [0733-flood-fill](https://github.com/mohith1306/Leet_code/tree/master/0733-flood-fill) |
| [0820-find-eventual-safe-states](https://github.com/mohith1306/Leet_code/tree/master/0820-find-eventual-safe-states) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/mohith1306/Leet_code/tree/master/0128-longest-consecutive-sequence) |
| [0130-surrounded-regions](https://github.com/mohith1306/Leet_code/tree/master/0130-surrounded-regions) |
| [0547-number-of-provinces](https://github.com/mohith1306/Leet_code/tree/master/0547-number-of-provinces) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/mohith1306/Leet_code/tree/master/0155-min-stack) |
| [0208-implement-trie-prefix-tree](https://github.com/mohith1306/Leet_code/tree/master/0208-implement-trie-prefix-tree) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/mohith1306/Leet_code/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/mohith1306/Leet_code/tree/master/0229-majority-element-ii) |
| [0383-ransom-note](https://github.com/mohith1306/Leet_code/tree/master/0383-ransom-note) |
| [0451-sort-characters-by-frequency](https://github.com/mohith1306/Leet_code/tree/master/0451-sort-characters-by-frequency) |
## Graph
| |
| ------- |
| [0207-course-schedule](https://github.com/mohith1306/Leet_code/tree/master/0207-course-schedule) |
| [0547-number-of-provinces](https://github.com/mohith1306/Leet_code/tree/master/0547-number-of-provinces) |
| [0820-find-eventual-safe-states](https://github.com/mohith1306/Leet_code/tree/master/0820-find-eventual-safe-states) |
## Topological Sort
| |
| ------- |
| [0207-course-schedule](https://github.com/mohith1306/Leet_code/tree/master/0207-course-schedule) |
| [0820-find-eventual-safe-states](https://github.com/mohith1306/Leet_code/tree/master/0820-find-eventual-safe-states) |
## Prefix Sum
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/mohith1306/Leet_code/tree/master/0209-minimum-size-subarray-sum) |
| [0238-product-of-array-except-self](https://github.com/mohith1306/Leet_code/tree/master/0238-product-of-array-except-self) |
| [0724-find-pivot-index](https://github.com/mohith1306/Leet_code/tree/master/0724-find-pivot-index) |
| [0878-shifting-letters](https://github.com/mohith1306/Leet_code/tree/master/0878-shifting-letters) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/mohith1306/Leet_code/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
## Heap (Priority Queue)
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0215-kth-largest-element-in-an-array) |
| [0239-sliding-window-maximum](https://github.com/mohith1306/Leet_code/tree/master/0239-sliding-window-maximum) |
| [0451-sort-characters-by-frequency](https://github.com/mohith1306/Leet_code/tree/master/0451-sort-characters-by-frequency) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/mohith1306/Leet_code/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
## Quickselect
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/mohith1306/Leet_code/tree/master/0215-kth-largest-element-in-an-array) |
## Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/mohith1306/Leet_code/tree/master/0239-sliding-window-maximum) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/mohith1306/Leet_code/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
## Monotonic Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/mohith1306/Leet_code/tree/master/0239-sliding-window-maximum) |
| [0892-shortest-subarray-with-sum-at-least-k](https://github.com/mohith1306/Leet_code/tree/master/0892-shortest-subarray-with-sum-at-least-k) |
## Number Theory
| |
| ------- |
| [0258-add-digits](https://github.com/mohith1306/Leet_code/tree/master/0258-add-digits) |
## Monotonic Stack
| |
| ------- |
| [0402-remove-k-digits](https://github.com/mohith1306/Leet_code/tree/master/0402-remove-k-digits) |
## Bucket Sort
| |
| ------- |
| [0451-sort-characters-by-frequency](https://github.com/mohith1306/Leet_code/tree/master/0451-sort-characters-by-frequency) |