🚀 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 #673LC-4161-D Dynamic ProgrammingNC 150NC 250
Medium

Partition Equal Subset Sum (分割等和子集)

Given a non-empty array nums of positive integers, return whether it can be partitioned into two subsets with equal sums. Constrai...

View Solution→
NeetCode #674LC-1201-D Dynamic Programming
Medium

Triangle (三角形最小路径和)

Given a triangle array, return the minimum path sum from the top to the bottom, where each step moves to an adjacent number in the...

View Solution→
NeetCode #675LC-7401-D Dynamic Programming
Medium

Delete and Earn (删除并获得点数)

You are given an integer array nums. You may delete elements, earning points equal to the value deleted, but deleting a value x al...

View Solution→
NeetCode #676LC-11051-D Dynamic Programming
Medium

Filling Bookcase Shelves (填充书架)

Books must be placed in order on shelves of width shelfWidth. Each book has a thickness and a height; the height of a shelf is the...

View Solution→
NeetCode #677LC-3771-D Dynamic ProgrammingNC 250
Medium

Combination Sum IV (组合总和 IV)

Given an array of distinct positive integers nums and a target, return the number of ordered sequences whose elements sum to targe...

View Solution→
NeetCode #678LC-2791-D Dynamic ProgrammingNC 250
Medium

Perfect Squares (完全平方数)

Given an integer n, return the fewest number of perfect squares whose sum equals n. A perfect square is k * k for some integer k. ...

View Solution→
NeetCode #679LC-23691-D Dynamic Programming
Medium

Check if There is a Valid Partition For The Array (检查数组是否存在有效划分)

Given a 0-indexed integer array nums, a partition into contiguous subarrays is valid when every subarray is one of: length 2 with ...

View Solution→
NeetCode #680LC-18561-D Dynamic Programming
Medium

Maximum Subarray Min-Product (子数组最小乘积的最大值)

The min-product of a subarray is its minimum value multiplied by its sum. Given an array nums, return the maximum min-product over...

View Solution→
NeetCode #681LC-9831-D Dynamic Programming
Medium

Minimum Cost For Tickets (最低票价)

You are given days, the days of the year on which you travel, and costs = [cost1, cost7, cost30] for 1-day, 7-day, and 30-day pass...

View Solution→
NeetCode #682LC-3431-D Dynamic ProgrammingNC 250
Medium

Integer Break (整数拆分)

Given an integer n, break it into the sum of at least two positive integers and maximise the product of those integers. Return the...

View Solution→
NeetCode #683LC-6731-D Dynamic Programming
Medium

Number of Longest Increasing Subsequence (最长递增子序列的个数)

Given an integer array nums, return the number of longest strictly increasing subsequences. Constraints: 1 <= nums.length <=...

View Solution→
NeetCode #684LC-3541-D Dynamic Programming
Hard

Russian Doll Envelopes (俄罗斯套娃信封问题)

You are given a 2-D array envelopes of [width, height] pairs. An envelope can be placed inside another only if both its width and ...

View Solution→
NeetCode #685LC-6911-D Dynamic Programming
Hard

Stickers to Spell Word (贴纸拼词)

Given an array of stickers (each a string of lowercase letters) and a target string, return the minimum number of stickers needed ...

View Solution→
NeetCode #686LC-10351-D Dynamic Programming
Medium

Uncrossed Lines (不相交的线)

You are given two integer arrays nums1 and nums2. Draw connecting lines between equal values, preserving order, so that no two lin...

View Solution→
NeetCode #687LC-21401-D Dynamic Programming
Medium

Solving Questions With Brainpower (解决智力问题)

You are given a 2-D array questions where questions[i] = [points_i, brainpower_i]. Solving question i earns points_i but forces yo...

View Solution→
NeetCode #688LC-24661-D Dynamic Programming
Medium

Count Ways To Build Good Strings (统计构造好字符串的方案数)

Given low, high, zero, and one, build strings by appending either zero copies of the character zero or one copies of the character...

View Solution→
NeetCode #689LC-2641-D Dynamic Programming
Medium

Ugly Number II (丑数 II)

An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given n, return the n-th ugly number. Constra...

View Solution→
NeetCode #690LC-8371-D Dynamic Programming
Medium

New 21 Game (新 21 点)

Starting with 0 points, repeatedly draw an integer uniformly from [1, maxPts] and add it, stopping as soon as the score reaches k ...

View Solution→
NeetCode #691LC-16261-D Dynamic Programming
Medium

Best Team With No Conflicts (无矛盾的最佳球队)

You are given integer arrays scores and ages. A team is conflict-free when no younger player has a strictly higher score. Return t...

View Solution→
NeetCode #692LC-10481-D Dynamic Programming
Medium

Longest String Chain (最长字符串链)

Given an array of words, a word chain is a sequence where each word is a predecessor of the next, meaning the next word can be for...

View Solution→
NeetCode #693LC-9351-D Dynamic Programming
Medium

Knight Dialer (骑士拨号器)

A chess knight dials phone numbers on a keypad shaped like a 3 x 4 grid holding the digits 0-9 (the bottom-left and bottom-right c...

View Solution→
NeetCode #694LC-10431-D Dynamic Programming
Medium

Partition Array for Maximum Sum (分隔数组以得到最大和)

Given an integer array arr and an integer k, partition arr into contiguous subarrays each of length at most k. Every element of a ...

View Solution→
NeetCode #695LC-3681-D Dynamic Programming
Medium

Largest Divisible Subset (最大整除子集)

Given a set of distinct positive integers nums, return the largest subset in which every pair (a, b) satisfies a % b == 0 or b % a...

View Solution→
NeetCode #696LC-23931-D Dynamic Programming
Medium

Count Strictly Increasing Subarrays (统计严格递增子数组的数目)

Given an integer array nums, return the number of contiguous subarrays that are strictly increasing. Constraints: 1 <= nums.len...

View Solution→