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

Zigzag Conversion

zigzag-conversion

Reverse Integer

reverse-integer

String to Integer (atoi)

string-to-integer-atoi

Palindrome Number

palindrome-number

Regular Expression Matching

regular-expression-matching

Container With Most Water

container-with-most-water

Two Pointers

Greedy

Integer to Roman

integer-to-roman

Roman to Integer

roman-to-integer

Longest Common Prefix

longest-common-prefix

Trie

3Sum

3sum

Sorting

3Sum Closest

3sum-closest

Letter Combinations of a Phone Number

letter-combinations-of-a-phone-number

Backtracking

4Sum

4sum

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

Remove Duplicates from Sorted Array

remove-duplicates-from-sorted-array

Remove Element

remove-element

Find the Index of the First Occurrence in a String

find-the-index-of-the-first-occurrence-in-a-string

String Matching

Divide Two Integers

divide-two-integers

Bit Manipulation

Substring with Concatenation of All Words

substring-with-concatenation-of-all-words

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

Valid Sudoku

valid-sudoku

Matrix

Sudoku Solver

sudoku-solver

Count and Say

count-and-say

Combination Sum

combination-sum

Combination Sum II

combination-sum-ii

First Missing Positive

first-missing-positive

Trapping Rain Water

trapping-rain-water

Monotonic Stack

Multiply Strings

multiply-strings

Simulation

Wildcard Matching

wildcard-matching

Jump Game II

jump-game-ii

Permutations

permutations

Permutations II

permutations-ii

Rotate Image

rotate-image

Group Anagrams

group-anagrams

Pow(x, n)

powx-n

Depth-First Search

Database

Breadth-First Search

Tree

Binary Tree

Design

Graph

Prefix Sum

Counting

Union Find

Ordered Set

Enumeration

Binary Search Tree

Queue

Bitmask

Memoization

Geometry

Segment Tree

Topological Sort

Number Theory

Binary Indexed Tree

Hash Function

Game Theory

Data Stream

Interactive

Combinatorics

Rolling Hash

Shortest Path

Randomized

Brainteaser

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