🚀 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 #913LC-13Math & GeometryNC 250
Easy

Roman to Integer (罗马数字转整数)

Given a valid Roman numeral string s, convert it to an integer. Roman numerals use the symbols I, V, X, L, C, D, M and are written...

View Solution→
NeetCode #914LC-12Math & Geometry
Medium

Integer to Roman (整数转罗马数字)

Given an integer num, convert it to a Roman numeral. Roman numerals use the symbols I, V, X, L, C, D, M plus the six subtractive p...

View Solution→
NeetCode #915LC-50Math & GeometryNC 150NC 250
Medium

Pow(x, n) (Pow(x, n)

Implement pow(x, n), computing x raised to the integer power n, without using any built-in power function. Constraints: -100.0 &lt...

View Solution→
NeetCode #916LC-2698Math & Geometry
Medium

Find the Punishment Number of an Integer (求一个整数的惩罚数)

An integer i is called punishable if the decimal representation of i^2 can be partitioned into contiguous substrings whose integer...

View Solution→
NeetCode #917LC-1780Math & Geometry
Medium

Check if Number is a Sum of Powers of Three (判断一个数字是否可以表示成三的幂的和)

Given an integer n, return true if it can be written as the sum of distinct powers of three, otherwise false. Constraints: 1 <=...

View Solution→
NeetCode #918LC-43Math & GeometryNC 150NC 250
Medium

Multiply Strings (字符串相乘)

Given two non-negative integers num1 and num2 represented as strings, return their product as a string. You must not use any built...

View Solution→
NeetCode #919LC-2013Math & GeometryNC 150NC 250
Medium

Detect Squares (检测正方形)

Design a class that stores points on the X-Y plane and answers, for a query point, how many axis-aligned squares can be formed usi...

View Solution→
NeetCode #920LC-1041Math & Geometry
Medium

Robot Bounded In Circle (困于环中的机器人)

A robot starts at (0, 0) facing north on an infinite plane and executes a list of instructions repeatedly forever: G moves forward...

View Solution→
NeetCode #921LC-874Math & Geometry
Medium

Walking Robot Simulation (模拟行走机器人)

A robot starts at (0, 0) facing north on an infinite plane containing obstacles at the given coordinates. It executes commands in ...

View Solution→
NeetCode #922LC-6Math & Geometry
Medium

Zigzag Conversion (Z 字形变换)

Given a string s and an integer numRows, write s in a zigzag pattern across numRows rows (moving down then diagonally up), then re...

View Solution→
NeetCode #923LC-1861Math & Geometry
Medium

Rotating the Box (旋转盒子)

Given an m x n box represented by a grid of characters, where # is a stone, * is a fixed obstacle and . is empty, rotate the box 9...

View Solution→
NeetCode #924LC-633Math & Geometry
Medium

Sum of Square Numbers (平方数之和)

Given a non-negative integer c, decide whether there exist integers a and b such that a^2 + b^2 = c. Constraints: 0 <= c <= ...

View Solution→
NeetCode #925LC-2028Math & Geometry
Medium

Find Missing Observations (找出缺失的观测数据)

Given an array rolls of m dice observations (each in 1..6) plus integers mean and n, the n + m total observations average exactly ...

View Solution→
NeetCode #926LC-539Math & Geometry
Medium

Minimum Time Difference (最小时间差)

Given a list timePoints of clock times formatted HH:MM on a 24-hour clock, return the smallest difference in minutes between any t...

View Solution→
NeetCode #927LC-2033Math & Geometry
Medium

Minimum Operations to Make a Uni-Value Grid (获取单值网格的最小操作数)

Given an m x n integer matrix grid and an integer x, one operation adds or subtracts x from any single element. Return the minimum...

View Solution→
NeetCode #928LC-1727Math & Geometry
Medium

Largest Submatrix With Rearrangements (重新排列后的最大子矩阵)

Given an m x n binary matrix, you may rearrange the elements of each column in any order. Return the area of the largest all-ones ...

View Solution→
NeetCode #929LC-1637Math & Geometry
Easy

Widest Vertical Area Between Two Points Containing No Points (两点之间不包含任何点的最宽垂直区域)

Given n points points[i] = [xi, yi], a vertical area is the region between two vertical lines containing no points. Return the wid...

View Solution→
NeetCode #930LC-1726Math & Geometry
Medium

Tuple with Same Product (同积元组)

Given an array nums of distinct positive integers, count the tuples (a, b, c, d) with a * b = c * d where a, b, c, d are four dist...

View Solution→
NeetCode #931LC-386Math & Geometry
Medium

Lexicographical Numbers (字典序排数)

Given an integer n, return all integers from 1 to n sorted in lexicographical order. The solution should run in O(n) time and use ...

View Solution→
NeetCode #932LC-1823Math & Geometry
Medium

Find the Winner of the Circular Game (找出游戏的获胜者)

n friends numbered 1..n stand in a circle. Counting starts at friend 1; every k-th friend is eliminated and counting resumes from ...

View Solution→
NeetCode #933LC-2579Math & Geometry
Medium

Count Total Number of Colored Cells (统计染色格子数)

Starting from a single blue cell at minute 1, at every subsequent minute all uncolored cells sharing an edge with a blue cell are ...

View Solution→
NeetCode #934LC-2601Math & Geometry
Medium

Prime Subtraction Operation (质数减法运算)

Given an array nums, you may perform any number of operations: pick an unused index i and a prime p, then replace nums[i] with num...

View Solution→
NeetCode #935LC-2523Math & Geometry
Medium

Closest Prime Numbers in Range (范围内最接近的两个质数)

Given two integers left and right, find two primes p1 < p2 in [left, right] with the smallest difference. Return [p1, p2], or [...

View Solution→
NeetCode #936LC-204Math & Geometry
Medium

Count Primes (计数质数)

Given an integer n, return the number of prime numbers strictly less than n. Constraints: 0 <= n <= 5 * 10^6.

View Solution→