Skip to content

Commit

Permalink
Updated markdown files
Browse files Browse the repository at this point in the history
  • Loading branch information
Zanger67/leetcode authored and Zanger67/leetcode committed Aug 11, 2024
1 parent 937078d commit cf8927a
Show file tree
Hide file tree
Showing 450 changed files with 667 additions and 558 deletions.
5 changes: 3 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (494 solved)
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (495 solved)

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

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

------

[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>), [Linked List](<markdowns/by_topic/Linked List.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.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>), [Binary Search](<markdowns/by_topic/Binary Search.md>), [Counting](<markdowns/by_topic/Counting.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>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.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>), [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>), [Counting Sort](<markdowns/by_topic/Counting 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>), [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>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
[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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.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>), [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>), [Backtracking](<markdowns/by_topic/Backtracking.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Graph](<markdowns/by_topic/Graph.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.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>), [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>), [Counting Sort](<markdowns/by_topic/Counting 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>), [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>), [Bitmask](<markdowns/by_topic/Bitmask.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>)

------

Expand Down Expand Up @@ -357,6 +357,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
| 1552 | [Magnetic Force Between Two Balls](<https://leetcode.com/problems/magnetic-force-between-two-balls>) | Medium | Daily | [solution](<markdowns/_1552. Magnetic Force Between Two Balls.md>) | py |
| 1561 | [Maximum Number of Coins You Can Get](<https://leetcode.com/problems/maximum-number-of-coins-you-can-get>) | Medium | | [solution](<markdowns/_1561. Maximum Number of Coins You Can Get.md>) | py |
| 1564 | [Put Boxes Into the Warehouse I](<https://leetcode.com/problems/put-boxes-into-the-warehouse-i>) | Medium | | [solution](<markdowns/_1564. Put Boxes Into the Warehouse I.md>) | py |
| 1568 | [Minimum Number of Days to Disconnect Island](<https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island>) | Hard | Daily | [solution](<markdowns/_1568. Minimum Number of Days to Disconnect Island.md>) | py |
| 1570 | [Dot Product of Two Sparse Vectors](<https://leetcode.com/problems/dot-product-of-two-sparse-vectors>) | Medium | | [solution](<markdowns/_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py |
| 1579 | [Remove Max Number of Edges to Keep Graph Fully Traversable](<https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable>) | Hard | Daily | [solution](<markdowns/_1579. Remove Max Number of Edges to Keep Graph Fully Traversable.md>) | py |
| 1580 | [Put Boxes Into the Warehouse II](<https://leetcode.com/problems/put-boxes-into-the-warehouse-ii>) | Medium | Weekly Premium | [solution](<markdowns/_1580. Put Boxes Into the Warehouse II.md>) | py |
Expand Down
1 change: 1 addition & 0 deletions markdowns/Daily_Questions.md
Original file line number Diff line number Diff line change
Expand Up @@ -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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/regions-cut-by-slashes>) | Medium | Daily | [solution](<_959. Regions Cut By Slashes.md>) | py | Aug 10, 2024 |
| 840 | [Magic Squares In Grid](<https://leetcode.com/problems/magic-squares-in-grid>) | Medium | Daily | [solution](<_840. Magic Squares In Grid.md>) | py | Aug 09, 2024 |
| 885 | [Spiral Matrix III](<https://leetcode.com/problems/spiral-matrix-iii>) | Medium | Daily | [solution](<_885. Spiral Matrix III.md>) | py | Aug 08, 2024 |
Expand Down
3 changes: 2 additions & 1 deletion markdowns/Hard.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
# Hard Questions (29)
# Hard Questions (30)

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

Expand Down Expand Up @@ -26,6 +26,7 @@
| 1028 | [Recover a Tree From Preorder Traversal](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/escape-the-spreading-fire>) | Hard | | [solution](<_2258. Escape the Spreading Fire.md>) | py | Jun 15, 2024 |
Expand Down
1 change: 1 addition & 0 deletions markdowns/Questions_By_Code_Length.md
Original file line number Diff line number Diff line change
Expand Up @@ -169,6 +169,7 @@ Calculations are based on the code files's byte sizes.
| 1698 | [Number of Distinct Substrings in a String](<https://leetcode.com/problems/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)](<https://leetcode.com/problems/insert-delete-getrandom-o1>) | Medium | | [solution](<_380. Insert Delete GetRandom O(1).md>) | java | Jul 06, 2024 |
| 238 | [Product of Array Except Self](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/word-search>) | Medium | B75, N150 | [solution](<_79. Word Search.md>) | py | Jun 27, 2024 |
Expand Down
1 change: 1 addition & 0 deletions markdowns/Questions_By_Recent.md
Original file line number Diff line number Diff line change
Expand Up @@ -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](<https://leetcode.com/problems/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](<https://leetcode.com/problems/regions-cut-by-slashes>) | Medium | Daily | [solution](<_959. Regions Cut By Slashes.md>) | py | Aug 10, 2024 |
| 840 | [Magic Squares In Grid](<https://leetcode.com/problems/magic-squares-in-grid>) | Medium | Daily | [solution](<_840. Magic Squares In Grid.md>) | py | Aug 09, 2024 |
| 885 | [Spiral Matrix III](<https://leetcode.com/problems/spiral-matrix-iii>) | Medium | Daily | [solution](<_885. Spiral Matrix III.md>) | py | Aug 08, 2024 |
Expand Down
Loading

0 comments on commit cf8927a

Please sign in to comment.