🚀 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 #697LC-4181-D Dynamic Programming
Medium

Sentence Screen Fitting (屏幕可显示句子的数量)

Given sentence (a list of words) and a screen with rows rows and cols columns, count how many times the sentence can be repeated b...

View Solution→
NeetCode #698LC-14061-D Dynamic ProgrammingNC 250
Hard

Stone Game III (石子游戏 III)

Alice and Bob play with a row of stones stoneValue. Starting with Alice, each player takes 1, 2, or 3 stones from the front and ad...

View Solution→
NeetCode #699LC-4721-D Dynamic Programming
Hard

Concatenated Words (连接词)

Given an array of distinct strings words, return all words that can be formed by concatenating at least two shorter words from the...

View Solution→
NeetCode #700LC-17991-D Dynamic Programming
Hard

Maximize Score After N Operations (N 次操作后的最大分数和)

Given nums of length 2 * n, perform n operations. In operation i (1-indexed) you pick two unused numbers a and b and gain i * gcd(...

View Solution→
NeetCode #701LC-19641-D Dynamic Programming
Hard

Find the Longest Valid Obstacle Course at Each Position (找出到每个位置为止最长的有效障碍赛跑路线)

For each index i in obstacles, find the length of the longest non-decreasing subsequence that ends at i, and return the array of t...

View Solution→
NeetCode #702LC-16711-D Dynamic Programming
Hard

Minimum Number of Removals to Make Mountain Array (得到山形数组的最少删除次数)

Given nums, return the minimum number of elements to remove so that the remaining array is a mountain array: strictly increasing u...

View Solution→
NeetCode #703LC-13591-D Dynamic Programming
Hard

Count All Valid Pickup and Delivery Options (有效的快递序列数目)

Given n orders, each with a pickup P_i and a delivery D_i, count the number of valid sequences of all 2n events in which P_i alway...

View Solution→
NeetCode #704LC-21471-D Dynamic Programming
Hard

Number of Ways to Divide a Long Corridor (分隔长廊的方案数)

Given a corridor string corridor made of S (seat) and P (plant), place dividers on plants to split the corridor into sections that...

View Solution→
NeetCode #705LC-6891-D Dynamic Programming
Hard

Maximum Sum of 3 Non-Overlapping Subarrays (三个无重叠子数组的最大和)

Given an integer array nums and an integer k, find three non-overlapping subarrays of length k with the maximum total sum and retu...

View Solution→
NeetCode #706LC-12351-D Dynamic Programming
Hard

Maximum Profit in Job Scheduling (规划兼职工作)

Given startTime, endTime, and profit for n jobs, choose a subset of non-overlapping jobs (a job ending at time t does not conflict...

View Solution→
NeetCode #707LC-5521-D Dynamic Programming
Hard

Student Attendance Record II (学生出勤记录 II)

Count the number of attendance records of length n (each day is A absent, L late, or P present) that contain at most one A and no ...

View Solution→
NeetCode #708LC-4651-D Dynamic Programming
Hard

Optimal Account Balancing (最优账单平衡)

Given transactions, where transactions[i] = [from, to, amount] means from paid to that amount, return the minimum number of transa...

View Solution→
NeetCode #709LC-12161-D Dynamic Programming
Hard

Valid Palindrome III (验证回文串 III)

Given a string s and an integer k, return true if s can be turned into a palindrome by deleting at most k characters. Constraints:...

View Solution→
NeetCode #710LC-4711-D Dynamic Programming
Hard

Encode String with Shortest Length (编码最短长度的字符串)

Given a string s, return its shortest encoded form, where a substring that repeats k times may be written as k[encoded]. If the en...

View Solution→
NeetCode #711LC-6561-D Dynamic Programming
Hard

Coin Path (金币路径)

Given an integer array coins, where 0 marks a position you may not land on, and an integer maxJump, find a path from index 0 to in...

View Solution→
NeetCode #712LC-622-D Dynamic ProgrammingBlind 75NC 150NC 250
Medium

Unique Paths (不同路径)

A robot starts at the top-left of an m x n grid and may move only right or down. Return the number of distinct paths to the bottom...

View Solution→
NeetCode #713LC-632-D Dynamic ProgrammingNC 250
Medium

Unique Paths II (不同路径 II)

A robot moves right or down from the top-left to the bottom-right of an m x n grid that contains obstacles marked 1. Return the nu...

View Solution→
NeetCode #714LC-642-D Dynamic ProgrammingNC 250
Medium

Minimum Path Sum (最小路径和)

Given an m x n grid of non-negative integers, find a path from the top-left to the bottom-right (moving right or down) that minimi...

View Solution→
NeetCode #715LC-19372-D Dynamic Programming
Medium

Maximum Number of Points with Cost (扣分后的最大得分)

Given an m x n matrix points, choose exactly one cell in each row. The score is the sum of the chosen values minus the total penal...

View Solution→
NeetCode #716LC-11432-D Dynamic ProgrammingBlind 75NC 150NC 250
Medium

Longest Common Subsequence (最长公共子序列)

Given strings text1 and text2, return the length of their longest common subsequence, or 0 if none exists. A subsequence preserves...

View Solution→
NeetCode #717LC-5162-D Dynamic Programming
Medium

Longest Palindromic Subsequence (最长回文子序列)

Given a string s, return the length of its longest palindromic subsequence. Constraints: 1 <= s.length <= 1000, and s consis...

View Solution→
NeetCode #718LC-8732-D Dynamic Programming
Medium

Length of Longest Fibonacci Subsequence (最长的斐波那契子序列的长度)

Given a strictly increasing array arr of positive integers, return the length of the longest Fibonacci-like subsequence, in which ...

View Solution→
NeetCode #719LC-10492-D Dynamic ProgrammingNC 250
Medium

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

Given stone weights stones, repeatedly smash two stones together: if they are equal both vanish, otherwise the larger becomes thei...

View Solution→
NeetCode #720LC-3092-D Dynamic ProgrammingNC 150NC 250
Medium

Best Time to Buy and Sell Stock with Cooldown (最佳买卖股票时机含冷冻期)

Given prices, find the maximum profit from any number of buy/sell transactions, with the restriction that after selling you must w...

View Solution→