🚀 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 #745LC-22182-D Dynamic Programming
Hard

Maximum Value of K Coins From Piles (从栈中取出 K 个硬币的最大面值和)

There are piles of coins; piles[i][j] is the value of the j-th coin from the top of pile i. You take exactly k coins, and from any...

View Solution→
NeetCode #746LC-9202-D Dynamic Programming
Hard

Number of Music Playlists (播放列表的数量)

You build a playlist of length goal from n distinct songs. Every song must be played at least once, and a song may repeat only if ...

View Solution→
NeetCode #747LC-16392-D Dynamic Programming
Hard

Number of Ways to Form a Target String Given a Dictionary (通过给定词典构造目标字符串的方案数)

Given a list of equal-length words and a target string, count the number of ways to form target by picking, for each position k, a...

View Solution→
NeetCode #748LC-8792-D Dynamic Programming
Hard

Profitable Schemes (盈利计划)

There are n members available. Crime i needs group[i] members and yields profit[i]. Choose a subset of crimes whose total members ...

View Solution→
NeetCode #749LC-15472-D Dynamic Programming
Hard

Minimum Cost to Cut a Stick (切棍子的最小成本)

A wooden stick of length n has cut positions cuts. Each cut costs the length of the stick being cut at that moment. Return the min...

View Solution→
NeetCode #750LC-27422-D Dynamic Programming
Hard

Painting the Walls (给墙壁刷油漆)

You must paint n walls. A paid painter paints wall i in time[i] units and charges cost[i]; while the paid painter is busy, a free ...

View Solution→
NeetCode #751LC-12692-D Dynamic Programming
Hard

Number of Ways to Stay in the Same Place After Some Steps (停在原地的方案数)

An array has length arrLen and a pointer starts at index 0. Each step the pointer moves left, right, or stays put, and it must rem...

View Solution→
NeetCode #752LC-15312-D Dynamic Programming
Hard

String Compression II (压缩字符串 II)

Run-length encoding replaces a run of L identical characters c with c if L == 1, else c followed by the decimal digits of L. Given...

View Solution→
NeetCode #753LC-13352-D Dynamic Programming
Hard

Minimum Difficulty of a Job Schedule (工作计划的最低难度)

You have jobDifficulty and d days. Split the jobs, in the given order, into exactly d non-empty consecutive groups. A day's diffic...

View Solution→
NeetCode #754LC-4462-D Dynamic Programming
Hard

Arithmetic Slices II - Subsequence (等差数列划分 II - 子序列)

Given an integer array nums, return the number of arithmetic subsequences of length at least 3. Constraints: 1 <= nums.length &...

View Solution→
NeetCode #755LC-6292-D Dynamic Programming
Hard

K Inverse Pairs Array (K 个逆序对数组)

Given n and k, count the permutations of the integers 1 to n that have exactly k inverse pairs, modulo 1e9+7. An inverse pair is a...

View Solution→
NeetCode #756LC-7412-D Dynamic Programming
Hard

Cherry Pickup (摘樱桃)

Given an n x n grid where 0 is empty, 1 is a cherry, and -1 is a thorn (blocked), start at (0, 0), walk to (n-1, n-1) moving only ...

View Solution→
NeetCode #757LC-14632-D Dynamic Programming
Hard

Cherry Pickup II (摘樱桃 II)

Given a rows x cols grid of cherries, two robots start at (0, 0) and (0, cols-1). Each step both move down one row, to a column wi...

View Solution→
NeetCode #758LC-12892-D Dynamic Programming
Hard

Minimum Falling Path Sum II (下降路径最小和 II)

Given an n x n grid, a falling path picks one cell per row, and the column chosen in row r + 1 must differ from the column chosen ...

View Solution→
NeetCode #759LC-5142-D Dynamic Programming
Hard

Freedom Trail (自由之路)

The string ring is written around a dial with index 0 at the top, and a center button can be pressed. To spell key, rotate the rin...

View Solution→
NeetCode #760LC-8052-D Dynamic Programming
Hard

Split Array With Same Average (数组的均值分割)

Given an integer array nums, return true if it can be split into two non-empty subsets whose averages are equal. Constraints: 1 &l...

View Solution→
NeetCode #761LC-2652-D Dynamic ProgrammingNC Algo100
Hard

Paint House II (粉刷房子 II)

There are n houses in a row and k colours. Painting house i with colour j costs costs[i][j], and no two adjacent houses may share ...

View Solution→
NeetCode #762LC-2706Greedy
Easy

Buy Two Chocolates (购买两块巧克力)

You are given an integer array prices and an integer money. You must buy exactly two distinct chocolates. Return the money left af...

View Solution→
NeetCode #763LC-860GreedyNC 250
Easy

Lemonade Change (柠檬水找零)

Each customer in a queue pays with a 5, 10 or 20 dollar bill for a 5 dollar lemonade. You start with no change. Return true if you...

View Solution→
NeetCode #764LC-2037Greedy
Easy

Minimum Number of Moves to Seat Everyone (使每位学生都有座位的最少移动次数)

There are n seats and n students. seats[i] is the position of the i-th seat and students[j] the position of the j-th student. Each...

View Solution→
NeetCode #765LC-2864Greedy
Easy

Maximum Odd Binary Number (最大二进制奇数)

You are given a binary string s containing at least one 1. Rearrange its bits to form the maximum odd binary number (a binary stri...

View Solution→
NeetCode #766LC-1614Greedy
Easy

Maximum Nesting Depth of the Parentheses (括号的最大嵌套深度)

A string s is a valid parentheses string (VPS) if it is empty, or (A) or AB for VPS A and B, and contains no other characters. Ret...

View Solution→
NeetCode #767LC-1790Greedy
Easy

Check if One String Swap Can Make Strings Equal (仅执行一次字符串交换能否使两个字符串相等)

You are given two strings s1 and s2 of equal length. You may swap exactly two characters at indices i and j (possibly i == j) in o...

View Solution→
NeetCode #768LC-1196Greedy
Easy

How Many Apples Can You Put into the Basket (最多可以买到的苹果数量)

You are given an array weight where weight[i] is the weight of the i-th apple. A basket can hold at most 5000 units. Return the ma...

View Solution→