You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
Repository navigation
Commit 8bb0910
Browse filesBrowse the repository at this point in the historyBrowse files
@@ -1427,7 +1427,7 @@ Install the PWA edition of *LeetCode Cookbook* to your home screen from an iOS /
1427
1427
|1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||72.1%|Hard||
1428
1428
|1285|Find the Start and End Number of Continuous Ranges||88.2%|Medium||
1429
1429
|1286|Iterator for Combination||73.5%|Medium||
1430
-
|1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-25-In-Sorted-Array)|59.5%|Easy||
1430
+
|1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array)|59.5%|Easy||
1431
1431
|1288|Remove Covered Intervals||57.3%|Medium||
1432
1432
|1289|Minimum Falling Path Sum II||59.6%|Hard||
1433
1433
|1290|Convert Binary Number in a Linked List to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer)|82.6%|Easy||
@@ -2601,13 +2601,13 @@ None
2601
2601
## Array
2602
2602
2603
2603
2604
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Array/)
2604
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Array/)
2605
2605
2606
2606
2607
2607
2608
2608
## String
2609
2609
2610
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/String/)
2610
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/String/)
2611
2611
2612
2612
2613
2613
## Two Pointers
@@ -2636,7 +2636,7 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/String/)
2636
2636
- The SUM problem set. Problems 1, 15, 16, 18, 167, 923, 1074.
2637
2637
2638
2638
2639
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Two_Pointers/)
2639
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Two_Pointers/)
2640
2640
2641
2641
2642
2642
## Linked List
@@ -2654,7 +2654,7 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Two_Poin
2654
2654
- Detecting whether a linked list has a cycle and, if so, outputting the index of the cycle's entry node; detecting whether two linked lists intersect and, if so, outputting the intersection node. Problems 141, 142, 160.
2655
2655
2656
2656
2657
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Linked_List/)
2657
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Linked_List/)
2658
2658
2659
2659
2660
2660
@@ -2668,22 +2668,22 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Linked_L
2668
2668
- Using a stack for encoding/decoding problems. Problems 394, 682, 856, 880.
2669
2669
- **Monotonic stack**. **Use a stack to maintain a monotonically increasing or decreasing array of indices**. Problems 84, 456, 496, 503, 739, 901, 907, 1019.
2670
2670
2671
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Stack/)
2671
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Stack/)
2672
2672
2673
2673
2674
2674
2675
2675
## Tree
2676
2676
2677
2677
2678
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Tree/)
2678
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Tree/)
2679
2679
2680
2680
2681
2681
2682
2682
2683
2683
2684
2684
## Dynamic Programming
2685
2685
2686
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Dynamic_Programming/)
2686
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Dynamic_Programming/)
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Backtracking/)
2785
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Backtracking/)
2786
2786
2787
2787
2788
2788
## Depth First Search
2789
2789
2790
2790
2791
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Depth_First_Search/)
2791
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Depth_First_Search/)
2792
2792
2793
2793
2794
2794
@@ -2797,7 +2797,7 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Depth_Fi
2797
2797
2798
2798
2799
2799
2800
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Breadth_First_Search/)
2800
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Breadth_First_Search/)
2801
2801
2802
2802
2803
2803
@@ -2929,22 +2929,22 @@ func peakIndexInMountainArray(A []int) int {
2929
2929
2930
2930
- The max-min (minimize-the-maximum) problem: find the largest value while satisfying the constraint as tightly as possible. Problems 410, 875, 1011, 1283.
2931
2931
2932
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Binary_Search/)
2932
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Binary_Search/)
2933
2933
2934
2934
2935
2935
2936
2936
## Math
2937
2937
2938
2938
2939
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Math/)
2939
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Math/)
2940
2940
2941
2941
2942
2942
2943
2943
2944
2944
## Hash Table
2945
2945
2946
2946
2947
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Hash_Table/)
2947
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Hash_Table/)
2948
2948
2949
2949
2950
2950
@@ -2959,7 +2959,7 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Hash_Tab
2959
2959
- Reordering so that no two adjacent elements are equal. Problems 767, 1054.
2960
2960
- "Pancake sorting". Problem 969.
2961
2961
2962
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Sort/)
2962
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Sorting/)
2963
2963
2964
2964
2965
2965
## Bit Manipulation
@@ -2998,7 +2998,7 @@ X & -X isolates the lowest set bit (LSB)
2998
2998
X & ~X = 0
2999
2999
```
3000
3000
3001
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Bit_Manipulation/)
3001
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Bit_Manipulation/)
3002
3002
3003
3003
3004
3004
## Union Find
@@ -3013,7 +3013,7 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Bit_Mani
3013
3013
- Problems solvable with union-find can generally also be solved with DFS and BFS, just at a somewhat higher time complexity.
3014
3014
3015
3015
3016
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Union_Find/)
3016
+
Problems List in [there](https://books.halfrost.com/leetcode/en/ChapterTwo/Union_Find/)
3017
3017
3018
3018
3019
3019
@@ -3039,7 +3039,7 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Union_Fi
|1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||72.1%|Hard||
1428
1428
|1285|Find the Start and End Number of Continuous Ranges||88.2%|Medium||
1429
1429
|1286|Iterator for Combination||73.5%|Medium||
1430
-
|1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-25-In-Sorted-Array)|59.5%|Easy||
1430
+
|1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-In-Sorted-Array)|59.5%|Easy||
1431
1431
|1288|Remove Covered Intervals||57.3%|Medium||
1432
1432
|1289|Minimum Falling Path Sum II||59.6%|Hard||
1433
1433
|1290|Convert Binary Number in a Linked List to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer)|82.6%|Easy||
@@ -2601,13 +2601,13 @@
2601
2601
## Array
2602
2602
2603
2603
2604
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/Array/)
2604
+
Problems List in [there](https://books.halfrost.com/leetcode/zh/ChapterTwo/Array/)
2605
2605
2606
2606
2607
2607
2608
2608
## String
2609
2609
2610
-
Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/String/)
2610
+
Problems List in [there](https://books.halfrost.com/leetcode/zh/ChapterTwo/String/)
2611
2611
2612
2612
2613
2613
## Two Pointers
@@ -2636,7 +2636,7 @@ Problems List in [there](https://books.halfrost.com/leetcode/ChapterTwo/String/)
0 commit comments