🚀 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 #73LC-1913Arrays & Hashing
Easy

Maximum Product Difference Between Two Pairs (两个数对之间的最大乘积差)

The product difference between two pairs (a, b) and (c, d) is (a * b) - (c * d). Given an array nums of distinct integers, return ...

View Solution→
NeetCode #74LC-2490Arrays & Hashing
Easy

Circular Sentence (循环句子)

A sentence is circular if the last character of each word equals the first character of the next word, including the wrap-around f...

View Solution→
NeetCode #75LC-1422Arrays & Hashing
Easy

Maximum Score After Splitting a String (分割字符串的最大得分)

Given a string s of 0s and 1s, split it into two non-empty parts. The score is the number of 0s in the left part plus the number o...

View Solution→
NeetCode #76LC-1496Arrays & Hashing
Easy

Path Crossing (判断路径是否相交)

Given a string path where each segment is 'N', 'S', 'E' or 'W', starting at the origin, determine whether the path crosses itself ...

View Solution→
NeetCode #77LC-1758Arrays & Hashing
Easy

Minimum Changes To Make Alternating Binary String (生成交替二进制字符串的最少操作数)

Given a binary string s, return the minimum number of changes needed to make it alternating (no two adjacent characters equal). A ...

View Solution→
NeetCode #78LC-1897Arrays & Hashing
Easy

Redistribute Characters to Make All Strings Equal (重新分配字符使所有字符串都相等)

Given an array of strings words, redistribute the characters so that all strings become equal (in any order). Return true if possi...

View Solution→
NeetCode #79LC-409Arrays & Hashing
Easy

Longest Palindrome (最长回文串)

Given a string s of lowercase and/or uppercase letters, return the length of the longest palindrome that can be built from its let...

View Solution→
NeetCode #80LC-1624Arrays & Hashing
Easy

Largest Substring Between Two Equal Characters (两个相同字符之间的最长子字符串)

Given a string s, return the length of the longest substring between two equal characters, excluding the two characters themselves...

View Solution→
NeetCode #81LC-645Arrays & Hashing
Easy

Set Mismatch (错误的集合)

You have a set of integers 1..n stored in an array nums of length n, but one number is duplicated and another is missing. Return [...

View Solution→
NeetCode #82LC-387Arrays & Hashing
Easy

First Unique Character in a String (字符串中的第一个唯一字符)

Given a string s, find the first non-repeating character and return its index, or -1 if none exists. Constraints: 1 <= s.length...

View Solution→
NeetCode #83LC-349Arrays & Hashing
Easy

Intersection of Two Arrays (两个数组的交集)

Given two integer arrays nums1 and nums2, return an array of their intersection: each element must be unique and may appear in any...

View Solution→
NeetCode #84LC-1002Arrays & Hashing
Easy

Find Common Characters (查找共用字符)

Given an array of strings words, return an array of all characters that appear in all strings, including duplicates (a character a...

View Solution→
NeetCode #85LC-1700Arrays & Hashing
Easy

Number of Students Unable to Eat Lunch (无法吃午餐的学生数量)

Students queue for lunch. students[i] is the sandwich preference of the i-th student (0 or 1) and sandwiches[j] is the type of the...

View Solution→
NeetCode #86LC-2073Arrays & Hashing
Easy

Time Needed to Buy Tickets (买票需要的时间)

There are n people in a queue, tickets[i] is the number of tickets person i wants, and each ticket takes exactly 1 second to buy. ...

View Solution→
NeetCode #87LC-1608Arrays & Hashing
Easy

Special Array With X Elements Greater Than or Equal X (特殊数组的特征值)

An array is special if there exists a number x such that exactly x elements in the array are greater than or equal to x. Given num...

View Solution→
NeetCode #88LC-1243Arrays & Hashing
Easy

Array Transformation (数组变换)

Given an integer array arr, repeatedly apply this transformation simultaneously to every interior element: increase it by 1 if it ...

View Solution→
NeetCode #89LC-243Arrays & Hashing
Easy

Shortest Word Distance (最短单词距离)

Given an array of strings wordsDict and two different strings word1 and word2, return the shortest distance between any occurrence...

View Solution→
NeetCode #90LC-2559Arrays & Hashing
Medium

Count Vowel Strings in Ranges (统计范围内的元音字符串数)

You are given an array of strings words and an array of queries, each queries[i] = [l, r]. A string is a vowel string if it starts...

View Solution→
NeetCode #91LC-1701Arrays & Hashing
Medium

Average Waiting Time (平均等待时间)

There is a single chef. Given customers[i] = [arrival_i, time_i], the chef starts cooking customer i's order no earlier than arriv...

View Solution→
NeetCode #92LC-912Arrays & HashingNC 250
Medium

Sort an Array (排序数组)

Given an array of integers nums, sort it in ascending order and return it, without using any built-in sort function. Constraints: ...

View Solution→
NeetCode #93LC-75Arrays & HashingNC 250
Medium

Sort Colors (颜色分类)

Given an array nums with n objects coloured red (0), white (1) or blue (2), sort them in place so that objects of the same colour ...

View Solution→
NeetCode #94LC-1122Arrays & Hashing
Easy

Relative Sort Array (数组的相对排序)

Given two arrays arr1 and arr2, sort arr1 such that the relative order of elements follows arr2: elements appearing in arr2 come f...

View Solution→
NeetCode #95LC-2418Arrays & Hashing
Easy

Sort the People (按身高排序)

Given arrays names and heights (aligned by index), return names sorted in descending order of heights. Constraints: 1 <= names....

View Solution→
NeetCode #96LC-1636Arrays & Hashing
Easy

Sort Array by Increasing Frequency (按照频率将数组升序排序)

Given an integer array nums, sort it in ascending order of frequency, breaking ties in descending order of value. Constraints: 1 &...

View Solution→