Skip to content

Commit b0c77d6

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent c15fa9e commit b0c77d6

File tree

9 files changed

+62
-10
lines changed

9 files changed

+62
-10
lines changed

‎README.md‎

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (524 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (525 solved)
22

33
<!-- This readme was generated using [WikiLeet](<https://github.com/Zanger67/WikiLeet>) -->
44

@@ -33,7 +33,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
3333

3434
------
3535

36-
[Array](<markdowns/by_topic/Array.md>), [String](<markdowns/by_topic/String.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Math](<markdowns/by_topic/Math.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Stack](<markdowns/by_topic/Stack.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Design](<markdowns/by_topic/Design.md>), [Counting](<markdowns/by_topic/Counting.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Database](<markdowns/by_topic/Database.md>), [Trie](<markdowns/by_topic/Trie.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
36+
[Array](<markdowns/by_topic/Array.md>), [String](<markdowns/by_topic/String.md>), [Hash Table](<markdowns/by_topic/Hash Table.md>), [Depth-First Search](<markdowns/by_topic/Depth-First Search.md>), [Tree](<markdowns/by_topic/Tree.md>), [Binary Tree](<markdowns/by_topic/Binary Tree.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Math](<markdowns/by_topic/Math.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Stack](<markdowns/by_topic/Stack.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.md>), [Design](<markdowns/by_topic/Design.md>), [Counting](<markdowns/by_topic/Counting.md>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Heap (Priority Queue)](<markdowns/by_topic/Heap (Priority Queue).md>), [Database](<markdowns/by_topic/Database.md>), [Trie](<markdowns/by_topic/Trie.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Suffix Array](<markdowns/by_topic/Suffix Array.md>), [Doubly-Linked List](<markdowns/by_topic/Doubly-Linked List.md>), [Iterator](<markdowns/by_topic/Iterator.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
3737

3838
------
3939

@@ -327,6 +327,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
327327
| 1218 | [Longest Arithmetic Subsequence of Given Difference](<https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference>) | Medium | | [solution](<markdowns/_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py |
328328
| 1229 | [Meeting Scheduler](<https://leetcode.com/problems/meeting-scheduler>) | Medium | Weekly Premium | [solution](<markdowns/_1229. Meeting Scheduler.md>) | py |
329329
| 1230 | [Toss Strange Coins](<https://leetcode.com/problems/toss-strange-coins>) | Medium | Weekly Premium | [solution](<markdowns/_1230. Toss Strange Coins.md>) | c, java, py |
330+
| 1232 | [Check If It Is a Straight Line](<https://leetcode.com/problems/check-if-it-is-a-straight-line>) | Easy | | [solution](<markdowns/_1232. Check If It Is a Straight Line.md>) | py |
330331
| 1233 | [Remove Sub-Folders from the Filesystem](<https://leetcode.com/problems/remove-sub-folders-from-the-filesystem>) | Medium | | [solution](<markdowns/_1233. Remove Sub-Folders from the Filesystem.md>) | py |
331332
| 1239 | [Maximum Length of a Concatenated String with Unique Characters](<https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters>) | Medium | | [solution](<markdowns/_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py |
332333
| 1248 | [Count Number of Nice Subarrays](<https://leetcode.com/problems/count-number-of-nice-subarrays>) | Medium | Daily | [solution](<markdowns/_1248. Count Number of Nice Subarrays.md>) | py |

‎markdowns/Easy.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Easy Questions (158)
1+
# Easy Questions (159)
22

33
*[Back to top](<../README.md>)*
44

@@ -92,6 +92,7 @@
9292
| 1160 | [Find Words That Can Be Formed by Characters](<https://leetcode.com/problems/find-words-that-can-be-formed-by-characters>) | Easy | | [solution](<_1160. Find Words That Can Be Formed by Characters.md>) | py | Sep 24, 2024 |
9393
| 1184 | [Distance Between Bus Stops](<https://leetcode.com/problems/distance-between-bus-stops>) | Easy | | [solution](<_1184. Distance Between Bus Stops.md>) | py | May 31, 2024 |
9494
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<_1207. Unique Number of Occurrences.md>) | py | Sep 25, 2024 |
95+
| 1232 | [Check If It Is a Straight Line](<https://leetcode.com/problems/check-if-it-is-a-straight-line>) | Easy | | [solution](<_1232. Check If It Is a Straight Line.md>) | py | Sep 25, 2024 |
9596
| 1252 | [Cells with Odd Values in a Matrix](<https://leetcode.com/problems/cells-with-odd-values-in-a-matrix>) | Easy | | [solution](<_1252. Cells with Odd Values in a Matrix.md>) | c | Jun 04, 2024 |
9697
| 1317 | [Convert Integer to the Sum of Two No-Zero Integers](<https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers>) | Easy | | [solution](<_1317. Convert Integer to the Sum of Two No-Zero Integers.md>) | c | Jun 04, 2024 |
9798
| 1351 | [Count Negative Numbers in a Sorted Matrix](<https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix>) | Easy | | [solution](<_1351. Count Negative Numbers in a Sorted Matrix.md>) | java, py | Jun 01, 2024 |

‎markdowns/Questions_By_Code_Length.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -388,6 +388,7 @@ Calculations are based on the code files's byte sizes.
388388
| 27 | [Remove Element](<https://leetcode.com/problems/remove-element>) | Easy | | [solution](<_27. Remove Element.md>) | java, py | Jun 02, 2024 |
389389
| 57 | [Insert Interval](<https://leetcode.com/problems/insert-interval>) | Medium | B75, N150 | [solution](<_57. Insert Interval.md>) | py | Jun 19, 2024 |
390390
| 226 | [Invert Binary Tree](<https://leetcode.com/problems/invert-binary-tree>) | Easy | B75, N150 | [solution](<_226. Invert Binary Tree.md>) | py | Jul 03, 2024 |
391+
| 1232 | [Check If It Is a Straight Line](<https://leetcode.com/problems/check-if-it-is-a-straight-line>) | Easy | | [solution](<_1232. Check If It Is a Straight Line.md>) | py | Sep 25, 2024 |
391392
| 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](<https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i>) | Medium | | [solution](<_3191. Minimum Operations to Make Binary Array Elements Equal to One I.md>) | java | Jun 22, 2024 |
392393
| 235 | [Lowest Common Ancestor of a Binary Search Tree](<https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree>) | Medium | B75, N150 | [solution](<_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 |
393394
| 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](<https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii>) | Medium | | [solution](<_3192. Minimum Operations to Make Binary Array Elements Equal to One II.md>) | java | Jun 22, 2024 |

‎markdowns/Questions_By_Recent.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@ Calculations are based on the date of the first solve.
66

77
| # | Title | Level | Cats | Solution | Languages | Date Complete |
88
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:--------------------------------------------|:----------------|
9+
| 1232 | [Check If It Is a Straight Line](<https://leetcode.com/problems/check-if-it-is-a-straight-line>) | Easy | | [solution](<_1232. Check If It Is a Straight Line.md>) | py | Sep 25, 2024 |
910
| 1207 | [Unique Number of Occurrences](<https://leetcode.com/problems/unique-number-of-occurrences>) | Easy | | [solution](<_1207. Unique Number of Occurrences.md>) | py | Sep 25, 2024 |
1011
| 1071 | [Greatest Common Divisor of Strings](<https://leetcode.com/problems/greatest-common-divisor-of-strings>) | Easy | | [solution](<_1071. Greatest Common Divisor of Strings.md>) | py | Sep 25, 2024 |
1112
| 1160 | [Find Words That Can Be Formed by Characters](<https://leetcode.com/problems/find-words-that-can-be-formed-by-characters>) | Easy | | [solution](<_1160. Find Words That Can Be Formed by Characters.md>) | py | Sep 24, 2024 |

‎markdowns/Topics.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -4,14 +4,14 @@
44

55
------
66

7-
- [Array](<by_topic/Array.md>) (247 completed)
7+
- [Array](<by_topic/Array.md>) (248 completed)
88
- [String](<by_topic/String.md>) (118 completed)
99
- [Hash Table](<by_topic/Hash Table.md>) (114 completed)
1010
- [Depth-First Search](<by_topic/Depth-First Search.md>) (88 completed)
1111
- [Tree](<by_topic/Tree.md>) (85 completed)
1212
- [Binary Tree](<by_topic/Binary Tree.md>) (77 completed)
1313
- [Sorting](<by_topic/Sorting.md>) (70 completed)
14-
- [Math](<by_topic/Math.md>) (66 completed)
14+
- [Math](<by_topic/Math.md>) (67 completed)
1515
- [Breadth-First Search](<by_topic/Breadth-First Search.md>) (56 completed)
1616
- [Two Pointers](<by_topic/Two Pointers.md>) (54 completed)
1717
- [Stack](<by_topic/Stack.md>) (51 completed)
@@ -46,6 +46,7 @@
4646
- [Rolling Hash](<by_topic/Rolling Hash.md>) (4 completed)
4747
- [Randomized](<by_topic/Randomized.md>) (4 completed)
4848
- [Bucket Sort](<by_topic/Bucket Sort.md>) (4 completed)
49+
- [Geometry](<by_topic/Geometry.md>) (3 completed)
4950
- [Data Stream](<by_topic/Data Stream.md>) (3 completed)
5051
- [Brainteaser](<by_topic/Brainteaser.md>) (3 completed)
5152
- [Memoization](<by_topic/Memoization.md>) (3 completed)
@@ -54,7 +55,6 @@
5455
- [Doubly-Linked List](<by_topic/Doubly-Linked List.md>) (3 completed)
5556
- [Iterator](<by_topic/Iterator.md>) (3 completed)
5657
- [Number Theory](<by_topic/Number Theory.md>) (3 completed)
57-
- [Geometry](<by_topic/Geometry.md>) (2 completed)
5858
- [Interactive](<by_topic/Interactive.md>) (2 completed)
5959
- [Bitmask](<by_topic/Bitmask.md>) (2 completed)
6060
- [Merge Sort](<by_topic/Merge Sort.md>) (2 completed)

0 commit comments

Comments
 (0)