leetcode

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

LeetCode Topics

Array

0001-two-sum
0014-longest-common-prefix
0026-remove-duplicates-from-sorted-array
0027-remove-element
0033-search-in-rotated-sorted-array
0051-n-queens
0108-convert-sorted-array-to-binary-search-tree
0136-single-number
0169-majority-element
0217-contains-duplicate
0283-move-zeroes
0713-subarray-product-less-than-k
2479-meeting-rooms-iii

Binary Search

0033-search-in-rotated-sorted-array
0278-first-bad-version
0713-subarray-product-less-than-k

Sliding Window

0713-subarray-product-less-than-k

Prefix Sum

0713-subarray-product-less-than-k

Hash Table

0001-two-sum
0013-roman-to-integer
0141-linked-list-cycle
0169-majority-element
0217-contains-duplicate
0383-ransom-note
0409-longest-palindrome
2479-meeting-rooms-iii

String

0013-roman-to-integer
0014-longest-common-prefix
0020-valid-parentheses
0067-add-binary
0383-ransom-note
0409-longest-palindrome
0443-string-compression
0874-backspace-string-compare

Stack

0020-valid-parentheses
0232-implement-queue-using-stacks
0874-backspace-string-compare

Design

0232-implement-queue-using-stacks

Queue

0232-implement-queue-using-stacks

Linked List

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

Recursion

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

Two Pointers

0026-remove-duplicates-from-sorted-array
0027-remove-element
0141-linked-list-cycle
0283-move-zeroes
0443-string-compression
0874-backspace-string-compare

Tree

0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree

Depth-First Search

0110-balanced-binary-tree

Binary Tree

0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree

Interactive

0278-first-bad-version

Divide and Conquer

0108-convert-sorted-array-to-binary-search-tree
0169-majority-element
0191-number-of-1-bits

Binary Search Tree

0108-convert-sorted-array-to-binary-search-tree

Counting

0169-majority-element
0383-ransom-note

Math

0009-palindrome-number
0013-roman-to-integer
0067-add-binary
0070-climbing-stairs

Dynamic Programming

0070-climbing-stairs
0338-counting-bits

Memoization

0070-climbing-stairs

Bit Manipulation

0067-add-binary
0136-single-number
0191-number-of-1-bits
0338-counting-bits

Simulation

0067-add-binary
0874-backspace-string-compare
2479-meeting-rooms-iii

Backtracking

0051-n-queens

Sorting

0169-majority-element
0217-contains-duplicate
2479-meeting-rooms-iii

Heap (Priority Queue)

2479-meeting-rooms-iii

Greedy

0409-longest-palindrome

Trie

0014-longest-common-prefix