Skip to content

Latest commit

 

History

History
 
 

残酷刷题

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
1004. Max Consecutive Ones III.ts
1004. Max Consecutive Ones III.ts
 
 
1043. Partition Array for Maximum Sum.ts
1043. Partition Array for Maximum Sum.ts
 
 
1094.car-pooling.ts
1094.car-pooling.ts
 
 
1105. Filling Bookcase Shelves.ts
1105. Filling Bookcase Shelves.ts
 
 
1109.corporate-flight-bookings.ts
1109.corporate-flight-bookings.ts
 
 
1249. Minimum Remove to Make Valid Parentheses.ts
1249. Minimum Remove to Make Valid Parentheses.ts
 
 
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
 
 
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
 
 
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
 
 
1405. Longest Happy String.ts
1405. Longest Happy String.ts
 
 
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
 
 
1494. Parallel Courses II.ts
1494. Parallel Courses II.ts
 
 
1541. Minimum Insertions to Balance a Parentheses String.ts
1541. Minimum Insertions to Balance a Parentheses String.ts
 
 
1542. Find Longest Awesome Substring.ts
1542. Find Longest Awesome Substring.ts
 
 
1589.maximum-sum-obtained-of-any-permutation.ts
1589.maximum-sum-obtained-of-any-permutation.ts
 
 
1591.strange-printer-ii.ts
1591.strange-printer-ii.ts
 
 
1601. Maximum Number of Achievable Transfer Requests.ts
1601. Maximum Number of Achievable Transfer Requests.ts
 
 
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
 
 
1655. Distribute Repeating Integers.ts
1655. Distribute Repeating Integers.ts
 
 
1674.minimum-moves-to-make-array-complementary.ts
1674.minimum-moves-to-make-array-complementary.ts
 
 
1697. Checking Existence of Edge Length Limited Paths.cpp
1697. Checking Existence of Edge Length Limited Paths.cpp
 
 
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.ts
1713. Minimum Operations to Make a Subsequence.ts
 
 
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
 
 
1801. Number of Orders in the Backlog.cpp
1801. Number of Orders in the Backlog.cpp
 
 
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.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
 
 
1882. Process Tasks Using Servers.cpp
1882. Process Tasks Using Servers.cpp
 
 
1882. Process Tasks Using Servers.ts
1882. Process Tasks Using Servers.ts
 
 
1883. Minimum Skips to Arrive at Meeting On Time.ts
1883. Minimum Skips to Arrive at Meeting On Time.ts
 
 
1888. Minimum Number of Flips to Make the Binary String Alternating.ts
1888. Minimum Number of Flips to Make the Binary String Alternating.ts
 
 
1889. Minimum Space Wasted From Packaging.ts
1889. Minimum Space Wasted From Packaging.ts
 
 
1896. Minimum Cost to Change the Final Value of Expression.ts
1896. Minimum Cost to Change the Final Value of Expression.ts
 
 
1898. Maximum Number of Removable Characters.ts
1898. Maximum Number of Removable Characters.ts
 
 
1900. The Earliest and Latest Rounds Where Players Compete.ts
1900. The Earliest and Latest Rounds Where Players Compete.ts
 
 
1904. The Number of Full Rounds You Have Played.ts
1904. The Number of Full Rounds You Have Played.ts
 
 
1906. Minimum Absolute Difference Queries.ts
1906. Minimum Absolute Difference Queries.ts
 
 
1915. Number of Wonderful Substrings.ts
1915. Number of Wonderful Substrings.ts
 
 
1916. Count Ways to Build Rooms in an Ant Colony.ts
1916. Count Ways to Build Rooms in an Ant Colony.ts
 
 
1928. Minimum Cost to Reach Destination in Time.ts
1928. Minimum Cost to Reach Destination in Time.ts
 
 
1931. Painting a Grid With Three Different Colors.ts
1931. Painting a Grid With Three Different Colors.ts
 
 
1932. Merge BSTs to Create Single BST.ts
1932. Merge BSTs to Create Single BST.ts
 
 
1937. Maximum Number of Points with Cost.ts
1937. Maximum Number of Points with Cost.ts
 
 
1938. Maximum Genetic Difference Query.ts
1938. Maximum Genetic Difference Query.ts
 
 
1942. The Number of the Smallest Unoccupied Chair.ts
1942. The Number of the Smallest Unoccupied Chair.ts
 
 
1943. Describe the Painting.ts
1943. Describe the Painting.ts
 
 
1959. Minimum Total Space Wasted With K Resizing Operations.ts
1959. Minimum Total Space Wasted With K Resizing Operations.ts
 
 
1960. Maximum Product of the Length of Two Palindromic Substrings.ts
1960. Maximum Product of the Length of Two Palindromic Substrings.ts
 
 
1963. Minimum Number of Swaps to Make the String Balanced.ts
1963. Minimum Number of Swaps to Make the String Balanced.ts
 
 
1964. Find the Longest Valid Obstacle Course at Each Position.ts
1964. Find the Longest Valid Obstacle Course at Each Position.ts
 
 
1969. Minimum Non-Zero Product of the Array Elements.ts
1969. Minimum Non-Zero Product of the Array Elements.ts
 
 
1970. Last Day Where You Can Still Cross.ts
1970. Last Day Where You Can Still Cross.ts
 
 
1976. Number of Ways to Arrive at Destination.ts
1976. Number of Ways to Arrive at Destination.ts
 
 
1977. Number of Ways to Separate Numbers.ts
1977. Number of Ways to Separate Numbers.ts
 
 
1981. Minimize the Difference Between Target and Chosen Elements.ts
1981. Minimize the Difference Between Target and Chosen Elements.ts
 
 
1982. Find Array Given Subset Sums.ts
1982. Find Array Given Subset Sums.ts
 
 
1986. Minimum Number of Work Sessions to Finish the Tasks.ts
1986. Minimum Number of Work Sessions to Finish the Tasks.ts
 
 
1987. Number of Unique Good Subsequences.ts
1987. Number of Unique Good Subsequences.ts
 
 
1994. The Number of Good Subsets.ts
1994. The Number of Good Subsets.ts
 
 
1996. The Number of Weak Characters in the Game.ts
1996. The Number of Weak Characters in the Game.ts
 
 
1998. GCD Sort of an Array.js
1998. GCD Sort of an Array.js
 
 
2002. Maximum Product of the Length of Two Palindromic Subsequences.ts
2002. Maximum Product of the Length of Two Palindromic Subsequences.ts
 
 
2008. Maximum Earnings From Taxi.ts
2008. Maximum Earnings From Taxi.ts
 
 
2009. Minimum Number of Operations to Make Array Continuous.ts
2009. Minimum Number of Operations to Make Array Continuous.ts
 
 
2014. Longest Subsequence Repeated k Times.ts
2014. Longest Subsequence Repeated k Times.ts
 
 
214. Shortest Palindrome-RollingHash.ts
214. Shortest Palindrome-RollingHash.ts
 
 
214. Shortest Palindrome.ts
214. Shortest Palindrome.ts
 
 
215. Kth Largest Element in an Array.ts
215. Kth Largest Element in an Array.ts
 
 
227. Basic Calculator II.ts
227. Basic Calculator II.ts
 
 
241. Different Ways to Add Parentheses.ts
241. Different Ways to Add Parentheses.ts
 
 
264. Ugly Number II.ts
264. Ugly Number II.ts
 
 
300. Longest Increasing Subsequence.ts
300. Longest Increasing Subsequence.ts
 
 
301. Remove Invalid Parentheses.ts
301. Remove Invalid Parentheses.ts
 
 
313. Super Ugly Number.ts
313. Super Ugly Number.ts
 
 
347. Top K Frequent Elements.js
347. Top K Frequent Elements.js
 
 
354. Russian Doll Envelopes.ts
354. Russian Doll Envelopes.ts
 
 
421. Maximum XOR of Two Numbers in an Array.ts
421. Maximum XOR of Two Numbers in an Array.ts
 
 
479. Largest Palindrome Product.ts
479. Largest Palindrome Product.ts
 
 
48.rotate-image.ts
48.rotate-image.ts
 
 
5. Longest Palindromic Substring-Manacher.ts
5. Longest Palindromic Substring-Manacher.ts
 
 
5. Longest Palindromic Substring.ts
5. Longest Palindromic Substring.ts
 
 

README.md

残酷刷题群

Problems

排序

    1. The Number of Weak Characters in the Game

Quick Select

    1. K Closest Points to Origin
    1. Top K Frequent Elements

双指针

    1. Minimum Number of Operations to Make Array Continuousg
    1. Max Consecutive Ones III

DP

    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. 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. Graph Connectivity With Threshold

时光倒流

    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. Longest Subsequence Repeated k Times

表达式求值

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

Links