Challenges for New Users

LeetCode is the golden standard for technical interviews . LeetCode problems are widely used during technical interviews at companies like Facebook, Hulu and Google. In the face of tight and limited job preparation time, this set of selected high-frequency interview problems can help you improve efficiently and greatly increase the possibility of obtaining an offer.

LeetCode Curated Algo 170

Aiming for Microsoft? This problems list will give you a preliminary grasp of their interview style and test sites, and conduct simulation exercises in advance. The list is updated based on how frequently problems appear in an interview.

LeetCode Curated SQL 70

Two Sum

two-sum

Array

Hash Table

Add Two Numbers

add-two-numbers

Linked List

Math

Recursion

Longest Substring Without Repeating Characters

longest-substring-without-repeating-characters

String

Sliding Window

Median of Two Sorted Arrays

median-of-two-sorted-arrays

Binary Search

Divide and Conquer

Longest Palindromic Substring

longest-palindromic-substring

Dynamic Programming

Container With Most Water

container-with-most-water

Two Pointers

Greedy

Roman to Integer

roman-to-integer

Longest Common Prefix

longest-common-prefix

Trie

3Sum

3sum

Sorting

Letter Combinations of a Phone Number

letter-combinations-of-a-phone-number

Backtracking

Remove Nth Node From End of List

remove-nth-node-from-end-of-list

Valid Parentheses

valid-parentheses

Stack

Merge Two Sorted Lists

merge-two-sorted-lists

Generate Parentheses

generate-parentheses

Merge k Sorted Lists

merge-k-sorted-lists

Heap (Priority Queue)

Merge Sort

Swap Nodes in Pairs

swap-nodes-in-pairs

Reverse Nodes in k-Group

reverse-nodes-in-k-group

Next Permutation

next-permutation

Longest Valid Parentheses

longest-valid-parentheses

Search in Rotated Sorted Array

search-in-rotated-sorted-array

Find First and Last Position of Element in Sorted Array

find-first-and-last-position-of-element-in-sorted-array

Search Insert Position

search-insert-position

Combination Sum

combination-sum

First Missing Positive

first-missing-positive

Trapping Rain Water

trapping-rain-water

Monotonic Stack

Jump Game II

jump-game-ii

Permutations

permutations

Rotate Image

rotate-image

Matrix

Group Anagrams

group-anagrams

N-Queens

n-queens

Maximum Subarray

maximum-subarray

Spiral Matrix

spiral-matrix

Simulation

Jump Game

jump-game

Merge Intervals

merge-intervals

Unique Paths

unique-paths

Combinatorics

Minimum Path Sum

minimum-path-sum

Climbing Stairs

climbing-stairs

Memoization

Edit Distance

edit-distance

Set Matrix Zeroes

set-matrix-zeroes

Search a 2D Matrix

search-a-2d-matrix

Sort Colors

sort-colors

Minimum Window Substring

minimum-window-substring

Subsets

subsets

Bit Manipulation

Word Search

word-search

Largest Rectangle in Histogram

largest-rectangle-in-histogram

Binary Tree Inorder Traversal

binary-tree-inorder-traversal

Tree

Depth-First Search

Binary Tree

Validate Binary Search Tree

validate-binary-search-tree

Binary Search Tree

Symmetric Tree

symmetric-tree

Breadth-First Search

Binary Tree Level Order Traversal

binary-tree-level-order-traversal

Maximum Depth of Binary Tree

maximum-depth-of-binary-tree

Database

Graph

Design

Prefix Sum

Counting

Union Find

Ordered Set

Enumeration

Bitmask

Queue

Segment Tree

Geometry

Topological Sort

Number Theory

Binary Indexed Tree

Hash Function

Game Theory

Shortest Path

Data Stream

Interactive

String Matching

Rolling Hash

Brainteaser

Randomized

Monotonic Queue

Iterator

Concurrency

Doubly-Linked List

Probability and Statistics

Quickselect

Bucket Sort

Suffix Array

Minimum Spanning Tree

Counting Sort

Shell

Line Sweep

Reservoir Sampling

Eulerian Circuit

Radix Sort

Strongly Connected Component

Rejection Sampling

Biconnected Component