@@ -17,63 +17,63 @@ weight: 5
17
17
18
18
| No. | Title | Solution | Difficulty | TimeComplexity | SpaceComplexity | Favorite| Acceptance |
19
19
| :--------:| :------- | :--------: | :----------: | :----: | :-----: | :-----: | :-----: |
20
- | 0020| Valid Parentheses| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0020.Valid-Parentheses.md" >}})| Easy| O(log n)| O(1)|| 40.6 %|
21
- | 0032| Longest Valid Parentheses| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0032.Longest-Valid-Parentheses.md" >}})| Hard|||| 31.1 %|
22
- | 0042| Trapping Rain Water| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0042.Trapping-Rain-Water.md" >}})| Hard| O(n)| O(1)| ❤️| 55.9 %|
23
- | 0071| Simplify Path| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0071.Simplify-Path.md" >}})| Medium| O(n)| O(n)| ❤️| 37.5 %|
24
- | 0084| Largest Rectangle in Histogram| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0084.Largest-Rectangle-in-Histogram.md" >}})| Hard| O(n)| O(n)| ❤️| 40.5 %|
25
- | 0094| Binary Tree Inorder Traversal| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0094.Binary-Tree-Inorder-Traversal.md" >}})| Easy| O(n)| O(1)|| 70.2 %|
26
- | 0114| Flatten Binary Tree to Linked List| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})| Medium|||| 57.2 %|
27
- | 0143| Reorder List| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0143.Reorder-List.md" >}})| Medium|||| 47.0 %|
28
- | 0144| Binary Tree Preorder Traversal| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0144.Binary-Tree-Preorder-Traversal.md" >}})| Easy| O(n)| O(1)|| 61.9 %|
29
- | 0145| Binary Tree Postorder Traversal| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0145.Binary-Tree-Postorder-Traversal.md" >}})| Easy| O(n)| O(1)|| 63.3 %|
30
- | 0150| Evaluate Reverse Polish Notation| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})| Medium| O(n)| O(1)|| 41.8 %|
31
- | 0155| Min Stack| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0155.Min-Stack.md" >}})| Easy| O(n)| O(n)|| 49.7 %|
32
- | 0173| Binary Search Tree Iterator| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0173.Binary-Search-Tree-Iterator.md" >}})| Medium| O(n)| O(1)|| 65.1 %|
33
- | 0224| Basic Calculator| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0224.Basic-Calculator.md" >}})| Hard| O(n)| O(n)|| 40.2 %|
34
- | 0225| Implement Stack using Queues| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0225.Implement-Stack-using-Queues.md" >}})| Easy| O(n)| O(n)|| 52.0 %|
35
- | 0227| Basic Calculator II| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0227.Basic-Calculator-II.md" >}})| Medium|||| 41.3 %|
36
- | 0232| Implement Queue using Stacks| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0232.Implement-Queue-using-Stacks.md" >}})| Easy| O(n)| O(n)|| 57 .2%|
37
- | 0234| Palindrome Linked List| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0234.Palindrome-Linked-List.md" >}})| Easy|||| 46.0 %|
38
- | 0331| Verify Preorder Serialization of a Binary Tree| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})| Medium| O(n)| O(1)|| 43.6 %|
39
- | 0341| Flatten Nested List Iterator| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0341.Flatten-Nested-List-Iterator.md" >}})| Medium|||| 58.3 %|
40
- | 0385| Mini Parser| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0385.Mini-Parser.md" >}})| Medium|||| 35.7 %|
41
- | 0394| Decode String| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0394.Decode-String.md" >}})| Medium| O(n)| O(n)|| 56.0 %|
20
+ | 0020| Valid Parentheses| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0020.Valid-Parentheses.md" >}})| Easy| O(log n)| O(1)|| 40.9 %|
21
+ | 0032| Longest Valid Parentheses| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0032.Longest-Valid-Parentheses.md" >}})| Hard|||| 31.3 %|
22
+ | 0042| Trapping Rain Water| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0042.Trapping-Rain-Water.md" >}})| Hard| O(n)| O(1)| ❤️| 56.5 %|
23
+ | 0071| Simplify Path| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0071.Simplify-Path.md" >}})| Medium| O(n)| O(n)| ❤️| 38.8 %|
24
+ | 0084| Largest Rectangle in Histogram| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0084.Largest-Rectangle-in-Histogram.md" >}})| Hard| O(n)| O(n)| ❤️| 40.8 %|
25
+ | 0094| Binary Tree Inorder Traversal| [ Go] ({{< relref "/ChapterFour/0001~ 0099/0094.Binary-Tree-Inorder-Traversal.md" >}})| Easy| O(n)| O(1)|| 70.8 %|
26
+ | 0114| Flatten Binary Tree to Linked List| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})| Medium|||| 57.8 %|
27
+ | 0143| Reorder List| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0143.Reorder-List.md" >}})| Medium|||| 47.9 %|
28
+ | 0144| Binary Tree Preorder Traversal| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0144.Binary-Tree-Preorder-Traversal.md" >}})| Easy| O(n)| O(1)|| 62.5 %|
29
+ | 0145| Binary Tree Postorder Traversal| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0145.Binary-Tree-Postorder-Traversal.md" >}})| Easy| O(n)| O(1)|| 64.1 %|
30
+ | 0150| Evaluate Reverse Polish Notation| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0150.Evaluate-Reverse-Polish-Notation.md" >}})| Medium| O(n)| O(1)|| 42.6 %|
31
+ | 0155| Min Stack| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0155.Min-Stack.md" >}})| Easy| O(n)| O(n)|| 50.2 %|
32
+ | 0173| Binary Search Tree Iterator| [ Go] ({{< relref "/ChapterFour/0100~ 0199/0173.Binary-Search-Tree-Iterator.md" >}})| Medium| O(n)| O(1)|| 67.3 %|
33
+ | 0224| Basic Calculator| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0224.Basic-Calculator.md" >}})| Hard| O(n)| O(n)|| 40.5 %|
34
+ | 0225| Implement Stack using Queues| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0225.Implement-Stack-using-Queues.md" >}})| Easy| O(n)| O(n)|| 53.6 %|
35
+ | 0227| Basic Calculator II| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0227.Basic-Calculator-II.md" >}})| Medium|||| 41.6 %|
36
+ | 0232| Implement Queue using Stacks| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0232.Implement-Queue-using-Stacks.md" >}})| Easy| O(n)| O(n)|| 58 .2%|
37
+ | 0234| Palindrome Linked List| [ Go] ({{< relref "/ChapterFour/0200~ 0299/0234.Palindrome-Linked-List.md" >}})| Easy|||| 46.6 %|
38
+ | 0331| Verify Preorder Serialization of a Binary Tree| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md" >}})| Medium| O(n)| O(1)|| 43.7 %|
39
+ | 0341| Flatten Nested List Iterator| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0341.Flatten-Nested-List-Iterator.md" >}})| Medium|||| 58.8 %|
40
+ | 0385| Mini Parser| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0385.Mini-Parser.md" >}})| Medium|||| 35.9 %|
41
+ | 0394| Decode String| [ Go] ({{< relref "/ChapterFour/0300~ 0399/0394.Decode-String.md" >}})| Medium| O(n)| O(n)|| 56.3 %|
42
42
| 0402| Remove K Digits| [ Go] ({{< relref "/ChapterFour/0400~ 0499/0402.Remove-K-Digits.md" >}})| Medium| O(n)| O(1)|| 30.5%|
43
- | 0445| Add Two Numbers II| [ Go] ({{< relref "/ChapterFour/0400~ 0499/0445.Add-Two-Numbers-II.md" >}})| Medium|||| 58.3 %|
43
+ | 0445| Add Two Numbers II| [ Go] ({{< relref "/ChapterFour/0400~ 0499/0445.Add-Two-Numbers-II.md" >}})| Medium|||| 58.6 %|
44
44
| 0456| 132 Pattern| [ Go] ({{< relref "/ChapterFour/0400~ 0499/0456.132-Pattern.md" >}})| Medium| O(n)| O(n)|| 30.9%|
45
- | 0496| Next Greater Element I| [ Go] ({{< relref "/ChapterFour/0400~ 0499/0496.Next-Greater-Element-I.md" >}})| Easy| O(n)| O(n)|| 69.6 %|
46
- | 0503| Next Greater Element II| [ Go] ({{< relref "/ChapterFour/0500~ 0599/0503.Next-Greater-Element-II.md" >}})| Medium| O(n)| O(n)|| 61.7 %|
47
- | 0581| Shortest Unsorted Continuous Subarray| [ Go] ({{< relref "/ChapterFour/0500~ 0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})| Medium|||| 34.0 %|
48
- | 0589| N-ary Tree Preorder Traversal| [ Go] ({{< relref "/ChapterFour/0500~ 0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})| Easy|||| 75.8 %|
49
- | 0636| Exclusive Time of Functions| [ Go] ({{< relref "/ChapterFour/0600~ 0699/0636.Exclusive-Time-of-Functions.md" >}})| Medium| O(n)| O(n)|| 59.7 %|
50
- | 0682| Baseball Game| [ Go] ({{< relref "/ChapterFour/0600~ 0699/0682.Baseball-Game.md" >}})| Easy| O(n)| O(n)|| 69.3 %|
45
+ | 0496| Next Greater Element I| [ Go] ({{< relref "/ChapterFour/0400~ 0499/0496.Next-Greater-Element-I.md" >}})| Easy| O(n)| O(n)|| 70.1 %|
46
+ | 0503| Next Greater Element II| [ Go] ({{< relref "/ChapterFour/0500~ 0599/0503.Next-Greater-Element-II.md" >}})| Medium| O(n)| O(n)|| 62.1 %|
47
+ | 0581| Shortest Unsorted Continuous Subarray| [ Go] ({{< relref "/ChapterFour/0500~ 0599/0581.Shortest-Unsorted-Continuous-Subarray.md" >}})| Medium|||| 35.9 %|
48
+ | 0589| N-ary Tree Preorder Traversal| [ Go] ({{< relref "/ChapterFour/0500~ 0599/0589.N-ary-Tree-Preorder-Traversal.md" >}})| Easy|||| 76.1 %|
49
+ | 0636| Exclusive Time of Functions| [ Go] ({{< relref "/ChapterFour/0600~ 0699/0636.Exclusive-Time-of-Functions.md" >}})| Medium| O(n)| O(n)|| 60.3 %|
50
+ | 0682| Baseball Game| [ Go] ({{< relref "/ChapterFour/0600~ 0699/0682.Baseball-Game.md" >}})| Easy| O(n)| O(n)|| 73.1 %|
51
51
| 0726| Number of Atoms| [ Go] ({{< relref "/ChapterFour/0700~ 0799/0726.Number-of-Atoms.md" >}})| Hard| O(n)| O(n) | ❤️| 51.7%|
52
52
| 0735| Asteroid Collision| [ Go] ({{< relref "/ChapterFour/0700~ 0799/0735.Asteroid-Collision.md" >}})| Medium| O(n)| O(n) || 44.4%|
53
- | 0739| Daily Temperatures| [ Go] ({{< relref "/ChapterFour/0700~ 0799/0739.Daily-Temperatures.md" >}})| Medium| O(n)| O(n) || 66.9 %|
54
- | 0844| Backspace String Compare| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0844.Backspace-String-Compare.md" >}})| Easy| O(n)| O(n) || 47.4 %|
55
- | 0853| Car Fleet| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0853.Car-Fleet.md" >}})| Medium|||| 47.8 %|
53
+ | 0739| Daily Temperatures| [ Go] ({{< relref "/ChapterFour/0700~ 0799/0739.Daily-Temperatures.md" >}})| Medium| O(n)| O(n) || 67.1 %|
54
+ | 0844| Backspace String Compare| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0844.Backspace-String-Compare.md" >}})| Easy| O(n)| O(n) || 48.0 %|
55
+ | 0853| Car Fleet| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0853.Car-Fleet.md" >}})| Medium|||| 48.2 %|
56
56
| 0856| Score of Parentheses| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0856.Score-of-Parentheses.md" >}})| Medium| O(n)| O(n)|| 65.4%|
57
57
| 0880| Decoded String at Index| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0880.Decoded-String-at-Index.md" >}})| Medium| O(n)| O(n)|| 28.3%|
58
- | 0895| Maximum Frequency Stack| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0895.Maximum-Frequency-Stack.md" >}})| Hard| O(n)| O(n) || 64.8 %|
59
- | 0897| Increasing Order Search Tree| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0897.Increasing-Order-Search-Tree.md" >}})| Easy|||| 76.0 %|
60
- | 0901| Online Stock Span| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0901.Online-Stock-Span.md" >}})| Medium| O(n)| O(n) || 62.9 %|
61
- | 0907| Sum of Subarray Minimums| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0907.Sum-of-Subarray-Minimums.md" >}})| Medium| O(n)| O(n)| ❤️| 33.7 %|
62
- | 0921| Minimum Add to Make Parentheses Valid| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})| Medium| O(n)| O(n)|| 77.3 %|
63
- | 0946| Validate Stack Sequences| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0946.Validate-Stack-Sequences.md" >}})| Medium| O(n)| O(n)|| 65.3 %|
64
- | 1003| Check If Word Is Valid After Substitutions| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})| Medium| O(n)| O(1)|| 57.7 %|
65
- | 1006| Clumsy Factorial| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1006.Clumsy-Factorial.md" >}})| Medium|||| 54.5 %|
66
- | 1019| Next Greater Node In Linked List| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1019.Next-Greater-Node-In-Linked-List.md" >}})| Medium| O(n)| O(1)|| 59.5 %|
67
- | 1021| Remove Outermost Parentheses| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1021.Remove-Outermost-Parentheses.md" >}})| Easy| O(n)| O(1)|| 79.7 %|
68
- | 1047| Remove All Adjacent Duplicates In String| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})| Easy| O(n)| O(1)|| 71.0 %|
69
- | 1111| Maximum Nesting Depth of Two Valid Parentheses Strings| [ Go] ({{< relref "/ChapterFour/1100~ 1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})| Medium|||| 72.8 %|
70
- | 1190| Reverse Substrings Between Each Pair of Parentheses| [ Go] ({{< relref "/ChapterFour/1100~ 1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md" >}})| Medium|||| 65.6 %|
71
- | 1209| Remove All Adjacent Duplicates in String II| [ Go] ({{< relref "/ChapterFour/1200~ 1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})| Medium|||| 56.0 %|
72
- | 1249| Minimum Remove to Make Valid Parentheses| [ Go] ({{< relref "/ChapterFour/1200~ 1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})| Medium|||| 65.2 %|
58
+ | 0895| Maximum Frequency Stack| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0895.Maximum-Frequency-Stack.md" >}})| Hard| O(n)| O(n) || 66.4 %|
59
+ | 0897| Increasing Order Search Tree| [ Go] ({{< relref "/ChapterFour/0800~ 0899/0897.Increasing-Order-Search-Tree.md" >}})| Easy|||| 78.3 %|
60
+ | 0901| Online Stock Span| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0901.Online-Stock-Span.md" >}})| Medium| O(n)| O(n) || 63.1 %|
61
+ | 0907| Sum of Subarray Minimums| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0907.Sum-of-Subarray-Minimums.md" >}})| Medium| O(n)| O(n)| ❤️| 33.8 %|
62
+ | 0921| Minimum Add to Make Parentheses Valid| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md" >}})| Medium| O(n)| O(n)|| 77.1 %|
63
+ | 0946| Validate Stack Sequences| [ Go] ({{< relref "/ChapterFour/0900~ 0999/0946.Validate-Stack-Sequences.md" >}})| Medium| O(n)| O(n)|| 67.6 %|
64
+ | 1003| Check If Word Is Valid After Substitutions| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md" >}})| Medium| O(n)| O(1)|| 57.9 %|
65
+ | 1006| Clumsy Factorial| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1006.Clumsy-Factorial.md" >}})| Medium|||| 54.7 %|
66
+ | 1019| Next Greater Node In Linked List| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1019.Next-Greater-Node-In-Linked-List.md" >}})| Medium| O(n)| O(1)|| 59.6 %|
67
+ | 1021| Remove Outermost Parentheses| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1021.Remove-Outermost-Parentheses.md" >}})| Easy| O(n)| O(1)|| 79.8 %|
68
+ | 1047| Remove All Adjacent Duplicates In String| [ Go] ({{< relref "/ChapterFour/1000~ 1099/1047.Remove-All-Adjacent-Duplicates-In-String.md" >}})| Easy| O(n)| O(1)|| 70.9 %|
69
+ | 1111| Maximum Nesting Depth of Two Valid Parentheses Strings| [ Go] ({{< relref "/ChapterFour/1100~ 1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md" >}})| Medium|||| 73.2 %|
70
+ | 1190| Reverse Substrings Between Each Pair of Parentheses| [ Go] ({{< relref "/ChapterFour/1100~ 1199/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses.md" >}})| Medium|||| 65.7 %|
71
+ | 1209| Remove All Adjacent Duplicates in String II| [ Go] ({{< relref "/ChapterFour/1200~ 1299/1209.Remove-All-Adjacent-Duplicates-in-String-II.md" >}})| Medium|||| 55.9 %|
72
+ | 1249| Minimum Remove to Make Valid Parentheses| [ Go] ({{< relref "/ChapterFour/1200~ 1299/1249.Minimum-Remove-to-Make-Valid-Parentheses.md" >}})| Medium|||| 65.7 %|
73
73
| 1614| Maximum Nesting Depth of the Parentheses| [ Go] ({{< relref "/ChapterFour/1600~ 1699/1614.Maximum-Nesting-Depth-of-the-Parentheses.md" >}})| Easy|||| 82.9%|
74
- | 1653| Minimum Deletions to Make String Balanced| [ Go] ({{< relref "/ChapterFour/1600~ 1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})| Medium|||| 55.3 %|
75
- | 1673| Find the Most Competitive Subsequence| [ Go] ({{< relref "/ChapterFour/1600~ 1699/1673.Find-the-Most-Competitive-Subsequence.md" >}})| Medium|||| 48.1 %|
76
- | 1700| Number of Students Unable to Eat Lunch| [ Go] ({{< relref "/ChapterFour/1700~ 1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})| Easy|||| 67.9 %|
74
+ | 1653| Minimum Deletions to Make String Balanced| [ Go] ({{< relref "/ChapterFour/1600~ 1699/1653.Minimum-Deletions-to-Make-String-Balanced.md" >}})| Medium|||| 56.6 %|
75
+ | 1673| Find the Most Competitive Subsequence| [ Go] ({{< relref "/ChapterFour/1600~ 1699/1673.Find-the-Most-Competitive-Subsequence.md" >}})| Medium|||| 48.4 %|
76
+ | 1700| Number of Students Unable to Eat Lunch| [ Go] ({{< relref "/ChapterFour/1700~ 1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})| Easy|||| 67.7 %|
77
77
| ------------| -------------------------------------------------------| -------| ----------------| ---------------| -------------| -------------| -------------|
78
78
79
79
0 commit comments