【每日一题】LeetCode 3399. Smallest Substring With Identical Characters II
Huifeng Guan
【每日一题】LeetCode 3399. Smallest Substring With Identical Characters II
30:50
【每日一题】LeetCode 3404. Count Special Subsequences
Huifeng Guan
【每日一题】LeetCode 3404. Count Special Subsequences
29:36
【每日一题】LeetCode 3405. Count the Number of Arrays with K Matching Adjacent Elements
Huifeng Guan
【每日一题】LeetCode 3405. Count the Number of Arrays with K Matching Adjacent Elements
16:16
不要问我咋好久不更了。问就是学琴去了。
Huifeng Guan
不要问我咋好久不更了。问就是学琴去了。
1:01
【每日一题】LeetCode 3306. Count of Substrings Containing Every Vowel and K Consonants II
Huifeng Guan
【每日一题】LeetCode 3306. Count of Substrings Containing Every Vowel and K Consonants II
27:11
【每日一题】LeetCode 3307. Find the K-th Character in String Game II
Huifeng Guan
【每日一题】LeetCode 3307. Find the K-th Character in String Game II
12:25
【每日一题】LeetCode 3298. Count Substrings That Can Be Rearranged to Contain a String II
Huifeng Guan
【每日一题】LeetCode 3298. Count Substrings That Can Be Rearranged to Contain a String II
25:10
【每日一题】LeetCode 3261. Count Substrings That Satisfy K-Constraint II
Huifeng Guan
【每日一题】LeetCode 3261. Count Substrings That Satisfy K-Constraint II
43:29
【每日一题】LeetCode 3234. Count the Number of Substrings With Dominant Ones
Huifeng Guan
【每日一题】LeetCode 3234. Count the Number of Substrings With Dominant Ones
40:00
【每日一题】LeetCode 3219. Minimum Cost for Cutting Cake II
Huifeng Guan
【每日一题】LeetCode 3219. Minimum Cost for Cutting Cake II
25:40
【每日一题】LeetCode 3213. Construct String with Minimum Cost
Huifeng Guan
【每日一题】LeetCode 3213. Construct String with Minimum Cost
23:35
【每日一题】LeetCode 1521. Find a Value of a Mysterious Function Closest to Target
Huifeng Guan
【每日一题】LeetCode 1521. Find a Value of a Mysterious Function Closest to Target
15:46
【每日一题】LeetCode 3209. Number of Subarrays With AND Value of K
Huifeng Guan
【每日一题】LeetCode 3209. Number of Subarrays With AND Value of K
16:40
【每日一题】LeetCode 3186. Maximum Total Damage With Spell Casting
Huifeng Guan
【每日一题】LeetCode 3186. Maximum Total Damage With Spell Casting
17:35
【每日一题】LeetCode 3187. Peaks in Array
Huifeng Guan
【每日一题】LeetCode 3187. Peaks in Array
10:41
【每日一题】LeetCode 3202. Find the Maximum Length of Valid Subsequence II
Huifeng Guan
【每日一题】LeetCode 3202. Find the Maximum Length of Valid Subsequence II
14:50
【每日一题】LeetCode 3203. Find Minimum Diameter After Merging Two Trees
Huifeng Guan
【每日一题】LeetCode 3203. Find Minimum Diameter After Merging Two Trees
16:05
【每日一题】LeetCode 3193. Count the Number of Inversions
Huifeng Guan
【每日一题】LeetCode 3193. Count the Number of Inversions
46:20
【每日一题】LeetCode 3197. Find the Minimum Area to Cover All Ones II
Huifeng Guan
【每日一题】LeetCode 3197. Find the Minimum Area to Cover All Ones II
32:24
【每日一题】LeetCode 3196. Maximize Total Cost of Alternating Subarrays
Huifeng Guan
【每日一题】LeetCode 3196. Maximize Total Cost of Alternating Subarrays
9:51
【每日一题】LeetCode 3177. Find the Maximum Length of a Good Subsequence II
Huifeng Guan
【每日一题】LeetCode 3177. Find the Maximum Length of a Good Subsequence II
31:50
【每日一题】LeetCode 3169. Count Days Without Meetings
Huifeng Guan
【每日一题】LeetCode 3169. Count Days Without Meetings
9:25
【每日一题】LeetCode 3171. Find Subarray With Bitwise AND Closest to K
Huifeng Guan
【每日一题】LeetCode 3171. Find Subarray With Bitwise AND Closest to K
14:26
【每日一题】LeetCode 3165. Maximum Sum of Subsequence With Non-adjacent Elements
Huifeng Guan
【每日一题】LeetCode 3165. Maximum Sum of Subsequence With Non-adjacent Elements
29:39
【每日一题】LeetCode 3161. Block Placement Queries
Huifeng Guan
【每日一题】LeetCode 3161. Block Placement Queries
23:16
【每日一题】LeetCode 3139. Minimum Cost to Equalize Array
Huifeng Guan
【每日一题】LeetCode 3139. Minimum Cost to Equalize Array
32:53
【每日一题】LeetCode 3116. Kth Smallest Amount With Single Denomination Combination
Huifeng Guan
【每日一题】LeetCode 3116. Kth Smallest Amount With Single Denomination Combination
20:05
【每日一题】LeetCode 3130. Find All Possible Stable Binary Arrays II
Huifeng Guan
【每日一题】LeetCode 3130. Find All Possible Stable Binary Arrays II
46:28
【每日一题】LeetCode 3134. Find the Median of the Uniqueness Array
Huifeng Guan
【每日一题】LeetCode 3134. Find the Median of the Uniqueness Array
21:35
【每日一题】LeetCode 3133. Minimum Array End
Huifeng Guan
【每日一题】LeetCode 3133. Minimum Array End
15:05
【每日一题】LeetCode 3122. Minimum Number of Operations to Satisfy Conditions
Huifeng Guan
【每日一题】LeetCode 3122. Minimum Number of Operations to Satisfy Conditions
16:17
【每日一题】LeetCode 3123. Find Edges in Shortest Paths
Huifeng Guan
【每日一题】LeetCode 3123. Find Edges in Shortest Paths
15:24
【每日一题】LeetCode 3112. Minimum Time to Visit Disappearing Nodes
Huifeng Guan
【每日一题】LeetCode 3112. Minimum Time to Visit Disappearing Nodes
12:23
【每日一题】LeetCode 3113. Find the Number of Subarrays Where Boundary Elements Are Maximum
Huifeng Guan
【每日一题】LeetCode 3113. Find the Number of Subarrays Where Boundary Elements Are Maximum
10:47
【每日一题】LeetCode 2992. Number of Self-Divisible Permutations
Huifeng Guan
【每日一题】LeetCode 2992. Number of Self-Divisible Permutations
14:05
【每日一题】LeetCode 2615. Sum of Distances
Huifeng Guan
【每日一题】LeetCode 2615. Sum of Distances
20:01
【每日一题】LeetCode 3082. Find the Sum of the Power of All Subsequences
Huifeng Guan
【每日一题】LeetCode 3082. Find the Sum of the Power of All Subsequences
19:52
【每日一题】LeetCode 3086. Minimum Moves to Pick K Ones
Huifeng Guan
【每日一题】LeetCode 3086. Minimum Moves to Pick K Ones
35:48
【每日一题】LeetCode 3093. Longest Common Suffix Queries
Huifeng Guan
【每日一题】LeetCode 3093. Longest Common Suffix Queries
16:00
【每日一题】LeetCode 3098. Find the Sum of Subsequence Powers
Huifeng Guan
【每日一题】LeetCode 3098. Find the Sum of Subsequence Powers
28:05
【每日一题】LeetCode 3102. Minimize Manhattan Distances
Huifeng Guan
【每日一题】LeetCode 3102. Minimize Manhattan Distances
17:50
【每日一题】LeetCode 3097. Shortest Subarray With OR at Least K II
Huifeng Guan
【每日一题】LeetCode 3097. Shortest Subarray With OR at Least K II
9:21
【每日一题】LeetCode 3077. Maximum Strength of K Disjoint Subarrays
Huifeng Guan
【每日一题】LeetCode 3077. Maximum Strength of K Disjoint Subarrays
30:50
【每日一题】LeetCode 3068. Find the Maximum Sum of Node Values
Huifeng Guan
【每日一题】LeetCode 3068. Find the Maximum Sum of Node Values
15:16
【每日一题】LeetCode 3049. Earliest Second to Mark Indices II
Huifeng Guan
【每日一题】LeetCode 3049. Earliest Second to Mark Indices II
36:55
【每日一题】LeetCode 3048. Earliest Second to Mark Indices I
Huifeng Guan
【每日一题】LeetCode 3048. Earliest Second to Mark Indices I
23:25
【每日一题】LeetCode 3018. Maximum Number of Removal Queries That Can Be Processed I
Huifeng Guan
【每日一题】LeetCode 3018. Maximum Number of Removal Queries That Can Be Processed I
24:15
【每日一题】LeetCode 3009. Maximum Number of Intersections on the Chart
Huifeng Guan
【每日一题】LeetCode 3009. Maximum Number of Intersections on the Chart
25:57
【每日一题】LeetCode 3041. Maximize Consecutive Elements in an Array After Modification
Huifeng Guan
【每日一题】LeetCode 3041. Maximize Consecutive Elements in an Array After Modification
18:36
【每日一题】LeetCode 3045. Count Prefix and Suffix Pairs II
Huifeng Guan
【每日一题】LeetCode 3045. Count Prefix and Suffix Pairs II
35:10
【每日一题】LeetCode 3027. Find the Number of Ways to Place People II
Huifeng Guan
【每日一题】LeetCode 3027. Find the Number of Ways to Place People II
14:05
【每日一题】LeetCode 3031. Minimum Time to Revert Word to Initial State II
Huifeng Guan
【每日一题】LeetCode 3031. Minimum Time to Revert Word to Initial State II
22:31
【每日一题】LeetCode 3022. Minimize OR of Remaining Elements Using Operations
Huifeng Guan
【每日一题】LeetCode 3022. Minimize OR of Remaining Elements Using Operations
48:41
【每日一题】LeetCode 2781. Length of the Longest Valid Substring
Huifeng Guan
【每日一题】LeetCode 2781. Length of the Longest Valid Substring
34:21
【每日一题】LeetCode 3012. Minimize Length of Array Using Operations
Huifeng Guan
【每日一题】LeetCode 3012. Minimize Length of Array Using Operations
10:35
【每日一题】LeetCode 3017. Count the Number of Houses at a Certain Distance II
Huifeng Guan
【每日一题】LeetCode 3017. Count the Number of Houses at a Certain Distance II
45:39
【每日一题】LeetCode 3013. Divide an Array Into Subarrays With Minimum Cost II
Huifeng Guan
【每日一题】LeetCode 3013. Divide an Array Into Subarrays With Minimum Cost II
19:05
【每日一题】LeetCode 2417. Closest Fair Integer
Huifeng Guan
【每日一题】LeetCode 2417. Closest Fair Integer
24:06
【每日一题】LeetCode 2983. Palindrome Rearrangement Queries
Huifeng Guan
【每日一题】LeetCode 2983. Palindrome Rearrangement Queries
36:26
【每日一题】LeetCode 2999. Count the Number of Powerful Integers
Huifeng Guan
【每日一题】LeetCode 2999. Count the Number of Powerful Integers
24:15
【每日一题】LeetCode 3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K
Huifeng Guan
【每日一题】LeetCode 3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K
27:40
【每日一题】LeetCode 3008. Find Beautiful Indices in the Given Array II
Huifeng Guan
【每日一题】LeetCode 3008. Find Beautiful Indices in the Given Array II
12:31
【每日一题】LeetCode 2916. Subarrays Distinct Element Sum of Squares II
Huifeng Guan
【每日一题】LeetCode 2916. Subarrays Distinct Element Sum of Squares II
41:30
【每日一题】LeetCode 2920. Maximum Points After Collecting Coins From All Nodes
Huifeng Guan
【每日一题】LeetCode 2920. Maximum Points After Collecting Coins From All Nodes
15:31
【每日一题】LeetCode 2969. Minimum Number of Coins for Fruits II
Huifeng Guan
【每日一题】LeetCode 2969. Minimum Number of Coins for Fruits II
17:40
【每日一题】LeetCode 2972. Count the Number of Incremovable Subarrays II
Huifeng Guan
【每日一题】LeetCode 2972. Count the Number of Incremovable Subarrays II
19:00
【每日一题】LeetCode 2973. Find Number of Coins to Place in Tree Nodes
Huifeng Guan
【每日一题】LeetCode 2973. Find Number of Coins to Place in Tree Nodes
20:35
【每日一题】LeetCode 2977. Minimum Cost to Convert String II
Huifeng Guan
【每日一题】LeetCode 2977. Minimum Cost to Convert String II
43:43
【每日一题】LeetCode 2976. Minimum Cost to Convert String I
Huifeng Guan
【每日一题】LeetCode 2976. Minimum Cost to Convert String I
13:01
【每日一题】LeetCode 2954. Count the Number of Infection Sequences
Huifeng Guan
【每日一题】LeetCode 2954. Count the Number of Infection Sequences
34:10
【每日一题】LeetCode 2950. Number of Divisible Substrings
Huifeng Guan
【每日一题】LeetCode 2950. Number of Divisible Substrings
16:01
【每日一题】LeetCode 2953. Count Complete Substrings
Huifeng Guan
【每日一题】LeetCode 2953. Count Complete Substrings
17:10
【每日一题】LeetCode 2952. Minimum Number of Coins to be Added
Huifeng Guan
【每日一题】LeetCode 2952. Minimum Number of Coins to be Added
12:35
【每日一题】LeetCode 564. Find the Closest Palindrome
Huifeng Guan
【每日一题】LeetCode 564. Find the Closest Palindrome
24:46
【每日一题】LeetCode 2967. Minimum Cost to Make Array Equalindromic
Huifeng Guan
【每日一题】LeetCode 2967. Minimum Cost to Make Array Equalindromic
13:31
【每日一题】LeetCode 2968. Apply Operations to Maximize Frequency Score
Huifeng Guan
【每日一题】LeetCode 2968. Apply Operations to Maximize Frequency Score
31:47
【每日一题】LeetCode 2959. Number of Possible Sets of Closing Branches
Huifeng Guan
【每日一题】LeetCode 2959. Number of Possible Sets of Closing Branches
13:07
【每日一题】LeetCode 2963. Count the Number of Good Partitions
Huifeng Guan
【每日一题】LeetCode 2963. Count the Number of Good Partitions
14:35
【每日一题】LeetCode 2911. Minimum Changes to Make K Semi-palindromes
Huifeng Guan
【每日一题】LeetCode 2911. Minimum Changes to Make K Semi-palindromes
20:10
【每日一题】LeetCode 2949. Count Beautiful Substrings II
Huifeng Guan
【每日一题】LeetCode 2949. Count Beautiful Substrings II
22:32
【每日一题】LeetCode 2945. Find Maximum Non-decreasing Array Length
Huifeng Guan
【每日一题】LeetCode 2945. Find Maximum Non-decreasing Array Length
31:55
【每日一题】LeetCode 2910. Minimum Number of Groups to Create a Valid Assignment
Huifeng Guan
【每日一题】LeetCode 2910. Minimum Number of Groups to Create a Valid Assignment
19:30
【每日一题】LeetCode 2939. Maximum Xor Product
Huifeng Guan
【每日一题】LeetCode 2939. Maximum Xor Product
22:16
【每日一题】LeetCode 2930. Number of Strings Which Can Be Rearranged to Contain Substring
Huifeng Guan
【每日一题】LeetCode 2930. Number of Strings Which Can Be Rearranged to Contain Substring
14:44
【每日一题】LeetCode 2940. Find Building Where Alice and Bob Can Meet
Huifeng Guan
【每日一题】LeetCode 2940. Find Building Where Alice and Bob Can Meet
27:16
【每日一题】LeetCode 2935. Maximum Strong Pair XOR II
Huifeng Guan
【每日一题】LeetCode 2935. Maximum Strong Pair XOR II
30:01
【每日一题】LeetCode 2925. Maximum Score After Applying Operations on a Tree
Huifeng Guan
【每日一题】LeetCode 2925. Maximum Score After Applying Operations on a Tree
19:20
【每日一题】LeetCode 2926. Maximum Balanced Subsequence Sum
Huifeng Guan
【每日一题】LeetCode 2926. Maximum Balanced Subsequence Sum
38:30
【每日一题】LeetCode 2902. Count of Sub-Multisets With Bounded Sum
Huifeng Guan
【每日一题】LeetCode 2902. Count of Sub-Multisets With Bounded Sum
34:06
【每日一题】LeetCode 2791. Count Paths That Can Form a Palindrome in a Tree
Huifeng Guan
【每日一题】LeetCode 2791. Count Paths That Can Form a Palindrome in a Tree
22:45
【每日一题】LeetCode 2896. Apply Operations to Make Two Strings Equal
Huifeng Guan
【每日一题】LeetCode 2896. Apply Operations to Make Two Strings Equal
50:26
【每日一题】LeetCode 2897. Apply Operations on Array to Maximize Sum of Squares
Huifeng Guan
【每日一题】LeetCode 2897. Apply Operations on Array to Maximize Sum of Squares
14:11
【每日一题】LeetCode 2863. Maximum Length of Semi-Decreasing Subarrays
Huifeng Guan
【每日一题】LeetCode 2863. Maximum Length of Semi-Decreasing Subarrays
14:15
【每日一题】LeetCode 2875. Minimum Size Subarray in Infinite Array
Huifeng Guan
【每日一题】LeetCode 2875. Minimum Size Subarray in Infinite Array
17:50
【每日一题】LeetCode 2876. Count Visited Nodes in a Directed Graph
Huifeng Guan
【每日一题】LeetCode 2876. Count Visited Nodes in a Directed Graph
14:30
【每日一题】LeetCode 1504. Count Submatrices With All Ones
Huifeng Guan
【每日一题】LeetCode 1504. Count Submatrices With All Ones
31:11
【每日一题】LeetCode 2871. Split Array Into Maximum Number of Subarrays
Huifeng Guan
【每日一题】LeetCode 2871. Split Array Into Maximum Number of Subarrays
10:45
【每日一题】LeetCode 2866. Beautiful Towers II
Huifeng Guan
【每日一题】LeetCode 2866. Beautiful Towers II
26:43
【每日一题】LeetCode 2764. is Array a Preorder of Some ‌Binary Tree
Huifeng Guan
【每日一题】LeetCode 2764. is Array a Preorder of Some ‌Binary Tree
11:03
【每日一题】LeetCode 2850. Minimum Moves to Spread Stones Over Grid
Huifeng Guan
【每日一题】LeetCode 2850. Minimum Moves to Spread Stones Over Grid
9:49