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

LeetCode Topics

Array

0011-container-with-most-water
0026-remove-duplicates-from-sorted-array
0027-remove-element
0035-search-insert-position
0053-maximum-subarray
0121-best-time-to-buy-and-sell-stock
0167-two-sum-ii-input-array-is-sorted
0283-move-zeroes
0347-top-k-frequent-elements
0350-intersection-of-two-arrays-ii
0704-binary-search
1207-unique-number-of-occurrences
1480-running-sum-of-1d-array

Two Pointers

0011-container-with-most-water
0026-remove-duplicates-from-sorted-array
0027-remove-element
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0167-two-sum-ii-input-array-is-sorted
0283-move-zeroes
0345-reverse-vowels-of-a-string
0350-intersection-of-two-arrays-ii
0392-is-subsequence
0844-backspace-string-compare

Greedy

0011-container-with-most-water

String

0020-valid-parentheses
0067-add-binary
0125-valid-palindrome
0242-valid-anagram
0345-reverse-vowels-of-a-string
0392-is-subsequence
0844-backspace-string-compare
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one

Stack

0020-valid-parentheses
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0232-implement-queue-using-stacks
0844-backspace-string-compare

Tree

0094-binary-tree-inorder-traversal
0098-validate-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
0107-binary-tree-level-order-traversal-ii
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
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
0236-lowest-common-ancestor-of-a-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
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
0236-lowest-common-ancestor-of-a-binary-tree

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
0107-binary-tree-level-order-traversal-ii
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0199-binary-tree-right-side-view
0226-invert-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-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
0107-binary-tree-level-order-traversal-ii
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
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
0236-lowest-common-ancestor-of-a-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree

Bit Manipulation

0067-add-binary
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one

Simulation

0067-add-binary
0844-backspace-string-compare
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one

Divide and Conquer

0053-maximum-subarray
0347-top-k-frequent-elements

Dynamic Programming

0053-maximum-subarray
0121-best-time-to-buy-and-sell-stock
0392-is-subsequence

Linked List

0021-merge-two-sorted-lists
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0141-linked-list-cycle
0142-linked-list-cycle-ii
0206-reverse-linked-list

Recursion

0021-merge-two-sorted-lists
0206-reverse-linked-list

Hash Table

0141-linked-list-cycle
0142-linked-list-cycle-ii
0242-valid-anagram
0347-top-k-frequent-elements
0350-intersection-of-two-arrays-ii
1207-unique-number-of-occurrences

Binary Search

0035-search-insert-position
0069-sqrtx
0167-two-sum-ii-input-array-is-sorted
0350-intersection-of-two-arrays-ii
0367-valid-perfect-square
0704-binary-search

Sorting

0242-valid-anagram
0347-top-k-frequent-elements
0350-intersection-of-two-arrays-ii

Math

0067-add-binary
0069-sqrtx
0367-valid-perfect-square

Heap (Priority Queue)

0347-top-k-frequent-elements

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements

Quickselect

0347-top-k-frequent-elements

Design

0232-implement-queue-using-stacks
0933-number-of-recent-calls

Queue

0232-implement-queue-using-stacks
0933-number-of-recent-calls

Data Stream

0933-number-of-recent-calls

Binary Search Tree

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

Backtracking

0113-path-sum-ii

Prefix Sum

1480-running-sum-of-1d-array