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 19, 2024
1 parent fc8bf62 commit adf90ec
Show file tree
Hide file tree
Showing 462 changed files with 531 additions and 472 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/)** (502 solved)
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (503 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>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Linked List](<markdowns/by_topic/Linked List.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>), [Backtracking](<markdowns/by_topic/Backtracking.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>), [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>), [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>)
[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>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Linked List](<markdowns/by_topic/Linked List.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>), [Backtracking](<markdowns/by_topic/Backtracking.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>), [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>), [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>)

------

Expand Down Expand Up @@ -216,6 +216,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
| 645 | [Set Mismatch](<https://leetcode.com/problems/set-mismatch>) | Easy | | [solution](<markdowns/_645. Set Mismatch.md>) | java, py |
| 647 | [Palindromic Substrings](<https://leetcode.com/problems/palindromic-substrings>) | Medium | B75, N150 | [solution](<markdowns/_647. Palindromic Substrings.md>) | py |
| 648 | [Replace Words](<https://leetcode.com/problems/replace-words>) | Medium | Daily | [solution](<markdowns/_648. Replace Words.md>) | java, py |
| 650 | [2 Keys Keyboard](<https://leetcode.com/problems/2-keys-keyboard>) | Medium | Daily | [solution](<markdowns/_650. 2 Keys Keyboard.md>) | py |
| 651 | [4 Keys Keyboard](<https://leetcode.com/problems/4-keys-keyboard>) | Medium | | [solution](<markdowns/_651. 4 Keys Keyboard.md>) | py |
| 653 | [Two Sum IV - Input is a BST](<https://leetcode.com/problems/two-sum-iv-input-is-a-bst>) | Easy | | [solution](<markdowns/_653. Two Sum IV - Input is a BST.md>) | py |
| 654 | [Maximum Binary Tree](<https://leetcode.com/problems/maximum-binary-tree>) | Medium | | [solution](<markdowns/_654. Maximum Binary Tree.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 |
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
| 650 | [2 Keys Keyboard](<https://leetcode.com/problems/2-keys-keyboard>) | Medium | Daily | [solution](<_650. 2 Keys Keyboard.md>) | py | Aug 19, 2024 |
| 624 | [Maximum Distance in Arrays](<https://leetcode.com/problems/maximum-distance-in-arrays>) | Medium | Daily | [solution](<_624. Maximum Distance in Arrays.md>) | py | Aug 16, 2024 |
| 860 | [Lemonade Change](<https://leetcode.com/problems/lemonade-change>) | Easy | Daily | [solution](<_860. Lemonade Change.md>) | py | Aug 15, 2024 |
| 719 | [Find K-th Smallest Pair Distance](<https://leetcode.com/problems/find-k-th-smallest-pair-distance>) | Hard | Daily | [solution](<_719. Find K-th Smallest Pair Distance.md>) | py | Aug 14, 2024 |
Expand Down
3 changes: 2 additions & 1 deletion markdowns/Medium.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
# Medium Questions (323)
# Medium Questions (324)

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

Expand Down Expand Up @@ -109,6 +109,7 @@
| 624 | [Maximum Distance in Arrays](<https://leetcode.com/problems/maximum-distance-in-arrays>) | Medium | Daily | [solution](<_624. Maximum Distance in Arrays.md>) | py | Aug 16, 2024 |
| 647 | [Palindromic Substrings](<https://leetcode.com/problems/palindromic-substrings>) | Medium | B75, N150 | [solution](<_647. Palindromic Substrings.md>) | py | Jul 05, 2024 |
| 648 | [Replace Words](<https://leetcode.com/problems/replace-words>) | Medium | Daily | [solution](<_648. Replace Words.md>) | java, py | Jun 07, 2024 |
| 650 | [2 Keys Keyboard](<https://leetcode.com/problems/2-keys-keyboard>) | Medium | Daily | [solution](<_650. 2 Keys Keyboard.md>) | py | Aug 19, 2024 |
| 651 | [4 Keys Keyboard](<https://leetcode.com/problems/4-keys-keyboard>) | Medium | | [solution](<_651. 4 Keys Keyboard.md>) | py | May 29, 2024 |
| 654 | [Maximum Binary Tree](<https://leetcode.com/problems/maximum-binary-tree>) | Medium | | [solution](<_654. Maximum Binary Tree.md>) | py | Jun 12, 2024 |
| 663 | [Equal Tree Partition](<https://leetcode.com/problems/equal-tree-partition>) | Medium | | [solution](<_663. Equal Tree Partition.md>) | py | Jun 17, 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 @@ -381,6 +381,7 @@ Calculations are based on the code files's byte sizes.
| 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 |
| 1046 | [Last Stone Weight](<https://leetcode.com/problems/last-stone-weight>) | Easy | N150 | [solution](<_1046. Last Stone Weight.md>) | py | Jun 04, 2024 |
| 1736 | [Latest Time by Replacing Hidden Digits](<https://leetcode.com/problems/latest-time-by-replacing-hidden-digits>) | Easy | | [solution](<_1736. Latest Time by Replacing Hidden Digits.md>) | c | Jun 03, 2024 |
| 650 | [2 Keys Keyboard](<https://leetcode.com/problems/2-keys-keyboard>) | Medium | Daily | [solution](<_650. 2 Keys Keyboard.md>) | py | Aug 19, 2024 |
| 260 | [Single Number III](<https://leetcode.com/problems/single-number-iii>) | Medium | | [solution](<_260. Single Number III.md>) | py | Jun 08, 2024 |
| 654 | [Maximum Binary Tree](<https://leetcode.com/problems/maximum-binary-tree>) | Medium | | [solution](<_654. Maximum Binary Tree.md>) | py | Jun 12, 2024 |
| 2942 | [Find Words Containing Character](<https://leetcode.com/problems/find-words-containing-character>) | Easy | | [solution](<_2942. Find Words Containing Character.md>) | c | Jun 06, 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 |
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:--------------------------------------------|:----------------|
| 650 | [2 Keys Keyboard](<https://leetcode.com/problems/2-keys-keyboard>) | Medium | Daily | [solution](<_650. 2 Keys Keyboard.md>) | py | Aug 19, 2024 |
| 624 | [Maximum Distance in Arrays](<https://leetcode.com/problems/maximum-distance-in-arrays>) | Medium | Daily | [solution](<_624. Maximum Distance in Arrays.md>) | py | Aug 16, 2024 |
| 860 | [Lemonade Change](<https://leetcode.com/problems/lemonade-change>) | Easy | Daily | [solution](<_860. Lemonade Change.md>) | py | Aug 15, 2024 |
| 719 | [Find K-th Smallest Pair Distance](<https://leetcode.com/problems/find-k-th-smallest-pair-distance>) | Hard | Daily | [solution](<_719. Find K-th Smallest Pair Distance.md>) | py | Aug 14, 2024 |
Expand Down
Loading

0 comments on commit adf90ec

Please sign in to comment.