🚀 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 #817LC-769Greedy
Medium

Max Chunks To Make Sorted (最多能完成排序的块)

You are given an array arr that is a permutation of 0 .. n-1. Split the array into some number of contiguous chunks and sort each ...

View Solution→
NeetCode #818LC-31Greedy
Medium

Next Permutation (下一个排列)

A permutation of integers is given as nums. Rearrange it in place into the next permutation in lexicographic order. If no larger p...

View Solution→
NeetCode #819LC-670Greedy
Medium

Maximum Swap (最大交换)

You are given an integer num. You may swap two digits at most once to get the maximum valued number. Return the maximum value you ...

View Solution→
NeetCode #820LC-2530Greedy
Medium

Maximal Score After Applying K Operations (执行 K 次操作后的最大分数)

You are given an integer array nums and an integer k. In one operation, choose an index i, add nums[i] to your score, then replace...

View Solution→
NeetCode #821LC-3434Greedy
Medium

Maximum Frequency After Subarray Operation (子数组操作后的最大频率)

You are given an integer array nums and an integer k. Choose one contiguous subarray and add k to every element in it. Return the ...

View Solution→
NeetCode #822LC-1564Greedy
Medium

Put Boxes Into the Warehouse I (把箱子放进仓库里 I)

You are given boxes, the heights of unit-width boxes, and warehouse, the heights of rooms in a warehouse. Boxes are pushed in from...

View Solution→
NeetCode #823LC-2551Greedy
Hard

Put Marbles in Bags (将珠子放入背包中)

You are given an array weights and an integer k. Split the array into k contiguous groups; the score of a group is the sum of its ...

View Solution→
NeetCode #824LC-995Greedy
Hard

Minimum Number of K Consecutive Bit Flips (K 连续位的最小翻转次数)

You are given a binary array nums and an integer k. In one operation, choose a window of length k (starting at i with i + k <= ...

View Solution→
NeetCode #825LC-1793Greedy
Hard

Maximum Score of a Good Subarray (好子数组的最大分数)

You are given an array nums and an integer k. A good subarray is one that contains index k. The score of a subarray is its minimum...

View Solution→
NeetCode #826LC-3068Greedy
Hard

Find the Maximum Sum of Node Values (最大节点价值之和)

You are given a tree with n nodes, an array nums of node values, an integer k, and edges describing the tree. In one operation, ch...

View Solution→
NeetCode #827LC-1526Greedy
Hard

Minimum Number of Increments on Subarrays to Form a Target Array (形成目标数组的子数组最少增加次数)

You are given an integer array target. Starting from an array of zeros, in one operation you choose a subarray and increment every...

View Solution→
NeetCode #828LC-2818Greedy
Hard

Apply Operations to Maximize Score (操作使得分最大)

You are given an array nums and an integer k. The prime score of a number is its count of distinct prime factors. In one operation...

View Solution→
NeetCode #829LC-163IntervalsNC Algo100
Easy

Missing Ranges (缺失的区间)

You are given a sorted integer array nums with distinct values and inclusive bounds lower and upper. Return the list of missing ra...

View Solution→
NeetCode #830LC-1272IntervalsNC Algo100
Medium

Remove Interval (删除区间)

You are given a sorted list of disjoint intervals intervals and an interval toBeRemoved. Return the list of intervals after removi...

View Solution→
NeetCode #831LC-616IntervalsNC Algo100
Medium

Add Bold Tag in String (给字符串添加加粗标签)

You are given a string s and a list of words. Wrap in <b> and </b> every substring of s that matches any word, merging...

View Solution→
NeetCode #832LC-57IntervalsBlind 75NC 150NC 250
Medium

Insert Interval (插入区间)

You are given an array of non-overlapping intervals intervals, sorted by start, and a newInterval. Insert newInterval and merge an...

View Solution→
NeetCode #833LC-56IntervalsBlind 75NC 150NC 250
Medium

Merge Intervals (合并区间)

You are given an array of intervals intervals. Merge all overlapping intervals and return the non-overlapping intervals that cover...

View Solution→
NeetCode #834LC-435IntervalsBlind 75NC 150NC 250
Medium

Non-overlapping Intervals (无重叠区间)

You are given an array of intervals intervals. Return the minimum number of intervals you must remove to make the rest non-overlap...

View Solution→
NeetCode #835LC-986Intervals
Medium

Interval List Intersections (区间列表的交集)

You are given two lists of closed intervals firstList and secondList, each sorted and internally disjoint. Return the intersection...

View Solution→
NeetCode #836LC-252IntervalsBlind 75NC 150NC 250NC Algo100
Easy

Meeting Rooms (会议室)

You are given an array of meeting time intervals intervals. Determine whether a person could attend all meetings, i.e. no two inte...

View Solution→
NeetCode #837LC-253IntervalsBlind 75NC 150NC 250NC Algo100
Medium

Meeting Rooms II (会议室 II)

You are given an array of meeting time intervals intervals. Return the minimum number of conference rooms required to hold all mee...

View Solution→
NeetCode #838LC-2402IntervalsNC 250
Hard

Meeting Rooms III (会议室 III)

You are given n rooms numbered 0 to n-1 and a list of meetings [start, end]. Rooms are assigned to the lowest-numbered free room; ...

View Solution→
NeetCode #839LC-2406Intervals
Medium

Divide Intervals Into Minimum Number of Groups (将区间分为最少组数)

You are given a 2D array intervals. Divide the intervals into the minimum number of groups such that no two intervals in the same ...

View Solution→
NeetCode #840LC-1288Intervals
Medium

Remove Covered Intervals (删除被覆盖区间)

You are given an array of intervals intervals. Remove all intervals that are covered by another interval (an interval [a, b] is co...

View Solution→