Skip to content

Commit 21816a7

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 5b28a79 commit 21816a7

9 files changed

+92
-9
lines changed

‎README.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (624 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (625 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>), [Math](<markdowns/by_topic/Math.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Stack](<markdowns/by_topic/Stack.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Design](<markdowns/by_topic/Design.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.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>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Database](<markdowns/by_topic/Database.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.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>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.md>), [Quickselect](<markdowns/by_topic/Quickselect.md>), [Enumeration](<markdowns/by_topic/Enumeration.md>), [Strongly Connected Component](<markdowns/by_topic/Strongly Connected Component.md>), [Probability and Statistics](<markdowns/by_topic/Probability and Statistics.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>), [Math](<markdowns/by_topic/Math.md>), [Sorting](<markdowns/by_topic/Sorting.md>), [Breadth-First Search](<markdowns/by_topic/Breadth-First Search.md>), [Two Pointers](<markdowns/by_topic/Two Pointers.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.md>), [Stack](<markdowns/by_topic/Stack.md>), [Matrix](<markdowns/by_topic/Matrix.md>), [Greedy](<markdowns/by_topic/Greedy.md>), [Linked List](<markdowns/by_topic/Linked List.md>), [Simulation](<markdowns/by_topic/Simulation.md>), [Design](<markdowns/by_topic/Design.md>), [Bit Manipulation](<markdowns/by_topic/Bit Manipulation.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>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Trie](<markdowns/by_topic/Trie.md>), [Graph](<markdowns/by_topic/Graph.md>), [Database](<markdowns/by_topic/Database.md>), [Union Find](<markdowns/by_topic/Union Find.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Queue](<markdowns/by_topic/Queue.md>), [Monotonic Stack](<markdowns/by_topic/Monotonic Stack.md>), [Divide and Conquer](<markdowns/by_topic/Divide and Conquer.md>), [String Matching](<markdowns/by_topic/String Matching.md>), [Shortest Path](<markdowns/by_topic/Shortest Path.md>), [Counting Sort](<markdowns/by_topic/Counting Sort.md>), [Hash Function](<markdowns/by_topic/Hash Function.md>), [Data Stream](<markdowns/by_topic/Data Stream.md>), [Game Theory](<markdowns/by_topic/Game Theory.md>), [Combinatorics](<markdowns/by_topic/Combinatorics.md>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.md>), [Rolling Hash](<markdowns/by_topic/Rolling Hash.md>), [Randomized](<markdowns/by_topic/Randomized.md>), [Number Theory](<markdowns/by_topic/Number Theory.md>), [Bucket Sort](<markdowns/by_topic/Bucket Sort.md>), [Geometry](<markdowns/by_topic/Geometry.md>), [Memoization](<markdowns/by_topic/Memoization.md>), [Monotonic Queue](<markdowns/by_topic/Monotonic Queue.md>), [Topological Sort](<markdowns/by_topic/Topological Sort.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>), [Enumeration](<markdowns/by_topic/Enumeration.md>), [Interactive](<markdowns/by_topic/Interactive.md>), [Bitmask](<markdowns/by_topic/Bitmask.md>), [Merge Sort](<markdowns/by_topic/Merge Sort.md>), [Binary Indexed Tree](<markdowns/by_topic/Binary Indexed Tree.md>), [Segment Tree](<markdowns/by_topic/Segment Tree.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>), [Reservoir Sampling](<markdowns/by_topic/Reservoir Sampling.md>), [Radix Sort](<markdowns/by_topic/Radix Sort.md>)
3737

3838
------
3939

@@ -426,6 +426,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
426426
| 1524 | [Number of Sub-arrays With Odd Sum](<https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum>) | Medium | Daily | [solution](<markdowns/_1524. Number of Sub-arrays With Odd Sum.md>) | py |
427427
| 1525 | [Number of Good Ways to Split a String](<https://leetcode.com/problems/number-of-good-ways-to-split-a-string>) | Medium | | [solution](<markdowns/_1525. Number of Good Ways to Split a String.md>) | py |
428428
| 1530 | [Number of Good Leaf Nodes Pairs](<https://leetcode.com/problems/number-of-good-leaf-nodes-pairs>) | Medium | Daily | [solution](<markdowns/_1530. Number of Good Leaf Nodes Pairs.md>) | py |
429+
| 1534 | [Count Good Triplets](<https://leetcode.com/problems/count-good-triplets>) | Easy | Daily | [solution](<markdowns/_1534. Count Good Triplets.md>) | c, py |
429430
| 1535 | [Find the Winner of an Array Game](<https://leetcode.com/problems/find-the-winner-of-an-array-game>) | Medium | | [solution](<markdowns/_1535. Find the Winner of an Array Game.md>) | py |
430431
| 1550 | [Three Consecutive Odds](<https://leetcode.com/problems/three-consecutive-odds>) | Easy | Daily | [solution](<markdowns/_1550. Three Consecutive Odds.md>) | c, py |
431432
| 1551 | [Minimum Operations to Make Array Equal](<https://leetcode.com/problems/minimum-operations-to-make-array-equal>) | Medium | | [solution](<markdowns/_1551. Minimum Operations to Make Array Equal.md>) | c, java, js, kt, py, rb, rs |

‎markdowns/Daily_Questions.md

+3-2
Original file line numberDiff line numberDiff line change
@@ -9,14 +9,15 @@ Dates are for the date I completed the question so due to the my time zone and h
99
|-------------------------------------:|-------------------------------------------:|---------------------------------------------------------------------------------:|-------------------------------------------------------:|-----:|---------------------------------------------:|-----:|
1010
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
1111
| 6 | [7](<_416. Partition Equal Subset Sum.md>) | [8](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | 9 | 10 | [11](<_2843. Count Symmetric Integers.md>) | 12 |
12-
| [13](<_1922. Count Good Numbers.md>) | 14 | 15 | 16 | 17 | 18 | 19 |
12+
| [13](<_1922. Count Good Numbers.md>) | [14](<_1534. Count Good Triplets.md>) | 15 | 16 | 17 | 18 | 19 |
1313
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
1414
| 27 | 28 | 29 | 30 | | | |
1515

1616

1717

1818
| # | Title | Level | Cats | Solution | Languages | Date Complete |
1919
|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------------|:-----------------------------|:----------------|
20+
| 1534 | [Count Good Triplets](<https://leetcode.com/problems/count-good-triplets>) | Easy | Daily | [solution](<_1534. Count Good Triplets.md>) | c, py | Apr 14, 2025 |
2021
| 1922 | [Count Good Numbers](<https://leetcode.com/problems/count-good-numbers>) | Medium | Daily | [solution](<_1922. Count Good Numbers.md>) | py | Apr 13, 2025 |
2122
| 2843 | [ Count Symmetric Integers](<https://leetcode.com/problems/count-symmetric-integers>) | Easy | Daily | [solution](<_2843. Count Symmetric Integers.md>) | py | Apr 11, 2025 |
2223
| 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](<https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct>) | Easy | Daily | [solution](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | py | Apr 08, 2025 |
@@ -282,7 +283,7 @@ Dates are for the date I completed the question so due to the my time zone and h
282283
|-------------------------------------:|-------------------------------------------:|---------------------------------------------------------------------------------:|-------------------------------------------------------:|-----:|---------------------------------------------:|-----:|
283284
| | | 1 | [2](<_2873. Maximum Value of an Ordered Triplet I.md>) | 3 | 4 | 5 |
284285
| 6 | [7](<_416. Partition Equal Subset Sum.md>) | [8](<_3396. Minimum Number of Operations to Make Elements in Array Distinct.md>) | 9 | 10 | [11](<_2843. Count Symmetric Integers.md>) | 12 |
285-
| [13](<_1922. Count Good Numbers.md>) | 14 | 15 | 16 | 17 | 18 | 19 |
286+
| [13](<_1922. Count Good Numbers.md>) | [14](<_1534. Count Good Triplets.md>) | 15 | 16 | 17 | 18 | 19 |
286287
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
287288
| 27 | 28 | 29 | 30 | | | |
288289

‎markdowns/Easy.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Easy Questions (182)
1+
# Easy Questions (183)
22

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

@@ -116,6 +116,7 @@
116116
| 1475 | [Final Prices With a Special Discount in a Shop](<https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop>) | Easy | Daily | [solution](<_1475. Final Prices With a Special Discount in a Shop.md>) | py | Dec 18, 2024 |
117117
| 1502 | [Can Make Arithmetic Progression From Sequence](<https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence>) | Easy | | [solution](<_1502. Can Make Arithmetic Progression From Sequence.md>) | c, py | Jun 04, 2024 |
118118
| 1518 | [Water Bottles](<https://leetcode.com/problems/water-bottles>) | Easy | Daily | [solution](<_1518. Water Bottles.md>) | c, cpp, cs, java, js, py, ts | Jul 07, 2024 |
119+
| 1534 | [Count Good Triplets](<https://leetcode.com/problems/count-good-triplets>) | Easy | Daily | [solution](<_1534. Count Good Triplets.md>) | c, py | Apr 14, 2025 |
119120
| 1550 | [Three Consecutive Odds](<https://leetcode.com/problems/three-consecutive-odds>) | Easy | Daily | [solution](<_1550. Three Consecutive Odds.md>) | c, py | Jul 01, 2024 |
120121
| 1598 | [Crawler Log Folder](<https://leetcode.com/problems/crawler-log-folder>) | Easy | Daily | [solution](<_1598. Crawler Log Folder.md>) | c, js | Jul 10, 2024 |
121122
| 1636 | [Sort Array by Increasing Frequency](<https://leetcode.com/problems/sort-array-by-increasing-frequency>) | Easy | Daily | [solution](<_1636. Sort Array by Increasing Frequency.md>) | py | Jul 23, 2024 |

0 commit comments

Comments
 (0)