README.md
leetcode_solutions
Collection of LeetCode questions to ace the coding interview! - Created using LeetHub.
LeetCode Topics
Array
Greedy
Sorting
Heap (Priority Queue)
Dynamic Programming
Hash Table
Tree
Depth-First Search
Breadth-First Search
Binary Tree
| 0110-balanced-binary-tree |
| 1022-sum-of-root-to-leaf-binary-numbers |
| 1218-lowest-common-ancestor-of-deepest-leaves |
| 1382-balance-a-binary-search-tree |
Math
String
Enumeration
Combinatorics
Binary Search
Divide and Conquer
| 0190-reverse-bits |
| 0761-special-binary-string |
| 1382-balance-a-binary-search-tree |
| 2280-count-good-triplets-in-an-array |
| 3719-longest-balanced-subarray-i |
| 3721-longest-balanced-subarray-ii |
Binary Indexed Tree
| 2280-count-good-triplets-in-an-array |
Segment Tree
| 1622-fancy-sequence |
| 2280-count-good-triplets-in-an-array |
| 3454-separate-squares-ii |
| 3719-longest-balanced-subarray-i |
| 3721-longest-balanced-subarray-ii |
| 3790-fruits-into-baskets-ii |
| 3791-fruits-into-baskets-iii |
Merge Sort
| 2280-count-good-triplets-in-an-array |
Ordered Set
Sliding Window
Prefix Sum
Number Theory
Queue
Monotonic Queue
| 2180-maximum-number-of-tasks-you-can-assign |
| 2527-count-subarrays-with-fixed-bounds |
| 3578-count-partitions-with-max-min-difference-at-most-k |
Two Pointers
Counting
Simulation
Graph
Matrix
Shortest Path
Bit Manipulation
Topological Sort
| 1986-largest-color-value-in-a-directed-graph |
Memoization
Union Find
| 1058-lexicographically-smallest-equivalent-string |
| 2092-find-all-people-with-secret |
| 3863-power-grid-maintenance |
Trie
| 0386-lexicographical-numbers |
| 0440-k-th-smallest-in-lexicographical-order |
| 1350-remove-sub-folders-from-the-filesystem |
| 2977-minimum-cost-to-convert-string-ii |
Recursion
| 0231-power-of-two |
| 0326-power-of-three |
| 1545-find-kth-bit-in-nth-binary-string |
| 3600-find-the-k-th-character-in-string-game-i |
Linked List
| 1411-convert-binary-number-in-a-linked-list-to-integer |
| 3501-delete-nodes-from-linked-list-present-in-array |
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
Stack
Backtracking
Monotonic Stack
| 0085-maximal-rectangle |
| 1628-count-submatrices-with-all-ones |
| 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array |
| 3834-minimum-operations-to-convert-all-elements-to-zero |
Geometry
Brainteaser
| 2837-minimum-operations-to-make-the-integer-zero |
| 3577-count-the-number-of-computer-unlocking-permutations |
Design
| 1622-fancy-sequence |
| 2023-design-movie-rental-system |
| 2169-simple-bank-system |
| 3678-design-task-manager |
| 3827-implement-router |
Bitmask
| 3233-maximize-the-number-of-partitions-after-operations |
| 3851-find-sum-of-array-product-of-magical-sequences |
Line Sweep
| 3454-separate-squares-ii |
Doubly-Linked List
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
Graph Theory
| 2976-minimum-cost-to-convert-string-i |
| 2977-minimum-cost-to-convert-string-ii |
| 3600-maximize-spanning-tree-stability-with-upgrades |
| 3650-minimum-cost-path-with-edge-reversals |
Binary Search Tree
| 1382-balance-a-binary-search-tree |
Rolling Hash
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
Hash Function
| 1461-check-if-a-string-contains-all-binary-codes-of-size-k |
Union-Find
| 3600-maximize-spanning-tree-stability-with-upgrades |
Minimum Spanning Tree
| 3600-maximize-spanning-tree-stability-with-upgrades |