🚀 NeetCode 973 Algorithm HandbookBlind 75 · NC 150 · NC 25019 Core Categories

NeetCode Comprehensive Algorithm Bank & Offline Handbook

Synchronized bilingual toggle with dual NeetCode & LeetCode problem numbering and direct links. Features step-by-step logic, benchmark Python3 code, complexity analysis, interview pitfalls, and standalone offline exports.

Mastery Progress
0.0%(0/973)
● Mastered: 0
◐ Reviewing: 0
○ Unstarted: 973
🔍
🎯 Featured Lists
📂 Categories (19 Core Topics)
Diff:
Mastery:
Showing 24 problems
NeetCode #505LC-1980Backtracking
Medium

Find Unique Binary String (找到不同的二进制字符串)

Given an array of n unique binary strings each of length n, return a binary string of length n that does not appear in the array. ...

View Solution→
NeetCode #506LC-1593Backtracking
Medium

Split a String Into the Max Number of Unique Substrings (拆分字符串使唯一子字符串的数目最大)

Given a string s, return the maximum number of unique non-empty substrings into which s can be split. Constraints: 1 <= s.lengt...

View Solution→
NeetCode #507LC-1239Backtracking
Medium

Maximum Length of a Concatenated String with Unique Characters (串联字符串的最大长度)

You are given an array of strings arr. Concatenate a subsequence of them so that the concatenated string has all unique characters...

View Solution→
NeetCode #508LC-698BacktrackingNC 250
Medium

Partition to K Equal Sum Subsets (划分为 k 个相等的子集)

Given an integer array nums and an integer k, return whether it is possible to divide the array into k non-empty subsets with equa...

View Solution→
NeetCode #509LC-2597Backtracking
Medium

The Number of Beautiful Subsets (美丽子集的数目)

You are given an array nums of positive integers and a positive integer k. A subset is beautiful if it contains no two elements wh...

View Solution→
NeetCode #510LC-241Backtracking
Medium

Different Ways to Add Parentheses (为运算表达式设计优先级)

Given a string expression of numbers and the operators +, -, *, return all possible results from computing all the different ways ...

View Solution→
NeetCode #511LC-1718Backtracking
Medium

Construct the Lexicographically Largest Valid Sequence (构建字典序最大的可行序列)

Given an integer n, construct the lexicographically largest sequence of length 2n - 1 containing two occurrences of each number fr...

View Solution→
NeetCode #512LC-2044Backtracking
Medium

Count Number of Maximum Bitwise-OR Subsets (统计按位或能得到最大值的子集数目)

Given an integer array nums, return the number of subsets whose bitwise OR equals the maximum possible OR. Constraints: 1 <= nu...

View Solution→
NeetCode #513LC-247BacktrackingNC Algo100
Medium

Strobogrammatic Number II (中心对称数 II)

Given an integer n, return all strobogrammatic numbers of length n in any order. A strobogrammatic number looks the same when rota...

View Solution→
NeetCode #514LC-254BacktrackingNC Algo100
Medium

Factor Combinations (因子的组合)

Numbers can be expressed as products of their factors. Given an integer n, return all possible factor combinations of n using fact...

View Solution→
NeetCode #515LC-1087BacktrackingNC Algo100
Medium

Brace Expansion (花括号展开)

You are given a string expression representing a brace expansion, e.g. "{a,b}{c,{d,e}}". Return all words generated by the expansi...

View Solution→
NeetCode #516LC-291Backtracking
Medium

Word Pattern II (单词规律 II)

Given a pattern string and a string s, return whether s matches the pattern, where each letter in the pattern maps bijectively to ...

View Solution→
NeetCode #517LC-351Backtracking
Medium

Android Unlock Patterns (安卓系统手势解锁)

Android unlock patterns are drawn on a 3x3 grid of dots using 4 to 9 distinct dots. A move may skip over an already-visited dot, b...

View Solution→
NeetCode #518LC-51BacktrackingNC 150NC 250
Hard

N-Queens (N 皇后)

The n-queens puzzle places n queens on an n x n board so that no two attack each other. Given n, return all distinct solutions, ea...

View Solution→
NeetCode #519LC-52BacktrackingNC 250
Hard

N-Queens II (N 皇后 II)

The n-queens puzzle places n queens on an n x n board so that no two attack each other. Given n, return the number of distinct sol...

View Solution→
NeetCode #520LC-1255Backtracking
Hard

Maximum Score Words Formed by Letters (得分最高的单词集合)

You are given words, letters (available letters, each usable once) and score (the score of each letter a-z). Return the maximum sc...

View Solution→
NeetCode #521LC-140BacktrackingNC 250
Hard

Word Break II (单词拆分 II)

Given a string s and a dictionary wordDict, add spaces to construct sentences where every word is in the dictionary. Return all su...

View Solution→
NeetCode #522LC-489Backtracking
Hard

Robot Room Cleaner (扫地机器人)

This is an interactive problem. A robot can move() (returns whether the move succeeded), turnLeft(), turnRight() and clean(). Give...

View Solution→
NeetCode #523LC-703Heap / Priority QueueNC 150NC 250
Easy

Kth Largest Element in a Stream (数据流中的第 K 大元素)

Design a class that finds the k-th largest element in a stream. KthLargest(k, nums) initialises with the initial numbers, and add(...

View Solution→
NeetCode #524LC-1046Heap / Priority QueueNC 150NC 250
Easy

Last Stone Weight (最后一块石头的重量)

You are given an array stones of weights. Repeatedly pick the two heaviest stones: if they are equal both are destroyed, otherwise...

View Solution→
NeetCode #525LC-2558Heap / Priority Queue
Easy

Take Gifts From the Richest Pile (从数量最多的堆取走礼物)

You are given an integer array gifts where gifts[i] is the number of gifts in the i-th pile, and an integer k. Each second you tak...

View Solution→
NeetCode #526LC-3264Heap / Priority Queue
Easy

Final Array State After K Multiplication Operations I (K 次乘运算后的最终数组 I)

You are given an integer array nums, an integer k and a multiplier multiplier. Repeat k times: find the minimum value in nums (tie...

View Solution→
NeetCode #527LC-1086Heap / Priority QueueNC Algo100
Easy

High Five (前五科的均分)

Given a list of [studentId, score] items, return each student's id with the floor of the average of their top five scores, sorted ...

View Solution→
NeetCode #528LC-1167Heap / Priority QueueNC Algo100
Medium

Minimum Cost to Connect Sticks (连接棒材的最低费用)

You are given an array sticks of positive integers. Repeatedly connect two sticks into one, paying the cost of the combined length...

View Solution→