diff --git a/README.md b/README.md index 01d5c9f8..67e197b3 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (494 solved) +# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (495 solved) @@ -33,7 +33,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, ------ -[Array](), [String](), [Hash Table](), [Depth-First Search](), [Tree](), [Binary Tree](), [Sorting](), [Math](), [Breadth-First Search](), [Two Pointers](), [Stack](), [Linked List](), [Dynamic Programming](), [Matrix](), [Greedy](), [Simulation](), [Bit Manipulation](), [Design](), [Binary Search](), [Counting](), [Heap (Priority Queue)](), [Database](), [Trie](), [Recursion](), [Backtracking](), [Binary Search Tree](), [Sliding Window](), [Graph](), [Prefix Sum](), [Queue](), [Monotonic Stack](), [Union Find](), [Divide and Conquer](), [String Matching](), [Hash Function](), [Shortest Path](), [Game Theory](), [Combinatorics](), [Rolling Hash](), [Randomized](), [Bucket Sort](), [Counting Sort](), [Data Stream](), [Brainteaser](), [Memoization](), [Monotonic Queue](), [Suffix Array](), [Doubly-Linked List](), [Iterator](), [Number Theory](), [Geometry](), [Interactive](), [Merge Sort](), [Topological Sort](), [Ordered Set](), [Quickselect](), [Bitmask](), [Probability and Statistics](), [Binary Indexed Tree](), [Reservoir Sampling](), [Radix Sort]() +[Array](), [String](), [Hash Table](), [Depth-First Search](), [Tree](), [Binary Tree](), [Sorting](), [Math](), [Breadth-First Search](), [Two Pointers](), [Stack](), [Matrix](), [Linked List](), [Dynamic Programming](), [Greedy](), [Simulation](), [Bit Manipulation](), [Design](), [Counting](), [Binary Search](), [Heap (Priority Queue)](), [Database](), [Trie](), [Recursion](), [Backtracking](), [Binary Search Tree](), [Sliding Window](), [Graph](), [Prefix Sum](), [Queue](), [Monotonic Stack](), [Union Find](), [Divide and Conquer](), [String Matching](), [Hash Function](), [Shortest Path](), [Game Theory](), [Combinatorics](), [Rolling Hash](), [Randomized](), [Bucket Sort](), [Counting Sort](), [Data Stream](), [Brainteaser](), [Memoization](), [Monotonic Queue](), [Suffix Array](), [Doubly-Linked List](), [Iterator](), [Number Theory](), [Geometry](), [Interactive](), [Merge Sort](), [Topological Sort](), [Ordered Set](), [Quickselect](), [Bitmask](), [Strongly Connected Component](), [Probability and Statistics](), [Binary Indexed Tree](), [Segment Tree](), [Reservoir Sampling](), [Radix Sort]() ------ @@ -357,6 +357,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python, | 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution]() | py | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution]() | py | | 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution]() | py | +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution]() | py | | 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution]() | c, java, py | | 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable]() | Hard | Daily | [solution]() | py | | 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution]() | py | diff --git a/markdowns/Daily_Questions.md b/markdowns/Daily_Questions.md index c3c6061f..d95ac6ca 100644 --- a/markdowns/Daily_Questions.md +++ b/markdowns/Daily_Questions.md @@ -6,6 +6,7 @@ Dates are for the date I completed the question so due to the my time zone and h | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------| +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | | 959 | [Regions Cut By Slashes]() | Medium | Daily | [solution](<_959. Regions Cut By Slashes.md>) | py | Aug 10, 2024 | | 840 | [Magic Squares In Grid]() | Medium | Daily | [solution](<_840. Magic Squares In Grid.md>) | py | Aug 09, 2024 | | 885 | [Spiral Matrix III]() | Medium | Daily | [solution](<_885. Spiral Matrix III.md>) | py | Aug 08, 2024 | diff --git a/markdowns/Hard.md b/markdowns/Hard.md index 1f0ed6d7..4a511425 100644 --- a/markdowns/Hard.md +++ b/markdowns/Hard.md @@ -1,4 +1,4 @@ -# Hard Questions (29) +# Hard Questions (30) *[Back to top](<../README.md>)* @@ -26,6 +26,7 @@ | 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<_1028. Recover a Tree From Preorder Traversal.md>) | py | Jul 01, 2024 | | 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | | 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix]() | Hard | | [solution](<_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>) | py | Jun 09, 2024 | +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | | 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable]() | Hard | Daily | [solution](<_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md>) | py | Jun 30, 2024 | | 2045 | [Second Minimum Time to Reach Destination]() | Hard | Daily | [solution](<_2045. Second Minimum Time to Reach Destination.md>) | py | Jul 28, 2024 | | 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<_2258. Escape the Spreading Fire.md>) | py | Jun 15, 2024 | diff --git a/markdowns/Questions_By_Code_Length.md b/markdowns/Questions_By_Code_Length.md index 98672ea9..c9bc4f9b 100644 --- a/markdowns/Questions_By_Code_Length.md +++ b/markdowns/Questions_By_Code_Length.md @@ -169,6 +169,7 @@ Calculations are based on the code files's byte sizes. | 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 02, 2024 | | 380 | [Insert Delete GetRandom O(1)]() | Medium | | [solution](<_380. Insert Delete GetRandom O(1).md>) | java | Jul 06, 2024 | | 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution](<_238. Product of Array Except Self.md>) | py | Jun 13, 2024 | +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | | 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | | 1190 | [Reverse Substrings Between Each Pair of Parentheses]() | Medium | Daily | [solution](<_1190. Reverse Substrings Between Each Pair of Parentheses.md>) | py | Jul 11, 2024 | | 79 | [Word Search]() | Medium | B75, N150 | [solution](<_79. Word Search.md>) | py | Jun 27, 2024 | diff --git a/markdowns/Questions_By_Recent.md b/markdowns/Questions_By_Recent.md index 5e8421ae..c882f6ef 100644 --- a/markdowns/Questions_By_Recent.md +++ b/markdowns/Questions_By_Recent.md @@ -6,6 +6,7 @@ Calculations are based on the date of the first solve. | # | Title | Level | Cats | Solution | Languages | Date Complete | |-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:--------------------------------------------|:----------------| +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | | 959 | [Regions Cut By Slashes]() | Medium | Daily | [solution](<_959. Regions Cut By Slashes.md>) | py | Aug 10, 2024 | | 840 | [Magic Squares In Grid]() | Medium | Daily | [solution](<_840. Magic Squares In Grid.md>) | py | Aug 09, 2024 | | 885 | [Spiral Matrix III]() | Medium | Daily | [solution](<_885. Spiral Matrix III.md>) | py | Aug 08, 2024 | diff --git a/markdowns/Topics.md b/markdowns/Topics.md index 9ece6b13..3d0c949c 100644 --- a/markdowns/Topics.md +++ b/markdowns/Topics.md @@ -4,26 +4,26 @@ ------ -- [Array]() (228 completed) +- [Array]() (233 completed) - [String]() (111 completed) -- [Hash Table]() (109 completed) -- [Depth-First Search]() (80 completed) +- [Hash Table]() (110 completed) +- [Depth-First Search]() (81 completed) - [Tree]() (79 completed) - [Binary Tree]() (74 completed) - [Sorting]() (67 completed) - [Math]() (62 completed) -- [Breadth-First Search]() (53 completed) -- [Two Pointers]() (49 completed) -- [Stack]() (47 completed) +- [Breadth-First Search]() (54 completed) +- [Two Pointers]() (51 completed) +- [Stack]() (48 completed) +- [Matrix]() (43 completed) - [Linked List]() (40 completed) - [Dynamic Programming]() (39 completed) -- [Matrix]() (39 completed) - [Greedy]() (39 completed) -- [Simulation]() (33 completed) +- [Simulation]() (34 completed) - [Bit Manipulation]() (28 completed) -- [Design]() (27 completed) +- [Design]() (28 completed) +- [Counting]() (22 completed) - [Binary Search]() (21 completed) -- [Counting]() (21 completed) - [Heap (Priority Queue)]() (19 completed) - [Database]() (18 completed) - [Trie]() (18 completed) @@ -61,7 +61,9 @@ - [Ordered Set]() (2 completed) - [Quickselect]() (2 completed) - [Bitmask]() (1 completed) +- [Strongly Connected Component]() (1 completed) - [Probability and Statistics]() (1 completed) - [Binary Indexed Tree]() (1 completed) +- [Segment Tree]() (1 completed) - [Reservoir Sampling]() (1 completed) - [Radix Sort]() (1 completed) diff --git a/markdowns/_1. Two Sum.md b/markdowns/_1. Two Sum.md index 2aff8c3d..35c190d0 100644 --- a/markdowns/_1. Two Sum.md +++ b/markdowns/_1. Two Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table]()** > -> **Acceptance Rate** : **53.3 %** +> **Acceptance Rate** : **53.37 %** ------ diff --git a/markdowns/_100. Same Tree.md b/markdowns/_100. Same Tree.md index 1e999d60..ef0b5687 100644 --- a/markdowns/_100. Same Tree.md +++ b/markdowns/_100. Same Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **62.9 %** +> **Acceptance Rate** : **62.96 %** ------ diff --git a/markdowns/_1006. Clumsy Factorial.md b/markdowns/_1006. Clumsy Factorial.md index 45c738fc..334c7b02 100644 --- a/markdowns/_1006. Clumsy Factorial.md +++ b/markdowns/_1006. Clumsy Factorial.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Stack](), [Simulation]()** > -> **Acceptance Rate** : **57.55 %** +> **Acceptance Rate** : **57.59 %** ------ diff --git a/markdowns/_1008. Construct Binary Search Tree from Preorder Traversal.md b/markdowns/_1008. Construct Binary Search Tree from Preorder Traversal.md index c63b5dd8..1e395b9b 100644 --- a/markdowns/_1008. Construct Binary Search Tree from Preorder Traversal.md +++ b/markdowns/_1008. Construct Binary Search Tree from Preorder Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Tree](), [Binary Search Tree](), [Monotonic Stack](), [Binary Tree]()** > -> **Acceptance Rate** : **82.35 %** +> **Acceptance Rate** : **82.38 %** ------ diff --git a/markdowns/_1018. Binary Prefix Divisible By 5.md b/markdowns/_1018. Binary Prefix Divisible By 5.md index 7a9ff99b..21267b2a 100644 --- a/markdowns/_1018. Binary Prefix Divisible By 5.md +++ b/markdowns/_1018. Binary Prefix Divisible By 5.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Bit Manipulation]()** > -> **Acceptance Rate** : **46.77 %** +> **Acceptance Rate** : **46.79 %** ------ diff --git a/markdowns/_1019. Next Greater Node In Linked List.md b/markdowns/_1019. Next Greater Node In Linked List.md index d633b4f4..374ff100 100644 --- a/markdowns/_1019. Next Greater Node In Linked List.md +++ b/markdowns/_1019. Next Greater Node In Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Linked List](), [Stack](), [Monotonic Stack]()** > -> **Acceptance Rate** : **61.1 %** +> **Acceptance Rate** : **61.13 %** ------ diff --git a/markdowns/_102. Binary Tree Level Order Traversal.md b/markdowns/_102. Binary Tree Level Order Traversal.md index d8abe505..ac07e9e8 100644 --- a/markdowns/_102. Binary Tree Level Order Traversal.md +++ b/markdowns/_102. Binary Tree Level Order Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **68.06 %** +> **Acceptance Rate** : **68.13 %** ------ diff --git a/markdowns/_1020. Number of Enclaves.md b/markdowns/_1020. Number of Enclaves.md index a37388c4..85d2c2b0 100644 --- a/markdowns/_1020. Number of Enclaves.md +++ b/markdowns/_1020. Number of Enclaves.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Depth-First Search](), [Breadth-First Search](), [Union Find](), [Matrix]()** > -> **Acceptance Rate** : **69.19 %** +> **Acceptance Rate** : **69.23 %** ------ diff --git a/markdowns/_1026. Maximum Difference Between Node and Ancestor.md b/markdowns/_1026. Maximum Difference Between Node and Ancestor.md index 40bca51c..f0dae10b 100644 --- a/markdowns/_1026. Maximum Difference Between Node and Ancestor.md +++ b/markdowns/_1026. Maximum Difference Between Node and Ancestor.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **78.11 %** +> **Acceptance Rate** : **78.09 %** ------ diff --git a/markdowns/_1028. Recover a Tree From Preorder Traversal.md b/markdowns/_1028. Recover a Tree From Preorder Traversal.md index 6d538941..bf8b8ea7 100644 --- a/markdowns/_1028. Recover a Tree From Preorder Traversal.md +++ b/markdowns/_1028. Recover a Tree From Preorder Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **75.0 %** +> **Acceptance Rate** : **75.05 %** ------ diff --git a/markdowns/_103. Binary Tree Zigzag Level Order Traversal.md b/markdowns/_103. Binary Tree Zigzag Level Order Traversal.md index 63ddcdce..471fe6c8 100644 --- a/markdowns/_103. Binary Tree Zigzag Level Order Traversal.md +++ b/markdowns/_103. Binary Tree Zigzag Level Order Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **59.64 %** +> **Acceptance Rate** : **59.7 %** ------ diff --git a/markdowns/_1030. Matrix Cells in Distance Order.md b/markdowns/_1030. Matrix Cells in Distance Order.md index 43817e8e..6002476f 100644 --- a/markdowns/_1030. Matrix Cells in Distance Order.md +++ b/markdowns/_1030. Matrix Cells in Distance Order.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Geometry](), [Sorting](), [Matrix]()** > -> **Acceptance Rate** : **71.44 %** +> **Acceptance Rate** : **71.48 %** ------ diff --git a/markdowns/_104. Maximum Depth of Binary Tree.md b/markdowns/_104. Maximum Depth of Binary Tree.md index b8204c39..11a7fcb5 100644 --- a/markdowns/_104. Maximum Depth of Binary Tree.md +++ b/markdowns/_104. Maximum Depth of Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **75.84 %** +> **Acceptance Rate** : **75.89 %** ------ diff --git a/markdowns/_1046. Last Stone Weight.md b/markdowns/_1046. Last Stone Weight.md index e34be0b3..ddb2b673 100644 --- a/markdowns/_1046. Last Stone Weight.md +++ b/markdowns/_1046. Last Stone Weight.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Heap (Priority Queue)]()** > -> **Acceptance Rate** : **65.52 %** +> **Acceptance Rate** : **65.53 %** ------ diff --git a/markdowns/_1051. Height Checker.md b/markdowns/_1051. Height Checker.md index b1f4e0a0..f8ea5a2f 100644 --- a/markdowns/_1051. Height Checker.md +++ b/markdowns/_1051. Height Checker.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sorting](), [Counting Sort]()** > -> **Acceptance Rate** : **80.77 %** +> **Acceptance Rate** : **80.78 %** ------ diff --git a/markdowns/_1052. Grumpy Bookstore Owner.md b/markdowns/_1052. Grumpy Bookstore Owner.md index 4fdede89..a8a56d1e 100644 --- a/markdowns/_1052. Grumpy Bookstore Owner.md +++ b/markdowns/_1052. Grumpy Bookstore Owner.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sliding Window]()** > -> **Acceptance Rate** : **64.33 %** +> **Acceptance Rate** : **64.32 %** ------ diff --git a/markdowns/_1062. Longest Repeating Substring.md b/markdowns/_1062. Longest Repeating Substring.md index c7a20d33..61164f0c 100644 --- a/markdowns/_1062. Longest Repeating Substring.md +++ b/markdowns/_1062. Longest Repeating Substring.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Binary Search](), [Dynamic Programming](), [Rolling Hash](), [Suffix Array](), [Hash Function]()** > -> **Acceptance Rate** : **62.0 %** +> **Acceptance Rate** : **62.33 %** ------ diff --git a/markdowns/_1068. Product Sales Analysis I.md b/markdowns/_1068. Product Sales Analysis I.md index 010a65a1..82ad9906 100644 --- a/markdowns/_1068. Product Sales Analysis I.md +++ b/markdowns/_1068. Product Sales Analysis I.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **83.57 %** +> **Acceptance Rate** : **83.75 %** ------ diff --git a/markdowns/_107. Binary Tree Level Order Traversal II.md b/markdowns/_107. Binary Tree Level Order Traversal II.md index 1200fd4d..98d1f157 100644 --- a/markdowns/_107. Binary Tree Level Order Traversal II.md +++ b/markdowns/_107. Binary Tree Level Order Traversal II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **63.98 %** +> **Acceptance Rate** : **64.03 %** ------ diff --git a/markdowns/_110. Balanced Binary Tree.md b/markdowns/_110. Balanced Binary Tree.md index 1e1edeca..01571d50 100644 --- a/markdowns/_110. Balanced Binary Tree.md +++ b/markdowns/_110. Balanced Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **52.95 %** +> **Acceptance Rate** : **53.01 %** ------ diff --git a/markdowns/_1101. The Earliest Moment When Everyone Become Friends.md b/markdowns/_1101. The Earliest Moment When Everyone Become Friends.md index c7eb4d6a..0bc9c60d 100644 --- a/markdowns/_1101. The Earliest Moment When Everyone Become Friends.md +++ b/markdowns/_1101. The Earliest Moment When Everyone Become Friends.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Union Find](), [Sorting]()** > -> **Acceptance Rate** : **65.31 %** +> **Acceptance Rate** : **65.3 %** ------ diff --git a/markdowns/_1105. Filling Bookcase Shelves.md b/markdowns/_1105. Filling Bookcase Shelves.md index a968eed5..d4314f0e 100644 --- a/markdowns/_1105. Filling Bookcase Shelves.md +++ b/markdowns/_1105. Filling Bookcase Shelves.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming]()** > -> **Acceptance Rate** : **68.91 %** +> **Acceptance Rate** : **68.86 %** ------ diff --git a/markdowns/_111. Minimum Depth of Binary Tree.md b/markdowns/_111. Minimum Depth of Binary Tree.md index 5dd7e5b4..0c8059e8 100644 --- a/markdowns/_111. Minimum Depth of Binary Tree.md +++ b/markdowns/_111. Minimum Depth of Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **48.63 %** +> **Acceptance Rate** : **48.68 %** ------ diff --git a/markdowns/_1110. Delete Nodes And Return Forest.md b/markdowns/_1110. Delete Nodes And Return Forest.md index ba75ef37..df646472 100644 --- a/markdowns/_1110. Delete Nodes And Return Forest.md +++ b/markdowns/_1110. Delete Nodes And Return Forest.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **72.41 %** +> **Acceptance Rate** : **72.42 %** ------ diff --git a/markdowns/_112. Path Sum.md b/markdowns/_112. Path Sum.md index e604ad83..9ed2a288 100644 --- a/markdowns/_112. Path Sum.md +++ b/markdowns/_112. Path Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **51.01 %** +> **Acceptance Rate** : **51.07 %** ------ diff --git a/markdowns/_113. Path Sum II.md b/markdowns/_113. Path Sum II.md index 943ea701..4104e364 100644 --- a/markdowns/_113. Path Sum II.md +++ b/markdowns/_113. Path Sum II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Backtracking](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **58.92 %** +> **Acceptance Rate** : **58.95 %** ------ diff --git a/markdowns/_114. Flatten Binary Tree to Linked List.md b/markdowns/_114. Flatten Binary Tree to Linked List.md index ac2f8e1b..22e3e768 100644 --- a/markdowns/_114. Flatten Binary Tree to Linked List.md +++ b/markdowns/_114. Flatten Binary Tree to Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Stack](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **65.86 %** +> **Acceptance Rate** : **65.94 %** ------ diff --git a/markdowns/_1166. Design File System.md b/markdowns/_1166. Design File System.md index 4e24e592..ee7425c5 100644 --- a/markdowns/_1166. Design File System.md +++ b/markdowns/_1166. Design File System.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Design](), [Trie]()** > -> **Acceptance Rate** : **63.11 %** +> **Acceptance Rate** : **63.14 %** ------ diff --git a/markdowns/_1171. Remove Zero Sum Consecutive Nodes from Linked List.md b/markdowns/_1171. Remove Zero Sum Consecutive Nodes from Linked List.md index 1edbeaca..2789b6fe 100644 --- a/markdowns/_1171. Remove Zero Sum Consecutive Nodes from Linked List.md +++ b/markdowns/_1171. Remove Zero Sum Consecutive Nodes from Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Linked List]()** > -> **Acceptance Rate** : **52.76 %** +> **Acceptance Rate** : **52.75 %** ------ diff --git a/markdowns/_118. Pascal's Triangle.md b/markdowns/_118. Pascal's Triangle.md index 02d984ba..f1a0a4e7 100644 --- a/markdowns/_118. Pascal's Triangle.md +++ b/markdowns/_118. Pascal's Triangle.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming]()** > -> **Acceptance Rate** : **75.0 %** +> **Acceptance Rate** : **75.06 %** ------ diff --git a/markdowns/_1184. Distance Between Bus Stops.md b/markdowns/_1184. Distance Between Bus Stops.md index b08a30e5..48d1f865 100644 --- a/markdowns/_1184. Distance Between Bus Stops.md +++ b/markdowns/_1184. Distance Between Bus Stops.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array]()** > -> **Acceptance Rate** : **54.13 %** +> **Acceptance Rate** : **54.12 %** ------ diff --git a/markdowns/_1209. Remove All Adjacent Duplicates in String II.md b/markdowns/_1209. Remove All Adjacent Duplicates in String II.md index ea263500..28324a24 100644 --- a/markdowns/_1209. Remove All Adjacent Duplicates in String II.md +++ b/markdowns/_1209. Remove All Adjacent Duplicates in String II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack]()** > -> **Acceptance Rate** : **58.12 %** +> **Acceptance Rate** : **58.15 %** ------ diff --git a/markdowns/_121. Best Time to Buy and Sell Stock.md b/markdowns/_121. Best Time to Buy and Sell Stock.md index 7062610e..59011393 100644 --- a/markdowns/_121. Best Time to Buy and Sell Stock.md +++ b/markdowns/_121. Best Time to Buy and Sell Stock.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming]()** > -> **Acceptance Rate** : **53.96 %** +> **Acceptance Rate** : **53.99 %** ------ diff --git a/markdowns/_1230. Toss Strange Coins.md b/markdowns/_1230. Toss Strange Coins.md index 64669a1a..bc3a695d 100644 --- a/markdowns/_1230. Toss Strange Coins.md +++ b/markdowns/_1230. Toss Strange Coins.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Dynamic Programming](), [Probability and Statistics]()** > -> **Acceptance Rate** : **58.15 %** +> **Acceptance Rate** : **58.19 %** ------ diff --git a/markdowns/_1239. Maximum Length of a Concatenated String with Unique Characters.md b/markdowns/_1239. Maximum Length of a Concatenated String with Unique Characters.md index 37f523c0..f9ee6723 100644 --- a/markdowns/_1239. Maximum Length of a Concatenated String with Unique Characters.md +++ b/markdowns/_1239. Maximum Length of a Concatenated String with Unique Characters.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Backtracking](), [Bit Manipulation]()** > -> **Acceptance Rate** : **54.11 %** +> **Acceptance Rate** : **54.1 %** ------ diff --git a/markdowns/_124. Binary Tree Maximum Path Sum.md b/markdowns/_124. Binary Tree Maximum Path Sum.md index c47ba14e..9a6e2a13 100644 --- a/markdowns/_124. Binary Tree Maximum Path Sum.md +++ b/markdowns/_124. Binary Tree Maximum Path Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Dynamic Programming](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **40.25 %** +> **Acceptance Rate** : **40.27 %** ------ diff --git a/markdowns/_1248. Count Number of Nice Subarrays.md b/markdowns/_1248. Count Number of Nice Subarrays.md index 4cd18ef7..3797191e 100644 --- a/markdowns/_1248. Count Number of Nice Subarrays.md +++ b/markdowns/_1248. Count Number of Nice Subarrays.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Math](), [Sliding Window]()** > -> **Acceptance Rate** : **71.25 %** +> **Acceptance Rate** : **71.29 %** ------ diff --git a/markdowns/_1249. Minimum Remove to Make Valid Parentheses.md b/markdowns/_1249. Minimum Remove to Make Valid Parentheses.md index 5984e237..90f67980 100644 --- a/markdowns/_1249. Minimum Remove to Make Valid Parentheses.md +++ b/markdowns/_1249. Minimum Remove to Make Valid Parentheses.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack]()** > -> **Acceptance Rate** : **69.13 %** +> **Acceptance Rate** : **69.15 %** ------ diff --git a/markdowns/_125. Valid Palindrome.md b/markdowns/_125. Valid Palindrome.md index f6931a66..5f04a330 100644 --- a/markdowns/_125. Valid Palindrome.md +++ b/markdowns/_125. Valid Palindrome.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String]()** > -> **Acceptance Rate** : **48.29 %** +> **Acceptance Rate** : **48.36 %** ------ diff --git a/markdowns/_1252. Cells with Odd Values in a Matrix.md b/markdowns/_1252. Cells with Odd Values in a Matrix.md index b0dc58c2..0ffe5030 100644 --- a/markdowns/_1252. Cells with Odd Values in a Matrix.md +++ b/markdowns/_1252. Cells with Odd Values in a Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Simulation]()** > -> **Acceptance Rate** : **78.78 %** +> **Acceptance Rate** : **78.79 %** ------ diff --git a/markdowns/_1268. Search Suggestions System.md b/markdowns/_1268. Search Suggestions System.md index 3f285eac..802ce775 100644 --- a/markdowns/_1268. Search Suggestions System.md +++ b/markdowns/_1268. Search Suggestions System.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Binary Search](), [Trie](), [Sorting](), [Heap (Priority Queue)]()** > -> **Acceptance Rate** : **65.1 %** +> **Acceptance Rate** : **65.09 %** ------ diff --git a/markdowns/_128. Longest Consecutive Sequence.md b/markdowns/_128. Longest Consecutive Sequence.md index 993f7b6c..bfcb5e5d 100644 --- a/markdowns/_128. Longest Consecutive Sequence.md +++ b/markdowns/_128. Longest Consecutive Sequence.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Union Find]()** > -> **Acceptance Rate** : **47.33 %** +> **Acceptance Rate** : **47.35 %** ------ diff --git a/markdowns/_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md b/markdowns/_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md index ce070db0..21d0efb4 100644 --- a/markdowns/_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md +++ b/markdowns/_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Bit Manipulation](), [Breadth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **72.16 %** +> **Acceptance Rate** : **72.15 %** ------ diff --git a/markdowns/_129. Sum Root to Leaf Numbers.md b/markdowns/_129. Sum Root to Leaf Numbers.md index ce27ed00..57b6493c 100644 --- a/markdowns/_129. Sum Root to Leaf Numbers.md +++ b/markdowns/_129. Sum Root to Leaf Numbers.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **66.4 %** +> **Acceptance Rate** : **66.45 %** ------ diff --git a/markdowns/_13. Roman to Integer.md b/markdowns/_13. Roman to Integer.md index faa1a1cf..40efbb1a 100644 --- a/markdowns/_13. Roman to Integer.md +++ b/markdowns/_13. Roman to Integer.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Math](), [String]()** > -> **Acceptance Rate** : **62.13 %** +> **Acceptance Rate** : **62.22 %** ------ diff --git a/markdowns/_1302. Deepest Leaves Sum.md b/markdowns/_1302. Deepest Leaves Sum.md index c4ada9ed..1913802e 100644 --- a/markdowns/_1302. Deepest Leaves Sum.md +++ b/markdowns/_1302. Deepest Leaves Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **86.32 %** +> **Acceptance Rate** : **86.33 %** ------ diff --git a/markdowns/_1305. All Elements in Two Binary Search Trees.md b/markdowns/_1305. All Elements in Two Binary Search Trees.md index aa2cca32..1a7d7410 100644 --- a/markdowns/_1305. All Elements in Two Binary Search Trees.md +++ b/markdowns/_1305. All Elements in Two Binary Search Trees.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Search Tree](), [Sorting](), [Binary Tree]()** > -> **Acceptance Rate** : **79.82 %** +> **Acceptance Rate** : **79.83 %** ------ diff --git a/markdowns/_131. Palindrome Partitioning.md b/markdowns/_131. Palindrome Partitioning.md index c150b6ad..1bc5c380 100644 --- a/markdowns/_131. Palindrome Partitioning.md +++ b/markdowns/_131. Palindrome Partitioning.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Dynamic Programming](), [Backtracking]()** > -> **Acceptance Rate** : **69.92 %** +> **Acceptance Rate** : **69.98 %** ------ diff --git a/markdowns/_1317. Convert Integer to the Sum of Two No-Zero Integers.md b/markdowns/_1317. Convert Integer to the Sum of Two No-Zero Integers.md index 7b1ebb96..374474e0 100644 --- a/markdowns/_1317. Convert Integer to the Sum of Two No-Zero Integers.md +++ b/markdowns/_1317. Convert Integer to the Sum of Two No-Zero Integers.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math]()** > -> **Acceptance Rate** : **53.92 %** +> **Acceptance Rate** : **53.94 %** ------ diff --git a/markdowns/_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md b/markdowns/_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md index 59a59917..faabc38e 100644 --- a/markdowns/_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md +++ b/markdowns/_1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Dynamic Programming](), [Graph](), [Shortest Path]()** > -> **Acceptance Rate** : **68.19 %** +> **Acceptance Rate** : **68.22 %** ------ diff --git a/markdowns/_1351. Count Negative Numbers in a Sorted Matrix.md b/markdowns/_1351. Count Negative Numbers in a Sorted Matrix.md index a152748d..c99a6d06 100644 --- a/markdowns/_1351. Count Negative Numbers in a Sorted Matrix.md +++ b/markdowns/_1351. Count Negative Numbers in a Sorted Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search](), [Matrix]()** > -> **Acceptance Rate** : **77.4 %** +> **Acceptance Rate** : **77.41 %** ------ diff --git a/markdowns/_136. Single Number.md b/markdowns/_136. Single Number.md index c279a26d..7caefaec 100644 --- a/markdowns/_136. Single Number.md +++ b/markdowns/_136. Single Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Bit Manipulation]()** > -> **Acceptance Rate** : **73.68 %** +> **Acceptance Rate** : **73.74 %** ------ diff --git a/markdowns/_1372. Longest ZigZag Path in a Binary Tree.md b/markdowns/_1372. Longest ZigZag Path in a Binary Tree.md index 2fe1ff6f..f22db356 100644 --- a/markdowns/_1372. Longest ZigZag Path in a Binary Tree.md +++ b/markdowns/_1372. Longest ZigZag Path in a Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Dynamic Programming](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **65.92 %** +> **Acceptance Rate** : **65.91 %** ------ diff --git a/markdowns/_138. Copy List with Random Pointer.md b/markdowns/_138. Copy List with Random Pointer.md index 05228756..4c3e3010 100644 --- a/markdowns/_138. Copy List with Random Pointer.md +++ b/markdowns/_138. Copy List with Random Pointer.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Linked List]()** > -> **Acceptance Rate** : **57.12 %** +> **Acceptance Rate** : **57.2 %** ------ diff --git a/markdowns/_1380. Lucky Numbers in a Matrix.md b/markdowns/_1380. Lucky Numbers in a Matrix.md index 96be41d2..5d3b6e04 100644 --- a/markdowns/_1380. Lucky Numbers in a Matrix.md +++ b/markdowns/_1380. Lucky Numbers in a Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Matrix]()** > -> **Acceptance Rate** : **79.9 %** +> **Acceptance Rate** : **79.89 %** ------ diff --git a/markdowns/_1382. Balance a Binary Search Tree.md b/markdowns/_1382. Balance a Binary Search Tree.md index 06a23f3b..cfe37aae 100644 --- a/markdowns/_1382. Balance a Binary Search Tree.md +++ b/markdowns/_1382. Balance a Binary Search Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Divide and Conquer](), [Greedy](), [Tree](), [Depth-First Search](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **84.67 %** +> **Acceptance Rate** : **84.68 %** ------ diff --git a/markdowns/_1395. Count Number of Teams.md b/markdowns/_1395. Count Number of Teams.md index bd01deeb..85403b18 100644 --- a/markdowns/_1395. Count Number of Teams.md +++ b/markdowns/_1395. Count Number of Teams.md @@ -12,9 +12,9 @@ ------ -> **Related Topics** : **[Array](), [Dynamic Programming](), [Binary Indexed Tree]()** +> **Related Topics** : **[Array](), [Dynamic Programming](), [Binary Indexed Tree](), [Segment Tree]()** > -> **Acceptance Rate** : **70.17 %** +> **Acceptance Rate** : **70.16 %** ------ diff --git a/markdowns/_14. Longest Common Prefix.md b/markdowns/_14. Longest Common Prefix.md index cd8f4535..e8e3da6f 100644 --- a/markdowns/_14. Longest Common Prefix.md +++ b/markdowns/_14. Longest Common Prefix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Trie]()** > -> **Acceptance Rate** : **43.42 %** +> **Acceptance Rate** : **43.48 %** ------ diff --git a/markdowns/_1404. Number of Steps to Reduce a Number in Binary Representation to One.md b/markdowns/_1404. Number of Steps to Reduce a Number in Binary Representation to One.md index 1da2bb9d..c792656a 100644 --- a/markdowns/_1404. Number of Steps to Reduce a Number in Binary Representation to One.md +++ b/markdowns/_1404. Number of Steps to Reduce a Number in Binary Representation to One.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Bit Manipulation]()** > -> **Acceptance Rate** : **61.46 %** +> **Acceptance Rate** : **61.45 %** ------ diff --git a/markdowns/_141. Linked List Cycle.md b/markdowns/_141. Linked List Cycle.md index 060ae785..37b05f11 100644 --- a/markdowns/_141. Linked List Cycle.md +++ b/markdowns/_141. Linked List Cycle.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Linked List](), [Two Pointers]()** > -> **Acceptance Rate** : **50.87 %** +> **Acceptance Rate** : **50.91 %** ------ diff --git a/markdowns/_142. Linked List Cycle II.md b/markdowns/_142. Linked List Cycle II.md index 9267076a..9a8e7085 100644 --- a/markdowns/_142. Linked List Cycle II.md +++ b/markdowns/_142. Linked List Cycle II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Linked List](), [Two Pointers]()** > -> **Acceptance Rate** : **52.16 %** +> **Acceptance Rate** : **52.23 %** ------ diff --git a/markdowns/_1426. Counting Elements.md b/markdowns/_1426. Counting Elements.md index cc14a899..974d95cf 100644 --- a/markdowns/_1426. Counting Elements.md +++ b/markdowns/_1426. Counting Elements.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table]()** > -> **Acceptance Rate** : **60.25 %** +> **Acceptance Rate** : **60.26 %** ------ diff --git a/markdowns/_143. Reorder List.md b/markdowns/_143. Reorder List.md index e65121af..ff2cec63 100644 --- a/markdowns/_143. Reorder List.md +++ b/markdowns/_143. Reorder List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Two Pointers](), [Stack](), [Recursion]()** > -> **Acceptance Rate** : **59.6 %** +> **Acceptance Rate** : **59.67 %** ------ diff --git a/markdowns/_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md b/markdowns/_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md index 72c68887..d9ecef66 100644 --- a/markdowns/_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md +++ b/markdowns/_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Queue](), [Sliding Window](), [Heap (Priority Queue)](), [Ordered Set](), [Monotonic Queue]()** > -> **Acceptance Rate** : **56.61 %** +> **Acceptance Rate** : **56.6 %** ------ diff --git a/markdowns/_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md b/markdowns/_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md index b89aff0a..2936e9f5 100644 --- a/markdowns/_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md +++ b/markdowns/_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Math](), [Bit Manipulation](), [Prefix Sum]()** > -> **Acceptance Rate** : **84.97 %** +> **Acceptance Rate** : **84.96 %** ------ diff --git a/markdowns/_1460. Make Two Arrays Equal by Reversing Subarrays.md b/markdowns/_1460. Make Two Arrays Equal by Reversing Subarrays.md index e775ce22..e58f1218 100644 --- a/markdowns/_1460. Make Two Arrays Equal by Reversing Subarrays.md +++ b/markdowns/_1460. Make Two Arrays Equal by Reversing Subarrays.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Sorting]()** > -> **Acceptance Rate** : **75.91 %** +> **Acceptance Rate** : **75.98 %** ------ diff --git a/markdowns/_1470. Shuffle the Array.md b/markdowns/_1470. Shuffle the Array.md index a311ed32..976edbf0 100644 --- a/markdowns/_1470. Shuffle the Array.md +++ b/markdowns/_1470. Shuffle the Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array]()** > -> **Acceptance Rate** : **88.57 %** +> **Acceptance Rate** : **88.58 %** ------ diff --git a/markdowns/_1472. Design Browser History.md b/markdowns/_1472. Design Browser History.md index 4e94879b..6cd2787a 100644 --- a/markdowns/_1472. Design Browser History.md +++ b/markdowns/_1472. Design Browser History.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Linked List](), [Stack](), [Design](), [Doubly-Linked List](), [Data Stream]()** > -> **Acceptance Rate** : **77.65 %** +> **Acceptance Rate** : **77.66 %** ------ diff --git a/markdowns/_1474. Delete N Nodes After M Nodes of a Linked List.md b/markdowns/_1474. Delete N Nodes After M Nodes of a Linked List.md index d7c4c550..6f1d3ead 100644 --- a/markdowns/_1474. Delete N Nodes After M Nodes of a Linked List.md +++ b/markdowns/_1474. Delete N Nodes After M Nodes of a Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List]()** > -> **Acceptance Rate** : **73.25 %** +> **Acceptance Rate** : **73.26 %** ------ diff --git a/markdowns/_1481. Least Number of Unique Integers after K Removals.md b/markdowns/_1481. Least Number of Unique Integers after K Removals.md index f176c91f..98ebdd9a 100644 --- a/markdowns/_1481. Least Number of Unique Integers after K Removals.md +++ b/markdowns/_1481. Least Number of Unique Integers after K Removals.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Greedy](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **63.08 %** +> **Acceptance Rate** : **63.09 %** ------ diff --git a/markdowns/_1482. Minimum Number of Days to Make m Bouquets.md b/markdowns/_1482. Minimum Number of Days to Make m Bouquets.md index 687944e9..c453db42 100644 --- a/markdowns/_1482. Minimum Number of Days to Make m Bouquets.md +++ b/markdowns/_1482. Minimum Number of Days to Make m Bouquets.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search]()** > -> **Acceptance Rate** : **55.91 %** +> **Acceptance Rate** : **55.84 %** ------ diff --git a/markdowns/_150. Evaluate Reverse Polish Notation.md b/markdowns/_150. Evaluate Reverse Polish Notation.md index 86019c2f..b7b60599 100644 --- a/markdowns/_150. Evaluate Reverse Polish Notation.md +++ b/markdowns/_150. Evaluate Reverse Polish Notation.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Stack]()** > -> **Acceptance Rate** : **52.25 %** +> **Acceptance Rate** : **52.32 %** ------ diff --git a/markdowns/_1502. Can Make Arithmetic Progression From Sequence.md b/markdowns/_1502. Can Make Arithmetic Progression From Sequence.md index b79e3c23..1c308cdc 100644 --- a/markdowns/_1502. Can Make Arithmetic Progression From Sequence.md +++ b/markdowns/_1502. Can Make Arithmetic Progression From Sequence.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sorting]()** > -> **Acceptance Rate** : **69.57 %** +> **Acceptance Rate** : **69.56 %** ------ diff --git a/markdowns/_1508. Range Sum of Sorted Subarray Sums.md b/markdowns/_1508. Range Sum of Sorted Subarray Sums.md index 8f0caecf..7137f02f 100644 --- a/markdowns/_1508. Range Sum of Sorted Subarray Sums.md +++ b/markdowns/_1508. Range Sum of Sorted Subarray Sums.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Binary Search](), [Sorting]()** > -> **Acceptance Rate** : **60.81 %** +> **Acceptance Rate** : **63.23 %** ------ diff --git a/markdowns/_1518. Water Bottles.md b/markdowns/_1518. Water Bottles.md index 7fe72ed7..736c0e98 100644 --- a/markdowns/_1518. Water Bottles.md +++ b/markdowns/_1518. Water Bottles.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Simulation]()** > -> **Acceptance Rate** : **71.01 %** +> **Acceptance Rate** : **71.0 %** ------ diff --git a/markdowns/_1522. Diameter of N-Ary Tree.md b/markdowns/_1522. Diameter of N-Ary Tree.md index 91d34dbc..cbc6e2fc 100644 --- a/markdowns/_1522. Diameter of N-Ary Tree.md +++ b/markdowns/_1522. Diameter of N-Ary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search]()** > -> **Acceptance Rate** : **74.45 %** +> **Acceptance Rate** : **74.47 %** ------ diff --git a/markdowns/_1530. Number of Good Leaf Nodes Pairs.md b/markdowns/_1530. Number of Good Leaf Nodes Pairs.md index 174f059d..58c169f2 100644 --- a/markdowns/_1530. Number of Good Leaf Nodes Pairs.md +++ b/markdowns/_1530. Number of Good Leaf Nodes Pairs.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **71.92 %** +> **Acceptance Rate** : **71.9 %** ------ diff --git a/markdowns/_1535. Find the Winner of an Array Game.md b/markdowns/_1535. Find the Winner of an Array Game.md index 5629b85e..a5062d9d 100644 --- a/markdowns/_1535. Find the Winner of an Array Game.md +++ b/markdowns/_1535. Find the Winner of an Array Game.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Simulation]()** > -> **Acceptance Rate** : **57.01 %** +> **Acceptance Rate** : **57.0 %** ------ diff --git a/markdowns/_155. Min Stack.md b/markdowns/_155. Min Stack.md index f8f01110..3f1c7270 100644 --- a/markdowns/_155. Min Stack.md +++ b/markdowns/_155. Min Stack.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Stack](), [Design]()** > -> **Acceptance Rate** : **54.7 %** +> **Acceptance Rate** : **54.74 %** ------ diff --git a/markdowns/_1550. Three Consecutive Odds.md b/markdowns/_1550. Three Consecutive Odds.md index bfd89793..83bb039a 100644 --- a/markdowns/_1550. Three Consecutive Odds.md +++ b/markdowns/_1550. Three Consecutive Odds.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array]()** > -> **Acceptance Rate** : **68.35 %** +> **Acceptance Rate** : **68.33 %** ------ diff --git a/markdowns/_1551. Minimum Operations to Make Array Equal.md b/markdowns/_1551. Minimum Operations to Make Array Equal.md index fbf5609f..7530866f 100644 --- a/markdowns/_1551. Minimum Operations to Make Array Equal.md +++ b/markdowns/_1551. Minimum Operations to Make Array Equal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math]()** > -> **Acceptance Rate** : **82.39 %** +> **Acceptance Rate** : **82.41 %** ------ diff --git a/markdowns/_1552. Magnetic Force Between Two Balls.md b/markdowns/_1552. Magnetic Force Between Two Balls.md index 826994b5..46be8568 100644 --- a/markdowns/_1552. Magnetic Force Between Two Balls.md +++ b/markdowns/_1552. Magnetic Force Between Two Balls.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search](), [Sorting]()** > -> **Acceptance Rate** : **71.07 %** +> **Acceptance Rate** : **71.09 %** ------ diff --git a/markdowns/_1561. Maximum Number of Coins You Can Get.md b/markdowns/_1561. Maximum Number of Coins You Can Get.md index bc3d5e42..348fd11f 100644 --- a/markdowns/_1561. Maximum Number of Coins You Can Get.md +++ b/markdowns/_1561. Maximum Number of Coins You Can Get.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Greedy](), [Sorting](), [Game Theory]()** > -> **Acceptance Rate** : **84.57 %** +> **Acceptance Rate** : **84.47 %** ------ diff --git a/markdowns/_1564. Put Boxes Into the Warehouse I.md b/markdowns/_1564. Put Boxes Into the Warehouse I.md index 19294e0d..c4fa12d8 100644 --- a/markdowns/_1564. Put Boxes Into the Warehouse I.md +++ b/markdowns/_1564. Put Boxes Into the Warehouse I.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **67.36 %** +> **Acceptance Rate** : **67.37 %** ------ diff --git a/markdowns/_1568. Minimum Number of Days to Disconnect Island.md b/markdowns/_1568. Minimum Number of Days to Disconnect Island.md new file mode 100644 index 00000000..655e4c11 --- /dev/null +++ b/markdowns/_1568. Minimum Number of Days to Disconnect Island.md @@ -0,0 +1,66 @@ +# 1568. [Minimum Number of Days to Disconnect Island]() + +*All prompts are owned by LeetCode. To view the prompt, click the title link above.* + +*[Back to top](<../README.md>)* + +------ + +> *First completed : August 11, 2024* +> +> *Last updated : August 11, 2024* + +------ + +> **Related Topics** : **[Array](), [Depth-First Search](), [Breadth-First Search](), [Matrix](), [Strongly Connected Component]()** +> +> **Acceptance Rate** : **50.0 %** + +------ + +## Solutions + +- [h1568.py](<../my-submissions/h1568.py>) +### Python +#### [h1568.py](<../my-submissions/h1568.py>) +```Python +class Solution: + def minDays(self, grid: List[List[int]]) -> int: + def island(i: int, j: int, visited: Set[Tuple[int, int]]) -> None : + if not (0 <= i < len(grid)) or \ + not (0 <= j < len(grid[0])) or \ + (i, j) in visited or \ + not grid[i][j]: + return + + visited.add((i, j)) + island(i - 1, j, visited) + island(i + 1, j, visited) + island(i, j - 1, visited) + island(i, j + 1, visited) + + def moreThanOneIsland(x: int, y: int) -> bool : + islandFnd = False + visited = set([(x, y)]) + for i in range(len(grid)) : + for j in range(len(grid[0])) : + if grid[i][j] and (i, j) not in visited : + if islandFnd : + return True + island(i, j, visited) + islandFnd = True + + return not islandFnd + + if moreThanOneIsland(-1, -1) : + return 0 + + for i in range(len(grid)) : + for j in range(len(grid[0])) : + if grid[i][j] and moreThanOneIsland(i, j) : + return 1 + + return 2 + +``` + diff --git a/markdowns/_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md b/markdowns/_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md index 997f5486..7b37f67d 100644 --- a/markdowns/_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md +++ b/markdowns/_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Union Find](), [Graph]()** > -> **Acceptance Rate** : **70.98 %** +> **Acceptance Rate** : **70.96 %** ------ diff --git a/markdowns/_1580. Put Boxes Into the Warehouse II.md b/markdowns/_1580. Put Boxes Into the Warehouse II.md index 9d3c5762..efbf0648 100644 --- a/markdowns/_1580. Put Boxes Into the Warehouse II.md +++ b/markdowns/_1580. Put Boxes Into the Warehouse II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **66.26 %** +> **Acceptance Rate** : **66.21 %** ------ diff --git a/markdowns/_1602. Find Nearest Right Node in Binary Tree.md b/markdowns/_1602. Find Nearest Right Node in Binary Tree.md index a9c9ce4e..6b77bfc1 100644 --- a/markdowns/_1602. Find Nearest Right Node in Binary Tree.md +++ b/markdowns/_1602. Find Nearest Right Node in Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **75.47 %** +> **Acceptance Rate** : **75.44 %** ------ diff --git a/markdowns/_1605. Find Valid Matrix Given Row and Column Sums.md b/markdowns/_1605. Find Valid Matrix Given Row and Column Sums.md index 3717bac2..2dc27b47 100644 --- a/markdowns/_1605. Find Valid Matrix Given Row and Column Sums.md +++ b/markdowns/_1605. Find Valid Matrix Given Row and Column Sums.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Matrix]()** > -> **Acceptance Rate** : **83.14 %** +> **Acceptance Rate** : **83.13 %** ------ diff --git a/markdowns/_1609. Even Odd Tree.md b/markdowns/_1609. Even Odd Tree.md index f0a212fd..b3bae721 100644 --- a/markdowns/_1609. Even Odd Tree.md +++ b/markdowns/_1609. Even Odd Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **65.85 %** +> **Acceptance Rate** : **65.87 %** ------ diff --git a/markdowns/_1636. Sort Array by Increasing Frequency.md b/markdowns/_1636. Sort Array by Increasing Frequency.md index e4c26f24..fb522c2e 100644 --- a/markdowns/_1636. Sort Array by Increasing Frequency.md +++ b/markdowns/_1636. Sort Array by Increasing Frequency.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Sorting]()** > -> **Acceptance Rate** : **79.75 %** +> **Acceptance Rate** : **79.77 %** ------ diff --git a/markdowns/_1641. Count Sorted Vowel Strings.md b/markdowns/_1641. Count Sorted Vowel Strings.md index 433f18ef..3d049dfc 100644 --- a/markdowns/_1641. Count Sorted Vowel Strings.md +++ b/markdowns/_1641. Count Sorted Vowel Strings.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Dynamic Programming](), [Combinatorics]()** > -> **Acceptance Rate** : **78.52 %** +> **Acceptance Rate** : **78.54 %** ------ diff --git a/markdowns/_165. Compare Version Numbers.md b/markdowns/_165. Compare Version Numbers.md index 242498be..34d5cb69 100644 --- a/markdowns/_165. Compare Version Numbers.md +++ b/markdowns/_165. Compare Version Numbers.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String]()** > -> **Acceptance Rate** : **41.1 %** +> **Acceptance Rate** : **41.14 %** ------ diff --git a/markdowns/_1650. Lowest Common Ancestor of a Binary Tree III.md b/markdowns/_1650. Lowest Common Ancestor of a Binary Tree III.md index 7aa69a10..27822615 100644 --- a/markdowns/_1650. Lowest Common Ancestor of a Binary Tree III.md +++ b/markdowns/_1650. Lowest Common Ancestor of a Binary Tree III.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Two Pointers](), [Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **80.1 %** +> **Acceptance Rate** : **80.13 %** ------ diff --git a/markdowns/_1653. Minimum Deletions to Make String Balanced.md b/markdowns/_1653. Minimum Deletions to Make String Balanced.md index 984a0784..a7842c65 100644 --- a/markdowns/_1653. Minimum Deletions to Make String Balanced.md +++ b/markdowns/_1653. Minimum Deletions to Make String Balanced.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Dynamic Programming](), [Stack]()** > -> **Acceptance Rate** : **65.86 %** +> **Acceptance Rate** : **65.84 %** ------ diff --git a/markdowns/_1657. Determine if Two Strings Are Close.md b/markdowns/_1657. Determine if Two Strings Are Close.md index 9a638d13..6832158a 100644 --- a/markdowns/_1657. Determine if Two Strings Are Close.md +++ b/markdowns/_1657. Determine if Two Strings Are Close.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **54.56 %** +> **Acceptance Rate** : **54.53 %** ------ diff --git a/markdowns/_166. Fraction to Recurring Decimal.md b/markdowns/_166. Fraction to Recurring Decimal.md index 006daa89..30d94d49 100644 --- a/markdowns/_166. Fraction to Recurring Decimal.md +++ b/markdowns/_166. Fraction to Recurring Decimal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Math](), [String]()** > -> **Acceptance Rate** : **25.25 %** +> **Acceptance Rate** : **25.27 %** ------ diff --git a/markdowns/_1660. Correct a Binary Tree.md b/markdowns/_1660. Correct a Binary Tree.md index 48d74898..70c42f7d 100644 --- a/markdowns/_1660. Correct a Binary Tree.md +++ b/markdowns/_1660. Correct a Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **74.42 %** +> **Acceptance Rate** : **74.41 %** ------ diff --git a/markdowns/_1669. Merge In Between Linked Lists.md b/markdowns/_1669. Merge In Between Linked Lists.md index 4229d3fd..39872e06 100644 --- a/markdowns/_1669. Merge In Between Linked Lists.md +++ b/markdowns/_1669. Merge In Between Linked Lists.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List]()** > -> **Acceptance Rate** : **81.68 %** +> **Acceptance Rate** : **81.7 %** ------ diff --git a/markdowns/_167. Two Sum II - Input Array Is Sorted.md b/markdowns/_167. Two Sum II - Input Array Is Sorted.md index 67f9abf2..0f713576 100644 --- a/markdowns/_167. Two Sum II - Input Array Is Sorted.md +++ b/markdowns/_167. Two Sum II - Input Array Is Sorted.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Binary Search]()** > -> **Acceptance Rate** : **61.79 %** +> **Acceptance Rate** : **61.83 %** ------ diff --git a/markdowns/_1684. Count the Number of Consistent Strings.md b/markdowns/_1684. Count the Number of Consistent Strings.md index 5ce25851..2106e8bc 100644 --- a/markdowns/_1684. Count the Number of Consistent Strings.md +++ b/markdowns/_1684. Count the Number of Consistent Strings.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Bit Manipulation]()** > -> **Acceptance Rate** : **83.43 %** +> **Acceptance Rate** : **83.47 %** ------ diff --git a/markdowns/_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md b/markdowns/_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md index fdf9455e..53555db7 100644 --- a/markdowns/_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md +++ b/markdowns/_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Greedy]()** > -> **Acceptance Rate** : **88.74 %** +> **Acceptance Rate** : **88.73 %** ------ diff --git a/markdowns/_1698. Number of Distinct Substrings in a String.md b/markdowns/_1698. Number of Distinct Substrings in a String.md index 0a0f534d..620d310d 100644 --- a/markdowns/_1698. Number of Distinct Substrings in a String.md +++ b/markdowns/_1698. Number of Distinct Substrings in a String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Trie](), [Rolling Hash](), [Suffix Array](), [Hash Function]()** > -> **Acceptance Rate** : **64.14 %** +> **Acceptance Rate** : **64.18 %** ------ diff --git a/markdowns/_17. Letter Combinations of a Phone Number.md b/markdowns/_17. Letter Combinations of a Phone Number.md index 067c5905..5a019ee1 100644 --- a/markdowns/_17. Letter Combinations of a Phone Number.md +++ b/markdowns/_17. Letter Combinations of a Phone Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Backtracking]()** > -> **Acceptance Rate** : **61.25 %** +> **Acceptance Rate** : **61.33 %** ------ diff --git a/markdowns/_1700. Number of Students Unable to Eat Lunch.md b/markdowns/_1700. Number of Students Unable to Eat Lunch.md index cf32c93a..501fad07 100644 --- a/markdowns/_1700. Number of Students Unable to Eat Lunch.md +++ b/markdowns/_1700. Number of Students Unable to Eat Lunch.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Queue](), [Simulation]()** > -> **Acceptance Rate** : **78.29 %** +> **Acceptance Rate** : **78.3 %** ------ diff --git a/markdowns/_1701. Average Waiting Time.md b/markdowns/_1701. Average Waiting Time.md index 3e0ec8b3..beb7f238 100644 --- a/markdowns/_1701. Average Waiting Time.md +++ b/markdowns/_1701. Average Waiting Time.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Simulation]()** > -> **Acceptance Rate** : **73.06 %** +> **Acceptance Rate** : **73.05 %** ------ diff --git a/markdowns/_1717. Maximum Score From Removing Substrings.md b/markdowns/_1717. Maximum Score From Removing Substrings.md index fd0416a8..1cf01fd2 100644 --- a/markdowns/_1717. Maximum Score From Removing Substrings.md +++ b/markdowns/_1717. Maximum Score From Removing Substrings.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack](), [Greedy]()** > -> **Acceptance Rate** : **63.1 %** +> **Acceptance Rate** : **63.07 %** ------ diff --git a/markdowns/_1721. Swapping Nodes in a Linked List.md b/markdowns/_1721. Swapping Nodes in a Linked List.md index 9ff2deba..c32af2cf 100644 --- a/markdowns/_1721. Swapping Nodes in a Linked List.md +++ b/markdowns/_1721. Swapping Nodes in a Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Two Pointers]()** > -> **Acceptance Rate** : **68.02 %** +> **Acceptance Rate** : **68.03 %** ------ diff --git a/markdowns/_173. Binary Search Tree Iterator.md b/markdowns/_173. Binary Search Tree Iterator.md index 2570ab59..8ac7e837 100644 --- a/markdowns/_173. Binary Search Tree Iterator.md +++ b/markdowns/_173. Binary Search Tree Iterator.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Stack](), [Tree](), [Design](), [Binary Search Tree](), [Binary Tree](), [Iterator]()** > -> **Acceptance Rate** : **72.72 %** +> **Acceptance Rate** : **72.77 %** ------ diff --git a/markdowns/_1736. Latest Time by Replacing Hidden Digits.md b/markdowns/_1736. Latest Time by Replacing Hidden Digits.md index 96f9e7b3..6d3a9503 100644 --- a/markdowns/_1736. Latest Time by Replacing Hidden Digits.md +++ b/markdowns/_1736. Latest Time by Replacing Hidden Digits.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Greedy]()** > -> **Acceptance Rate** : **42.76 %** +> **Acceptance Rate** : **42.77 %** ------ diff --git a/markdowns/_1740. Find Distance in a Binary Tree.md b/markdowns/_1740. Find Distance in a Binary Tree.md index bfedeff0..e34b6386 100644 --- a/markdowns/_1740. Find Distance in a Binary Tree.md +++ b/markdowns/_1740. Find Distance in a Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **73.54 %** +> **Acceptance Rate** : **73.57 %** ------ diff --git a/markdowns/_1743. Restore the Array From Adjacent Pairs.md b/markdowns/_1743. Restore the Array From Adjacent Pairs.md index 2ff64486..ef707fbe 100644 --- a/markdowns/_1743. Restore the Array From Adjacent Pairs.md +++ b/markdowns/_1743. Restore the Array From Adjacent Pairs.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table]()** > -> **Acceptance Rate** : **74.75 %** +> **Acceptance Rate** : **74.76 %** ------ diff --git a/markdowns/_1748. Sum of Unique Elements.md b/markdowns/_1748. Sum of Unique Elements.md index b92a6c00..7e633773 100644 --- a/markdowns/_1748. Sum of Unique Elements.md +++ b/markdowns/_1748. Sum of Unique Elements.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Counting]()** > -> **Acceptance Rate** : **77.98 %** +> **Acceptance Rate** : **78.02 %** ------ diff --git a/markdowns/_175. Combine Two Tables.md b/markdowns/_175. Combine Two Tables.md index 93fd9b85..e57ebe81 100644 --- a/markdowns/_175. Combine Two Tables.md +++ b/markdowns/_175. Combine Two Tables.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **76.45 %** +> **Acceptance Rate** : **76.49 %** ------ diff --git a/markdowns/_176. Second Highest Salary.md b/markdowns/_176. Second Highest Salary.md index 50e941a9..a3b29b0c 100644 --- a/markdowns/_176. Second Highest Salary.md +++ b/markdowns/_176. Second Highest Salary.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **41.15 %** +> **Acceptance Rate** : **41.22 %** ------ diff --git a/markdowns/_1768. Merge Strings Alternately.md b/markdowns/_1768. Merge Strings Alternately.md index a4ca0b8f..4e880b71 100644 --- a/markdowns/_1768. Merge Strings Alternately.md +++ b/markdowns/_1768. Merge Strings Alternately.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String]()** > -> **Acceptance Rate** : **80.36 %** +> **Acceptance Rate** : **80.43 %** ------ diff --git a/markdowns/_1783. Grand Slam Titles.md b/markdowns/_1783. Grand Slam Titles.md index 48d6f588..5027b533 100644 --- a/markdowns/_1783. Grand Slam Titles.md +++ b/markdowns/_1783. Grand Slam Titles.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **83.59 %** +> **Acceptance Rate** : **83.61 %** ------ diff --git a/markdowns/_1804. Implement Trie II (Prefix Tree).md b/markdowns/_1804. Implement Trie II (Prefix Tree).md index 43b5ac67..61c4d991 100644 --- a/markdowns/_1804. Implement Trie II (Prefix Tree).md +++ b/markdowns/_1804. Implement Trie II (Prefix Tree).md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Design](), [Trie]()** > -> **Acceptance Rate** : **61.5 %** +> **Acceptance Rate** : **61.49 %** ------ diff --git a/markdowns/_181. Employees Earning More Than Their Managers.md b/markdowns/_181. Employees Earning More Than Their Managers.md index 68d2d735..e3fecd70 100644 --- a/markdowns/_181. Employees Earning More Than Their Managers.md +++ b/markdowns/_181. Employees Earning More Than Their Managers.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **69.96 %** +> **Acceptance Rate** : **70.0 %** ------ diff --git a/markdowns/_182. Duplicate Emails.md b/markdowns/_182. Duplicate Emails.md index fb8ce8b4..678a8fb8 100644 --- a/markdowns/_182. Duplicate Emails.md +++ b/markdowns/_182. Duplicate Emails.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **71.35 %** +> **Acceptance Rate** : **71.38 %** ------ diff --git a/markdowns/_1822. Sign of the Product of an Array.md b/markdowns/_1822. Sign of the Product of an Array.md index 23f1b55d..04c17bad 100644 --- a/markdowns/_1822. Sign of the Product of an Array.md +++ b/markdowns/_1822. Sign of the Product of an Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math]()** > -> **Acceptance Rate** : **65.3 %** +> **Acceptance Rate** : **65.31 %** ------ diff --git a/markdowns/_183. Customers Who Never Order.md b/markdowns/_183. Customers Who Never Order.md index 984e5bcc..9d99aea9 100644 --- a/markdowns/_183. Customers Who Never Order.md +++ b/markdowns/_183. Customers Who Never Order.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **69.42 %** +> **Acceptance Rate** : **69.46 %** ------ diff --git a/markdowns/_1836. Remove Duplicates From an Unsorted Linked List.md b/markdowns/_1836. Remove Duplicates From an Unsorted Linked List.md index ed6dca71..a36cc855 100644 --- a/markdowns/_1836. Remove Duplicates From an Unsorted Linked List.md +++ b/markdowns/_1836. Remove Duplicates From an Unsorted Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Linked List]()** > -> **Acceptance Rate** : **74.56 %** +> **Acceptance Rate** : **74.59 %** ------ diff --git a/markdowns/_184. Department Highest Salary.md b/markdowns/_184. Department Highest Salary.md index 7d38caa4..cb53d6d2 100644 --- a/markdowns/_184. Department Highest Salary.md +++ b/markdowns/_184. Department Highest Salary.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **52.3 %** +> **Acceptance Rate** : **52.37 %** ------ diff --git a/markdowns/_1844. Replace All Digits with Characters.md b/markdowns/_1844. Replace All Digits with Characters.md index 455e62dd..d3d13418 100644 --- a/markdowns/_1844. Replace All Digits with Characters.md +++ b/markdowns/_1844. Replace All Digits with Characters.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String]()** > -> **Acceptance Rate** : **81.44 %** +> **Acceptance Rate** : **81.48 %** ------ diff --git a/markdowns/_1852. Distinct Numbers in Each Subarray.md b/markdowns/_1852. Distinct Numbers in Each Subarray.md index d64bb43b..de8797f2 100644 --- a/markdowns/_1852. Distinct Numbers in Each Subarray.md +++ b/markdowns/_1852. Distinct Numbers in Each Subarray.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Sliding Window]()** > -> **Acceptance Rate** : **71.36 %** +> **Acceptance Rate** : **71.42 %** ------ diff --git a/markdowns/_1858. Longest Word With All Prefixes.md b/markdowns/_1858. Longest Word With All Prefixes.md index 098b7db5..399244e6 100644 --- a/markdowns/_1858. Longest Word With All Prefixes.md +++ b/markdowns/_1858. Longest Word With All Prefixes.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Depth-First Search](), [Trie]()** > -> **Acceptance Rate** : **68.55 %** +> **Acceptance Rate** : **68.57 %** ------ diff --git a/markdowns/_1874. Minimize Product Sum of Two Arrays.md b/markdowns/_1874. Minimize Product Sum of Two Arrays.md index 8d4ded3c..24310f2b 100644 --- a/markdowns/_1874. Minimize Product Sum of Two Arrays.md +++ b/markdowns/_1874. Minimize Product Sum of Two Arrays.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **89.38 %** +> **Acceptance Rate** : **89.4 %** ------ diff --git a/markdowns/_1877. Minimize Maximum Pair Sum in Array.md b/markdowns/_1877. Minimize Maximum Pair Sum in Array.md index 525ac11f..c4ae40ae 100644 --- a/markdowns/_1877. Minimize Maximum Pair Sum in Array.md +++ b/markdowns/_1877. Minimize Maximum Pair Sum in Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **81.45 %** +> **Acceptance Rate** : **81.44 %** ------ diff --git a/markdowns/_1884. Egg Drop With 2 Eggs and N Floors.md b/markdowns/_1884. Egg Drop With 2 Eggs and N Floors.md index aeaea906..d92c3e91 100644 --- a/markdowns/_1884. Egg Drop With 2 Eggs and N Floors.md +++ b/markdowns/_1884. Egg Drop With 2 Eggs and N Floors.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Dynamic Programming]()** > -> **Acceptance Rate** : **72.99 %** +> **Acceptance Rate** : **73.03 %** ------ diff --git a/markdowns/_1885. Count Pairs in Two Arrays.md b/markdowns/_1885. Count Pairs in Two Arrays.md index 4aafb3d9..c6bdd367 100644 --- a/markdowns/_1885. Count Pairs in Two Arrays.md +++ b/markdowns/_1885. Count Pairs in Two Arrays.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Binary Search](), [Sorting]()** > -> **Acceptance Rate** : **60.88 %** +> **Acceptance Rate** : **60.89 %** ------ diff --git a/markdowns/_189. Rotate Array.md b/markdowns/_189. Rotate Array.md index 554aed7e..7f1ce369 100644 --- a/markdowns/_189. Rotate Array.md +++ b/markdowns/_189. Rotate Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Two Pointers]()** > -> **Acceptance Rate** : **41.18 %** +> **Acceptance Rate** : **41.24 %** ------ diff --git a/markdowns/_19. Remove Nth Node From End of List.md b/markdowns/_19. Remove Nth Node From End of List.md index 214e7d77..15004a31 100644 --- a/markdowns/_19. Remove Nth Node From End of List.md +++ b/markdowns/_19. Remove Nth Node From End of List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Two Pointers]()** > -> **Acceptance Rate** : **46.21 %** +> **Acceptance Rate** : **46.29 %** ------ diff --git a/markdowns/_1905. Count Sub Islands.md b/markdowns/_1905. Count Sub Islands.md index a71b5b5e..2baf2516 100644 --- a/markdowns/_1905. Count Sub Islands.md +++ b/markdowns/_1905. Count Sub Islands.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Depth-First Search](), [Breadth-First Search](), [Union Find](), [Matrix]()** > -> **Acceptance Rate** : **67.48 %** +> **Acceptance Rate** : **67.49 %** ------ diff --git a/markdowns/_1909. Remove One Element to Make the Array Strictly Increasing.md b/markdowns/_1909. Remove One Element to Make the Array Strictly Increasing.md index 8b7bf774..6352a623 100644 --- a/markdowns/_1909. Remove One Element to Make the Array Strictly Increasing.md +++ b/markdowns/_1909. Remove One Element to Make the Array Strictly Increasing.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array]()** > -> **Acceptance Rate** : **27.63 %** +> **Acceptance Rate** : **27.66 %** ------ diff --git a/markdowns/_191. Number of 1 Bits.md b/markdowns/_191. Number of 1 Bits.md index 4c75c0c3..8db73d19 100644 --- a/markdowns/_191. Number of 1 Bits.md +++ b/markdowns/_191. Number of 1 Bits.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Divide and Conquer](), [Bit Manipulation]()** > -> **Acceptance Rate** : **71.93 %** +> **Acceptance Rate** : **72.01 %** ------ diff --git a/markdowns/_1929. Concatenation of Array.md b/markdowns/_1929. Concatenation of Array.md index 15dd31a0..a39e8055 100644 --- a/markdowns/_1929. Concatenation of Array.md +++ b/markdowns/_1929. Concatenation of Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Simulation]()** > -> **Acceptance Rate** : **90.01 %** +> **Acceptance Rate** : **90.03 %** ------ diff --git a/markdowns/_1940. Longest Common Subsequence Between Sorted Arrays.md b/markdowns/_1940. Longest Common Subsequence Between Sorted Arrays.md index bdf422ad..485d95c0 100644 --- a/markdowns/_1940. Longest Common Subsequence Between Sorted Arrays.md +++ b/markdowns/_1940. Longest Common Subsequence Between Sorted Arrays.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Counting]()** > -> **Acceptance Rate** : **81.27 %** +> **Acceptance Rate** : **81.22 %** ------ diff --git a/markdowns/_196. Delete Duplicate Emails.md b/markdowns/_196. Delete Duplicate Emails.md index ad3b243a..4bd7278d 100644 --- a/markdowns/_196. Delete Duplicate Emails.md +++ b/markdowns/_196. Delete Duplicate Emails.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **62.51 %** +> **Acceptance Rate** : **62.58 %** ------ diff --git a/markdowns/_197. Rising Temperature.md b/markdowns/_197. Rising Temperature.md index 49b2fb0b..9fdf201c 100644 --- a/markdowns/_197. Rising Temperature.md +++ b/markdowns/_197. Rising Temperature.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **48.29 %** +> **Acceptance Rate** : **48.38 %** ------ diff --git a/markdowns/_1973. Count Nodes Equal to Sum of Descendants.md b/markdowns/_1973. Count Nodes Equal to Sum of Descendants.md index 663410dc..50ef3261 100644 --- a/markdowns/_1973. Count Nodes Equal to Sum of Descendants.md +++ b/markdowns/_1973. Count Nodes Equal to Sum of Descendants.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **76.97 %** +> **Acceptance Rate** : **76.98 %** ------ diff --git a/markdowns/_198. House Robber.md b/markdowns/_198. House Robber.md index 901812c5..4ac33ec0 100644 --- a/markdowns/_198. House Robber.md +++ b/markdowns/_198. House Robber.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming]()** > -> **Acceptance Rate** : **51.33 %** +> **Acceptance Rate** : **51.36 %** ------ diff --git a/markdowns/_199. Binary Tree Right Side View.md b/markdowns/_199. Binary Tree Right Side View.md index 6d3e7ae5..d49d6d12 100644 --- a/markdowns/_199. Binary Tree Right Side View.md +++ b/markdowns/_199. Binary Tree Right Side View.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **63.57 %** +> **Acceptance Rate** : **63.61 %** ------ diff --git a/markdowns/_1992. Find All Groups of Farmland.md b/markdowns/_1992. Find All Groups of Farmland.md index 5a28dae9..ba6d0a0e 100644 --- a/markdowns/_1992. Find All Groups of Farmland.md +++ b/markdowns/_1992. Find All Groups of Farmland.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Depth-First Search](), [Breadth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **75.8 %** +> **Acceptance Rate** : **75.79 %** ------ diff --git a/markdowns/_2. Add Two Numbers.md b/markdowns/_2. Add Two Numbers.md index 15819c8c..341c4d9c 100644 --- a/markdowns/_2. Add Two Numbers.md +++ b/markdowns/_2. Add Two Numbers.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Math](), [Recursion]()** > -> **Acceptance Rate** : **43.64 %** +> **Acceptance Rate** : **43.71 %** ------ diff --git a/markdowns/_20. Valid Parentheses.md b/markdowns/_20. Valid Parentheses.md index 3737a1e9..92048798 100644 --- a/markdowns/_20. Valid Parentheses.md +++ b/markdowns/_20. Valid Parentheses.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack]()** > -> **Acceptance Rate** : **40.82 %** +> **Acceptance Rate** : **40.85 %** ------ diff --git a/markdowns/_200. Number of Islands.md b/markdowns/_200. Number of Islands.md index b36e897f..fb383847 100644 --- a/markdowns/_200. Number of Islands.md +++ b/markdowns/_200. Number of Islands.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Depth-First Search](), [Breadth-First Search](), [Union Find](), [Matrix]()** > -> **Acceptance Rate** : **60.04 %** +> **Acceptance Rate** : **60.09 %** ------ diff --git a/markdowns/_2011. Final Value of Variable After Performing Operations.md b/markdowns/_2011. Final Value of Variable After Performing Operations.md index f62076f4..1e1440f2 100644 --- a/markdowns/_2011. Final Value of Variable After Performing Operations.md +++ b/markdowns/_2011. Final Value of Variable After Performing Operations.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Simulation]()** > -> **Acceptance Rate** : **89.29 %** +> **Acceptance Rate** : **89.31 %** ------ diff --git a/markdowns/_2013. Detect Squares.md b/markdowns/_2013. Detect Squares.md index c36bb194..510ea026 100644 --- a/markdowns/_2013. Detect Squares.md +++ b/markdowns/_2013. Detect Squares.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Design](), [Counting]()** > -> **Acceptance Rate** : **51.18 %** +> **Acceptance Rate** : **51.2 %** ------ diff --git a/markdowns/_2037. Minimum Number of Moves to Seat Everyone.md b/markdowns/_2037. Minimum Number of Moves to Seat Everyone.md index a667a1a7..67766ed7 100644 --- a/markdowns/_2037. Minimum Number of Moves to Seat Everyone.md +++ b/markdowns/_2037. Minimum Number of Moves to Seat Everyone.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **87.7 %** +> **Acceptance Rate** : **87.65 %** ------ diff --git a/markdowns/_2045. Second Minimum Time to Reach Destination.md b/markdowns/_2045. Second Minimum Time to Reach Destination.md index faef2955..c8dba487 100644 --- a/markdowns/_2045. Second Minimum Time to Reach Destination.md +++ b/markdowns/_2045. Second Minimum Time to Reach Destination.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Breadth-First Search](), [Graph](), [Shortest Path]()** > -> **Acceptance Rate** : **63.27 %** +> **Acceptance Rate** : **63.22 %** ------ diff --git a/markdowns/_2046. Sort Linked List Already Sorted Using Absolute Values.md b/markdowns/_2046. Sort Linked List Already Sorted Using Absolute Values.md index 9b58df74..59dca416 100644 --- a/markdowns/_2046. Sort Linked List Already Sorted Using Absolute Values.md +++ b/markdowns/_2046. Sort Linked List Already Sorted Using Absolute Values.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Two Pointers](), [Sorting]()** > -> **Acceptance Rate** : **67.13 %** +> **Acceptance Rate** : **67.11 %** ------ diff --git a/markdowns/_2053. Kth Distinct String in an Array.md b/markdowns/_2053. Kth Distinct String in an Array.md index 023cb1e7..8d8cba46 100644 --- a/markdowns/_2053. Kth Distinct String in an Array.md +++ b/markdowns/_2053. Kth Distinct String in an Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Counting]()** > -> **Acceptance Rate** : **73.17 %** +> **Acceptance Rate** : **82.15 %** ------ diff --git a/markdowns/_2058. Find the Minimum and Maximum Number of Nodes Between Critical Points.md b/markdowns/_2058. Find the Minimum and Maximum Number of Nodes Between Critical Points.md index a71246dd..63c65cfa 100644 --- a/markdowns/_2058. Find the Minimum and Maximum Number of Nodes Between Critical Points.md +++ b/markdowns/_2058. Find the Minimum and Maximum Number of Nodes Between Critical Points.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List]()** > -> **Acceptance Rate** : **69.73 %** +> **Acceptance Rate** : **69.7 %** ------ diff --git a/markdowns/_206. Reverse Linked List.md b/markdowns/_206. Reverse Linked List.md index 17138243..965df264 100644 --- a/markdowns/_206. Reverse Linked List.md +++ b/markdowns/_206. Reverse Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Recursion]()** > -> **Acceptance Rate** : **77.25 %** +> **Acceptance Rate** : **77.31 %** ------ diff --git a/markdowns/_208. Implement Trie (Prefix Tree).md b/markdowns/_208. Implement Trie (Prefix Tree).md index 1a5ebfd6..43af9cd3 100644 --- a/markdowns/_208. Implement Trie (Prefix Tree).md +++ b/markdowns/_208. Implement Trie (Prefix Tree).md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Design](), [Trie]()** > -> **Acceptance Rate** : **65.9 %** +> **Acceptance Rate** : **65.95 %** ------ diff --git a/markdowns/_2083. Substrings That Begin and End With the Same Letter.md b/markdowns/_2083. Substrings That Begin and End With the Same Letter.md index 700988f9..fc7843c3 100644 --- a/markdowns/_2083. Substrings That Begin and End With the Same Letter.md +++ b/markdowns/_2083. Substrings That Begin and End With the Same Letter.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Math](), [String](), [Counting](), [Prefix Sum]()** > -> **Acceptance Rate** : **74.29 %** +> **Acceptance Rate** : **74.28 %** ------ diff --git a/markdowns/_2086. Minimum Number of Food Buckets to Feed the Hamsters.md b/markdowns/_2086. Minimum Number of Food Buckets to Feed the Hamsters.md index 3a497718..344cb82d 100644 --- a/markdowns/_2086. Minimum Number of Food Buckets to Feed the Hamsters.md +++ b/markdowns/_2086. Minimum Number of Food Buckets to Feed the Hamsters.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Dynamic Programming](), [Greedy]()** > -> **Acceptance Rate** : **46.76 %** +> **Acceptance Rate** : **46.79 %** ------ diff --git a/markdowns/_2093. Minimum Cost to Reach City With Discounts.md b/markdowns/_2093. Minimum Cost to Reach City With Discounts.md index 0aff1f0a..103898bf 100644 --- a/markdowns/_2093. Minimum Cost to Reach City With Discounts.md +++ b/markdowns/_2093. Minimum Cost to Reach City With Discounts.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Graph](), [Heap (Priority Queue)](), [Shortest Path]()** > -> **Acceptance Rate** : **59.69 %** +> **Acceptance Rate** : **59.82 %** ------ diff --git a/markdowns/_2095. Delete the Middle Node of a Linked List.md b/markdowns/_2095. Delete the Middle Node of a Linked List.md index c584b284..cee8f664 100644 --- a/markdowns/_2095. Delete the Middle Node of a Linked List.md +++ b/markdowns/_2095. Delete the Middle Node of a Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Two Pointers]()** > -> **Acceptance Rate** : **59.39 %** +> **Acceptance Rate** : **59.43 %** ------ diff --git a/markdowns/_21. Merge Two Sorted Lists.md b/markdowns/_21. Merge Two Sorted Lists.md index aa02fbbc..44d4be65 100644 --- a/markdowns/_21. Merge Two Sorted Lists.md +++ b/markdowns/_21. Merge Two Sorted Lists.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Recursion]()** > -> **Acceptance Rate** : **64.91 %** +> **Acceptance Rate** : **64.97 %** ------ diff --git a/markdowns/_211. Design Add and Search Words Data Structure.md b/markdowns/_211. Design Add and Search Words Data Structure.md index 92e465bf..3a11d423 100644 --- a/markdowns/_211. Design Add and Search Words Data Structure.md +++ b/markdowns/_211. Design Add and Search Words Data Structure.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Depth-First Search](), [Design](), [Trie]()** > -> **Acceptance Rate** : **45.68 %** +> **Acceptance Rate** : **45.71 %** ------ diff --git a/markdowns/_212. Word Search II.md b/markdowns/_212. Word Search II.md index bbe7da96..701f9312 100644 --- a/markdowns/_212. Word Search II.md +++ b/markdowns/_212. Word Search II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Backtracking](), [Trie](), [Matrix]()** > -> **Acceptance Rate** : **36.49 %** +> **Acceptance Rate** : **36.5 %** ------ diff --git a/markdowns/_2134. Minimum Swaps to Group All 1's Together II.md b/markdowns/_2134. Minimum Swaps to Group All 1's Together II.md index e7efebeb..45627c12 100644 --- a/markdowns/_2134. Minimum Swaps to Group All 1's Together II.md +++ b/markdowns/_2134. Minimum Swaps to Group All 1's Together II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sliding Window]()** > -> **Acceptance Rate** : **65.61 %** +> **Acceptance Rate** : **65.52 %** ------ diff --git a/markdowns/_2149. Rearrange Array Elements by Sign.md b/markdowns/_2149. Rearrange Array Elements by Sign.md index 398b3b78..33bd71ee 100644 --- a/markdowns/_2149. Rearrange Array Elements by Sign.md +++ b/markdowns/_2149. Rearrange Array Elements by Sign.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Simulation]()** > -> **Acceptance Rate** : **84.02 %** +> **Acceptance Rate** : **84.01 %** ------ diff --git a/markdowns/_2165. Smallest Value of the Rearranged Number.md b/markdowns/_2165. Smallest Value of the Rearranged Number.md index 08074a6b..f2f566e2 100644 --- a/markdowns/_2165. Smallest Value of the Rearranged Number.md +++ b/markdowns/_2165. Smallest Value of the Rearranged Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Sorting]()** > -> **Acceptance Rate** : **52.22 %** +> **Acceptance Rate** : **52.23 %** ------ diff --git a/markdowns/_217. Contains Duplicate.md b/markdowns/_217. Contains Duplicate.md index 10232685..da20bd5f 100644 --- a/markdowns/_217. Contains Duplicate.md +++ b/markdowns/_217. Contains Duplicate.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Sorting]()** > -> **Acceptance Rate** : **62.04 %** +> **Acceptance Rate** : **62.07 %** ------ diff --git a/markdowns/_2192. All Ancestors of a Node in a Directed Acyclic Graph.md b/markdowns/_2192. All Ancestors of a Node in a Directed Acyclic Graph.md index 1404524a..f9ee58ef 100644 --- a/markdowns/_2192. All Ancestors of a Node in a Directed Acyclic Graph.md +++ b/markdowns/_2192. All Ancestors of a Node in a Directed Acyclic Graph.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Depth-First Search](), [Breadth-First Search](), [Graph](), [Topological Sort]()** > -> **Acceptance Rate** : **62.2 %** +> **Acceptance Rate** : **62.19 %** ------ diff --git a/markdowns/_2196. Create Binary Tree From Descriptions.md b/markdowns/_2196. Create Binary Tree From Descriptions.md index b042832c..c2dfc7f0 100644 --- a/markdowns/_2196. Create Binary Tree From Descriptions.md +++ b/markdowns/_2196. Create Binary Tree From Descriptions.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **81.82 %** +> **Acceptance Rate** : **81.83 %** ------ diff --git a/markdowns/_22. Generate Parentheses.md b/markdowns/_22. Generate Parentheses.md index 3d0342e7..3bd87e46 100644 --- a/markdowns/_22. Generate Parentheses.md +++ b/markdowns/_22. Generate Parentheses.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Dynamic Programming](), [Backtracking]()** > -> **Acceptance Rate** : **75.17 %** +> **Acceptance Rate** : **75.22 %** ------ diff --git a/markdowns/_2206. Divide Array Into Equal Pairs.md b/markdowns/_2206. Divide Array Into Equal Pairs.md index c7c3df87..f24e5d09 100644 --- a/markdowns/_2206. Divide Array Into Equal Pairs.md +++ b/markdowns/_2206. Divide Array Into Equal Pairs.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Bit Manipulation](), [Counting]()** > -> **Acceptance Rate** : **73.71 %** +> **Acceptance Rate** : **73.72 %** ------ diff --git a/markdowns/_2211. Count Collisions on a Road.md b/markdowns/_2211. Count Collisions on a Road.md index b3e85e06..29858116 100644 --- a/markdowns/_2211. Count Collisions on a Road.md +++ b/markdowns/_2211. Count Collisions on a Road.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack](), [Simulation]()** > -> **Acceptance Rate** : **43.88 %** +> **Acceptance Rate** : **43.9 %** ------ diff --git a/markdowns/_2221. Find Triangular Sum of an Array.md b/markdowns/_2221. Find Triangular Sum of an Array.md index fe0c021d..0d93bbdc 100644 --- a/markdowns/_2221. Find Triangular Sum of an Array.md +++ b/markdowns/_2221. Find Triangular Sum of an Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Simulation](), [Combinatorics]()** > -> **Acceptance Rate** : **78.8 %** +> **Acceptance Rate** : **78.81 %** ------ diff --git a/markdowns/_2225. Find Players With Zero or One Losses.md b/markdowns/_2225. Find Players With Zero or One Losses.md index 1a5b2b3c..d7ef0c14 100644 --- a/markdowns/_2225. Find Players With Zero or One Losses.md +++ b/markdowns/_2225. Find Players With Zero or One Losses.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **73.23 %** +> **Acceptance Rate** : **73.21 %** ------ diff --git a/markdowns/_224. Basic Calculator.md b/markdowns/_224. Basic Calculator.md index 7f10bfd4..da9e5d83 100644 --- a/markdowns/_224. Basic Calculator.md +++ b/markdowns/_224. Basic Calculator.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [String](), [Stack](), [Recursion]()** > -> **Acceptance Rate** : **43.75 %** +> **Acceptance Rate** : **43.77 %** ------ diff --git a/markdowns/_2248. Intersection of Multiple Arrays.md b/markdowns/_2248. Intersection of Multiple Arrays.md index 5b6f88ab..ad5f58ed 100644 --- a/markdowns/_2248. Intersection of Multiple Arrays.md +++ b/markdowns/_2248. Intersection of Multiple Arrays.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **68.2 %** +> **Acceptance Rate** : **68.23 %** ------ diff --git a/markdowns/_2258. Escape the Spreading Fire.md b/markdowns/_2258. Escape the Spreading Fire.md index d05a9e6d..09075658 100644 --- a/markdowns/_2258. Escape the Spreading Fire.md +++ b/markdowns/_2258. Escape the Spreading Fire.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search](), [Breadth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **35.11 %** +> **Acceptance Rate** : **35.09 %** ------ diff --git a/markdowns/_226. Invert Binary Tree.md b/markdowns/_226. Invert Binary Tree.md index cd19a8ea..edf3ef92 100644 --- a/markdowns/_226. Invert Binary Tree.md +++ b/markdowns/_226. Invert Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **77.53 %** +> **Acceptance Rate** : **77.57 %** ------ diff --git a/markdowns/_2268. Minimum Number of Keypresses.md b/markdowns/_2268. Minimum Number of Keypresses.md index 020464cf..b8e60871 100644 --- a/markdowns/_2268. Minimum Number of Keypresses.md +++ b/markdowns/_2268. Minimum Number of Keypresses.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Greedy](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **71.31 %** +> **Acceptance Rate** : **71.29 %** ------ diff --git a/markdowns/_227. Basic Calculator II.md b/markdowns/_227. Basic Calculator II.md index 8d66667b..5b957774 100644 --- a/markdowns/_227. Basic Calculator II.md +++ b/markdowns/_227. Basic Calculator II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [String](), [Stack]()** > -> **Acceptance Rate** : **44.01 %** +> **Acceptance Rate** : **44.05 %** ------ diff --git a/markdowns/_2285. Maximum Total Importance of Roads.md b/markdowns/_2285. Maximum Total Importance of Roads.md index 848340f3..4300ca47 100644 --- a/markdowns/_2285. Maximum Total Importance of Roads.md +++ b/markdowns/_2285. Maximum Total Importance of Roads.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Greedy](), [Graph](), [Sorting](), [Heap (Priority Queue)]()** > -> **Acceptance Rate** : **69.38 %** +> **Acceptance Rate** : **69.36 %** ------ diff --git a/markdowns/_23. Merge k Sorted Lists.md b/markdowns/_23. Merge k Sorted Lists.md index a3ee8c9e..7eb92e4f 100644 --- a/markdowns/_23. Merge k Sorted Lists.md +++ b/markdowns/_23. Merge k Sorted Lists.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Divide and Conquer](), [Heap (Priority Queue)](), [Merge Sort]()** > -> **Acceptance Rate** : **53.65 %** +> **Acceptance Rate** : **53.72 %** ------ diff --git a/markdowns/_230. Kth Smallest Element in a BST.md b/markdowns/_230. Kth Smallest Element in a BST.md index f9a5c1de..e8703f77 100644 --- a/markdowns/_230. Kth Smallest Element in a BST.md +++ b/markdowns/_230. Kth Smallest Element in a BST.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **73.26 %** +> **Acceptance Rate** : **73.32 %** ------ diff --git a/markdowns/_2304. Minimum Path Cost in a Grid.md b/markdowns/_2304. Minimum Path Cost in a Grid.md index f45fc547..ca3544d5 100644 --- a/markdowns/_2304. Minimum Path Cost in a Grid.md +++ b/markdowns/_2304. Minimum Path Cost in a Grid.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming](), [Matrix]()** > -> **Acceptance Rate** : **66.81 %** +> **Acceptance Rate** : **66.85 %** ------ diff --git a/markdowns/_235. Lowest Common Ancestor of a Binary Search Tree.md b/markdowns/_235. Lowest Common Ancestor of a Binary Search Tree.md index a375b4b2..d52457cb 100644 --- a/markdowns/_235. Lowest Common Ancestor of a Binary Search Tree.md +++ b/markdowns/_235. Lowest Common Ancestor of a Binary Search Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **65.61 %** +> **Acceptance Rate** : **65.68 %** ------ diff --git a/markdowns/_236. Lowest Common Ancestor of a Binary Tree.md b/markdowns/_236. Lowest Common Ancestor of a Binary Tree.md index 465e33a9..3f57aa41 100644 --- a/markdowns/_236. Lowest Common Ancestor of a Binary Tree.md +++ b/markdowns/_236. Lowest Common Ancestor of a Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **63.32 %** +> **Acceptance Rate** : **63.4 %** ------ diff --git a/markdowns/_2365. Task Scheduler II.md b/markdowns/_2365. Task Scheduler II.md index e63a5eed..75f807d9 100644 --- a/markdowns/_2365. Task Scheduler II.md +++ b/markdowns/_2365. Task Scheduler II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Simulation]()** > -> **Acceptance Rate** : **52.51 %** +> **Acceptance Rate** : **52.57 %** ------ diff --git a/markdowns/_238. Product of Array Except Self.md b/markdowns/_238. Product of Array Except Self.md index 76a69deb..876a447f 100644 --- a/markdowns/_238. Product of Array Except Self.md +++ b/markdowns/_238. Product of Array Except Self.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Prefix Sum]()** > -> **Acceptance Rate** : **66.53 %** +> **Acceptance Rate** : **66.55 %** ------ diff --git a/markdowns/_2385. Amount of Time for Binary Tree to Be Infected.md b/markdowns/_2385. Amount of Time for Binary Tree to Be Infected.md index f30fe0b8..50a40a65 100644 --- a/markdowns/_2385. Amount of Time for Binary Tree to Be Infected.md +++ b/markdowns/_2385. Amount of Time for Binary Tree to Be Infected.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **62.72 %** +> **Acceptance Rate** : **62.73 %** ------ diff --git a/markdowns/_2389. Longest Subsequence With Limited Sum.md b/markdowns/_2389. Longest Subsequence With Limited Sum.md index f2791ab2..4c310686 100644 --- a/markdowns/_2389. Longest Subsequence With Limited Sum.md +++ b/markdowns/_2389. Longest Subsequence With Limited Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search](), [Greedy](), [Sorting](), [Prefix Sum]()** > -> **Acceptance Rate** : **71.87 %** +> **Acceptance Rate** : **71.89 %** ------ diff --git a/markdowns/_239. Sliding Window Maximum.md b/markdowns/_239. Sliding Window Maximum.md index 75a7a819..1e3d99c9 100644 --- a/markdowns/_239. Sliding Window Maximum.md +++ b/markdowns/_239. Sliding Window Maximum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Queue](), [Sliding Window](), [Heap (Priority Queue)](), [Monotonic Queue]()** > -> **Acceptance Rate** : **46.74 %** +> **Acceptance Rate** : **46.76 %** ------ diff --git a/markdowns/_2390. Removing Stars From a String.md b/markdowns/_2390. Removing Stars From a String.md index 4df5e78c..aa0b1846 100644 --- a/markdowns/_2390. Removing Stars From a String.md +++ b/markdowns/_2390. Removing Stars From a String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack](), [Simulation]()** > -> **Acceptance Rate** : **75.85 %** +> **Acceptance Rate** : **75.93 %** ------ diff --git a/markdowns/_2392. Build a Matrix With Conditions.md b/markdowns/_2392. Build a Matrix With Conditions.md index 9bf00dce..8641fcb7 100644 --- a/markdowns/_2392. Build a Matrix With Conditions.md +++ b/markdowns/_2392. Build a Matrix With Conditions.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Graph](), [Topological Sort](), [Matrix]()** > -> **Acceptance Rate** : **79.6 %** +> **Acceptance Rate** : **79.58 %** ------ diff --git a/markdowns/_2393. Count Strictly Increasing Subarrays.md b/markdowns/_2393. Count Strictly Increasing Subarrays.md index 097e7edb..f9076a86 100644 --- a/markdowns/_2393. Count Strictly Increasing Subarrays.md +++ b/markdowns/_2393. Count Strictly Increasing Subarrays.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Dynamic Programming]()** > -> **Acceptance Rate** : **74.82 %** +> **Acceptance Rate** : **74.8 %** ------ diff --git a/markdowns/_2395. Find Subarrays With Equal Sum.md b/markdowns/_2395. Find Subarrays With Equal Sum.md index 89cc5af7..8b4f1844 100644 --- a/markdowns/_2395. Find Subarrays With Equal Sum.md +++ b/markdowns/_2395. Find Subarrays With Equal Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table]()** > -> **Acceptance Rate** : **65.25 %** +> **Acceptance Rate** : **65.27 %** ------ diff --git a/markdowns/_2396. Strictly Palindromic Number.md b/markdowns/_2396. Strictly Palindromic Number.md index 210bdaa0..01b456d8 100644 --- a/markdowns/_2396. Strictly Palindromic Number.md +++ b/markdowns/_2396. Strictly Palindromic Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Two Pointers](), [Brainteaser]()** > -> **Acceptance Rate** : **87.68 %** +> **Acceptance Rate** : **87.72 %** ------ diff --git a/markdowns/_24. Swap Nodes in Pairs.md b/markdowns/_24. Swap Nodes in Pairs.md index 67aecbeb..d33fcf8c 100644 --- a/markdowns/_24. Swap Nodes in Pairs.md +++ b/markdowns/_24. Swap Nodes in Pairs.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Recursion]()** > -> **Acceptance Rate** : **64.94 %** +> **Acceptance Rate** : **64.99 %** ------ diff --git a/markdowns/_2405. Optimal Partition of String.md b/markdowns/_2405. Optimal Partition of String.md index 23c4e5e9..286227d9 100644 --- a/markdowns/_2405. Optimal Partition of String.md +++ b/markdowns/_2405. Optimal Partition of String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Greedy]()** > -> **Acceptance Rate** : **77.97 %** +> **Acceptance Rate** : **77.98 %** ------ diff --git a/markdowns/_2415. Reverse Odd Levels of Binary Tree.md b/markdowns/_2415. Reverse Odd Levels of Binary Tree.md index 722d3eb0..25ef8a51 100644 --- a/markdowns/_2415. Reverse Odd Levels of Binary Tree.md +++ b/markdowns/_2415. Reverse Odd Levels of Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **78.01 %** +> **Acceptance Rate** : **78.05 %** ------ diff --git a/markdowns/_2418. Sort the People.md b/markdowns/_2418. Sort the People.md index 50db2e7b..f36142b9 100644 --- a/markdowns/_2418. Sort the People.md +++ b/markdowns/_2418. Sort the People.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Sorting]()** > -> **Acceptance Rate** : **85.04 %** +> **Acceptance Rate** : **85.03 %** ------ diff --git a/markdowns/_242. Valid Anagram.md b/markdowns/_242. Valid Anagram.md index e0999603..d20bbd60 100644 --- a/markdowns/_242. Valid Anagram.md +++ b/markdowns/_242. Valid Anagram.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Sorting]()** > -> **Acceptance Rate** : **65.03 %** +> **Acceptance Rate** : **65.07 %** ------ diff --git a/markdowns/_2423. Remove Letter To Equalize Frequency.md b/markdowns/_2423. Remove Letter To Equalize Frequency.md index 609e4e51..83b1f5c8 100644 --- a/markdowns/_2423. Remove Letter To Equalize Frequency.md +++ b/markdowns/_2423. Remove Letter To Equalize Frequency.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Counting]()** > -> **Acceptance Rate** : **17.37 %** +> **Acceptance Rate** : **17.4 %** ------ diff --git a/markdowns/_2433. Find The Original Array of Prefix Xor.md b/markdowns/_2433. Find The Original Array of Prefix Xor.md index 00bd50a5..57d7daba 100644 --- a/markdowns/_2433. Find The Original Array of Prefix Xor.md +++ b/markdowns/_2433. Find The Original Array of Prefix Xor.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Bit Manipulation]()** > -> **Acceptance Rate** : **88.08 %** +> **Acceptance Rate** : **88.07 %** ------ diff --git a/markdowns/_2455. Average Value of Even Numbers That Are Divisible by Three.md b/markdowns/_2455. Average Value of Even Numbers That Are Divisible by Three.md index c62cb29f..2f6a7bfb 100644 --- a/markdowns/_2455. Average Value of Even Numbers That Are Divisible by Three.md +++ b/markdowns/_2455. Average Value of Even Numbers That Are Divisible by Three.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math]()** > -> **Acceptance Rate** : **60.54 %** +> **Acceptance Rate** : **60.55 %** ------ diff --git a/markdowns/_2473. Minimum Cost to Buy Apples.md b/markdowns/_2473. Minimum Cost to Buy Apples.md index abd1c3ee..a45310b6 100644 --- a/markdowns/_2473. Minimum Cost to Buy Apples.md +++ b/markdowns/_2473. Minimum Cost to Buy Apples.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Graph](), [Heap (Priority Queue)](), [Shortest Path]()** > -> **Acceptance Rate** : **67.77 %** +> **Acceptance Rate** : **67.74 %** ------ diff --git a/markdowns/_2482. Difference Between Ones and Zeros in Row and Column.md b/markdowns/_2482. Difference Between Ones and Zeros in Row and Column.md index 7d7f8810..fb241cde 100644 --- a/markdowns/_2482. Difference Between Ones and Zeros in Row and Column.md +++ b/markdowns/_2482. Difference Between Ones and Zeros in Row and Column.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Matrix](), [Simulation]()** > -> **Acceptance Rate** : **84.45 %** +> **Acceptance Rate** : **84.44 %** ------ diff --git a/markdowns/_2486. Append Characters to String to Make Subsequence.md b/markdowns/_2486. Append Characters to String to Make Subsequence.md index 2cb6fa2f..4c644bde 100644 --- a/markdowns/_2486. Append Characters to String to Make Subsequence.md +++ b/markdowns/_2486. Append Characters to String to Make Subsequence.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String](), [Greedy]()** > -> **Acceptance Rate** : **73.02 %** +> **Acceptance Rate** : **73.01 %** ------ diff --git a/markdowns/_2487. Remove Nodes From Linked List.md b/markdowns/_2487. Remove Nodes From Linked List.md index 3832cd38..5bf6e02f 100644 --- a/markdowns/_2487. Remove Nodes From Linked List.md +++ b/markdowns/_2487. Remove Nodes From Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Stack](), [Recursion](), [Monotonic Stack]()** > -> **Acceptance Rate** : **74.35 %** +> **Acceptance Rate** : **74.34 %** ------ diff --git a/markdowns/_25. Reverse Nodes in k-Group.md b/markdowns/_25. Reverse Nodes in k-Group.md index ce4d7655..2443163e 100644 --- a/markdowns/_25. Reverse Nodes in k-Group.md +++ b/markdowns/_25. Reverse Nodes in k-Group.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Recursion]()** > -> **Acceptance Rate** : **59.81 %** +> **Acceptance Rate** : **59.91 %** ------ diff --git a/markdowns/_251. Flatten 2D Vector.md b/markdowns/_251. Flatten 2D Vector.md index 9001992b..12b82203 100644 --- a/markdowns/_251. Flatten 2D Vector.md +++ b/markdowns/_251. Flatten 2D Vector.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Design](), [Iterator]()** > -> **Acceptance Rate** : **49.62 %** +> **Acceptance Rate** : **49.63 %** ------ diff --git a/markdowns/_2545. Sort the Students by Their Kth Score.md b/markdowns/_2545. Sort the Students by Their Kth Score.md index 042bce09..c1c2c495 100644 --- a/markdowns/_2545. Sort the Students by Their Kth Score.md +++ b/markdowns/_2545. Sort the Students by Their Kth Score.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sorting](), [Matrix]()** > -> **Acceptance Rate** : **85.55 %** +> **Acceptance Rate** : **85.53 %** ------ diff --git a/markdowns/_2570. Merge Two 2D Arrays by Summing Values.md b/markdowns/_2570. Merge Two 2D Arrays by Summing Values.md index 8c762856..5028d453 100644 --- a/markdowns/_2570. Merge Two 2D Arrays by Summing Values.md +++ b/markdowns/_2570. Merge Two 2D Arrays by Summing Values.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Two Pointers]()** > -> **Acceptance Rate** : **73.67 %** +> **Acceptance Rate** : **73.71 %** ------ diff --git a/markdowns/_2582. Pass the Pillow.md b/markdowns/_2582. Pass the Pillow.md index 20236d3c..881a105d 100644 --- a/markdowns/_2582. Pass the Pillow.md +++ b/markdowns/_2582. Pass the Pillow.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Simulation]()** > -> **Acceptance Rate** : **56.97 %** +> **Acceptance Rate** : **56.98 %** ------ diff --git a/markdowns/_26. Remove Duplicates from Sorted Array.md b/markdowns/_26. Remove Duplicates from Sorted Array.md index 868e04cd..a2366464 100644 --- a/markdowns/_26. Remove Duplicates from Sorted Array.md +++ b/markdowns/_26. Remove Duplicates from Sorted Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers]()** > -> **Acceptance Rate** : **56.95 %** +> **Acceptance Rate** : **57.06 %** ------ diff --git a/markdowns/_2619. Array Prototype Last.md b/markdowns/_2619. Array Prototype Last.md index cf69e2ab..8f79ca47 100644 --- a/markdowns/_2619. Array Prototype Last.md +++ b/markdowns/_2619. Array Prototype Last.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **73.46 %** +> **Acceptance Rate** : **73.51 %** ------ diff --git a/markdowns/_2620. Counter.md b/markdowns/_2620. Counter.md index 381fed91..491c0bde 100644 --- a/markdowns/_2620. Counter.md +++ b/markdowns/_2620. Counter.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **81.09 %** +> **Acceptance Rate** : **81.14 %** ------ diff --git a/markdowns/_2621. Sleep.md b/markdowns/_2621. Sleep.md index 5b9bc52c..af593596 100644 --- a/markdowns/_2621. Sleep.md +++ b/markdowns/_2621. Sleep.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **86.89 %** +> **Acceptance Rate** : **86.91 %** ------ diff --git a/markdowns/_2623. Memoize.md b/markdowns/_2623. Memoize.md index 0ae9caea..c48453bc 100644 --- a/markdowns/_2623. Memoize.md +++ b/markdowns/_2623. Memoize.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **62.56 %** +> **Acceptance Rate** : **62.54 %** ------ diff --git a/markdowns/_2624. Snail Traversal.md b/markdowns/_2624. Snail Traversal.md index 4545796a..204983f0 100644 --- a/markdowns/_2624. Snail Traversal.md +++ b/markdowns/_2624. Snail Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **65.35 %** +> **Acceptance Rate** : **65.42 %** ------ diff --git a/markdowns/_2626. Array Reduce Transformation.md b/markdowns/_2626. Array Reduce Transformation.md index 885e4de5..8e08990b 100644 --- a/markdowns/_2626. Array Reduce Transformation.md +++ b/markdowns/_2626. Array Reduce Transformation.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **84.67 %** +> **Acceptance Rate** : **84.72 %** ------ diff --git a/markdowns/_2629. Function Composition.md b/markdowns/_2629. Function Composition.md index 9d76c5f0..24930fc1 100644 --- a/markdowns/_2629. Function Composition.md +++ b/markdowns/_2629. Function Composition.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **86.16 %** +> **Acceptance Rate** : **86.22 %** ------ diff --git a/markdowns/_2634. Filter Elements from Array.md b/markdowns/_2634. Filter Elements from Array.md index b5dd4464..4c06b1d8 100644 --- a/markdowns/_2634. Filter Elements from Array.md +++ b/markdowns/_2634. Filter Elements from Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **84.7 %** +> **Acceptance Rate** : **84.75 %** ------ diff --git a/markdowns/_2635. Apply Transform Over Each Element in Array.md b/markdowns/_2635. Apply Transform Over Each Element in Array.md index fe90f260..a7b97110 100644 --- a/markdowns/_2635. Apply Transform Over Each Element in Array.md +++ b/markdowns/_2635. Apply Transform Over Each Element in Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **85.73 %** +> **Acceptance Rate** : **85.78 %** ------ diff --git a/markdowns/_2665. Counter II.md b/markdowns/_2665. Counter II.md index 3b185c20..b31a3160 100644 --- a/markdowns/_2665. Counter II.md +++ b/markdowns/_2665. Counter II.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **80.14 %** +> **Acceptance Rate** : **80.15 %** ------ diff --git a/markdowns/_2666. Allow One Function Call.md b/markdowns/_2666. Allow One Function Call.md index 89e1d76b..160166ab 100644 --- a/markdowns/_2666. Allow One Function Call.md +++ b/markdowns/_2666. Allow One Function Call.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **86.17 %** +> **Acceptance Rate** : **86.2 %** ------ diff --git a/markdowns/_2667. Create Hello World Function.md b/markdowns/_2667. Create Hello World Function.md index 67deb9b3..5f312080 100644 --- a/markdowns/_2667. Create Hello World Function.md +++ b/markdowns/_2667. Create Hello World Function.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **81.29 %** +> **Acceptance Rate** : **81.31 %** ------ diff --git a/markdowns/_2671. Frequency Tracker.md b/markdowns/_2671. Frequency Tracker.md index 5fe616f6..d6f22768 100644 --- a/markdowns/_2671. Frequency Tracker.md +++ b/markdowns/_2671. Frequency Tracker.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Design]()** > -> **Acceptance Rate** : **29.87 %** +> **Acceptance Rate** : **29.91 %** ------ diff --git a/markdowns/_2678. Number of Senior Citizens.md b/markdowns/_2678. Number of Senior Citizens.md index 9a4bfb29..80356e8e 100644 --- a/markdowns/_2678. Number of Senior Citizens.md +++ b/markdowns/_2678. Number of Senior Citizens.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String]()** > -> **Acceptance Rate** : **81.92 %** +> **Acceptance Rate** : **81.82 %** ------ diff --git a/markdowns/_2679. Sum in a Matrix.md b/markdowns/_2679. Sum in a Matrix.md index bcee85e4..d4fa6ca4 100644 --- a/markdowns/_2679. Sum in a Matrix.md +++ b/markdowns/_2679. Sum in a Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sorting](), [Heap (Priority Queue)](), [Matrix](), [Simulation]()** > -> **Acceptance Rate** : **60.02 %** +> **Acceptance Rate** : **60.07 %** ------ diff --git a/markdowns/_27. Remove Element.md b/markdowns/_27. Remove Element.md index d76b3f50..7a94c3e2 100644 --- a/markdowns/_27. Remove Element.md +++ b/markdowns/_27. Remove Element.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers]()** > -> **Acceptance Rate** : **57.69 %** +> **Acceptance Rate** : **57.77 %** ------ diff --git a/markdowns/_2703. Return Length of Arguments Passed.md b/markdowns/_2703. Return Length of Arguments Passed.md index 55c7f066..8ff58b87 100644 --- a/markdowns/_2703. Return Length of Arguments Passed.md +++ b/markdowns/_2703. Return Length of Arguments Passed.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **94.27 %** +> **Acceptance Rate** : **94.29 %** ------ diff --git a/markdowns/_271. Encode and Decode Strings.md b/markdowns/_271. Encode and Decode Strings.md index f49779e0..3ba01675 100644 --- a/markdowns/_271. Encode and Decode Strings.md +++ b/markdowns/_271. Encode and Decode Strings.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Design]()** > -> **Acceptance Rate** : **47.27 %** +> **Acceptance Rate** : **47.34 %** ------ diff --git a/markdowns/_272. Closest Binary Search Tree Value II.md b/markdowns/_272. Closest Binary Search Tree Value II.md index 52054d23..0ea77fc9 100644 --- a/markdowns/_272. Closest Binary Search Tree Value II.md +++ b/markdowns/_272. Closest Binary Search Tree Value II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [Stack](), [Tree](), [Depth-First Search](), [Binary Search Tree](), [Heap (Priority Queue)](), [Binary Tree]()** > -> **Acceptance Rate** : **59.36 %** +> **Acceptance Rate** : **59.37 %** ------ diff --git a/markdowns/_2723. Add Two Promises.md b/markdowns/_2723. Add Two Promises.md index fc283a3e..f92fc2a9 100644 --- a/markdowns/_2723. Add Two Promises.md +++ b/markdowns/_2723. Add Two Promises.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **91.37 %** +> **Acceptance Rate** : **91.36 %** ------ diff --git a/markdowns/_273. Integer to English Words.md b/markdowns/_273. Integer to English Words.md index fa75177d..3d2db012 100644 --- a/markdowns/_273. Integer to English Words.md +++ b/markdowns/_273. Integer to English Words.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [String](), [Recursion]()** > -> **Acceptance Rate** : **30.91 %** +> **Acceptance Rate** : **33.9 %** ------ diff --git a/markdowns/_2734. Lexicographically Smallest String After Substring Operation.md b/markdowns/_2734. Lexicographically Smallest String After Substring Operation.md index d8ca2508..f0c4c39a 100644 --- a/markdowns/_2734. Lexicographically Smallest String After Substring Operation.md +++ b/markdowns/_2734. Lexicographically Smallest String After Substring Operation.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Greedy]()** > -> **Acceptance Rate** : **30.97 %** +> **Acceptance Rate** : **31.02 %** ------ diff --git a/markdowns/_2743. Count Substrings Without Repeating Character.md b/markdowns/_2743. Count Substrings Without Repeating Character.md index 0e5b199b..b0a5a43a 100644 --- a/markdowns/_2743. Count Substrings Without Repeating Character.md +++ b/markdowns/_2743. Count Substrings Without Repeating Character.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Sliding Window]()** > -> **Acceptance Rate** : **76.69 %** +> **Acceptance Rate** : **76.66 %** ------ diff --git a/markdowns/_2751. Robot Collisions.md b/markdowns/_2751. Robot Collisions.md index e5a4c33d..4da675e6 100644 --- a/markdowns/_2751. Robot Collisions.md +++ b/markdowns/_2751. Robot Collisions.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Sorting](), [Simulation]()** > -> **Acceptance Rate** : **57.16 %** +> **Acceptance Rate** : **57.13 %** ------ diff --git a/markdowns/_2796. Repeat String.md b/markdowns/_2796. Repeat String.md index 9130baf1..f78463ab 100644 --- a/markdowns/_2796. Repeat String.md +++ b/markdowns/_2796. Repeat String.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **92.83 %** +> **Acceptance Rate** : **92.82 %** ------ diff --git a/markdowns/_28. Find the Index of the First Occurrence in a String.md b/markdowns/_28. Find the Index of the First Occurrence in a String.md index ad5a8bc2..c733d45d 100644 --- a/markdowns/_28. Find the Index of the First Occurrence in a String.md +++ b/markdowns/_28. Find the Index of the First Occurrence in a String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String](), [String Matching]()** > -> **Acceptance Rate** : **43.04 %** +> **Acceptance Rate** : **43.1 %** ------ diff --git a/markdowns/_2807. Insert Greatest Common Divisors in Linked List.md b/markdowns/_2807. Insert Greatest Common Divisors in Linked List.md index 6e5e6d82..ac333842 100644 --- a/markdowns/_2807. Insert Greatest Common Divisors in Linked List.md +++ b/markdowns/_2807. Insert Greatest Common Divisors in Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Math](), [Number Theory]()** > -> **Acceptance Rate** : **88.76 %** +> **Acceptance Rate** : **88.8 %** ------ diff --git a/markdowns/_2816. Double a Number Represented as a Linked List.md b/markdowns/_2816. Double a Number Represented as a Linked List.md index 04da0bcc..bec338e8 100644 --- a/markdowns/_2816. Double a Number Represented as a Linked List.md +++ b/markdowns/_2816. Double a Number Represented as a Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Math](), [Stack]()** > -> **Acceptance Rate** : **61.54 %** +> **Acceptance Rate** : **61.55 %** ------ diff --git a/markdowns/_286. Walls and Gates.md b/markdowns/_286. Walls and Gates.md index 0d2675eb..6fa25308 100644 --- a/markdowns/_286. Walls and Gates.md +++ b/markdowns/_286. Walls and Gates.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Breadth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **61.66 %** +> **Acceptance Rate** : **61.69 %** ------ diff --git a/markdowns/_287. Find the Duplicate Number.md b/markdowns/_287. Find the Duplicate Number.md index c13bf979..8a144a06 100644 --- a/markdowns/_287. Find the Duplicate Number.md +++ b/markdowns/_287. Find the Duplicate Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Binary Search](), [Bit Manipulation]()** > -> **Acceptance Rate** : **61.3 %** +> **Acceptance Rate** : **61.35 %** ------ diff --git a/markdowns/_2886. Change Data Type.md b/markdowns/_2886. Change Data Type.md index b1d09297..5ca7d4ba 100644 --- a/markdowns/_2886. Change Data Type.md +++ b/markdowns/_2886. Change Data Type.md @@ -14,7 +14,7 @@ > **Related Topics** : **N/A** > -> **Acceptance Rate** : **87.04 %** +> **Acceptance Rate** : **87.13 %** ------ diff --git a/markdowns/_2894. Divisible and Non-divisible Sums Difference.md b/markdowns/_2894. Divisible and Non-divisible Sums Difference.md index 09efa174..edc9b8cf 100644 --- a/markdowns/_2894. Divisible and Non-divisible Sums Difference.md +++ b/markdowns/_2894. Divisible and Non-divisible Sums Difference.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math]()** > -> **Acceptance Rate** : **89.02 %** +> **Acceptance Rate** : **89.07 %** ------ diff --git a/markdowns/_292. Nim Game.md b/markdowns/_292. Nim Game.md index 7e7aa24f..f3b170d7 100644 --- a/markdowns/_292. Nim Game.md +++ b/markdowns/_292. Nim Game.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Brainteaser](), [Game Theory]()** > -> **Acceptance Rate** : **57.11 %** +> **Acceptance Rate** : **57.14 %** ------ diff --git a/markdowns/_2954. Count the Number of Infection Sequences.md b/markdowns/_2954. Count the Number of Infection Sequences.md index 90d8619c..ddfc6ad3 100644 --- a/markdowns/_2954. Count the Number of Infection Sequences.md +++ b/markdowns/_2954. Count the Number of Infection Sequences.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Combinatorics]()** > -> **Acceptance Rate** : **36.63 %** +> **Acceptance Rate** : **36.65 %** ------ diff --git a/markdowns/_2976. Minimum Cost to Convert String I.md b/markdowns/_2976. Minimum Cost to Convert String I.md index a8c86dd2..dde19d22 100644 --- a/markdowns/_2976. Minimum Cost to Convert String I.md +++ b/markdowns/_2976. Minimum Cost to Convert String I.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Graph](), [Shortest Path]()** > -> **Acceptance Rate** : **58.75 %** +> **Acceptance Rate** : **58.66 %** ------ diff --git a/markdowns/_2979. Most Expensive Item That Can Not Be Bought.md b/markdowns/_2979. Most Expensive Item That Can Not Be Bought.md index 2e0c17ee..46275774 100644 --- a/markdowns/_2979. Most Expensive Item That Can Not Be Bought.md +++ b/markdowns/_2979. Most Expensive Item That Can Not Be Bought.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Dynamic Programming](), [Number Theory]()** > -> **Acceptance Rate** : **77.09 %** +> **Acceptance Rate** : **77.16 %** ------ diff --git a/markdowns/_2997. Minimum Number of Operations to Make Array XOR Equal to K.md b/markdowns/_2997. Minimum Number of Operations to Make Array XOR Equal to K.md index c98d710d..4cd6665b 100644 --- a/markdowns/_2997. Minimum Number of Operations to Make Array XOR Equal to K.md +++ b/markdowns/_2997. Minimum Number of Operations to Make Array XOR Equal to K.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Bit Manipulation]()** > -> **Acceptance Rate** : **86.43 %** +> **Acceptance Rate** : **86.41 %** ------ diff --git a/markdowns/_3. Longest Substring Without Repeating Characters.md b/markdowns/_3. Longest Substring Without Repeating Characters.md index b114d465..d606f54d 100644 --- a/markdowns/_3. Longest Substring Without Repeating Characters.md +++ b/markdowns/_3. Longest Substring Without Repeating Characters.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Sliding Window]()** > -> **Acceptance Rate** : **35.18 %** +> **Acceptance Rate** : **35.22 %** ------ diff --git a/markdowns/_3016. Minimum Number of Pushes to Type Word II.md b/markdowns/_3016. Minimum Number of Pushes to Type Word II.md index 90b7c397..2cbe8d2b 100644 --- a/markdowns/_3016. Minimum Number of Pushes to Type Word II.md +++ b/markdowns/_3016. Minimum Number of Pushes to Type Word II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Greedy](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **70.93 %** +> **Acceptance Rate** : **80.7 %** ------ diff --git a/markdowns/_3043. Find the Length of the Longest Common Prefix.md b/markdowns/_3043. Find the Length of the Longest Common Prefix.md index a65ddc3b..fe79a37b 100644 --- a/markdowns/_3043. Find the Length of the Longest Common Prefix.md +++ b/markdowns/_3043. Find the Length of the Longest Common Prefix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Trie]()** > -> **Acceptance Rate** : **34.77 %** +> **Acceptance Rate** : **34.95 %** ------ diff --git a/markdowns/_3045. Count Prefix and Suffix Pairs II.md b/markdowns/_3045. Count Prefix and Suffix Pairs II.md index 9978f2e2..ebad1299 100644 --- a/markdowns/_3045. Count Prefix and Suffix Pairs II.md +++ b/markdowns/_3045. Count Prefix and Suffix Pairs II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Trie](), [Rolling Hash](), [String Matching](), [Hash Function]()** > -> **Acceptance Rate** : **24.84 %** +> **Acceptance Rate** : **24.83 %** ------ diff --git a/markdowns/_3064. Guess the Number Using Bitwise Questions I.md b/markdowns/_3064. Guess the Number Using Bitwise Questions I.md index c8c18ca1..979d4de7 100644 --- a/markdowns/_3064. Guess the Number Using Bitwise Questions I.md +++ b/markdowns/_3064. Guess the Number Using Bitwise Questions I.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Bit Manipulation](), [Interactive]()** > -> **Acceptance Rate** : **91.19 %** +> **Acceptance Rate** : **91.23 %** ------ diff --git a/markdowns/_3074. Apple Redistribution into Boxes.md b/markdowns/_3074. Apple Redistribution into Boxes.md index 4c884228..0c91b4c9 100644 --- a/markdowns/_3074. Apple Redistribution into Boxes.md +++ b/markdowns/_3074. Apple Redistribution into Boxes.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **66.96 %** +> **Acceptance Rate** : **66.99 %** ------ diff --git a/markdowns/_3106. Lexicographically Smallest String After Operations With Constraint.md b/markdowns/_3106. Lexicographically Smallest String After Operations With Constraint.md index d6510dc2..65a0be96 100644 --- a/markdowns/_3106. Lexicographically Smallest String After Operations With Constraint.md +++ b/markdowns/_3106. Lexicographically Smallest String After Operations With Constraint.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Greedy]()** > -> **Acceptance Rate** : **63.42 %** +> **Acceptance Rate** : **63.46 %** ------ diff --git a/markdowns/_3110. Score of a String.md b/markdowns/_3110. Score of a String.md index ccf3e1a6..b823c74f 100644 --- a/markdowns/_3110. Score of a String.md +++ b/markdowns/_3110. Score of a String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String]()** > -> **Acceptance Rate** : **93.34 %** +> **Acceptance Rate** : **93.3 %** ------ diff --git a/markdowns/_3111. Minimum Rectangles to Cover Points.md b/markdowns/_3111. Minimum Rectangles to Cover Points.md index 64a73251..a5baab53 100644 --- a/markdowns/_3111. Minimum Rectangles to Cover Points.md +++ b/markdowns/_3111. Minimum Rectangles to Cover Points.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **63.66 %** +> **Acceptance Rate** : **63.77 %** ------ diff --git a/markdowns/_3136. Valid Word.md b/markdowns/_3136. Valid Word.md index 279a84a3..dea40494 100644 --- a/markdowns/_3136. Valid Word.md +++ b/markdowns/_3136. Valid Word.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String]()** > -> **Acceptance Rate** : **37.46 %** +> **Acceptance Rate** : **37.55 %** ------ diff --git a/markdowns/_314. Binary Tree Vertical Order Traversal.md b/markdowns/_314. Binary Tree Vertical Order Traversal.md index 62c84f66..4cae412e 100644 --- a/markdowns/_314. Binary Tree Vertical Order Traversal.md +++ b/markdowns/_314. Binary Tree Vertical Order Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Tree](), [Depth-First Search](), [Breadth-First Search](), [Sorting](), [Binary Tree]()** > -> **Acceptance Rate** : **54.86 %** +> **Acceptance Rate** : **54.9 %** ------ diff --git a/markdowns/_3157. Find the Level of Tree with Minimum Sum.md b/markdowns/_3157. Find the Level of Tree with Minimum Sum.md index 07138b53..b43065c6 100644 --- a/markdowns/_3157. Find the Level of Tree with Minimum Sum.md +++ b/markdowns/_3157. Find the Level of Tree with Minimum Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **69.54 %** +> **Acceptance Rate** : **69.22 %** ------ diff --git a/markdowns/_3168. Minimum Number of Chairs in a Waiting Room.md b/markdowns/_3168. Minimum Number of Chairs in a Waiting Room.md index 8818ecfa..1fea8f9e 100644 --- a/markdowns/_3168. Minimum Number of Chairs in a Waiting Room.md +++ b/markdowns/_3168. Minimum Number of Chairs in a Waiting Room.md @@ -16,7 +16,7 @@ > **Related Topics** : **[String](), [Simulation]()** > -> **Acceptance Rate** : **80.32 %** +> **Acceptance Rate** : **80.31 %** ------ diff --git a/markdowns/_3169. Count Days Without Meetings.md b/markdowns/_3169. Count Days Without Meetings.md index 6d4fc6c3..946b6388 100644 --- a/markdowns/_3169. Count Days Without Meetings.md +++ b/markdowns/_3169. Count Days Without Meetings.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Sorting]()** > -> **Acceptance Rate** : **33.57 %** +> **Acceptance Rate** : **33.6 %** ------ diff --git a/markdowns/_3174. Clear Digits.md b/markdowns/_3174. Clear Digits.md index 654bea4c..dd859a15 100644 --- a/markdowns/_3174. Clear Digits.md +++ b/markdowns/_3174. Clear Digits.md @@ -14,9 +14,9 @@ ------ -> **Related Topics** : **[Hash Table](), [String](), [Simulation]()** +> **Related Topics** : **[String](), [Stack](), [Simulation]()** > -> **Acceptance Rate** : **72.37 %** +> **Acceptance Rate** : **72.4 %** ------ diff --git a/markdowns/_3175. Find The First Player to win K Games in a Row.md b/markdowns/_3175. Find The First Player to win K Games in a Row.md index d0e488f3..1fca1238 100644 --- a/markdowns/_3175. Find The First Player to win K Games in a Row.md +++ b/markdowns/_3175. Find The First Player to win K Games in a Row.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Simulation]()** > -> **Acceptance Rate** : **39.36 %** +> **Acceptance Rate** : **39.39 %** ------ diff --git a/markdowns/_3178. Find the Child Who Has the Ball After K Seconds.md b/markdowns/_3178. Find the Child Who Has the Ball After K Seconds.md index b919d9de..75501da7 100644 --- a/markdowns/_3178. Find the Child Who Has the Ball After K Seconds.md +++ b/markdowns/_3178. Find the Child Who Has the Ball After K Seconds.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Math](), [Simulation]()** > -> **Acceptance Rate** : **61.88 %** +> **Acceptance Rate** : **61.8 %** ------ diff --git a/markdowns/_3179. Find the N-th Value After K Seconds.md b/markdowns/_3179. Find the N-th Value After K Seconds.md index d03abcdf..c1a38198 100644 --- a/markdowns/_3179. Find the N-th Value After K Seconds.md +++ b/markdowns/_3179. Find the N-th Value After K Seconds.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Math](), [Simulation](), [Combinatorics](), [Prefix Sum]()** > -> **Acceptance Rate** : **54.58 %** +> **Acceptance Rate** : **54.61 %** ------ diff --git a/markdowns/_3180. Maximum Total Reward Using Operations I.md b/markdowns/_3180. Maximum Total Reward Using Operations I.md index 0e2c51ea..ddb3023b 100644 --- a/markdowns/_3180. Maximum Total Reward Using Operations I.md +++ b/markdowns/_3180. Maximum Total Reward Using Operations I.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming]()** > -> **Acceptance Rate** : **29.2 %** +> **Acceptance Rate** : **29.27 %** ------ diff --git a/markdowns/_3184. Count Pairs That Form a Complete Day I.md b/markdowns/_3184. Count Pairs That Form a Complete Day I.md index a773bdcf..ecf2cbb9 100644 --- a/markdowns/_3184. Count Pairs That Form a Complete Day I.md +++ b/markdowns/_3184. Count Pairs That Form a Complete Day I.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Counting]()** > -> **Acceptance Rate** : **79.12 %** +> **Acceptance Rate** : **79.14 %** ------ diff --git a/markdowns/_3185. Count Pairs That Form a Complete Day II.md b/markdowns/_3185. Count Pairs That Form a Complete Day II.md index 5186581b..36449a39 100644 --- a/markdowns/_3185. Count Pairs That Form a Complete Day II.md +++ b/markdowns/_3185. Count Pairs That Form a Complete Day II.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Counting]()** > -> **Acceptance Rate** : **42.8 %** +> **Acceptance Rate** : **42.87 %** ------ diff --git a/markdowns/_3186. Maximum Total Damage With Spell Casting.md b/markdowns/_3186. Maximum Total Damage With Spell Casting.md index 19383a5f..f449c621 100644 --- a/markdowns/_3186. Maximum Total Damage With Spell Casting.md +++ b/markdowns/_3186. Maximum Total Damage With Spell Casting.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Two Pointers](), [Binary Search](), [Dynamic Programming](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **25.86 %** +> **Acceptance Rate** : **25.95 %** ------ diff --git a/markdowns/_3190. Find Minimum Operations to Make All Elements Divisible by Three.md b/markdowns/_3190. Find Minimum Operations to Make All Elements Divisible by Three.md index 332671cb..c8e2955d 100644 --- a/markdowns/_3190. Find Minimum Operations to Make All Elements Divisible by Three.md +++ b/markdowns/_3190. Find Minimum Operations to Make All Elements Divisible by Three.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math]()** > -> **Acceptance Rate** : **89.67 %** +> **Acceptance Rate** : **89.74 %** ------ diff --git a/markdowns/_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md b/markdowns/_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md index d3a37f1f..35bb6773 100644 --- a/markdowns/_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md +++ b/markdowns/_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Bit Manipulation](), [Queue](), [Sliding Window](), [Prefix Sum]()** > -> **Acceptance Rate** : **70.71 %** +> **Acceptance Rate** : **70.76 %** ------ diff --git a/markdowns/_3192. Minimum Operations to Make Binary Array Elements Equal to One II.md b/markdowns/_3192. Minimum Operations to Make Binary Array Elements Equal to One II.md index 1f6f9978..a5b9ba4a 100644 --- a/markdowns/_3192. Minimum Operations to Make Binary Array Elements Equal to One II.md +++ b/markdowns/_3192. Minimum Operations to Make Binary Array Elements Equal to One II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming](), [Greedy]()** > -> **Acceptance Rate** : **64.91 %** +> **Acceptance Rate** : **64.99 %** ------ diff --git a/markdowns/_3194. Minimum Average of Smallest and Largest Elements.md b/markdowns/_3194. Minimum Average of Smallest and Largest Elements.md index c114b7b1..06727069 100644 --- a/markdowns/_3194. Minimum Average of Smallest and Largest Elements.md +++ b/markdowns/_3194. Minimum Average of Smallest and Largest Elements.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Sorting]()** > -> **Acceptance Rate** : **85.0 %** +> **Acceptance Rate** : **85.09 %** ------ diff --git a/markdowns/_3195. Find the Minimum Area to Cover All Ones I.md b/markdowns/_3195. Find the Minimum Area to Cover All Ones I.md index d5f0adb3..852531fe 100644 --- a/markdowns/_3195. Find the Minimum Area to Cover All Ones I.md +++ b/markdowns/_3195. Find the Minimum Area to Cover All Ones I.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Matrix]()** > -> **Acceptance Rate** : **74.03 %** +> **Acceptance Rate** : **73.98 %** ------ diff --git a/markdowns/_3196. Maximize Total Cost of Alternating Subarrays.md b/markdowns/_3196. Maximize Total Cost of Alternating Subarrays.md index 31b51353..9d8e12a7 100644 --- a/markdowns/_3196. Maximize Total Cost of Alternating Subarrays.md +++ b/markdowns/_3196. Maximize Total Cost of Alternating Subarrays.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming]()** > -> **Acceptance Rate** : **28.25 %** +> **Acceptance Rate** : **28.32 %** ------ diff --git a/markdowns/_3210. Find the Encrypted String.md b/markdowns/_3210. Find the Encrypted String.md index 4f94d156..4e799067 100644 --- a/markdowns/_3210. Find the Encrypted String.md +++ b/markdowns/_3210. Find the Encrypted String.md @@ -16,7 +16,7 @@ > **Related Topics** : **[String]()** > -> **Acceptance Rate** : **69.42 %** +> **Acceptance Rate** : **69.35 %** ------ diff --git a/markdowns/_3211. Generate Binary Strings Without Adjacent Zeros.md b/markdowns/_3211. Generate Binary Strings Without Adjacent Zeros.md index 0c491ba8..757d2bd0 100644 --- a/markdowns/_3211. Generate Binary Strings Without Adjacent Zeros.md +++ b/markdowns/_3211. Generate Binary Strings Without Adjacent Zeros.md @@ -16,7 +16,7 @@ > **Related Topics** : **[String](), [Bit Manipulation](), [Recursion]()** > -> **Acceptance Rate** : **86.2 %** +> **Acceptance Rate** : **86.28 %** ------ diff --git a/markdowns/_3212. Count Submatrices With Equal Frequency of X and Y.md b/markdowns/_3212. Count Submatrices With Equal Frequency of X and Y.md index 01cb39e4..1220fc18 100644 --- a/markdowns/_3212. Count Submatrices With Equal Frequency of X and Y.md +++ b/markdowns/_3212. Count Submatrices With Equal Frequency of X and Y.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Matrix](), [Prefix Sum]()** > -> **Acceptance Rate** : **51.52 %** +> **Acceptance Rate** : **51.61 %** ------ diff --git a/markdowns/_3213. Construct String with Minimum Cost.md b/markdowns/_3213. Construct String with Minimum Cost.md index 3b21e3c9..eb6986d1 100644 --- a/markdowns/_3213. Construct String with Minimum Cost.md +++ b/markdowns/_3213. Construct String with Minimum Cost.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [String](), [Dynamic Programming](), [Suffix Array]()** > -> **Acceptance Rate** : **20.62 %** +> **Acceptance Rate** : **20.53 %** ------ diff --git a/markdowns/_3226. Number of Bit Changes to Make Two Integers Equal.md b/markdowns/_3226. Number of Bit Changes to Make Two Integers Equal.md index a52b6154..d0981abb 100644 --- a/markdowns/_3226. Number of Bit Changes to Make Two Integers Equal.md +++ b/markdowns/_3226. Number of Bit Changes to Make Two Integers Equal.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Bit Manipulation]()** > -> **Acceptance Rate** : **64.14 %** +> **Acceptance Rate** : **64.22 %** ------ diff --git a/markdowns/_3227. Vowels Game in a String.md b/markdowns/_3227. Vowels Game in a String.md index cc448f07..f57adc66 100644 --- a/markdowns/_3227. Vowels Game in a String.md +++ b/markdowns/_3227. Vowels Game in a String.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Math](), [String](), [Brainteaser](), [Game Theory]()** > -> **Acceptance Rate** : **61.83 %** +> **Acceptance Rate** : **62.01 %** ------ diff --git a/markdowns/_3228. Maximum Number of Operations to Move Ones to the End.md b/markdowns/_3228. Maximum Number of Operations to Move Ones to the End.md index 78eed187..b5870ef8 100644 --- a/markdowns/_3228. Maximum Number of Operations to Move Ones to the End.md +++ b/markdowns/_3228. Maximum Number of Operations to Move Ones to the End.md @@ -16,7 +16,7 @@ > **Related Topics** : **[String](), [Greedy](), [Counting]()** > -> **Acceptance Rate** : **53.28 %** +> **Acceptance Rate** : **53.49 %** ------ diff --git a/markdowns/_3229. Minimum Operations to Make Array Equal to Target.md b/markdowns/_3229. Minimum Operations to Make Array Equal to Target.md index 616379e0..88d81682 100644 --- a/markdowns/_3229. Minimum Operations to Make Array Equal to Target.md +++ b/markdowns/_3229. Minimum Operations to Make Array Equal to Target.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming](), [Stack](), [Greedy](), [Monotonic Stack]()** > -> **Acceptance Rate** : **37.21 %** +> **Acceptance Rate** : **37.42 %** ------ diff --git a/markdowns/_3232. Find if Digit Game Can Be Won.md b/markdowns/_3232. Find if Digit Game Can Be Won.md index 08a9a611..168f0bee 100644 --- a/markdowns/_3232. Find if Digit Game Can Be Won.md +++ b/markdowns/_3232. Find if Digit Game Can Be Won.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Math]()** > -> **Acceptance Rate** : **83.13 %** +> **Acceptance Rate** : **83.14 %** ------ diff --git a/markdowns/_3233. Find the Count of Numbers Which Are Not Special.md b/markdowns/_3233. Find the Count of Numbers Which Are Not Special.md index cf290e5b..19794824 100644 --- a/markdowns/_3233. Find the Count of Numbers Which Are Not Special.md +++ b/markdowns/_3233. Find the Count of Numbers Which Are Not Special.md @@ -16,7 +16,7 @@ > **Related Topics** : **[Array](), [Math](), [Number Theory]()** > -> **Acceptance Rate** : **26.31 %** +> **Acceptance Rate** : **26.43 %** ------ diff --git a/markdowns/_3238. Find the Number of Winning Players.md b/markdowns/_3238. Find the Number of Winning Players.md index 9b8df7f5..749eb585 100644 --- a/markdowns/_3238. Find the Number of Winning Players.md +++ b/markdowns/_3238. Find the Number of Winning Players.md @@ -14,9 +14,9 @@ ------ -> **Related Topics** : **N/A** +> **Related Topics** : **[Array](), [Hash Table](), [Counting]()** > -> **Acceptance Rate** : **59.92 %** +> **Acceptance Rate** : **60.82 %** ------ diff --git a/markdowns/_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md b/markdowns/_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md index e1c581f5..8d80383b 100644 --- a/markdowns/_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md +++ b/markdowns/_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md @@ -14,9 +14,9 @@ ------ -> **Related Topics** : **N/A** +> **Related Topics** : **[Array](), [Two Pointers](), [Matrix]()** > -> **Acceptance Rate** : **76.97 %** +> **Acceptance Rate** : **77.93 %** ------ diff --git a/markdowns/_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md b/markdowns/_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md index f50ab375..7ac63247 100644 --- a/markdowns/_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md +++ b/markdowns/_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md @@ -14,9 +14,9 @@ ------ -> **Related Topics** : **N/A** +> **Related Topics** : **[Array](), [Two Pointers](), [Matrix]()** > -> **Acceptance Rate** : **16.86 %** +> **Acceptance Rate** : **21.83 %** ------ diff --git a/markdowns/_3242. Design Neighbor Sum Service.md b/markdowns/_3242. Design Neighbor Sum Service.md index 9c912439..10798abe 100644 --- a/markdowns/_3242. Design Neighbor Sum Service.md +++ b/markdowns/_3242. Design Neighbor Sum Service.md @@ -12,9 +12,9 @@ ------ -> **Related Topics** : **N/A** +> **Related Topics** : **[Array](), [Hash Table](), [Design](), [Matrix](), [Simulation]()** > -> **Acceptance Rate** : **83.2 %** +> **Acceptance Rate** : **83.78 %** ------ diff --git a/markdowns/_328. Odd Even Linked List.md b/markdowns/_328. Odd Even Linked List.md index 0411aa47..1f7e624a 100644 --- a/markdowns/_328. Odd Even Linked List.md +++ b/markdowns/_328. Odd Even Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List]()** > -> **Acceptance Rate** : **61.53 %** +> **Acceptance Rate** : **61.54 %** ------ diff --git a/markdowns/_330. Patching Array.md b/markdowns/_330. Patching Array.md index bf3eab0c..073932e9 100644 --- a/markdowns/_330. Patching Array.md +++ b/markdowns/_330. Patching Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy]()** > -> **Acceptance Rate** : **53.12 %** +> **Acceptance Rate** : **53.13 %** ------ diff --git a/markdowns/_339. Nested List Weight Sum.md b/markdowns/_339. Nested List Weight Sum.md index d052864b..385c2e1d 100644 --- a/markdowns/_339. Nested List Weight Sum.md +++ b/markdowns/_339. Nested List Weight Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Depth-First Search](), [Breadth-First Search]()** > -> **Acceptance Rate** : **84.04 %** +> **Acceptance Rate** : **84.05 %** ------ diff --git a/markdowns/_341. Flatten Nested List Iterator.md b/markdowns/_341. Flatten Nested List Iterator.md index 933a86d5..19a33319 100644 --- a/markdowns/_341. Flatten Nested List Iterator.md +++ b/markdowns/_341. Flatten Nested List Iterator.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Stack](), [Tree](), [Depth-First Search](), [Design](), [Queue](), [Iterator]()** > -> **Acceptance Rate** : **64.66 %** +> **Acceptance Rate** : **64.68 %** ------ diff --git a/markdowns/_344. Reverse String.md b/markdowns/_344. Reverse String.md index db21ae9d..4d46bbc7 100644 --- a/markdowns/_344. Reverse String.md +++ b/markdowns/_344. Reverse String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String]()** > -> **Acceptance Rate** : **78.84 %** +> **Acceptance Rate** : **78.87 %** ------ diff --git a/markdowns/_345. Reverse Vowels of a String.md b/markdowns/_345. Reverse Vowels of a String.md index 899648ae..a4efde23 100644 --- a/markdowns/_345. Reverse Vowels of a String.md +++ b/markdowns/_345. Reverse Vowels of a String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String]()** > -> **Acceptance Rate** : **53.84 %** +> **Acceptance Rate** : **53.9 %** ------ diff --git a/markdowns/_347. Top K Frequent Elements.md b/markdowns/_347. Top K Frequent Elements.md index 2cf040ac..c05ad089 100644 --- a/markdowns/_347. Top K Frequent Elements.md +++ b/markdowns/_347. Top K Frequent Elements.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Divide and Conquer](), [Sorting](), [Heap (Priority Queue)](), [Bucket Sort](), [Counting](), [Quickselect]()** > -> **Acceptance Rate** : **63.08 %** +> **Acceptance Rate** : **63.11 %** ------ diff --git a/markdowns/_350. Intersection of Two Arrays II.md b/markdowns/_350. Intersection of Two Arrays II.md index 6eb800f6..5afc0180 100644 --- a/markdowns/_350. Intersection of Two Arrays II.md +++ b/markdowns/_350. Intersection of Two Arrays II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Two Pointers](), [Binary Search](), [Sorting]()** > -> **Acceptance Rate** : **58.59 %** +> **Acceptance Rate** : **58.6 %** ------ diff --git a/markdowns/_353. Design Snake Game.md b/markdowns/_353. Design Snake Game.md index ffa484de..722e41c6 100644 --- a/markdowns/_353. Design Snake Game.md +++ b/markdowns/_353. Design Snake Game.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Design](), [Queue](), [Simulation]()** > -> **Acceptance Rate** : **38.83 %** +> **Acceptance Rate** : **38.85 %** ------ diff --git a/markdowns/_36. Valid Sudoku.md b/markdowns/_36. Valid Sudoku.md index fab64b22..a36b158c 100644 --- a/markdowns/_36. Valid Sudoku.md +++ b/markdowns/_36. Valid Sudoku.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Matrix]()** > -> **Acceptance Rate** : **60.25 %** +> **Acceptance Rate** : **60.31 %** ------ diff --git a/markdowns/_364. Nested List Weight Sum II.md b/markdowns/_364. Nested List Weight Sum II.md index 0db44f80..1289d38a 100644 --- a/markdowns/_364. Nested List Weight Sum II.md +++ b/markdowns/_364. Nested List Weight Sum II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Stack](), [Depth-First Search](), [Breadth-First Search]()** > -> **Acceptance Rate** : **64.85 %** +> **Acceptance Rate** : **64.83 %** ------ diff --git a/markdowns/_374. Guess Number Higher or Lower.md b/markdowns/_374. Guess Number Higher or Lower.md index 3acd9ad4..c941e7b6 100644 --- a/markdowns/_374. Guess Number Higher or Lower.md +++ b/markdowns/_374. Guess Number Higher or Lower.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Binary Search](), [Interactive]()** > -> **Acceptance Rate** : **53.97 %** +> **Acceptance Rate** : **54.01 %** ------ diff --git a/markdowns/_380. Insert Delete GetRandom O(1).md b/markdowns/_380. Insert Delete GetRandom O(1).md index f8748eb8..6d081ff1 100644 --- a/markdowns/_380. Insert Delete GetRandom O(1).md +++ b/markdowns/_380. Insert Delete GetRandom O(1).md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Math](), [Design](), [Randomized]()** > -> **Acceptance Rate** : **54.57 %** +> **Acceptance Rate** : **54.58 %** ------ diff --git a/markdowns/_382. Linked List Random Node.md b/markdowns/_382. Linked List Random Node.md index 1b81ef84..d7be0c08 100644 --- a/markdowns/_382. Linked List Random Node.md +++ b/markdowns/_382. Linked List Random Node.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Math](), [Reservoir Sampling](), [Randomized]()** > -> **Acceptance Rate** : **63.33 %** +> **Acceptance Rate** : **63.34 %** ------ diff --git a/markdowns/_384. Shuffle an Array.md b/markdowns/_384. Shuffle an Array.md index 76172b92..5c6ab103 100644 --- a/markdowns/_384. Shuffle an Array.md +++ b/markdowns/_384. Shuffle an Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Randomized]()** > -> **Acceptance Rate** : **58.46 %** +> **Acceptance Rate** : **58.47 %** ------ diff --git a/markdowns/_39. Combination Sum.md b/markdowns/_39. Combination Sum.md index 1131a338..aeeff460 100644 --- a/markdowns/_39. Combination Sum.md +++ b/markdowns/_39. Combination Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Backtracking]()** > -> **Acceptance Rate** : **72.26 %** +> **Acceptance Rate** : **72.33 %** ------ diff --git a/markdowns/_394. Decode String.md b/markdowns/_394. Decode String.md index 143c2662..ae244d7f 100644 --- a/markdowns/_394. Decode String.md +++ b/markdowns/_394. Decode String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack](), [Recursion]()** > -> **Acceptance Rate** : **59.57 %** +> **Acceptance Rate** : **59.61 %** ------ diff --git a/markdowns/_408. Valid Word Abbreviation.md b/markdowns/_408. Valid Word Abbreviation.md index 6d87c363..0ed67d38 100644 --- a/markdowns/_408. Valid Word Abbreviation.md +++ b/markdowns/_408. Valid Word Abbreviation.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String]()** > -> **Acceptance Rate** : **36.0 %** +> **Acceptance Rate** : **36.01 %** ------ diff --git a/markdowns/_412. Fizz Buzz.md b/markdowns/_412. Fizz Buzz.md index 89890d8c..8fd81a12 100644 --- a/markdowns/_412. Fizz Buzz.md +++ b/markdowns/_412. Fizz Buzz.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [String](), [Simulation]()** > -> **Acceptance Rate** : **72.7 %** +> **Acceptance Rate** : **72.73 %** ------ diff --git a/markdowns/_414. Third Maximum Number.md b/markdowns/_414. Third Maximum Number.md index 0a3d5d33..d199fe2c 100644 --- a/markdowns/_414. Third Maximum Number.md +++ b/markdowns/_414. Third Maximum Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sorting]()** > -> **Acceptance Rate** : **35.34 %** +> **Acceptance Rate** : **35.38 %** ------ diff --git a/markdowns/_419. Battleships in a Board.md b/markdowns/_419. Battleships in a Board.md index 6417fa3b..10dcad43 100644 --- a/markdowns/_419. Battleships in a Board.md +++ b/markdowns/_419. Battleships in a Board.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Depth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **75.54 %** +> **Acceptance Rate** : **75.56 %** ------ diff --git a/markdowns/_424. Longest Repeating Character Replacement.md b/markdowns/_424. Longest Repeating Character Replacement.md index 8b5ef24e..209fa58d 100644 --- a/markdowns/_424. Longest Repeating Character Replacement.md +++ b/markdowns/_424. Longest Repeating Character Replacement.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Sliding Window]()** > -> **Acceptance Rate** : **54.75 %** +> **Acceptance Rate** : **54.84 %** ------ diff --git a/markdowns/_426. Convert Binary Search Tree to Sorted Doubly Linked List.md b/markdowns/_426. Convert Binary Search Tree to Sorted Doubly Linked List.md index 7170f90e..dc23cf83 100644 --- a/markdowns/_426. Convert Binary Search Tree to Sorted Doubly Linked List.md +++ b/markdowns/_426. Convert Binary Search Tree to Sorted Doubly Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Stack](), [Tree](), [Depth-First Search](), [Binary Search Tree](), [Binary Tree](), [Doubly-Linked List]()** > -> **Acceptance Rate** : **64.88 %** +> **Acceptance Rate** : **64.89 %** ------ diff --git a/markdowns/_429. N-ary Tree Level Order Traversal.md b/markdowns/_429. N-ary Tree Level Order Traversal.md index 59d9dc6a..5e67acc0 100644 --- a/markdowns/_429. N-ary Tree Level Order Traversal.md +++ b/markdowns/_429. N-ary Tree Level Order Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Breadth-First Search]()** > -> **Acceptance Rate** : **70.9 %** +> **Acceptance Rate** : **70.91 %** ------ diff --git a/markdowns/_430. Flatten a Multilevel Doubly Linked List.md b/markdowns/_430. Flatten a Multilevel Doubly Linked List.md index 4436d245..4aca1aa4 100644 --- a/markdowns/_430. Flatten a Multilevel Doubly Linked List.md +++ b/markdowns/_430. Flatten a Multilevel Doubly Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Depth-First Search](), [Doubly-Linked List]()** > -> **Acceptance Rate** : **60.31 %** +> **Acceptance Rate** : **60.33 %** ------ diff --git a/markdowns/_431. Encode N-ary Tree to Binary Tree.md b/markdowns/_431. Encode N-ary Tree to Binary Tree.md index cbfe6e71..7c45cf35 100644 --- a/markdowns/_431. Encode N-ary Tree to Binary Tree.md +++ b/markdowns/_431. Encode N-ary Tree to Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Design](), [Binary Tree]()** > -> **Acceptance Rate** : **79.6 %** +> **Acceptance Rate** : **79.62 %** ------ diff --git a/markdowns/_437. Path Sum III.md b/markdowns/_437. Path Sum III.md index e8301c17..217e4357 100644 --- a/markdowns/_437. Path Sum III.md +++ b/markdowns/_437. Path Sum III.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **46.14 %** +> **Acceptance Rate** : **46.13 %** ------ diff --git a/markdowns/_450. Delete Node in a BST.md b/markdowns/_450. Delete Node in a BST.md index 2a807b72..9676ce6e 100644 --- a/markdowns/_450. Delete Node in a BST.md +++ b/markdowns/_450. Delete Node in a BST.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **51.72 %** +> **Acceptance Rate** : **51.76 %** ------ diff --git a/markdowns/_451. Sort Characters By Frequency.md b/markdowns/_451. Sort Characters By Frequency.md index 3c42c410..05acd7a6 100644 --- a/markdowns/_451. Sort Characters By Frequency.md +++ b/markdowns/_451. Sort Characters By Frequency.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Sorting](), [Heap (Priority Queue)](), [Bucket Sort](), [Counting]()** > -> **Acceptance Rate** : **72.85 %** +> **Acceptance Rate** : **72.87 %** ------ diff --git a/markdowns/_46. Permutations.md b/markdowns/_46. Permutations.md index a6ca49d5..5dae5efe 100644 --- a/markdowns/_46. Permutations.md +++ b/markdowns/_46. Permutations.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Backtracking]()** > -> **Acceptance Rate** : **78.93 %** +> **Acceptance Rate** : **78.98 %** ------ diff --git a/markdowns/_475. Heaters.md b/markdowns/_475. Heaters.md index e8e0ffbb..56ff93ca 100644 --- a/markdowns/_475. Heaters.md +++ b/markdowns/_475. Heaters.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Binary Search](), [Sorting]()** > -> **Acceptance Rate** : **38.29 %** +> **Acceptance Rate** : **38.33 %** ------ diff --git a/markdowns/_48. Rotate Image.md b/markdowns/_48. Rotate Image.md index 31ebba10..de5d912f 100644 --- a/markdowns/_48. Rotate Image.md +++ b/markdowns/_48. Rotate Image.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Matrix]()** > -> **Acceptance Rate** : **75.34 %** +> **Acceptance Rate** : **75.43 %** ------ diff --git a/markdowns/_49. Group Anagrams.md b/markdowns/_49. Group Anagrams.md index da3af69e..899a7d01 100644 --- a/markdowns/_49. Group Anagrams.md +++ b/markdowns/_49. Group Anagrams.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Sorting]()** > -> **Acceptance Rate** : **69.09 %** +> **Acceptance Rate** : **69.14 %** ------ diff --git a/markdowns/_5. Longest Palindromic Substring.md b/markdowns/_5. Longest Palindromic Substring.md index 9010cb0f..9922827e 100644 --- a/markdowns/_5. Longest Palindromic Substring.md +++ b/markdowns/_5. Longest Palindromic Substring.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String](), [Dynamic Programming]()** > -> **Acceptance Rate** : **34.2 %** +> **Acceptance Rate** : **34.24 %** ------ diff --git a/markdowns/_50. Pow(x, n).md b/markdowns/_50. Pow(x, n).md index 471aa0c0..ac3e004a 100644 --- a/markdowns/_50. Pow(x, n).md +++ b/markdowns/_50. Pow(x, n).md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Recursion]()** > -> **Acceptance Rate** : **35.26 %** +> **Acceptance Rate** : **35.3 %** ------ diff --git a/markdowns/_503. Next Greater Element II.md b/markdowns/_503. Next Greater Element II.md index 3c60c455..09b27aa4 100644 --- a/markdowns/_503. Next Greater Element II.md +++ b/markdowns/_503. Next Greater Element II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Monotonic Stack]()** > -> **Acceptance Rate** : **64.4 %** +> **Acceptance Rate** : **64.45 %** ------ diff --git a/markdowns/_509. Fibonacci Number.md b/markdowns/_509. Fibonacci Number.md index 2623cf65..25f8f8f9 100644 --- a/markdowns/_509. Fibonacci Number.md +++ b/markdowns/_509. Fibonacci Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Dynamic Programming](), [Recursion](), [Memoization]()** > -> **Acceptance Rate** : **71.51 %** +> **Acceptance Rate** : **71.56 %** ------ diff --git a/markdowns/_513. Find Bottom Left Tree Value.md b/markdowns/_513. Find Bottom Left Tree Value.md index e47809df..1e8854da 100644 --- a/markdowns/_513. Find Bottom Left Tree Value.md +++ b/markdowns/_513. Find Bottom Left Tree Value.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **71.31 %** +> **Acceptance Rate** : **71.32 %** ------ diff --git a/markdowns/_523. Continuous Subarray Sum.md b/markdowns/_523. Continuous Subarray Sum.md index 4fc26af7..42ca958b 100644 --- a/markdowns/_523. Continuous Subarray Sum.md +++ b/markdowns/_523. Continuous Subarray Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Math](), [Prefix Sum]()** > -> **Acceptance Rate** : **30.28 %** +> **Acceptance Rate** : **30.29 %** ------ diff --git a/markdowns/_535. Encode and Decode TinyURL.md b/markdowns/_535. Encode and Decode TinyURL.md index c1f98dc5..aca57fb9 100644 --- a/markdowns/_535. Encode and Decode TinyURL.md +++ b/markdowns/_535. Encode and Decode TinyURL.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Design](), [Hash Function]()** > -> **Acceptance Rate** : **86.45 %** +> **Acceptance Rate** : **86.46 %** ------ diff --git a/markdowns/_540. Single Element in a Sorted Array.md b/markdowns/_540. Single Element in a Sorted Array.md index 4303d406..6795463b 100644 --- a/markdowns/_540. Single Element in a Sorted Array.md +++ b/markdowns/_540. Single Element in a Sorted Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search]()** > -> **Acceptance Rate** : **59.2 %** +> **Acceptance Rate** : **59.21 %** ------ diff --git a/markdowns/_542. 01 Matrix.md b/markdowns/_542. 01 Matrix.md index 701188db..9b557d2c 100644 --- a/markdowns/_542. 01 Matrix.md +++ b/markdowns/_542. 01 Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming](), [Breadth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **49.13 %** +> **Acceptance Rate** : **49.18 %** ------ diff --git a/markdowns/_543. Diameter of Binary Tree.md b/markdowns/_543. Diameter of Binary Tree.md index 57c8f21e..85962686 100644 --- a/markdowns/_543. Diameter of Binary Tree.md +++ b/markdowns/_543. Diameter of Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **61.09 %** +> **Acceptance Rate** : **61.15 %** ------ diff --git a/markdowns/_56. Merge Intervals.md b/markdowns/_56. Merge Intervals.md index a606970b..a3ec8132 100644 --- a/markdowns/_56. Merge Intervals.md +++ b/markdowns/_56. Merge Intervals.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sorting]()** > -> **Acceptance Rate** : **47.76 %** +> **Acceptance Rate** : **47.78 %** ------ diff --git a/markdowns/_565. Array Nesting.md b/markdowns/_565. Array Nesting.md index 9cb127d0..0d125278 100644 --- a/markdowns/_565. Array Nesting.md +++ b/markdowns/_565. Array Nesting.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Depth-First Search]()** > -> **Acceptance Rate** : **56.3 %** +> **Acceptance Rate** : **56.31 %** ------ diff --git a/markdowns/_567. Permutation in String.md b/markdowns/_567. Permutation in String.md index 3853c3a9..9f2180d4 100644 --- a/markdowns/_567. Permutation in String.md +++ b/markdowns/_567. Permutation in String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Two Pointers](), [String](), [Sliding Window]()** > -> **Acceptance Rate** : **44.61 %** +> **Acceptance Rate** : **44.63 %** ------ diff --git a/markdowns/_57. Insert Interval.md b/markdowns/_57. Insert Interval.md index 36e2dd4c..7bf97e43 100644 --- a/markdowns/_57. Insert Interval.md +++ b/markdowns/_57. Insert Interval.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array]()** > -> **Acceptance Rate** : **41.94 %** +> **Acceptance Rate** : **41.98 %** ------ diff --git a/markdowns/_572. Subtree of Another Tree.md b/markdowns/_572. Subtree of Another Tree.md index deac24db..3c184406 100644 --- a/markdowns/_572. Subtree of Another Tree.md +++ b/markdowns/_572. Subtree of Another Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [String Matching](), [Binary Tree](), [Hash Function]()** > -> **Acceptance Rate** : **48.38 %** +> **Acceptance Rate** : **48.43 %** ------ diff --git a/markdowns/_577. Employee Bonus.md b/markdowns/_577. Employee Bonus.md index 9414778d..7c3f56ae 100644 --- a/markdowns/_577. Employee Bonus.md +++ b/markdowns/_577. Employee Bonus.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **75.81 %** +> **Acceptance Rate** : **75.91 %** ------ diff --git a/markdowns/_584. Find Customer Referee.md b/markdowns/_584. Find Customer Referee.md index 570a0994..de0e87a6 100644 --- a/markdowns/_584. Find Customer Referee.md +++ b/markdowns/_584. Find Customer Referee.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **70.39 %** +> **Acceptance Rate** : **70.47 %** ------ diff --git a/markdowns/_586. Customer Placing the Largest Number of Orders.md b/markdowns/_586. Customer Placing the Largest Number of Orders.md index 4f9e5a1f..02418b08 100644 --- a/markdowns/_586. Customer Placing the Largest Number of Orders.md +++ b/markdowns/_586. Customer Placing the Largest Number of Orders.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **64.66 %** +> **Acceptance Rate** : **64.67 %** ------ diff --git a/markdowns/_595. Big Countries.md b/markdowns/_595. Big Countries.md index 5bdc3e0c..b9b88087 100644 --- a/markdowns/_595. Big Countries.md +++ b/markdowns/_595. Big Countries.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **68.08 %** +> **Acceptance Rate** : **68.09 %** ------ diff --git a/markdowns/_596. Classes More Than 5 Students.md b/markdowns/_596. Classes More Than 5 Students.md index 2283399e..ff7c360a 100644 --- a/markdowns/_596. Classes More Than 5 Students.md +++ b/markdowns/_596. Classes More Than 5 Students.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **56.37 %** +> **Acceptance Rate** : **56.52 %** ------ diff --git a/markdowns/_605. Can Place Flowers.md b/markdowns/_605. Can Place Flowers.md index 9424967b..f4ffcb28 100644 --- a/markdowns/_605. Can Place Flowers.md +++ b/markdowns/_605. Can Place Flowers.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy]()** > -> **Acceptance Rate** : **29.0 %** +> **Acceptance Rate** : **28.98 %** ------ diff --git a/markdowns/_606. Construct String from Binary Tree.md b/markdowns/_606. Construct String from Binary Tree.md index 4ca00cd8..c0a58b07 100644 --- a/markdowns/_606. Construct String from Binary Tree.md +++ b/markdowns/_606. Construct String from Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **69.42 %** +> **Acceptance Rate** : **69.43 %** ------ diff --git a/markdowns/_607. Sales Person.md b/markdowns/_607. Sales Person.md index 5aeaa17f..1ec7af3c 100644 --- a/markdowns/_607. Sales Person.md +++ b/markdowns/_607. Sales Person.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **65.73 %** +> **Acceptance Rate** : **65.76 %** ------ diff --git a/markdowns/_61. Rotate List.md b/markdowns/_61. Rotate List.md index e4094c97..82d46535 100644 --- a/markdowns/_61. Rotate List.md +++ b/markdowns/_61. Rotate List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Two Pointers]()** > -> **Acceptance Rate** : **38.33 %** +> **Acceptance Rate** : **38.39 %** ------ diff --git a/markdowns/_611. Valid Triangle Number.md b/markdowns/_611. Valid Triangle Number.md index 9604c9e9..be85111a 100644 --- a/markdowns/_611. Valid Triangle Number.md +++ b/markdowns/_611. Valid Triangle Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Binary Search](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **51.33 %** +> **Acceptance Rate** : **51.35 %** ------ diff --git a/markdowns/_616. Add Bold Tag in String.md b/markdowns/_616. Add Bold Tag in String.md index c7b39720..1c72583b 100644 --- a/markdowns/_616. Add Bold Tag in String.md +++ b/markdowns/_616. Add Bold Tag in String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Trie](), [String Matching]()** > -> **Acceptance Rate** : **49.92 %** +> **Acceptance Rate** : **49.94 %** ------ diff --git a/markdowns/_619. Biggest Single Number.md b/markdowns/_619. Biggest Single Number.md index 80580ca8..4d50f922 100644 --- a/markdowns/_619. Biggest Single Number.md +++ b/markdowns/_619. Biggest Single Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Database]()** > -> **Acceptance Rate** : **64.87 %** +> **Acceptance Rate** : **65.09 %** ------ diff --git a/markdowns/_622. Design Circular Queue.md b/markdowns/_622. Design Circular Queue.md index 3d354f01..52012655 100644 --- a/markdowns/_622. Design Circular Queue.md +++ b/markdowns/_622. Design Circular Queue.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Linked List](), [Design](), [Queue]()** > -> **Acceptance Rate** : **51.7 %** +> **Acceptance Rate** : **51.71 %** ------ diff --git a/markdowns/_637. Average of Levels in Binary Tree.md b/markdowns/_637. Average of Levels in Binary Tree.md index a9a80448..646b4f2c 100644 --- a/markdowns/_637. Average of Levels in Binary Tree.md +++ b/markdowns/_637. Average of Levels in Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **73.03 %** +> **Acceptance Rate** : **73.06 %** ------ diff --git a/markdowns/_645. Set Mismatch.md b/markdowns/_645. Set Mismatch.md index 7d4e20e6..1a911eb8 100644 --- a/markdowns/_645. Set Mismatch.md +++ b/markdowns/_645. Set Mismatch.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Bit Manipulation](), [Sorting]()** > -> **Acceptance Rate** : **44.5 %** +> **Acceptance Rate** : **44.51 %** ------ diff --git a/markdowns/_647. Palindromic Substrings.md b/markdowns/_647. Palindromic Substrings.md index 697b54c9..27a879d6 100644 --- a/markdowns/_647. Palindromic Substrings.md +++ b/markdowns/_647. Palindromic Substrings.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Two Pointers](), [String](), [Dynamic Programming]()** > -> **Acceptance Rate** : **70.45 %** +> **Acceptance Rate** : **70.48 %** ------ diff --git a/markdowns/_651. 4 Keys Keyboard.md b/markdowns/_651. 4 Keys Keyboard.md index 815fa4a3..1be3e9d8 100644 --- a/markdowns/_651. 4 Keys Keyboard.md +++ b/markdowns/_651. 4 Keys Keyboard.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Dynamic Programming]()** > -> **Acceptance Rate** : **55.85 %** +> **Acceptance Rate** : **55.83 %** ------ diff --git a/markdowns/_653. Two Sum IV - Input is a BST.md b/markdowns/_653. Two Sum IV - Input is a BST.md index 998cb7af..e0ad7b8f 100644 --- a/markdowns/_653. Two Sum IV - Input is a BST.md +++ b/markdowns/_653. Two Sum IV - Input is a BST.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Two Pointers](), [Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **61.45 %** +> **Acceptance Rate** : **61.46 %** ------ diff --git a/markdowns/_654. Maximum Binary Tree.md b/markdowns/_654. Maximum Binary Tree.md index 6ad4feb4..f30d1793 100644 --- a/markdowns/_654. Maximum Binary Tree.md +++ b/markdowns/_654. Maximum Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Divide and Conquer](), [Stack](), [Tree](), [Monotonic Stack](), [Binary Tree]()** > -> **Acceptance Rate** : **85.52 %** +> **Acceptance Rate** : **85.54 %** ------ diff --git a/markdowns/_66. Plus One.md b/markdowns/_66. Plus One.md index d2b6963a..23120545 100644 --- a/markdowns/_66. Plus One.md +++ b/markdowns/_66. Plus One.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math]()** > -> **Acceptance Rate** : **45.83 %** +> **Acceptance Rate** : **45.88 %** ------ diff --git a/markdowns/_663. Equal Tree Partition.md b/markdowns/_663. Equal Tree Partition.md index a731bba1..0fea0f8b 100644 --- a/markdowns/_663. Equal Tree Partition.md +++ b/markdowns/_663. Equal Tree Partition.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **41.54 %** +> **Acceptance Rate** : **41.55 %** ------ diff --git a/markdowns/_666. Path Sum IV.md b/markdowns/_666. Path Sum IV.md index 4458d8c8..cd074d57 100644 --- a/markdowns/_666. Path Sum IV.md +++ b/markdowns/_666. Path Sum IV.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **61.41 %** +> **Acceptance Rate** : **61.43 %** ------ diff --git a/markdowns/_687. Longest Univalue Path.md b/markdowns/_687. Longest Univalue Path.md index 5dd10b53..825f23e9 100644 --- a/markdowns/_687. Longest Univalue Path.md +++ b/markdowns/_687. Longest Univalue Path.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **41.74 %** +> **Acceptance Rate** : **41.76 %** ------ diff --git a/markdowns/_69. Sqrt(x).md b/markdowns/_69. Sqrt(x).md index 6506af4a..0f9d1c51 100644 --- a/markdowns/_69. Sqrt(x).md +++ b/markdowns/_69. Sqrt(x).md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Binary Search]()** > -> **Acceptance Rate** : **39.15 %** +> **Acceptance Rate** : **39.18 %** ------ diff --git a/markdowns/_690. Employee Importance.md b/markdowns/_690. Employee Importance.md index 6c3316fd..1f5045fc 100644 --- a/markdowns/_690. Employee Importance.md +++ b/markdowns/_690. Employee Importance.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Tree](), [Depth-First Search](), [Breadth-First Search]()** > -> **Acceptance Rate** : **67.27 %** +> **Acceptance Rate** : **67.29 %** ------ diff --git a/markdowns/_692. Top K Frequent Words.md b/markdowns/_692. Top K Frequent Words.md index b3288866..0d37e564 100644 --- a/markdowns/_692. Top K Frequent Words.md +++ b/markdowns/_692. Top K Frequent Words.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String](), [Trie](), [Sorting](), [Heap (Priority Queue)](), [Bucket Sort](), [Counting]()** > -> **Acceptance Rate** : **58.28 %** +> **Acceptance Rate** : **58.3 %** ------ diff --git a/markdowns/_695. Max Area of Island.md b/markdowns/_695. Max Area of Island.md index eec54623..4bb7c643 100644 --- a/markdowns/_695. Max Area of Island.md +++ b/markdowns/_695. Max Area of Island.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Depth-First Search](), [Breadth-First Search](), [Union Find](), [Matrix]()** > -> **Acceptance Rate** : **72.36 %** +> **Acceptance Rate** : **72.37 %** ------ diff --git a/markdowns/_7. Reverse Integer.md b/markdowns/_7. Reverse Integer.md index 30a89a82..3e345a50 100644 --- a/markdowns/_7. Reverse Integer.md +++ b/markdowns/_7. Reverse Integer.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math]()** > -> **Acceptance Rate** : **28.94 %** +> **Acceptance Rate** : **28.97 %** ------ diff --git a/markdowns/_70. Climbing Stairs.md b/markdowns/_70. Climbing Stairs.md index bbc91682..6838c9cf 100644 --- a/markdowns/_70. Climbing Stairs.md +++ b/markdowns/_70. Climbing Stairs.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math](), [Dynamic Programming](), [Memoization]()** > -> **Acceptance Rate** : **53.03 %** +> **Acceptance Rate** : **53.05 %** ------ diff --git a/markdowns/_700. Search in a Binary Search Tree.md b/markdowns/_700. Search in a Binary Search Tree.md index 9b6e6427..7625c9b5 100644 --- a/markdowns/_700. Search in a Binary Search Tree.md +++ b/markdowns/_700. Search in a Binary Search Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **80.32 %** +> **Acceptance Rate** : **80.36 %** ------ diff --git a/markdowns/_703. Kth Largest Element in a Stream.md b/markdowns/_703. Kth Largest Element in a Stream.md index 2db65e76..348dd2cc 100644 --- a/markdowns/_703. Kth Largest Element in a Stream.md +++ b/markdowns/_703. Kth Largest Element in a Stream.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Design](), [Binary Search Tree](), [Heap (Priority Queue)](), [Binary Tree](), [Data Stream]()** > -> **Acceptance Rate** : **57.05 %** +> **Acceptance Rate** : **57.08 %** ------ diff --git a/markdowns/_707. Design Linked List.md b/markdowns/_707. Design Linked List.md index bcfe6336..71df53d9 100644 --- a/markdowns/_707. Design Linked List.md +++ b/markdowns/_707. Design Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Design]()** > -> **Acceptance Rate** : **28.34 %** +> **Acceptance Rate** : **28.36 %** ------ diff --git a/markdowns/_708. Insert into a Sorted Circular Linked List.md b/markdowns/_708. Insert into a Sorted Circular Linked List.md index 39797168..e41e6435 100644 --- a/markdowns/_708. Insert into a Sorted Circular Linked List.md +++ b/markdowns/_708. Insert into a Sorted Circular Linked List.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List]()** > -> **Acceptance Rate** : **36.46 %** +> **Acceptance Rate** : **36.47 %** ------ diff --git a/markdowns/_71. Simplify Path.md b/markdowns/_71. Simplify Path.md index 84f5d555..a6610660 100644 --- a/markdowns/_71. Simplify Path.md +++ b/markdowns/_71. Simplify Path.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack]()** > -> **Acceptance Rate** : **43.55 %** +> **Acceptance Rate** : **43.64 %** ------ diff --git a/markdowns/_713. Subarray Product Less Than K.md b/markdowns/_713. Subarray Product Less Than K.md index 215db324..6c484cb6 100644 --- a/markdowns/_713. Subarray Product Less Than K.md +++ b/markdowns/_713. Subarray Product Less Than K.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Sliding Window]()** > -> **Acceptance Rate** : **51.63 %** +> **Acceptance Rate** : **51.66 %** ------ diff --git a/markdowns/_720. Longest Word in Dictionary.md b/markdowns/_720. Longest Word in Dictionary.md index 6376fb46..533dc991 100644 --- a/markdowns/_720. Longest Word in Dictionary.md +++ b/markdowns/_720. Longest Word in Dictionary.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Trie](), [Sorting]()** > -> **Acceptance Rate** : **52.63 %** +> **Acceptance Rate** : **52.64 %** ------ diff --git a/markdowns/_725. Split Linked List in Parts.md b/markdowns/_725. Split Linked List in Parts.md index 81effdb2..53c97b1b 100644 --- a/markdowns/_725. Split Linked List in Parts.md +++ b/markdowns/_725. Split Linked List in Parts.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List]()** > -> **Acceptance Rate** : **64.25 %** +> **Acceptance Rate** : **64.26 %** ------ diff --git a/markdowns/_735. Asteroid Collision.md b/markdowns/_735. Asteroid Collision.md index 89fabfe7..226abf0d 100644 --- a/markdowns/_735. Asteroid Collision.md +++ b/markdowns/_735. Asteroid Collision.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Simulation]()** > -> **Acceptance Rate** : **44.58 %** +> **Acceptance Rate** : **44.62 %** ------ diff --git a/markdowns/_739. Daily Temperatures.md b/markdowns/_739. Daily Temperatures.md index a26e40e2..a2a44e75 100644 --- a/markdowns/_739. Daily Temperatures.md +++ b/markdowns/_739. Daily Temperatures.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Monotonic Stack]()** > -> **Acceptance Rate** : **66.21 %** +> **Acceptance Rate** : **66.24 %** ------ diff --git a/markdowns/_74. Search a 2D Matrix.md b/markdowns/_74. Search a 2D Matrix.md index 6a9fcbb4..a85a9297 100644 --- a/markdowns/_74. Search a 2D Matrix.md +++ b/markdowns/_74. Search a 2D Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search](), [Matrix]()** > -> **Acceptance Rate** : **50.72 %** +> **Acceptance Rate** : **50.77 %** ------ diff --git a/markdowns/_743. Network Delay Time.md b/markdowns/_743. Network Delay Time.md index dec5e348..a69344d1 100644 --- a/markdowns/_743. Network Delay Time.md +++ b/markdowns/_743. Network Delay Time.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Depth-First Search](), [Breadth-First Search](), [Graph](), [Heap (Priority Queue)](), [Shortest Path]()** > -> **Acceptance Rate** : **54.63 %** +> **Acceptance Rate** : **54.71 %** ------ diff --git a/markdowns/_744. Find Smallest Letter Greater Than Target.md b/markdowns/_744. Find Smallest Letter Greater Than Target.md index d6dd455b..8e97a4b5 100644 --- a/markdowns/_744. Find Smallest Letter Greater Than Target.md +++ b/markdowns/_744. Find Smallest Letter Greater Than Target.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Binary Search]()** > -> **Acceptance Rate** : **52.52 %** +> **Acceptance Rate** : **52.56 %** ------ diff --git a/markdowns/_746. Min Cost Climbing Stairs.md b/markdowns/_746. Min Cost Climbing Stairs.md index f3cc9a66..f78a2588 100644 --- a/markdowns/_746. Min Cost Climbing Stairs.md +++ b/markdowns/_746. Min Cost Climbing Stairs.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Dynamic Programming]()** > -> **Acceptance Rate** : **66.04 %** +> **Acceptance Rate** : **66.07 %** ------ diff --git a/markdowns/_75. Sort Colors.md b/markdowns/_75. Sort Colors.md index cf2b70da..afcc0abd 100644 --- a/markdowns/_75. Sort Colors.md +++ b/markdowns/_75. Sort Colors.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Sorting]()** > -> **Acceptance Rate** : **64.48 %** +> **Acceptance Rate** : **64.57 %** ------ diff --git a/markdowns/_758. Bold Words in String.md b/markdowns/_758. Bold Words in String.md index f11abaa6..32949ee0 100644 --- a/markdowns/_758. Bold Words in String.md +++ b/markdowns/_758. Bold Words in String.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [String](), [Trie](), [String Matching]()** > -> **Acceptance Rate** : **51.56 %** +> **Acceptance Rate** : **51.57 %** ------ diff --git a/markdowns/_77. Combinations.md b/markdowns/_77. Combinations.md index 46aac45a..3dadc409 100644 --- a/markdowns/_77. Combinations.md +++ b/markdowns/_77. Combinations.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Backtracking]()** > -> **Acceptance Rate** : **70.95 %** +> **Acceptance Rate** : **70.99 %** ------ diff --git a/markdowns/_771. Jewels and Stones.md b/markdowns/_771. Jewels and Stones.md index 758f844c..cb9e724c 100644 --- a/markdowns/_771. Jewels and Stones.md +++ b/markdowns/_771. Jewels and Stones.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [String]()** > -> **Acceptance Rate** : **88.76 %** +> **Acceptance Rate** : **88.78 %** ------ diff --git a/markdowns/_776. Split BST.md b/markdowns/_776. Split BST.md index 5312364b..9e566311 100644 --- a/markdowns/_776. Split BST.md +++ b/markdowns/_776. Split BST.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Binary Search Tree](), [Recursion](), [Binary Tree]()** > -> **Acceptance Rate** : **82.63 %** +> **Acceptance Rate** : **82.62 %** ------ diff --git a/markdowns/_78. Subsets.md b/markdowns/_78. Subsets.md index c14013cc..268c25bf 100644 --- a/markdowns/_78. Subsets.md +++ b/markdowns/_78. Subsets.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Backtracking](), [Bit Manipulation]()** > -> **Acceptance Rate** : **78.87 %** +> **Acceptance Rate** : **78.92 %** ------ diff --git a/markdowns/_784. Letter Case Permutation.md b/markdowns/_784. Letter Case Permutation.md index 290f6ffd..c45d6b44 100644 --- a/markdowns/_784. Letter Case Permutation.md +++ b/markdowns/_784. Letter Case Permutation.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Backtracking](), [Bit Manipulation]()** > -> **Acceptance Rate** : **74.38 %** +> **Acceptance Rate** : **74.39 %** ------ diff --git a/markdowns/_79. Word Search.md b/markdowns/_79. Word Search.md index 576476c1..51101fcb 100644 --- a/markdowns/_79. Word Search.md +++ b/markdowns/_79. Word Search.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Backtracking](), [Matrix]()** > -> **Acceptance Rate** : **43.32 %** +> **Acceptance Rate** : **43.37 %** ------ diff --git a/markdowns/_794. Valid Tic-Tac-Toe State.md b/markdowns/_794. Valid Tic-Tac-Toe State.md index f61df9b7..c492a21b 100644 --- a/markdowns/_794. Valid Tic-Tac-Toe State.md +++ b/markdowns/_794. Valid Tic-Tac-Toe State.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Matrix]()** > -> **Acceptance Rate** : **34.7 %** +> **Acceptance Rate** : **34.71 %** ------ diff --git a/markdowns/_8. String to Integer (atoi).md b/markdowns/_8. String to Integer (atoi).md index 689b60a7..6581af42 100644 --- a/markdowns/_8. String to Integer (atoi).md +++ b/markdowns/_8. String to Integer (atoi).md @@ -14,7 +14,7 @@ > **Related Topics** : **[String]()** > -> **Acceptance Rate** : **17.68 %** +> **Acceptance Rate** : **17.71 %** ------ diff --git a/markdowns/_807. Max Increase to Keep City Skyline.md b/markdowns/_807. Max Increase to Keep City Skyline.md index c919da3f..f6f28070 100644 --- a/markdowns/_807. Max Increase to Keep City Skyline.md +++ b/markdowns/_807. Max Increase to Keep City Skyline.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Matrix]()** > -> **Acceptance Rate** : **86.19 %** +> **Acceptance Rate** : **86.21 %** ------ diff --git a/markdowns/_817. Linked List Components.md b/markdowns/_817. Linked List Components.md index 9c89602b..448a477f 100644 --- a/markdowns/_817. Linked List Components.md +++ b/markdowns/_817. Linked List Components.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Linked List]()** > -> **Acceptance Rate** : **56.9 %** +> **Acceptance Rate** : **56.88 %** ------ diff --git a/markdowns/_82. Remove Duplicates from Sorted List II.md b/markdowns/_82. Remove Duplicates from Sorted List II.md index 6d4fc5eb..930cd9d4 100644 --- a/markdowns/_82. Remove Duplicates from Sorted List II.md +++ b/markdowns/_82. Remove Duplicates from Sorted List II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Linked List](), [Two Pointers]()** > -> **Acceptance Rate** : **47.99 %** +> **Acceptance Rate** : **48.03 %** ------ diff --git a/markdowns/_826. Most Profit Assigning Work.md b/markdowns/_826. Most Profit Assigning Work.md index 753c63a1..a6390d90 100644 --- a/markdowns/_826. Most Profit Assigning Work.md +++ b/markdowns/_826. Most Profit Assigning Work.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Binary Search](), [Greedy](), [Sorting]()** > -> **Acceptance Rate** : **55.9 %** +> **Acceptance Rate** : **55.91 %** ------ diff --git a/markdowns/_84. Largest Rectangle in Histogram.md b/markdowns/_84. Largest Rectangle in Histogram.md index ec54d46b..4a7d2087 100644 --- a/markdowns/_84. Largest Rectangle in Histogram.md +++ b/markdowns/_84. Largest Rectangle in Histogram.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Monotonic Stack]()** > -> **Acceptance Rate** : **45.12 %** +> **Acceptance Rate** : **45.18 %** ------ diff --git a/markdowns/_840. Magic Squares In Grid.md b/markdowns/_840. Magic Squares In Grid.md index 9a8f035c..8317dc9d 100644 --- a/markdowns/_840. Magic Squares In Grid.md +++ b/markdowns/_840. Magic Squares In Grid.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Math](), [Matrix]()** > -> **Acceptance Rate** : **39.18 %** +> **Acceptance Rate** : **51.72 %** ------ diff --git a/markdowns/_848. Shifting Letters.md b/markdowns/_848. Shifting Letters.md index 9fcd476b..0faa52a6 100644 --- a/markdowns/_848. Shifting Letters.md +++ b/markdowns/_848. Shifting Letters.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [String](), [Prefix Sum]()** > -> **Acceptance Rate** : **44.8 %** +> **Acceptance Rate** : **44.79 %** ------ diff --git a/markdowns/_849. Maximize Distance to Closest Person.md b/markdowns/_849. Maximize Distance to Closest Person.md index 0cde4a7e..f9ce7a77 100644 --- a/markdowns/_849. Maximize Distance to Closest Person.md +++ b/markdowns/_849. Maximize Distance to Closest Person.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array]()** > -> **Acceptance Rate** : **48.24 %** +> **Acceptance Rate** : **48.25 %** ------ diff --git a/markdowns/_853. Car Fleet.md b/markdowns/_853. Car Fleet.md index 2d880f99..a576f352 100644 --- a/markdowns/_853. Car Fleet.md +++ b/markdowns/_853. Car Fleet.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Sorting](), [Monotonic Stack]()** > -> **Acceptance Rate** : **51.58 %** +> **Acceptance Rate** : **51.62 %** ------ diff --git a/markdowns/_856. Score of Parentheses.md b/markdowns/_856. Score of Parentheses.md index ddcdf86d..4054f457 100644 --- a/markdowns/_856. Score of Parentheses.md +++ b/markdowns/_856. Score of Parentheses.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack]()** > -> **Acceptance Rate** : **64.06 %** +> **Acceptance Rate** : **64.05 %** ------ diff --git a/markdowns/_863. All Nodes Distance K in Binary Tree.md b/markdowns/_863. All Nodes Distance K in Binary Tree.md index 339b6553..6f63cf2e 100644 --- a/markdowns/_863. All Nodes Distance K in Binary Tree.md +++ b/markdowns/_863. All Nodes Distance K in Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **64.8 %** +> **Acceptance Rate** : **64.84 %** ------ diff --git a/markdowns/_867. Transpose Matrix.md b/markdowns/_867. Transpose Matrix.md index 69b605d5..2ba8b24c 100644 --- a/markdowns/_867. Transpose Matrix.md +++ b/markdowns/_867. Transpose Matrix.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Matrix](), [Simulation]()** > -> **Acceptance Rate** : **72.15 %** +> **Acceptance Rate** : **72.2 %** ------ diff --git a/markdowns/_877. Stone Game.md b/markdowns/_877. Stone Game.md index 1b039086..2d0bfc08 100644 --- a/markdowns/_877. Stone Game.md +++ b/markdowns/_877. Stone Game.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Dynamic Programming](), [Game Theory]()** > -> **Acceptance Rate** : **70.76 %** +> **Acceptance Rate** : **70.77 %** ------ diff --git a/markdowns/_885. Spiral Matrix III.md b/markdowns/_885. Spiral Matrix III.md index ac17546c..af1a16af 100644 --- a/markdowns/_885. Spiral Matrix III.md +++ b/markdowns/_885. Spiral Matrix III.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Matrix](), [Simulation]()** > -> **Acceptance Rate** : **74.72 %** +> **Acceptance Rate** : **84.53 %** ------ diff --git a/markdowns/_894. All Possible Full Binary Trees.md b/markdowns/_894. All Possible Full Binary Trees.md index 63ddc9a9..0b7d683c 100644 --- a/markdowns/_894. All Possible Full Binary Trees.md +++ b/markdowns/_894. All Possible Full Binary Trees.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Dynamic Programming](), [Tree](), [Recursion](), [Memoization](), [Binary Tree]()** > -> **Acceptance Rate** : **82.75 %** +> **Acceptance Rate** : **82.77 %** ------ diff --git a/markdowns/_895. Maximum Frequency Stack.md b/markdowns/_895. Maximum Frequency Stack.md index e2bc1fee..46e2a7a1 100644 --- a/markdowns/_895. Maximum Frequency Stack.md +++ b/markdowns/_895. Maximum Frequency Stack.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Stack](), [Design](), [Ordered Set]()** > -> **Acceptance Rate** : **66.43 %** +> **Acceptance Rate** : **66.45 %** ------ diff --git a/markdowns/_9. Palindrome Number.md b/markdowns/_9. Palindrome Number.md index 55c1272e..2ac12a5e 100644 --- a/markdowns/_9. Palindrome Number.md +++ b/markdowns/_9. Palindrome Number.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Math]()** > -> **Acceptance Rate** : **57.11 %** +> **Acceptance Rate** : **57.18 %** ------ diff --git a/markdowns/_90. Subsets II.md b/markdowns/_90. Subsets II.md index 2a2190f0..cbe23f36 100644 --- a/markdowns/_90. Subsets II.md +++ b/markdowns/_90. Subsets II.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Backtracking](), [Bit Manipulation]()** > -> **Acceptance Rate** : **57.81 %** +> **Acceptance Rate** : **57.85 %** ------ diff --git a/markdowns/_909. Snakes and Ladders.md b/markdowns/_909. Snakes and Ladders.md index 0d683507..1540a34b 100644 --- a/markdowns/_909. Snakes and Ladders.md +++ b/markdowns/_909. Snakes and Ladders.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Breadth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **43.83 %** +> **Acceptance Rate** : **43.84 %** ------ diff --git a/markdowns/_912. Sort an Array.md b/markdowns/_912. Sort an Array.md index 4af2a079..3b4b7e08 100644 --- a/markdowns/_912. Sort an Array.md +++ b/markdowns/_912. Sort an Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Divide and Conquer](), [Sorting](), [Heap (Priority Queue)](), [Merge Sort](), [Bucket Sort](), [Radix Sort](), [Counting Sort]()** > -> **Acceptance Rate** : **58.07 %** +> **Acceptance Rate** : **58.03 %** ------ diff --git a/markdowns/_919. Complete Binary Tree Inserter.md b/markdowns/_919. Complete Binary Tree Inserter.md index 9cae833a..85e6de76 100644 --- a/markdowns/_919. Complete Binary Tree Inserter.md +++ b/markdowns/_919. Complete Binary Tree Inserter.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Breadth-First Search](), [Design](), [Binary Tree]()** > -> **Acceptance Rate** : **65.84 %** +> **Acceptance Rate** : **65.85 %** ------ diff --git a/markdowns/_921. Minimum Add to Make Parentheses Valid.md b/markdowns/_921. Minimum Add to Make Parentheses Valid.md index b51d2925..c2858115 100644 --- a/markdowns/_921. Minimum Add to Make Parentheses Valid.md +++ b/markdowns/_921. Minimum Add to Make Parentheses Valid.md @@ -14,7 +14,7 @@ > **Related Topics** : **[String](), [Stack](), [Greedy]()** > -> **Acceptance Rate** : **74.95 %** +> **Acceptance Rate** : **74.92 %** ------ diff --git a/markdowns/_930. Binary Subarrays With Sum.md b/markdowns/_930. Binary Subarrays With Sum.md index c87af4b9..26ca7746 100644 --- a/markdowns/_930. Binary Subarrays With Sum.md +++ b/markdowns/_930. Binary Subarrays With Sum.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Sliding Window](), [Prefix Sum]()** > -> **Acceptance Rate** : **63.4 %** +> **Acceptance Rate** : **63.44 %** ------ diff --git a/markdowns/_938. Range Sum of BST.md b/markdowns/_938. Range Sum of BST.md index eb6633e2..a2f099f7 100644 --- a/markdowns/_938. Range Sum of BST.md +++ b/markdowns/_938. Range Sum of BST.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **86.96 %** +> **Acceptance Rate** : **86.98 %** ------ diff --git a/markdowns/_94. Binary Tree Inorder Traversal.md b/markdowns/_94. Binary Tree Inorder Traversal.md index c74092fe..244950c8 100644 --- a/markdowns/_94. Binary Tree Inorder Traversal.md +++ b/markdowns/_94. Binary Tree Inorder Traversal.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Stack](), [Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **76.74 %** +> **Acceptance Rate** : **76.79 %** ------ diff --git a/markdowns/_945. Minimum Increment to Make Array Unique.md b/markdowns/_945. Minimum Increment to Make Array Unique.md index 2b7b679b..1bcba697 100644 --- a/markdowns/_945. Minimum Increment to Make Array Unique.md +++ b/markdowns/_945. Minimum Increment to Make Array Unique.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Greedy](), [Sorting](), [Counting]()** > -> **Acceptance Rate** : **60.02 %** +> **Acceptance Rate** : **60.03 %** ------ diff --git a/markdowns/_946. Validate Stack Sequences.md b/markdowns/_946. Validate Stack Sequences.md index cbfadb41..aaf679fe 100644 --- a/markdowns/_946. Validate Stack Sequences.md +++ b/markdowns/_946. Validate Stack Sequences.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Stack](), [Simulation]()** > -> **Acceptance Rate** : **69.54 %** +> **Acceptance Rate** : **69.53 %** ------ diff --git a/markdowns/_950. Reveal Cards In Increasing Order.md b/markdowns/_950. Reveal Cards In Increasing Order.md index a7bb1ac3..584d89b1 100644 --- a/markdowns/_950. Reveal Cards In Increasing Order.md +++ b/markdowns/_950. Reveal Cards In Increasing Order.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Queue](), [Sorting](), [Simulation]()** > -> **Acceptance Rate** : **83.02 %** +> **Acceptance Rate** : **83.03 %** ------ diff --git a/markdowns/_959. Regions Cut By Slashes.md b/markdowns/_959. Regions Cut By Slashes.md index 4662bca6..3d3b8fde 100644 --- a/markdowns/_959. Regions Cut By Slashes.md +++ b/markdowns/_959. Regions Cut By Slashes.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Depth-First Search](), [Breadth-First Search](), [Union Find](), [Matrix]()** > -> **Acceptance Rate** : **69.49 %** +> **Acceptance Rate** : **77.88 %** ------ diff --git a/markdowns/_973. K Closest Points to Origin.md b/markdowns/_973. K Closest Points to Origin.md index 5ee19157..c542c2e6 100644 --- a/markdowns/_973. K Closest Points to Origin.md +++ b/markdowns/_973. K Closest Points to Origin.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Math](), [Divide and Conquer](), [Geometry](), [Sorting](), [Heap (Priority Queue)](), [Quickselect]()** > -> **Acceptance Rate** : **66.67 %** +> **Acceptance Rate** : **66.71 %** ------ diff --git a/markdowns/_974. Subarray Sums Divisible by K.md b/markdowns/_974. Subarray Sums Divisible by K.md index 16e25412..9c2047fb 100644 --- a/markdowns/_974. Subarray Sums Divisible by K.md +++ b/markdowns/_974. Subarray Sums Divisible by K.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Hash Table](), [Prefix Sum]()** > -> **Acceptance Rate** : **55.47 %** +> **Acceptance Rate** : **55.46 %** ------ diff --git a/markdowns/_977. Squares of a Sorted Array.md b/markdowns/_977. Squares of a Sorted Array.md index dcaee84f..08646bda 100644 --- a/markdowns/_977. Squares of a Sorted Array.md +++ b/markdowns/_977. Squares of a Sorted Array.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Two Pointers](), [Sorting]()** > -> **Acceptance Rate** : **72.91 %** +> **Acceptance Rate** : **72.93 %** ------ diff --git a/markdowns/_979. Distribute Coins in Binary Tree.md b/markdowns/_979. Distribute Coins in Binary Tree.md index c966d001..aca23cae 100644 --- a/markdowns/_979. Distribute Coins in Binary Tree.md +++ b/markdowns/_979. Distribute Coins in Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **77.12 %** +> **Acceptance Rate** : **77.13 %** ------ diff --git a/markdowns/_98. Validate Binary Search Tree.md b/markdowns/_98. Validate Binary Search Tree.md index 363787da..2f38139d 100644 --- a/markdowns/_98. Validate Binary Search Tree.md +++ b/markdowns/_98. Validate Binary Search Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Binary Search Tree](), [Binary Tree]()** > -> **Acceptance Rate** : **33.24 %** +> **Acceptance Rate** : **33.26 %** ------ diff --git a/markdowns/_987. Vertical Order Traversal of a Binary Tree.md b/markdowns/_987. Vertical Order Traversal of a Binary Tree.md index db5a7792..450bab60 100644 --- a/markdowns/_987. Vertical Order Traversal of a Binary Tree.md +++ b/markdowns/_987. Vertical Order Traversal of a Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Hash Table](), [Tree](), [Depth-First Search](), [Breadth-First Search](), [Sorting](), [Binary Tree]()** > -> **Acceptance Rate** : **48.39 %** +> **Acceptance Rate** : **48.46 %** ------ diff --git a/markdowns/_993. Cousins in Binary Tree.md b/markdowns/_993. Cousins in Binary Tree.md index 6e5f40bc..91bee809 100644 --- a/markdowns/_993. Cousins in Binary Tree.md +++ b/markdowns/_993. Cousins in Binary Tree.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Tree](), [Depth-First Search](), [Breadth-First Search](), [Binary Tree]()** > -> **Acceptance Rate** : **56.49 %** +> **Acceptance Rate** : **56.52 %** ------ diff --git a/markdowns/_994. Rotting Oranges.md b/markdowns/_994. Rotting Oranges.md index 9026c074..cd14b542 100644 --- a/markdowns/_994. Rotting Oranges.md +++ b/markdowns/_994. Rotting Oranges.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Breadth-First Search](), [Matrix]()** > -> **Acceptance Rate** : **54.66 %** +> **Acceptance Rate** : **54.71 %** ------ diff --git a/markdowns/_995. Minimum Number of K Consecutive Bit Flips.md b/markdowns/_995. Minimum Number of K Consecutive Bit Flips.md index b78490a4..7b6e5570 100644 --- a/markdowns/_995. Minimum Number of K Consecutive Bit Flips.md +++ b/markdowns/_995. Minimum Number of K Consecutive Bit Flips.md @@ -14,7 +14,7 @@ > **Related Topics** : **[Array](), [Bit Manipulation](), [Queue](), [Sliding Window](), [Prefix Sum]()** > -> **Acceptance Rate** : **62.73 %** +> **Acceptance Rate** : **62.72 %** ------ diff --git a/markdowns/by_topic/Array.md b/markdowns/by_topic/Array.md index 7d629e57..d8a77760 100644 --- a/markdowns/by_topic/Array.md +++ b/markdowns/by_topic/Array.md @@ -1,4 +1,4 @@ -# [Array]() (228 completed) +# [Array]() (233 completed) *[Back to top](<../../README.md>)* @@ -149,6 +149,7 @@ | 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<../_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | | 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | | 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution](<../_1564. Put Boxes Into the Warehouse I.md>) | py | Jun 15, 2024 | +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<../_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | | 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | | 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<../_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 15, 2024 | | 1598 | [Crawler Log Folder]() | Easy | Daily | [solution](<../_1598. Crawler Log Folder.md>) | c, js | Jul 10, 2024 | @@ -233,4 +234,8 @@ | 3213 | Weekly Contest 405 - q4 - [Construct String with Minimum Cost]() | Hard | Contest | [solution](<../_3213. Construct String with Minimum Cost.md>) | py | Jul 07, 2024 | | 3229 | Weekly Contest 407 - q4 - [Minimum Operations to Make Array Equal to Target]() | Hard | Contest | [solution](<../_3229. Minimum Operations to Make Array Equal to Target.md>) | py | Jul 21, 2024 | | 3232 | Weekly Contest 408 - q1 - [Find if Digit Game Can Be Won]() | Easy | Contest | [solution](<../_3232. Find if Digit Game Can Be Won.md>) | py | Jul 28, 2024 | -| 3233 | Weekly Contest 408 - q2 - [Find the Count of Numbers Which Are Not Special]() | Medium | Contest | [solution](<../_3233. Find the Count of Numbers Which Are Not Special.md>) | java, py | Jul 28, 2024 | \ No newline at end of file +| 3233 | Weekly Contest 408 - q2 - [Find the Count of Numbers Which Are Not Special]() | Medium | Contest | [solution](<../_3233. Find the Count of Numbers Which Are Not Special.md>) | java, py | Jul 28, 2024 | +| 3238 | Biweekly Contest 136 - q1 - [Find the Number of Winning Players]() | Easy | Contest | [solution](<../_3238. Find the Number of Winning Players.md>) | py | Aug 03, 2024 | +| 3239 | Biweekly Contest 136 - q2 - [Minimum Number of Flips to Make Binary Grid Palindromic I]() | Medium | Contest | [solution](<../_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md>) | py | Aug 03, 2024 | +| 3240 | Biweekly Contest 136 - q3 - [Minimum Number of Flips to Make Binary Grid Palindromic II]() | Medium | Contest | [solution](<../_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md>) | py | Aug 03, 2024 | +| 3242 | [Design Neighbor Sum Service]() | Easy | | [solution](<../_3242. Design Neighbor Sum Service.md>) | py | Aug 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Breadth-First Search.md b/markdowns/by_topic/Breadth-First Search.md index c06ca8a9..f411c268 100644 --- a/markdowns/by_topic/Breadth-First Search.md +++ b/markdowns/by_topic/Breadth-First Search.md @@ -1,4 +1,4 @@ -# [Breadth-First Search]() (53 completed) +# [Breadth-First Search]() (54 completed) *[Back to top](<../../README.md>)* @@ -46,6 +46,7 @@ | 1448 | [Count Good Nodes in Binary Tree]() | Medium | N150 | [solution](<../_1448. Count Good Nodes in Binary Tree.md>) | java | Jul 04, 2024 | | 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution](<../_1457. Pseudo-Palindromic Paths in a Binary Tree.md>) | py | Jul 05, 2024 | | 1490 | [Clone N-ary Tree]() | Medium | | [solution](<../_1490. Clone N-ary Tree.md>) | java, py | Jun 02, 2024 | +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<../_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | | 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution](<../_1602. Find Nearest Right Node in Binary Tree.md>) | java, py | Jul 03, 2024 | | 1609 | [Even Odd Tree]() | Medium | | [solution](<../_1609. Even Odd Tree.md>) | py | Jul 05, 2024 | | 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 27, 2024 | diff --git a/markdowns/by_topic/Counting.md b/markdowns/by_topic/Counting.md index 82c6cc44..550a789a 100644 --- a/markdowns/by_topic/Counting.md +++ b/markdowns/by_topic/Counting.md @@ -1,4 +1,4 @@ -# [Counting]() (21 completed) +# [Counting]() (22 completed) *[Back to top](<../../README.md>)* @@ -26,4 +26,5 @@ | 3184 | Weekly Contest 402 - q1 - [Count Pairs That Form a Complete Day I]() | Easy | Contest | [solution](<../_3184. Count Pairs That Form a Complete Day I.md>) | py | Jul 07, 2024 | | 3185 | Weekly Contest 402 - q2 - [Count Pairs That Form a Complete Day II]() | Medium | Contest | [solution](<../_3185. Count Pairs That Form a Complete Day II.md>) | py | Jul 07, 2024 | | 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting]() | Medium | Contest | [solution](<../_3186. Maximum Total Damage With Spell Casting.md>) | py | Jul 07, 2024 | -| 3228 | Weekly Contest 407 - q3 - [Maximum Number of Operations to Move Ones to the End]() | Medium | Contest | [solution](<../_3228. Maximum Number of Operations to Move Ones to the End.md>) | py | Jul 21, 2024 | \ No newline at end of file +| 3228 | Weekly Contest 407 - q3 - [Maximum Number of Operations to Move Ones to the End]() | Medium | Contest | [solution](<../_3228. Maximum Number of Operations to Move Ones to the End.md>) | py | Jul 21, 2024 | +| 3238 | Biweekly Contest 136 - q1 - [Find the Number of Winning Players]() | Easy | Contest | [solution](<../_3238. Find the Number of Winning Players.md>) | py | Aug 03, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Depth-First Search.md b/markdowns/by_topic/Depth-First Search.md index c8d46e35..ed59b396 100644 --- a/markdowns/by_topic/Depth-First Search.md +++ b/markdowns/by_topic/Depth-First Search.md @@ -1,4 +1,4 @@ -# [Depth-First Search]() (80 completed) +# [Depth-First Search]() (81 completed) *[Back to top](<../../README.md>)* @@ -73,6 +73,7 @@ | 1490 | [Clone N-ary Tree]() | Medium | | [solution](<../_1490. Clone N-ary Tree.md>) | java, py | Jun 02, 2024 | | 1522 | [Diameter of N-Ary Tree]() | Medium | | [solution](<../_1522. Diameter of N-Ary Tree.md>) | py | Jul 03, 2024 | | 1530 | [Number of Good Leaf Nodes Pairs]() | Medium | Daily | [solution](<../_1530. Number of Good Leaf Nodes Pairs.md>) | py | Jul 18, 2024 | +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<../_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | | 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 27, 2024 | | 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution](<../_1676. Lowest Common Ancestor of a Binary Tree IV.md>) | py | Jun 29, 2024 | | 1740 | [Find Distance in a Binary Tree]() | Medium | Weekly Premium | [solution](<../_1740. Find Distance in a Binary Tree.md>) | py | Jul 15, 2024 | diff --git a/markdowns/by_topic/Design.md b/markdowns/by_topic/Design.md index ef1b5893..6d021b3e 100644 --- a/markdowns/by_topic/Design.md +++ b/markdowns/by_topic/Design.md @@ -1,4 +1,4 @@ -# [Design]() (27 completed) +# [Design]() (28 completed) *[Back to top](<../../README.md>)* @@ -32,4 +32,5 @@ | 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | | 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | | 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2671 | [Frequency Tracker]() | Medium | | [solution](<../_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | \ No newline at end of file +| 2671 | [Frequency Tracker]() | Medium | | [solution](<../_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | +| 3242 | [Design Neighbor Sum Service]() | Easy | | [solution](<../_3242. Design Neighbor Sum Service.md>) | py | Aug 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Hash Table.md b/markdowns/by_topic/Hash Table.md index 533ea670..8e2511f3 100644 --- a/markdowns/by_topic/Hash Table.md +++ b/markdowns/by_topic/Hash Table.md @@ -1,4 +1,4 @@ -# [Hash Table]() (109 completed) +# [Hash Table]() (110 completed) *[Back to top](<../../README.md>)* @@ -111,7 +111,8 @@ | 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 22, 2024 | | 3016 | [Minimum Number of Pushes to Type Word II]() | Medium | Daily | [solution](<../_3016. Minimum Number of Pushes to Type Word II.md>) | py | Aug 06, 2024 | | 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 28, 2024 | -| 3174 | Biweekly Contest 132 - q1 - [Clear Digits]() | Easy | Contest | [solution](<../_3174. Clear Digits.md>) | py | Jul 07, 2024 | | 3184 | Weekly Contest 402 - q1 - [Count Pairs That Form a Complete Day I]() | Easy | Contest | [solution](<../_3184. Count Pairs That Form a Complete Day I.md>) | py | Jul 07, 2024 | | 3185 | Weekly Contest 402 - q2 - [Count Pairs That Form a Complete Day II]() | Medium | Contest | [solution](<../_3185. Count Pairs That Form a Complete Day II.md>) | py | Jul 07, 2024 | -| 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting]() | Medium | Contest | [solution](<../_3186. Maximum Total Damage With Spell Casting.md>) | py | Jul 07, 2024 | \ No newline at end of file +| 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting]() | Medium | Contest | [solution](<../_3186. Maximum Total Damage With Spell Casting.md>) | py | Jul 07, 2024 | +| 3238 | Biweekly Contest 136 - q1 - [Find the Number of Winning Players]() | Easy | Contest | [solution](<../_3238. Find the Number of Winning Players.md>) | py | Aug 03, 2024 | +| 3242 | [Design Neighbor Sum Service]() | Easy | | [solution](<../_3242. Design Neighbor Sum Service.md>) | py | Aug 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Matrix.md b/markdowns/by_topic/Matrix.md index 330a422e..8261526c 100644 --- a/markdowns/by_topic/Matrix.md +++ b/markdowns/by_topic/Matrix.md @@ -1,47 +1,51 @@ -# [Matrix]() (39 completed) +# [Matrix]() (43 completed) *[Back to top](<../../README.md>)* ------ -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------------------|:------------|:----------------| -| 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 15, 2024 | -| 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<../_74. Search a 2D Matrix.md>) | py | Jun 15, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 17, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | -| 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 15, 2024 | -| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution](<../_348. Design Tic-Tac-Toe.md>) | py | Jul 05, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 24, 2024 | -| 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | -| 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 24, 2024 | -| 794 | [Valid Tic-Tac-Toe State]() | Medium | | [solution](<../_794. Valid Tic-Tac-Toe State.md>) | py | Jul 05, 2024 | -| 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<../_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | -| 840 | [Magic Squares In Grid]() | Medium | Daily | [solution](<../_840. Magic Squares In Grid.md>) | py | Aug 09, 2024 | -| 861 | [Score After Flipping Matrix]() | Medium | | [solution](<../_861. Score After Flipping Matrix.md>) | c, py | Jun 10, 2024 | -| 867 | [Transpose Matrix]() | Easy | | [solution](<../_867. Transpose Matrix.md>) | py | Jun 15, 2024 | -| 885 | [Spiral Matrix III]() | Medium | Daily | [solution](<../_885. Spiral Matrix III.md>) | py | Aug 08, 2024 | -| 909 | [Snakes and Ladders]() | Medium | | [solution](<../_909. Snakes and Ladders.md>) | py | Jun 12, 2024 | -| 959 | [Regions Cut By Slashes]() | Medium | Daily | [solution](<../_959. Regions Cut By Slashes.md>) | py | Aug 10, 2024 | -| 994 | [Rotting Oranges]() | Medium | N150 | [solution](<../_994. Rotting Oranges.md>) | py | Jun 15, 2024 | -| 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | -| 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 04, 2024 | -| 1254 | [Number of Closed Islands]() | Medium | | [solution](<../_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | -| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix]() | Hard | | [solution](<../_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>) | py | Jun 09, 2024 | -| 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution](<../_1351. Count Negative Numbers in a Sorted Matrix.md>) | java, py | Jun 01, 2024 | -| 1380 | [Lucky Numbers in a Matrix]() | Easy | Daily | [solution](<../_1380. Lucky Numbers in a Matrix.md>) | js, py | Jul 19, 2024 | -| 1605 | [Find Valid Matrix Given Row and Column Sums]() | Medium | Daily | [solution](<../_1605. Find Valid Matrix Given Row and Column Sums.md>) | py | Jul 20, 2024 | -| 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<../_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | -| 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | -| 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 24, 2024 | -| 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 15, 2024 | -| 2304 | [Minimum Path Cost in a Grid]() | Medium | | [solution](<../_2304. Minimum Path Cost in a Grid.md>) | py | Jul 29, 2024 | -| 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 27, 2024 | -| 2392 | [Build a Matrix With Conditions]() | Hard | Daily | [solution](<../_2392. Build a Matrix With Conditions.md>) | py | Jul 21, 2024 | -| 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution](<../_2482. Difference Between Ones and Zeros in Row and Column.md>) | py | Jun 07, 2024 | -| 2545 | [Sort the Students by Their Kth Score]() | Medium | | [solution](<../_2545. Sort the Students by Their Kth Score.md>) | java, py | Jun 24, 2024 | -| 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | -| 3195 | Weekly Contest 403 - q2 - [Find the Minimum Area to Cover All Ones I]() | Medium | Contest | [solution](<../_3195. Find the Minimum Area to Cover All Ones I.md>) | py | Jul 07, 2024 | -| 3212 | Weekly Contest 405 - q3 - [Count Submatrices With Equal Frequency of X and Y]() | Medium | Contest | [solution](<../_3212. Count Submatrices With Equal Frequency of X and Y.md>) | py | Jul 07, 2024 | \ No newline at end of file +| # | Title | Level | Cats | Solution | Languages | Date Complete | +|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------------------|:------------|:----------------| +| 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | +| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 15, 2024 | +| 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<../_74. Search a 2D Matrix.md>) | py | Jun 15, 2024 | +| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | +| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 17, 2024 | +| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | +| 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 15, 2024 | +| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution](<../_348. Design Tic-Tac-Toe.md>) | py | Jul 05, 2024 | +| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 24, 2024 | +| 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | +| 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 24, 2024 | +| 794 | [Valid Tic-Tac-Toe State]() | Medium | | [solution](<../_794. Valid Tic-Tac-Toe State.md>) | py | Jul 05, 2024 | +| 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<../_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | +| 840 | [Magic Squares In Grid]() | Medium | Daily | [solution](<../_840. Magic Squares In Grid.md>) | py | Aug 09, 2024 | +| 861 | [Score After Flipping Matrix]() | Medium | | [solution](<../_861. Score After Flipping Matrix.md>) | c, py | Jun 10, 2024 | +| 867 | [Transpose Matrix]() | Easy | | [solution](<../_867. Transpose Matrix.md>) | py | Jun 15, 2024 | +| 885 | [Spiral Matrix III]() | Medium | Daily | [solution](<../_885. Spiral Matrix III.md>) | py | Aug 08, 2024 | +| 909 | [Snakes and Ladders]() | Medium | | [solution](<../_909. Snakes and Ladders.md>) | py | Jun 12, 2024 | +| 959 | [Regions Cut By Slashes]() | Medium | Daily | [solution](<../_959. Regions Cut By Slashes.md>) | py | Aug 10, 2024 | +| 994 | [Rotting Oranges]() | Medium | N150 | [solution](<../_994. Rotting Oranges.md>) | py | Jun 15, 2024 | +| 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | +| 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 04, 2024 | +| 1254 | [Number of Closed Islands]() | Medium | | [solution](<../_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | +| 1284 | [Minimum Number of Flips to Convert Binary Matrix to Zero Matrix]() | Hard | | [solution](<../_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>) | py | Jun 09, 2024 | +| 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution](<../_1351. Count Negative Numbers in a Sorted Matrix.md>) | java, py | Jun 01, 2024 | +| 1380 | [Lucky Numbers in a Matrix]() | Easy | Daily | [solution](<../_1380. Lucky Numbers in a Matrix.md>) | js, py | Jul 19, 2024 | +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<../_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | +| 1605 | [Find Valid Matrix Given Row and Column Sums]() | Medium | Daily | [solution](<../_1605. Find Valid Matrix Given Row and Column Sums.md>) | py | Jul 20, 2024 | +| 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<../_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | +| 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | +| 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 24, 2024 | +| 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 15, 2024 | +| 2304 | [Minimum Path Cost in a Grid]() | Medium | | [solution](<../_2304. Minimum Path Cost in a Grid.md>) | py | Jul 29, 2024 | +| 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 27, 2024 | +| 2392 | [Build a Matrix With Conditions]() | Hard | Daily | [solution](<../_2392. Build a Matrix With Conditions.md>) | py | Jul 21, 2024 | +| 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution](<../_2482. Difference Between Ones and Zeros in Row and Column.md>) | py | Jun 07, 2024 | +| 2545 | [Sort the Students by Their Kth Score]() | Medium | | [solution](<../_2545. Sort the Students by Their Kth Score.md>) | java, py | Jun 24, 2024 | +| 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | +| 3195 | Weekly Contest 403 - q2 - [Find the Minimum Area to Cover All Ones I]() | Medium | Contest | [solution](<../_3195. Find the Minimum Area to Cover All Ones I.md>) | py | Jul 07, 2024 | +| 3212 | Weekly Contest 405 - q3 - [Count Submatrices With Equal Frequency of X and Y]() | Medium | Contest | [solution](<../_3212. Count Submatrices With Equal Frequency of X and Y.md>) | py | Jul 07, 2024 | +| 3239 | Biweekly Contest 136 - q2 - [Minimum Number of Flips to Make Binary Grid Palindromic I]() | Medium | Contest | [solution](<../_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md>) | py | Aug 03, 2024 | +| 3240 | Biweekly Contest 136 - q3 - [Minimum Number of Flips to Make Binary Grid Palindromic II]() | Medium | Contest | [solution](<../_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md>) | py | Aug 03, 2024 | +| 3242 | [Design Neighbor Sum Service]() | Easy | | [solution](<../_3242. Design Neighbor Sum Service.md>) | py | Aug 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Segment Tree.md b/markdowns/by_topic/Segment Tree.md new file mode 100644 index 00000000..48d6d934 --- /dev/null +++ b/markdowns/by_topic/Segment Tree.md @@ -0,0 +1,9 @@ +# [Segment Tree]() (1 completed) + +*[Back to top](<../../README.md>)* + +------ + +| # | Title | Level | Cats | Solution | Languages | Date Complete | +|-----:|:-------------------------------------------------------------------------------|:--------|:-------|:-------------------------------------------------|:------------|:----------------| +| 1395 | [Count Number of Teams]() | Medium | Daily | [solution](<../_1395. Count Number of Teams.md>) | py | Jul 29, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Simulation.md b/markdowns/by_topic/Simulation.md index 4ce2c9c1..a852c18d 100644 --- a/markdowns/by_topic/Simulation.md +++ b/markdowns/by_topic/Simulation.md @@ -1,4 +1,4 @@ -# [Simulation]() (33 completed) +# [Simulation]() (34 completed) *[Back to top](<../../README.md>)* @@ -38,4 +38,5 @@ | 3174 | Biweekly Contest 132 - q1 - [Clear Digits]() | Easy | Contest | [solution](<../_3174. Clear Digits.md>) | py | Jul 07, 2024 | | 3175 | Biweekly Contest 132 - q2 - [Find The First Player to win K Games in a Row]() | Medium | Contest | [solution](<../_3175. Find The First Player to win K Games in a Row.md>) | py | Jul 07, 2024 | | 3178 | Weekly Contest 401 - q1 - [Find the Child Who Has the Ball After K Seconds]() | Easy | Contest | [solution](<../_3178. Find the Child Who Has the Ball After K Seconds.md>) | py | Jul 07, 2024 | -| 3179 | Weekly Contest 401 - q2 - [Find the N-th Value After K Seconds]() | Medium | Contest | [solution](<../_3179. Find the N-th Value After K Seconds.md>) | py | Jul 07, 2024 | \ No newline at end of file +| 3179 | Weekly Contest 401 - q2 - [Find the N-th Value After K Seconds]() | Medium | Contest | [solution](<../_3179. Find the N-th Value After K Seconds.md>) | py | Jul 07, 2024 | +| 3242 | [Design Neighbor Sum Service]() | Easy | | [solution](<../_3242. Design Neighbor Sum Service.md>) | py | Aug 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Stack.md b/markdowns/by_topic/Stack.md index 3d5c4fe4..e558e09e 100644 --- a/markdowns/by_topic/Stack.md +++ b/markdowns/by_topic/Stack.md @@ -1,4 +1,4 @@ -# [Stack]() (47 completed) +# [Stack]() (48 completed) *[Back to top](<../../README.md>)* @@ -52,4 +52,5 @@ | 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 12, 2024 | | 2751 | [Robot Collisions]() | Hard | Daily | [solution](<../_2751. Robot Collisions.md>) | py | Jul 13, 2024 | | 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution](<../_2816. Double a Number Represented as a Linked List.md>) | c | Jul 04, 2024 | +| 3174 | Biweekly Contest 132 - q1 - [Clear Digits]() | Easy | Contest | [solution](<../_3174. Clear Digits.md>) | py | Jul 07, 2024 | | 3229 | Weekly Contest 407 - q4 - [Minimum Operations to Make Array Equal to Target]() | Hard | Contest | [solution](<../_3229. Minimum Operations to Make Array Equal to Target.md>) | py | Jul 21, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Strongly Connected Component.md b/markdowns/by_topic/Strongly Connected Component.md new file mode 100644 index 00000000..a41a03c3 --- /dev/null +++ b/markdowns/by_topic/Strongly Connected Component.md @@ -0,0 +1,9 @@ +# [Strongly Connected Component]() (1 completed) + +*[Back to top](<../../README.md>)* + +------ + +| # | Title | Level | Cats | Solution | Languages | Date Complete | +|-----:|:---------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:-----------------------------------------------------------------------|:------------|:----------------| +| 1568 | [Minimum Number of Days to Disconnect Island]() | Hard | Daily | [solution](<../_1568. Minimum Number of Days to Disconnect Island.md>) | py | Aug 11, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Two Pointers.md b/markdowns/by_topic/Two Pointers.md index 6c1839b5..cd3f03dc 100644 --- a/markdowns/by_topic/Two Pointers.md +++ b/markdowns/by_topic/Two Pointers.md @@ -1,57 +1,59 @@ -# [Two Pointers]() (49 completed) +# [Two Pointers]() (51 completed) *[Back to top](<../../README.md>)* ------ -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------------|:---------------------------------|:----------------| -| 5 | [Longest Palindromic Substring]() | Medium | B75, N150 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 05, 2024 | -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<../_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 07, 2024 | -| 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<../_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | -| 27 | [Remove Element]() | Easy | | [solution](<../_27. Remove Element.md>) | java, py | Jun 02, 2024 | -| 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | -| 61 | [Rotate List]() | Medium | | [solution](<../_61. Rotate List.md>) | py | Jun 22, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 12, 2024 | -| 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution](<../_82. Remove Duplicates from Sorted List II.md>) | py | Jul 04, 2024 | -| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 04, 2024 | -| 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 26, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 11, 2024 | -| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | -| 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<../_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 14, 2024 | -| 170 | [Two Sum III - Data structure design]() | Easy | | [solution](<../_170. Two Sum III - Data structure design.md>) | py | Jul 31, 2024 | -| 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | -| 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jul 01, 2024 | -| 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 26, 2024 | -| 344 | [Reverse String]() | Easy | Daily | [solution](<../_344. Reverse String.md>) | java, py | Jun 02, 2024 | -| 345 | [Reverse Vowels of a String]() | Easy | | [solution](<../_345. Reverse Vowels of a String.md>) | py | May 23, 2024 | -| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 02, 2024 | -| 392 | [Is Subsequence]() | Easy | | [solution](<../_392. Is Subsequence.md>) | java | Jun 22, 2024 | -| 408 | [Valid Word Abbreviation]() | Easy | | [solution](<../_408. Valid Word Abbreviation.md>) | py | Jun 02, 2024 | -| 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | -| 567 | [Permutation in String]() | Medium | N150 | [solution](<../_567. Permutation in String.md>) | py | Jul 06, 2024 | -| 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | -| 647 | [Palindromic Substrings]() | Medium | B75, N150 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 05, 2024 | -| 653 | [Two Sum IV - Input is a BST]() | Easy | | [solution](<../_653. Two Sum IV - Input is a BST.md>) | py | Jul 31, 2024 | -| 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 18, 2024 | -| 977 | [Squares of a Sorted Array]() | Easy | | [solution](<../_977. Squares of a Sorted Array.md>) | py | Jun 21, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | -| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<../_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | -| 1508 | [Range Sum of Sorted Subarray Sums]() | Medium | Daily | [solution](<../_1508. Range Sum of Sorted Subarray Sums.md>) | py | Aug 04, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | -| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 10, 2024 | -| 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<../_1721. Swapping Nodes in a Linked List.md>) | c | Jun 07, 2024 | -| 1768 | [Merge Strings Alternately]() | Easy | | [solution](<../_1768. Merge Strings Alternately.md>) | java | Jul 01, 2024 | -| 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | -| 1885 | [Count Pairs in Two Arrays]() | Medium | | [solution](<../_1885. Count Pairs in Two Arrays.md>) | py | Jun 08, 2024 | -| 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<../_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | -| 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<../_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 07, 2024 | -| 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 21, 2024 | -| 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 10, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | c, cpp, java, js, kt, py, rb, rs | Jun 09, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | -| 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<../_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | -| 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting]() | Medium | Contest | [solution](<../_3186. Maximum Total Damage With Spell Casting.md>) | py | Jul 07, 2024 | -| 3194 | Weekly Contest 403 - q1 - [Minimum Average of Smallest and Largest Elements]() | Easy | Contest | [solution](<../_3194. Minimum Average of Smallest and Largest Elements.md>) | py | Jul 07, 2024 | \ No newline at end of file +| # | Title | Level | Cats | Solution | Languages | Date Complete | +|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------------|:---------------------------------|:----------------| +| 5 | [Longest Palindromic Substring]() | Medium | B75, N150 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 05, 2024 | +| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<../_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 07, 2024 | +| 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<../_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | +| 27 | [Remove Element]() | Easy | | [solution](<../_27. Remove Element.md>) | java, py | Jun 02, 2024 | +| 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | +| 61 | [Rotate List]() | Medium | | [solution](<../_61. Rotate List.md>) | py | Jun 22, 2024 | +| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 12, 2024 | +| 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution](<../_82. Remove Duplicates from Sorted List II.md>) | py | Jul 04, 2024 | +| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | +| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 04, 2024 | +| 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 26, 2024 | +| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 11, 2024 | +| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | +| 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<../_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 14, 2024 | +| 170 | [Two Sum III - Data structure design]() | Easy | | [solution](<../_170. Two Sum III - Data structure design.md>) | py | Jul 31, 2024 | +| 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | +| 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | +| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jul 01, 2024 | +| 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 26, 2024 | +| 344 | [Reverse String]() | Easy | Daily | [solution](<../_344. Reverse String.md>) | java, py | Jun 02, 2024 | +| 345 | [Reverse Vowels of a String]() | Easy | | [solution](<../_345. Reverse Vowels of a String.md>) | py | May 23, 2024 | +| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 02, 2024 | +| 392 | [Is Subsequence]() | Easy | | [solution](<../_392. Is Subsequence.md>) | java | Jun 22, 2024 | +| 408 | [Valid Word Abbreviation]() | Easy | | [solution](<../_408. Valid Word Abbreviation.md>) | py | Jun 02, 2024 | +| 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | +| 567 | [Permutation in String]() | Medium | N150 | [solution](<../_567. Permutation in String.md>) | py | Jul 06, 2024 | +| 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | +| 647 | [Palindromic Substrings]() | Medium | B75, N150 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 05, 2024 | +| 653 | [Two Sum IV - Input is a BST]() | Easy | | [solution](<../_653. Two Sum IV - Input is a BST.md>) | py | Jul 31, 2024 | +| 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 18, 2024 | +| 977 | [Squares of a Sorted Array]() | Easy | | [solution](<../_977. Squares of a Sorted Array.md>) | py | Jun 21, 2024 | +| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | +| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<../_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | +| 1508 | [Range Sum of Sorted Subarray Sums]() | Medium | Daily | [solution](<../_1508. Range Sum of Sorted Subarray Sums.md>) | py | Aug 04, 2024 | +| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | +| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 10, 2024 | +| 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<../_1721. Swapping Nodes in a Linked List.md>) | c | Jun 07, 2024 | +| 1768 | [Merge Strings Alternately]() | Easy | | [solution](<../_1768. Merge Strings Alternately.md>) | java | Jul 01, 2024 | +| 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | +| 1885 | [Count Pairs in Two Arrays]() | Medium | | [solution](<../_1885. Count Pairs in Two Arrays.md>) | py | Jun 08, 2024 | +| 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<../_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | +| 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<../_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 07, 2024 | +| 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 21, 2024 | +| 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 10, 2024 | +| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | c, cpp, java, js, kt, py, rb, rs | Jun 09, 2024 | +| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | +| 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<../_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | +| 3186 | Weekly Contest 402 - q3 - [Maximum Total Damage With Spell Casting]() | Medium | Contest | [solution](<../_3186. Maximum Total Damage With Spell Casting.md>) | py | Jul 07, 2024 | +| 3194 | Weekly Contest 403 - q1 - [Minimum Average of Smallest and Largest Elements]() | Easy | Contest | [solution](<../_3194. Minimum Average of Smallest and Largest Elements.md>) | py | Jul 07, 2024 | +| 3239 | Biweekly Contest 136 - q2 - [Minimum Number of Flips to Make Binary Grid Palindromic I]() | Medium | Contest | [solution](<../_3239. Minimum Number of Flips to Make Binary Grid Palindromic I.md>) | py | Aug 03, 2024 | +| 3240 | Biweekly Contest 136 - q3 - [Minimum Number of Flips to Make Binary Grid Palindromic II]() | Medium | Contest | [solution](<../_3240. Minimum Number of Flips to Make Binary Grid Palindromic II.md>) | py | Aug 03, 2024 | \ No newline at end of file