ABCDEFGHIJKLMNOPQRSTUVWXYZAAABAC
1
If you'd like to comment or ask questions, please send the request for access
2
3
残酷刷题群动态规划的套路小讲座残酷群2020年会残酷群2021年会
4
GitHub代码Lee215 特别节目
5
6
No.TitleDateTag 1Tag 2LeveldifficultyYouTubeRecording DateB站
7
8
9
10
3405Find the Lexicographically Largest String From the Box IStringHard
11
1163Last Substring in Lexicographical OrderStringHard
12
2800Shortest String That Contains Three StringsStringThinkingMedium1855
13
420Strong Password CheckerStringMedium-
14
2468Split Message Based on Limit
StringMedium2381https://youtu.be/oOWb_CQU5xo11/13/2022
15
527*Word AbbreviationStringMedium-https://youtu.be/G-0QGOGea5M11/6/2022
16
68Text JustificationStringMedium-https://youtu.be/6D7YFoQ4t0w2/5/2022
17
418*Sentence Screen FittingStringMedium-https://youtu.be/0WD0M2GmVTw1/4/2022https://www.bilibili.com/video/BV16P4y1E75D/
18
3681Maximum XOR of SubsequencesMathMediumhttps://youtu.be/M4UMLvrEh-A9/18/2025
19
3068Find the Maximum Sum of Node ValuesOthersMedium2267https://youtu.be/CF7rTxasbow3/2/2024
20
3092Most Frequent IDsSorted ContainerMedium1793N/A
21
3703Remove K-Balanced SubstringsStackMediumN/A
22
3676Count Bowl SubarraysStackMediumhttps://youtu.be/sfjXOXMRnQo9/7/2025
23
3113Find the Number of Subarrays Where Boundary Elements Are MaximumStackMedium2046https://youtu.be/FViZk7J_SHE4/20/2024
24
3609Minimum Moves to Reach Target in GridRecursiveThinkingHardhttps://youtu.be/rdhWlz01oyE7/6/2025
25
3632*Subarrays with XOR at Least KTrieXORHard
26
3372Maximize the Number of Target Nodes After Connecting Trees ITreeMedium
27
3373Maximize the Number of Target Nodes After Connecting Trees IITreeReRootHard
28
3367Maximize Sum of Weights after Edge RemovalsTreeGreedyHard
29
3691Maximum Total Subarray Value IIBinary SearchRMQHardhttps://youtu.be/Fsng5ilHJFM9/29/2025
30
3677Count Binary Palindromic NumbersBinary SearchMediumhttps://youtu.be/9zm0CqqvkOI9/7/2025
31
3639Minimum Time to Activate StringBinary SearchMedium
32
3608Minimum Time for K Connected ComponentsBinary SearchUnion FindMedium
33
3449Maximize the Minimum Game ScoreBinary SearchHardhttps://youtu.be/N6aScon-ehY2/10/2025
34
3399Smallest Substring With Identical Characters IIBinary SearchHardhttps://youtu.be/AdT2F0x-uKo1/2/2025
35
3640Trionic Array IIEnumerationMediumhttps://youtu.be/PrcwRr7uebE8/4/2025
36
3628Maximum Number of Subsequences After One InsertingEnumerationHardhttps://youtu.be/8I0lxrKfZHM8/1/2025
37
3447Assign Elements to Groups with ConstraintsEnumerationMediumhttps://youtu.be/YCNZmqfCswE2/9/2025
38
3641*Longest Semi-Repeating SubarrayTwo PointersHard
39
3634Minimum Removals to Balance ArrayTwo PointersMedium
40
3660Jump Game IXThinkingHardhttps://youtu.be/IMbwUOlC-FE8/25/2025
41
3644Maximum K to Sort a PermutationThinkingHardhttps://youtu.be/-1CXTt9jWh08/11/2025
42
3578Count Partitions With Max-Min Difference at Most KDequeDPHardhttps://youtu.be/zRxSvdFd8Mo6/10/2025
43
3671Sum of Beautiful SubsequencesBITHardhttps://youtu.be/xFHXfJ1OlYY9/6/2025
44
3448Count Substrings Divisible By Last DigitHashPrefixHardhttps://youtu.be/7VDPEki9qX42/9/2025
45
3518Smallest Palindromic Rearrangement IICombinatoricsdigit coutingHardhttps://youtu.be/L-3r64EZoPw4/6/2025
46
3463Check If Digits Are Equal in String After Operations IICombinatoricsHardhttps://youtu.be/grXNc-Tqgng2/24/2025
47
3655XOR After Range Multiplication Queries IIDiff ArraySqrt DecompositionHardhttps://youtu.be/l1rTR3OBv4E8/20/2025
48
3604Minimum Time to Reach Destination in Directed GraphGraphDijkstraMedium
49
3594Minimum Time to Transport All IndividualsGraphDijkstraHardhttps://youtu.be/Z8n4D2nr5b46/23/2025
50
3695Maximize Alternating Sum Using SwapsUnion FindMediumN/A
51
3704Count No-Zero Pairs That Sum to Ndigit coutingRecursionMediumhttps://youtu.be/OS_1E9o4k1s10/5/2025
52
3669Balanced K-Factor DecompositionDFSMediumhttps://youtu.be/uI-HBJPRVhA9/1/2025
53
3615Longest Palindromic Path in GraphDFSBit MaskHardhttps://youtu.be/VFEkS5GFhtY7/13/2025
54
3593Minimum Increments to Equalize Leaf PathsDFSMedium
55
3459Length of Longest V-Shaped Diagonal SegmentDFSMediumhttps://youtu.be/5CvMx5TKsX02/18/2025
56
57
3700Number of ZigZag Arrays II10/19/2025DPMatrix MultiplicationHardhttps://youtu.be/bhMq96VOfAk9/28/2025
58
3699Number of ZigZag Arrays I10/18/2025DPMediumN/A
59
3686Number of Stable Subsequences10/17/2025DPMediumN/A
60
3665Twisted Mirror Path Count10/16/2025DPMedium
61
3670Maximum Product of Two Integers With No Common Bits10/15/2025DPBit MaskHardhttps://youtu.be/kZunhvnAuqY9/1/2025
62
3661Maximum Walls Destroyed by Robots10/14/2025DPHardhttps://youtu.be/Dbmc23aEEn48/27/2025
63
SKIPPED10/13/2025
64
3654Minimum Sum After Divisible Sum Deletions10/12/2025DPPrefix SumHardhttps://youtu.be/gQO8_Vsa69c8/23/2025
65
SKIPPED10/11/2025
66
3599Partition Array to Minimize XOR10/10/2025DPPrefix SumMediumN/A
67
3538Merge Operations for Minimum Travel Time10/9/2025DPHard
68
3579Minimum Steps to Convert String with Operations10/8/2025DPGreedyHardhttps://youtu.be/A6pdvNWq7BM6/13/2025
69
3685Subsequence Sum After Capping Elements10/7/2025DPKnapsack Hardhttps://youtu.be/G6xwQHlxRqQ9/14/2025
70
SKIPPED10/6/2025
71
3592Inverse Coin Change10/5/2025DPKnapsack Hardhttps://youtu.be/58MxA96KqwQ6/22/2025
72
3489Zero Array Transformation IV10/4/2025DPKnapsack Hardhttps://youtu.be/ilvbOwh1o_U3/17/2025
73
2902Count of Sub-Multisets With Bounded Sum10/3/2025DPKnapsack Hard2758https://youtu.be/7RyTk9IpU9810/16/2023https://www.bilibili.com/video/BV1xg4y1X7en/
74
2585Number of Ways to Earn Points
10/2/2025DPKnapsackMedium1502https://youtu.be/a0_HXxT78eo3/6/2023https://www.bilibili.com/video/BV1U14y1C7Kr/
75
2291*Maximum Profit From Trading Stocks10/1/2025DPKnapsackMedium-
76
1981Minimize the Difference Between Target and Chosen Elements9/30/2025DPKnapsackMedium2009https://youtu.be/xdTkTgYU6Gw8/22/2021https://www.bilibili.com/video/BV1LL4y1Y7SF/
77
1449Form Largest Integer With Digits That Add up to Target9/29/2025DPKnapsackHard1927https://youtu.be/E17ff2rZ_8M11/6/2020https://www.bilibili.com/video/BV1YR4y1U7XJ/
78
879Profitable Schemes9/28/2025DP KnapsackHard2204https://youtu.be/SGod9bCXYfw12/26/2022https://www.bilibili.com/video/BV1X14y13781/
79
SKIPPED9/27/2025
80
2518Number of Great Partitions9/26/2025DPKnapsackHard2414https://youtu.be/V7wdVxiPFCU12/25/2022https://www.bilibili.com/video/BV1YD4y1j7Pz/
81
416Partition Equal Subset Sum9/25/2025DPKnapsackMedium-https://youtu.be/JIiDb2iPW4012/27/2022https://www.bilibili.com/video/BV1ke4y157bV/
82
494Target Sum 9/24/2025DPKnapsackMedium-https://youtu.be/MTMxgyJt3VM12/25/2022https://www.bilibili.com/video/BV1GR4y1U7Mp/
83
518Coin Change 29/23/2025DPKnapsackHard-https://youtu.be/KkBwcRBhSyM11/7/2020
84
322Coin Change9/22/2025DPKnapsackMedium-
85
SKIPPED9/21/2025
86
3690Split and Merge Array Transformation9/20/2025BFSMedium
87
3666Minimum Operations to Equalize Binary String9/19/2025BFSHard
88
1568Minimum Number of Days to Disconnect Island9/18/2025BFSMathMediumhttps://youtu.be/PZBsve6rBqY
89
1368Minimum Cost to Make at Least One Valid Path in a Grid9/17/2025BFSHardhttps://youtu.be/_RQkP3kzUG8
90
1559Detect Cycles in 2D Grid9/16/2025BFSEasyhttps://youtu.be/l_pqy_eZJKI
91
1728Cat and Mouse II9/15/2025BFSHard2849https://youtu.be/ZDHb58kJFl0https://www.bilibili.com/video/BV18K411u7FJ/
92
913Cat and Mouse9/14/2025BFSHardhttp://youtu.be/sq6Ggb98A38same as 4/14/2019
93
SKIPPED9/13/2025
94
3629Minimum Jumps to Reach End via Prime Teleportation9/12/2025BFSMediumhttps://youtu.be/SZ3Nb2oWC048/6/2025
95
3568Minimum Moves to Clean the Classroom9/11/2025BFSStateful BFSMedium
96
3552Grid Teleportation Traversal9/10/2025BFSDequeMedium
97
2493Divide Nodes Into the Maximum Number of Groups9/9/2025BFSHard2415https://youtu.be/oa26sFeHRNM12/4/2022https://www.bilibili.com/video/BV15K411r7G1/
98
1263Minimum Moves to Move a Box to Their Target Location9/8/2025BFSDequeHardhttps://youtu.be/RwmNMRdnLl0
99
SKIPPED9/7/2025
100
SKIPPED9/6/2025