DSA-codes

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Array

0001-two-sum
0031-next-permutation
0039-combination-sum
0040-combination-sum-ii
0045-jump-game-ii
0046-permutations
0047-permutations-ii
0048-rotate-image
0053-maximum-subarray
0054-spiral-matrix
0055-jump-game
0063-unique-paths-ii
0064-minimum-path-sum
0073-set-matrix-zeroes
0075-sort-colors
0078-subsets
0088-merge-sorted-array
0090-subsets-ii
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0128-longest-consecutive-sequence
0136-single-number
0162-find-peak-element
0169-majority-element
0188-best-time-to-buy-and-sell-stock-iv
0198-house-robber
0213-house-robber-ii
0229-majority-element-ii
0268-missing-number
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0322-coin-change
0416-partition-equal-subset-sum
0455-assign-cookies
0485-max-consecutive-ones
0494-target-sum
0518-coin-change-ii
0890-lemonade-change
0948-sort-an-array
0966-binary-subarrays-with-sum
0967-minimum-falling-path-sum
1046-max-consecutive-ones-iii
1050-construct-binary-search-tree-from-preorder-traversal
1370-count-number-of-nice-subarrays
1408-find-the-smallest-divisor-given-a-threshold
1538-maximum-points-you-can-obtain-from-cards
1878-check-if-array-is-sorted-and-rotated
2271-rearrange-array-elements-by-sign

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0073-set-matrix-zeroes
0128-longest-consecutive-sequence
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0169-majority-element
0229-majority-element-ii
0268-missing-number
0424-longest-repeating-character-replacement
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
0966-binary-subarrays-with-sum
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters

Math

0048-rotate-image
0050-powx-n
0070-climbing-stairs
0231-power-of-two
0268-missing-number
1370-count-number-of-nice-subarrays

Binary Search

0162-find-peak-element
0222-count-complete-tree-nodes
0268-missing-number
0300-longest-increasing-subsequence
1046-max-consecutive-ones-iii
1408-find-the-smallest-divisor-given-a-threshold

Bit Manipulation

0078-subsets
0090-subsets-ii
0136-single-number
0222-count-complete-tree-nodes
0231-power-of-two
0268-missing-number

Sorting

0047-permutations-ii
0075-sort-colors
0088-merge-sorted-array
0169-majority-element
0229-majority-element-ii
0268-missing-number
0455-assign-cookies
0948-sort-an-array

Two Pointers

0019-remove-nth-node-from-end-of-list
0031-next-permutation
0075-sort-colors
0088-merge-sorted-array
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0455-assign-cookies
0653-two-sum-iv-input-is-a-bst
0908-middle-of-the-linked-list
2216-delete-the-middle-node-of-a-linked-list
2271-rearrange-array-elements-by-sign

Dynamic Programming

0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0063-unique-paths-ii
0064-minimum-path-sum
0070-climbing-stairs
0072-edit-distance
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0131-palindrome-partitioning
0188-best-time-to-buy-and-sell-stock-iv
0198-house-robber
0213-house-robber-ii
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0322-coin-change
0416-partition-equal-subset-sum
0494-target-sum
0516-longest-palindromic-subsequence
0518-coin-change-ii
0583-delete-operation-for-two-strings
0967-minimum-falling-path-sum
1250-longest-common-subsequence
1437-minimum-insertion-steps-to-make-a-string-palindrome

Simulation

0054-spiral-matrix
2271-rearrange-array-elements-by-sign

Union Find

0128-longest-consecutive-sequence

Linked List

0019-remove-nth-node-from-end-of-list
0114-flatten-binary-tree-to-linked-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0237-delete-node-in-a-linked-list
0908-middle-of-the-linked-list
2216-delete-the-middle-node-of-a-linked-list

Recursion

0050-powx-n
0206-reverse-linked-list
0231-power-of-two

String

0003-longest-substring-without-repeating-characters
0020-valid-parentheses
0072-edit-distance
0131-palindrome-partitioning
0424-longest-repeating-character-replacement
0516-longest-palindromic-subsequence
0583-delete-operation-for-two-strings
1078-remove-outermost-parentheses
1250-longest-common-subsequence
1437-minimum-insertion-steps-to-make-a-string-palindrome
1460-number-of-substrings-containing-all-three-characters

Stack

0020-valid-parentheses
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
1050-construct-binary-search-tree-from-preorder-traversal
1078-remove-outermost-parentheses

Greedy

0045-jump-game-ii
0055-jump-game
0122-best-time-to-buy-and-sell-stock-ii
0455-assign-cookies
0890-lemonade-change

Sliding Window

0003-longest-substring-without-repeating-characters
0424-longest-repeating-character-replacement
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters
1538-maximum-points-you-can-obtain-from-cards

Prefix Sum

0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1538-maximum-points-you-can-obtain-from-cards

Divide and Conquer

0053-maximum-subarray
0169-majority-element
0948-sort-an-array

Counting

0169-majority-element
0229-majority-element-ii

Matrix

0048-rotate-image
0054-spiral-matrix
0063-unique-paths-ii
0064-minimum-path-sum
0073-set-matrix-zeroes
0967-minimum-falling-path-sum

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0893-all-nodes-distance-k-in-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0322-coin-change
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0893-all-nodes-distance-k-in-binary-tree

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
1050-construct-binary-search-tree-from-preorder-traversal

Monotonic Stack

1050-construct-binary-search-tree-from-preorder-traversal

Memoization

0070-climbing-stairs

Heap (Priority Queue)

0948-sort-an-array

Merge Sort

0948-sort-an-array

Bucket Sort

0948-sort-an-array

Radix Sort

0948-sort-an-array

Counting Sort

0948-sort-an-array

Backtracking

0039-combination-sum
0040-combination-sum-ii
0046-permutations
0047-permutations-ii
0078-subsets
0090-subsets-ii
0131-palindrome-partitioning
0494-target-sum