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

LeetCode Topics

Array

0001-two-sum
0624-maximum-distance-in-arrays

Greedy

0409-longest-palindrome
0624-maximum-distance-in-arrays
1252-break-a-palindrome
2475-largest-palindromic-number
2816-lexicographically-smallest-palindrome

Hash Table

0001-two-sum
0013-roman-to-integer
0409-longest-palindrome
2475-largest-palindromic-number

Math

0002-add-two-numbers
0009-palindrome-number
0013-roman-to-integer
1411-convert-binary-number-in-a-linked-list-to-integer
2481-strictly-palindromic-number
2871-double-a-number-represented-as-a-linked-list

String

0005-longest-palindromic-substring
0013-roman-to-integer
0131-palindrome-partitioning
0409-longest-palindrome
0647-palindromic-substrings
1252-break-a-palindrome
2475-largest-palindromic-number
2816-lexicographically-smallest-palindrome

Stack

0234-palindrome-linked-list
0933-increasing-order-search-tree
2871-double-a-number-represented-as-a-linked-list

Tree

0098-validate-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0501-find-mode-in-binary-search-tree
0784-insert-into-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Depth-First Search

0098-validate-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0501-find-mode-in-binary-search-tree
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Binary Search Tree

0098-validate-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0501-find-mode-in-binary-search-tree
0784-insert-into-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Binary Tree

0098-validate-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0501-find-mode-in-binary-search-tree
0784-insert-into-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0933-increasing-order-search-tree
0975-range-sum-of-bst

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0061-rotate-list
0083-remove-duplicates-from-sorted-list
0109-convert-sorted-list-to-binary-search-tree
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list
0908-middle-of-the-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer
2299-merge-nodes-in-between-zeros
2871-double-a-number-represented-as-a-linked-list

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list

Two Pointers

0005-longest-palindromic-substring
0019-remove-nth-node-from-end-of-list
0061-rotate-list
0234-palindrome-linked-list
0647-palindromic-substrings
0908-middle-of-the-linked-list
2481-strictly-palindromic-number
2816-lexicographically-smallest-palindrome

Breadth-First Search

0799-minimum-distance-between-bst-nodes

Dynamic Programming

0005-longest-palindromic-substring
0131-palindrome-partitioning
0647-palindromic-substrings

Counting

2475-largest-palindromic-number

Brainteaser

2481-strictly-palindromic-number

Simulation

2299-merge-nodes-in-between-zeros

Backtracking

0131-palindrome-partitioning

Divide and Conquer

0109-convert-sorted-list-to-binary-search-tree