1. Minimum Total Space Wasted With K Resizing Operations
1. Filling Bookcase Shelves
1. Partition Array for Maximum Sum
1. Number of Ways to Separate Numbers
- LCS + 区间 DP
1. Maximum Earnings From Taxi
1. Maximum Profit in Job Scheduling
1. Maximum Number of Events That Can Be Attended II
1. Allocate Mailboxes
- DP + 货仓选址
1. Count Square Submatrices with All Ones
1. Count Fertile Pyramids in a Land
1. Paint House III
- 线性 DP
1. Count Substrings That Differ by One Character
1. Minimum Time to Remove All Cars Containing Illegal Goods
1. Minimum White Tiles After Covering With Carpets
数位 DP
- 1. Numbers With Repeated Digits
- 1. Count Special Integers
- 1. Non-negative Integers without Consecutive Ones

二分图

1. Minimum Cost to Connect Two Groups of Points

状态压缩

1. Minimum Number of Work Sessions to Finish the Tasks
- 子集遍历
1. Parallel Courses II
1. Distribute Repeating Integers
1. Maximum Product of the Length of Two Palindromic Subsequences
1. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix
1. People Whose List of Favorite Companies Is Not a Subset of Another List

LIS (最长上升子序列)

1. Longest Increasing Subsequence
1. Find the Longest Valid Obstacle Course at Each Position
1. Minimum Operations to Make a Subsequence
1. Russian Doll Envelopes
- w 递增，h 递减排序，在 h 上求 LIS 一定就是答案

背包

1. Minimize the Difference Between Target and Chosen Elements

subsequence 计数

1. Distinct Subsequences II
1. Number of Unique Good Subsequences
1. The Number of Good Subsets

二分查找

1. Two Best Non-Overlapping Events
1. Maximum Profit in Job Scheduling
1. Maximum Number of Events That Can Be Attended II
1. Sum of Mutated Array Closest to Target
1. Maximum Value at a Given Index in a Bounded Array
1. Ugly Number III.js
二分 + 容斥原理 + lcm
1. Sell Diminishing-Valued Colored Balls

并查集

1. Graph Connectivity With Threshold
1. Find All People With Secret
- 并查集，宽搜都可以做
1. Groups of Strings

时光倒流

1. Last Day Where You Can Still Cross
1. Bricks Falling When Hit

回文串 (DP / Manacher)

1. Longest Palindromic Substring
1. Maximum Product of the Length of Two Palindromic Substrings
- Manacher + 双指针
1. Shortest Palindrome

最短路

1. Number of Ways to Arrive at Destination
- 最短路 + DP

数学

质数筛

1. Largest Component Size by Common Factor
- 质数筛 + DP
1. GCD Sort of an Array

公约数

1. Count Array Pairs Divisible by K

搜索

1. Longest Subsequence Repeated k Times
1. Closest Subsequence Sum
- 双向搜索

BFS

1. Second Minimum Time to Reach Destination
1. Minimum Moves to Move a Box to Their Target Location
- Deque, 只有 0 和 1 两个边权
1. Escape the Spreading Fire
1. Detonate the Maximum Bombs
1. Minimum Jumps to Reach Home
1. Count Subtrees With Max Distance Between Cities

拓扑排序

1. Course Schedule
1. Course Schedule II
1. Find All Possible Recipes from Given Supplies
1. Minimum Height Trees
- 无向图的拓扑排序

DFS

1. Diameter of Binary Tree
1. Longest Univalue Path
1. Binary Tree Maximum Path Sum
1. Number of Valid Move Combinations On Chessboard
- 非常恶心的一道暴力题，怎么做都能做出来，但是就是题意复杂

位运算枚举

1. Closest Dessert Cost

表达式求值

1. Basic Calculator II
1. Different Ways to Add Parentheses
1. 24 Game

状态机

1. Plates Between Candles

链表

1. Reverse Linked List
1. Reverse Linked List II
1. Reverse Nodes in k-Group
1. Reverse Nodes in Even Length Groups
1. Reorder List

欧拉路径

1. Reconstruct Itinerary
1. Valid Arrangement of Pairs

LCA (最近公共祖先)

1. Lowest Common Ancestor of a Binary Tree
1. Lowest Common Ancestor of Deepest Leaves
1. Step-By-Step Directions From a Binary Tree Node to Another

基环树

1. Maximum Employees to Be Invited to a Meeting

字符串哈希

1. Longest Duplicate Substring
- 数据比较强，需要开较大的 Q 取模，只能用 BigInt
1. Shortest Palindrome
1. Find Substring With Given Hash Value
1. Longest Common Subpath
1. Sum of Scores of Built Strings
- 双哈希，可以把 mod 调小一点，不用 BigInt，JS 的 BigInt 效率还是很慢，很容易超时

括号匹配

1. Check if a Parentheses String Can Be Valid
1. Longest Valid Parentheses

分治 (Divide and Conquer)

1. Count of Smaller Numbers After Self
1. Count Good Triplets in an Array

扫描线 (Sweep Line)

1. Merge Intervals
1. The Skyline Problem

线段树

1. Range Module
1. Longest Substring of One Repeating Character
1. Booking Concert Tickets in Groups
1. Maximum White Tiles Covered by a Carpet

Name		Name	Last commit message	Last commit date
parent directory ..
rs		rs
1004. Max Consecutive Ones III.ts		1004. Max Consecutive Ones III.ts
1011. Capacity To Ship Packages Within D Days.js		1011. Capacity To Ship Packages Within D Days.js
1012. Numbers With Repeated Digits.js		1012. Numbers With Repeated Digits.js
1043. Partition Array for Maximum Sum.ts		1043. Partition Array for Maximum Sum.ts
1044. Longest Duplicate Substring.js		1044. Longest Duplicate Substring.js
1094.car-pooling.ts		1094.car-pooling.ts
1105. Filling Bookcase Shelves.ts		1105. Filling Bookcase Shelves.ts
1109. Corporate Flight Bookings.js		1109. Corporate Flight Bookings.js
1109.corporate-flight-bookings.ts		1109.corporate-flight-bookings.ts
1123. Lowest Common Ancestor of Deepest Leaves.js		1123. Lowest Common Ancestor of Deepest Leaves.js
1146. Snapshot Array.ts		1146. Snapshot Array.ts
1186. Maximum Subarray Sum with One Deletion.ts		1186. Maximum Subarray Sum with One Deletion.ts
1201. Ugly Number III.js		1201. Ugly Number III.js
1235. Maximum Profit in Job Scheduling.ts		1235. Maximum Profit in Job Scheduling.ts
124. Binary Tree Maximum Path Sum.js		124. Binary Tree Maximum Path Sum.js
1249. Minimum Remove to Make Valid Parentheses.ts		1249. Minimum Remove to Make Valid Parentheses.ts
1263. Minimum Moves to Move a Box to Their Target Location.js		1263. Minimum Moves to Move a Box to Their Target Location.js
1277. Count Square Submatrices with All Ones.js		1277. Count Square Submatrices with All Ones.js
1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.ts		1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.ts
1300. Sum of Mutated Array Closest to Target.js		1300. Sum of Mutated Array Closest to Target.js
131. Palindrome Partitioning.cpp		131. Palindrome Partitioning.cpp
1353. Maximum Number of Events That Can Be Attended.ts		1353. Maximum Number of Events That Can Be Attended.ts
1368. Minimum Cost to Make at Least One Valid Path in a Grid.ts		1368. Minimum Cost to Make at Least One Valid Path in a Grid.ts
1371. Find the Longest Substring Containing Vowels in Even Counts.js		1371. Find the Longest Substring Containing Vowels in Even Counts.js
1371. Find the Longest Substring Containing Vowels in Even Counts.ts		1371. Find the Longest Substring Containing Vowels in Even Counts.ts
1383. Maximum Performance of a Team.ts		1383. Maximum Performance of a Team.ts
1388. Pizza With 3n Slices.js		1388. Pizza With 3n Slices.js
1405. Longest Happy String.ts		1405. Longest Happy String.ts
1425. Constrained Subsequence Sum.js		1425. Constrained Subsequence Sum.js
143. Reorder List.js		143. Reorder List.js
1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.js		1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.js
1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.ts		1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows.ts
1452. People Whose List of Favorite Companies Is Not a Subset of Another List.ts		1452. People Whose List of Favorite Companies Is Not a Subset of Another List.ts
1462.course-schedule-iv.ts		1462.course-schedule-iv.ts
1473. Paint House III.js		1473. Paint House III.js
1478. Allocate Mailboxes.ts		1478. Allocate Mailboxes.ts
1494. Parallel Courses II.ts		1494. Parallel Courses II.ts
1498. Number of Subsequences That Satisfy the Given Sum Condition.js		1498. Number of Subsequences That Satisfy the Given Sum Condition.js
1499. Max Value of Equation.js		1499. Max Value of Equation.js
1514. Path with Maximum Probability.js		1514. Path with Maximum Probability.js
152. Maximum Product Subarray.ts		152. Maximum Product Subarray.ts
1541. Minimum Insertions to Balance a Parentheses String.ts		1541. Minimum Insertions to Balance a Parentheses String.ts
1542. Find Longest Awesome Substring.js		1542. Find Longest Awesome Substring.js
1542. Find Longest Awesome Substring.ts		1542. Find Longest Awesome Substring.ts
1562. Find Latest Group of Size M.js		1562. Find Latest Group of Size M.js
1589.maximum-sum-obtained-of-any-permutation.ts		1589.maximum-sum-obtained-of-any-permutation.ts
1590. Make Sum Divisible by P.js		1590. Make Sum Divisible by P.js
1591.strange-printer-ii.ts		1591.strange-printer-ii.ts
1595. Minimum Cost to Connect Two Groups of Points.ts		1595. Minimum Cost to Connect Two Groups of Points.ts
1601. Maximum Number of Achievable Transfer Requests.ts		1601. Maximum Number of Achievable Transfer Requests.ts
1608. Special Array With X Elements Greater Than or Equal X.ts		1608. Special Array With X Elements Greater Than or Equal X.ts
1617. Count Subtrees With Max Distance Between Cities.js		1617. Count Subtrees With Max Distance Between Cities.js
1625. Lexicographically Smallest String After Applying Operations.ts		1625. Lexicographically Smallest String After Applying Operations.ts
1627. Graph Connectivity With Threshold.js		1627. Graph Connectivity With Threshold.js
1638. Count Substrings That Differ by One Character.ts		1638. Count Substrings That Differ by One Character.ts
1648. Sell Diminishing-Valued Colored Balls.js		1648. Sell Diminishing-Valued Colored Balls.js
1648. Sell Diminishing-Valued Colored Balls.ts		1648. Sell Diminishing-Valued Colored Balls.ts
1649. Create Sorted Array through Instructions.js		1649. Create Sorted Array through Instructions.js
1653. Minimum Deletions to Make String Balanced.js		1653. Minimum Deletions to Make String Balanced.js
1654. Minimum Jumps to Reach Home.js		1654. Minimum Jumps to Reach Home.js
1655. Distribute Repeating Integers.ts		1655. Distribute Repeating Integers.ts
1664. Ways to Make a Fair Array.js		1664. Ways to Make a Fair Array.js
1673. Find the Most Competitive Subsequence.ts		1673. Find the Most Competitive Subsequence.ts
1674. Minimum Moves to Make Array Complementary.js		1674. Minimum Moves to Make Array Complementary.js
1674.minimum-moves-to-make-array-complementary.ts		1674.minimum-moves-to-make-array-complementary.ts
1685. Sum of Absolute Differences in a Sorted Array.js		1685. Sum of Absolute Differences in a Sorted Array.js
1697. Checking Existence of Edge Length Limited Paths.cpp		1697. Checking Existence of Edge Length Limited Paths.cpp
1697. Checking Existence of Edge Length Limited Paths.js		1697. Checking Existence of Edge Length Limited Paths.js
1707. Maximum XOR With an Element From Array.cpp		1707. Maximum XOR With an Element From Array.cpp
1713. Minimum Operations to Make a Subsequence-1.ts		1713. Minimum Operations to Make a Subsequence-1.ts
1713. Minimum Operations to Make a Subsequence.ts		1713. Minimum Operations to Make a Subsequence.ts
1723. Find Minimum Time to Finish All Jobs.js		1723. Find Minimum Time to Finish All Jobs.js
1735. Count Ways to Make Array With Product.js		1735. Count Ways to Make Array With Product.js
1737. Change Minimum Characters to Satisfy One of Three Conditions.ts		1737. Change Minimum Characters to Satisfy One of Three Conditions.ts
1751. Maximum Number of Events That Can Be Attended II.cpp		1751. Maximum Number of Events That Can Be Attended II.cpp
1751. Maximum Number of Events That Can Be Attended II.ts		1751. Maximum Number of Events That Can Be Attended II.ts
1755. Closest Subsequence Sum.js		1755. Closest Subsequence Sum.js
1769. Minimum Number of Operations to Move All Balls to Each Box.js		1769. Minimum Number of Operations to Move All Balls to Each Box.js
1774. Closest Dessert Cost.ts		1774. Closest Dessert Cost.ts
1801. Number of Orders in the Backlog.cpp		1801. Number of Orders in the Backlog.cpp
1802. Maximum Value at a Given Index in a Bounded Array.js		1802. Maximum Value at a Given Index in a Bounded Array.js
1819. Number of Different Subsequences GCDs.js		1819. Number of Different Subsequences GCDs.js
1830. Minimum Number of Operations to Make String Sorted.js		1830. Minimum Number of Operations to Make String Sorted.js
1834. Single-Threaded CPU.ts		1834. Single-Threaded CPU.ts
1847. Closest Room.cpp		1847. Closest Room.cpp
1849. Splitting a String Into Descending Consecutive Values.cpp		1849. Splitting a String Into Descending Consecutive Values.cpp
1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number.cpp		1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number.cpp
1851. Minimum Interval to Include Each Query.cpp		1851. Minimum Interval to Include Each Query.cpp
1851. Minimum Interval to Include Each Query.ts		1851. Minimum Interval to Include Each Query.ts
1856. Maximum Subarray Min-Product.js		1856. Maximum Subarray Min-Product.js
1856. Maximum Subarray Min-Product.ts		1856. Maximum Subarray Min-Product.ts
1857.largest-color-value-in-a-directed-graph.ts		1857.largest-color-value-in-a-directed-graph.ts
1861.rotating-the-box.ts		1861.rotating-the-box.ts
1862.sum-of-floored-pairs.ts		1862.sum-of-floored-pairs.ts
1870.minimum-speed-to-arrive-on-time.ts		1870.minimum-speed-to-arrive-on-time.ts
1871.jump-game-vii.ts		1871.jump-game-vii.ts
1872.stone-game-viii.ts		1872.stone-game-viii.ts
1878. Get Biggest Three Rhombus Sums in a Grid.ts		1878. Get Biggest Three Rhombus Sums in a Grid.ts
1879. Minimum XOR Sum of Two Arrays.ts		1879. Minimum XOR Sum of Two Arrays.ts

Files

残酷刷题

Directory actions

More options

Directory actions

More options

Latest commit

History

残酷刷题

Folders and files

parent directory

README.md

残酷刷题群

Problems

前缀和

排序

Quick Select

双指针

堆

单调栈

DP

二分图

状态压缩

LIS (最长上升子序列)

背包

subsequence 计数

二分查找

并查集

时光倒流

回文串 (DP / Manacher)

最短路

数学

质数筛

公约数

搜索

BFS

拓扑排序

DFS

位运算枚举

表达式求值

状态机

链表

欧拉路径

LCA (最近公共祖先)

基环树

字符串哈希

括号匹配

分治 (Divide and Conquer)

扫描线 (Sweep Line)

线段树

Links