leetcode

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

LeetCode Topics

Tree

0098-validate-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
1544-count-good-nodes-in-binary-tree

Depth-First Search

0098-validate-binary-search-tree
0100-same-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
1544-count-good-nodes-in-binary-tree

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0226-invert-binary-tree
1544-count-good-nodes-in-binary-tree

Binary Tree

0098-validate-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
1544-count-good-nodes-in-binary-tree

String Matching

0005-longest-palindromic-substring
0006-zigzag-conversion
0008-string-to-integer-atoi
0012-integer-to-roman
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0572-subtree-of-another-tree
3143-longest-unequal-adjacent-groups-subsequence-i

Hash Function

0572-subtree-of-another-tree

Array

0004-median-of-two-sorted-arrays
0014-longest-common-prefix
0015-3sum
0018-4sum
0036-valid-sudoku
0039-combination-sum
0040-combination-sum-ii
0078-subsets
0088-merge-sorted-array
0128-longest-consecutive-sequence
0167-two-sum-ii-input-array-is-sorted
0238-product-of-array-except-self
0347-top-k-frequent-elements
1421-find-numbers-with-even-number-of-digits
2387-partition-array-such-that-maximum-difference-is-k
3143-longest-unequal-adjacent-groups-subsequence-i

Hash Table

0012-integer-to-roman
0017-letter-combinations-of-a-phone-number
0036-valid-sudoku
0128-longest-consecutive-sequence
0347-top-k-frequent-elements
1500-count-largest-group

Divide and Conquer

0004-median-of-two-sorted-arrays
0023-merge-k-sorted-lists
0347-top-k-frequent-elements

Sorting

0015-3sum
0018-4sum
0088-merge-sorted-array
0347-top-k-frequent-elements
2387-partition-array-such-that-maximum-difference-is-k

Heap (Priority Queue)

0023-merge-k-sorted-lists
0347-top-k-frequent-elements

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements

Quickselect

0347-top-k-frequent-elements

Prefix Sum

0238-product-of-array-except-self

Matrix

0036-valid-sudoku

Union Find

0128-longest-consecutive-sequence

Two Pointers

0005-longest-palindromic-substring
0015-3sum
0018-4sum
0088-merge-sorted-array
0167-two-sum-ii-input-array-is-sorted

Binary Search

0004-median-of-two-sorted-arrays
0167-two-sum-ii-input-array-is-sorted

Stack

0020-valid-parentheses

Math

0002-add-two-numbers
0012-integer-to-roman
1421-find-numbers-with-even-number-of-digits
1500-count-largest-group

Backtracking

0017-letter-combinations-of-a-phone-number
0039-combination-sum
0040-combination-sum-ii
0078-subsets

Bit Manipulation

0078-subsets

Dynamic Programming

0005-longest-palindromic-substring
3143-longest-unequal-adjacent-groups-subsequence-i

Greedy

2387-partition-array-such-that-maximum-difference-is-k
3143-longest-unequal-adjacent-groups-subsequence-i

Binary Search Tree

0098-validate-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree

Linked List

0002-add-two-numbers
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0083-remove-duplicates-from-sorted-list
0203-remove-linked-list-elements

Recursion

0002-add-two-numbers
0024-swap-nodes-in-pairs
0203-remove-linked-list-elements

Trie

0014-longest-common-prefix

Merge Sort

0023-merge-k-sorted-lists