Algorithm-codingTest

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

Array

0088-merge-sorted-array

Two Pointers

0088-merge-sorted-array

Sorting

0088-merge-sorted-array

LeetCode Topics

Array

0001-two-sum
0026-remove-duplicates-from-sorted-array
0027-remove-element
0035-search-insert-position
0049-group-anagrams
0136-single-number
0200-number-of-islands
0268-missing-number
0283-move-zeroes
0300-longest-increasing-subsequence
0605-can-place-flowers
0747-min-cost-climbing-stairs
1019-squares-of-a-sorted-array
1098-largest-unique-number
1354-find-players-with-zero-or-one-losses
1370-count-number-of-nice-subarrays
1391-counting-elements
1392-find-the-difference-of-two-arrays
1421-find-numbers-with-even-number-of-digits
1468-check-if-n-and-its-double-exist
1528-kids-with-the-greatest-number-of-candies
2262-solving-questions-with-brainpower
2331-intersection-of-multiple-arrays
2428-equal-row-and-column-pairs
2473-max-sum-of-a-pair-with-equal-sum-of-digits

Greedy

0605-can-place-flowers

Hash Table

0001-two-sum
0049-group-anagrams
0205-isomorphic-strings
0268-missing-number
0290-word-pattern
0383-ransom-note
1098-largest-unique-number
1297-maximum-number-of-balloons
1354-find-players-with-zero-or-one-losses
1370-count-number-of-nice-subarrays
1391-counting-elements
1392-find-the-difference-of-two-arrays
1468-check-if-n-and-its-double-exist
1960-check-if-the-sentence-is-pangram
2053-check-if-all-characters-have-equal-number-of-occurrences
2331-intersection-of-multiple-arrays
2427-first-letter-to-appear-twice
2428-equal-row-and-column-pairs
2473-max-sum-of-a-pair-with-equal-sum-of-digits

String

0020-valid-parentheses
0049-group-anagrams
0125-valid-palindrome
0205-isomorphic-strings
0290-word-pattern
0344-reverse-string
0383-ransom-note
0392-is-subsequence
1128-remove-all-adjacent-duplicates-in-string
1297-maximum-number-of-balloons
1960-check-if-the-sentence-is-pangram
2053-check-if-all-characters-have-equal-number-of-occurrences
2427-first-letter-to-appear-twice
2470-removing-stars-from-a-string

Stack

0020-valid-parentheses
1128-remove-all-adjacent-duplicates-in-string
2470-removing-stars-from-a-string

Simulation

2428-equal-row-and-column-pairs
2470-removing-stars-from-a-string

Tree

0098-validate-binary-search-tree
0100-same-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree
0975-range-sum-of-bst
1092-maximum-difference-between-node-and-ancestor
1254-deepest-leaves-sum
1544-count-good-nodes-in-binary-tree

Depth-First Search

0098-validate-binary-search-tree
0100-same-tree
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0200-number-of-islands
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree
0547-number-of-provinces
0975-range-sum-of-bst
1092-maximum-difference-between-node-and-ancestor
1254-deepest-leaves-sum
1544-count-good-nodes-in-binary-tree
1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero

Breadth-First Search

0100-same-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0200-number-of-islands
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0547-number-of-provinces
1254-deepest-leaves-sum
1544-count-good-nodes-in-binary-tree
1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero

Binary Tree

0098-validate-binary-search-tree
0100-same-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0515-find-largest-value-in-each-tree-row
0530-minimum-absolute-difference-in-bst
0543-diameter-of-binary-tree
0975-range-sum-of-bst
1092-maximum-difference-between-node-and-ancestor
1254-deepest-leaves-sum
1544-count-good-nodes-in-binary-tree

Binary Search

0035-search-insert-position
0268-missing-number
0300-longest-increasing-subsequence
1468-check-if-n-and-its-double-exist

Bit Manipulation

0136-single-number
0268-missing-number
2427-first-letter-to-appear-twice

Two Pointers

0026-remove-duplicates-from-sorted-array
0027-remove-element
0125-valid-palindrome
0283-move-zeroes
0344-reverse-string
0392-is-subsequence
1019-squares-of-a-sorted-array
1468-check-if-n-and-its-double-exist

Dynamic Programming

0300-longest-increasing-subsequence
0392-is-subsequence
0747-min-cost-climbing-stairs
2262-solving-questions-with-brainpower

Union Find

0200-number-of-islands
0547-number-of-provinces

Matrix

0200-number-of-islands
2428-equal-row-and-column-pairs

Sorting

0049-group-anagrams
0268-missing-number
1019-squares-of-a-sorted-array
1098-largest-unique-number
1354-find-players-with-zero-or-one-losses
1468-check-if-n-and-its-double-exist
2331-intersection-of-multiple-arrays
2473-max-sum-of-a-pair-with-equal-sum-of-digits

Counting

0383-ransom-note
1297-maximum-number-of-balloons
1354-find-players-with-zero-or-one-losses
2053-check-if-all-characters-have-equal-number-of-occurrences
2331-intersection-of-multiple-arrays
2427-first-letter-to-appear-twice

Math

0009-palindrome-number
0268-missing-number
1370-count-number-of-nice-subarrays
1421-find-numbers-with-even-number-of-digits

Sliding Window

1370-count-number-of-nice-subarrays

Prefix Sum

1370-count-number-of-nice-subarrays

Heap (Priority Queue)

2473-max-sum-of-a-pair-with-equal-sum-of-digits

Binary Search Tree

0098-validate-binary-search-tree
0530-minimum-absolute-difference-in-bst
0975-range-sum-of-bst

Graph

0547-number-of-provinces
1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero