Skip to content

Commit 5983247

Browse files
Zanger67/leetcodeZanger67/leetcode
Zanger67/leetcode
authored and
Zanger67/leetcode
committed
Updated markdown files
1 parent 1729074 commit 5983247

11 files changed

+165
-9
lines changed

‎README.md

+5-2
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (601 solved)
1+
# **[LeetCode Records](https://leetcode.com/u/Zanger/)** (604 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>), [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>), [Trie](<markdowns/by_topic/Trie.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Database](<markdowns/by_topic/Database.md>), [Graph](<markdowns/by_topic/Graph.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Union Find](<markdowns/by_topic/Union Find.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>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.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>), [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>), [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>), [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>)
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>), [Stack](<markdowns/by_topic/Stack.md>), [Dynamic Programming](<markdowns/by_topic/Dynamic Programming.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>), [Trie](<markdowns/by_topic/Trie.md>), [Prefix Sum](<markdowns/by_topic/Prefix Sum.md>), [Recursion](<markdowns/by_topic/Recursion.md>), [Sliding Window](<markdowns/by_topic/Sliding Window.md>), [Database](<markdowns/by_topic/Database.md>), [Graph](<markdowns/by_topic/Graph.md>), [Binary Search Tree](<markdowns/by_topic/Binary Search Tree.md>), [Union Find](<markdowns/by_topic/Union Find.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>), [Ordered Set](<markdowns/by_topic/Ordered Set.md>), [Brainteaser](<markdowns/by_topic/Brainteaser.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>), [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>), [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>), [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

@@ -145,6 +145,7 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
145145
| 226 | [Invert Binary Tree](<https://leetcode.com/problems/invert-binary-tree>) | Easy | B75, N150 | [solution](<markdowns/_226. Invert Binary Tree.md>) | py |
146146
| 227 | [Basic Calculator II](<https://leetcode.com/problems/basic-calculator-ii>) | Medium | | [solution](<markdowns/_227. Basic Calculator II.md>) | py |
147147
| 230 | [Kth Smallest Element in a BST](<https://leetcode.com/problems/kth-smallest-element-in-a-bst>) | Medium | B75, N150 | [solution](<markdowns/_230. Kth Smallest Element in a BST.md>) | py |
148+
| 231 | [Power of Two](<https://leetcode.com/problems/power-of-two>) | Easy | | [solution](<markdowns/_231. Power of Two.md>) | py |
148149
| 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](<markdowns/_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py |
149150
| 236 | [Lowest Common Ancestor of a Binary Tree](<https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree>) | Medium | B75 | [solution](<markdowns/_236. Lowest Common Ancestor of a Binary Tree.md>) | py |
150151
| 238 | [Product of Array Except Self](<https://leetcode.com/problems/product-of-array-except-self>) | Medium | B75, N150 | [solution](<markdowns/_238. Product of Array Except Self.md>) | py |
@@ -162,10 +163,12 @@ This repo is a collection of my LeetCode solutions, primarily written in Python,
162163
| 314 | [Binary Tree Vertical Order Traversal](<https://leetcode.com/problems/binary-tree-vertical-order-traversal>) | Medium | | [solution](<markdowns/_314. Binary Tree Vertical Order Traversal.md>) | py |
163164
| 320 | [Generalized Abbreviation](<https://leetcode.com/problems/generalized-abbreviation>) | Medium | Weekly Premium | [solution](<markdowns/_320. Generalized Abbreviation.md>) | py |
164165
| 322 | [Coin Change](<https://leetcode.com/problems/coin-change>) | Medium | B75, N150 | [solution](<markdowns/_322. Coin Change.md>) | py |
166+
| 326 | [Power of Three](<https://leetcode.com/problems/power-of-three>) | Easy | | [solution](<markdowns/_326. Power of Three.md>) | py |
165167
| 328 | [Odd Even Linked List](<https://leetcode.com/problems/odd-even-linked-list>) | Medium | | [solution](<markdowns/_328. Odd Even Linked List.md>) | py |
166168
| 330 | [Patching Array](<https://leetcode.com/problems/patching-array>) | Hard | Daily | [solution](<markdowns/_330. Patching Array.md>) | py |
167169
| 339 | [Nested List Weight Sum](<https://leetcode.com/problems/nested-list-weight-sum>) | Medium | | [solution](<markdowns/_339. Nested List Weight Sum.md>) | c, py |
168170
| 341 | [Flatten Nested List Iterator](<https://leetcode.com/problems/flatten-nested-list-iterator>) | Medium | | [solution](<markdowns/_341. Flatten Nested List Iterator.md>) | java |
171+
| 342 | [Power of Four](<https://leetcode.com/problems/power-of-four>) | Easy | | [solution](<markdowns/_342. Power of Four.md>) | py |
169172
| 344 | [Reverse String](<https://leetcode.com/problems/reverse-string>) | Easy | Daily | [solution](<markdowns/_344. Reverse String.md>) | java, py |
170173
| 345 | [Reverse Vowels of a String](<https://leetcode.com/problems/reverse-vowels-of-a-string>) | Easy | | [solution](<markdowns/_345. Reverse Vowels of a String.md>) | py |
171174
| 347 | [Top K Frequent Elements](<https://leetcode.com/problems/top-k-frequent-elements>) | Medium | B75, N150 | [solution](<markdowns/_347. Top K Frequent Elements.md>) | py |

‎markdowns/Easy.md

+4-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# Easy Questions (172)
1+
# Easy Questions (175)
22

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

@@ -42,8 +42,11 @@
4242
| 206 | [Reverse Linked List](<https://leetcode.com/problems/reverse-linked-list>) | Easy | B75, N150 | [solution](<_206. Reverse Linked List.md>) | java | Jun 27, 2024 |
4343
| 217 | [Contains Duplicate](<https://leetcode.com/problems/contains-duplicate>) | Easy | B75, N150 | [solution](<_217. Contains Duplicate.md>) | py | Jun 12, 2024 |
4444
| 226 | [Invert Binary Tree](<https://leetcode.com/problems/invert-binary-tree>) | Easy | B75, N150 | [solution](<_226. Invert Binary Tree.md>) | py | Jul 03, 2024 |
45+
| 231 | [Power of Two](<https://leetcode.com/problems/power-of-two>) | Easy | | [solution](<_231. Power of Two.md>) | py | Mar 04, 2025 |
4546
| 242 | [Valid Anagram](<https://leetcode.com/problems/valid-anagram>) | Easy | B75, N150 | [solution](<_242. Valid Anagram.md>) | c, py | Jun 13, 2024 |
4647
| 292 | [Nim Game](<https://leetcode.com/problems/nim-game>) | Easy | | [solution](<_292. Nim Game.md>) | py | May 23, 2024 |
48+
| 326 | [Power of Three](<https://leetcode.com/problems/power-of-three>) | Easy | | [solution](<_326. Power of Three.md>) | py | Mar 04, 2025 |
49+
| 342 | [Power of Four](<https://leetcode.com/problems/power-of-four>) | Easy | | [solution](<_342. Power of Four.md>) | py | Mar 04, 2025 |
4750
| 344 | [Reverse String](<https://leetcode.com/problems/reverse-string>) | Easy | Daily | [solution](<_344. Reverse String.md>) | java, py | Jun 02, 2024 |
4851
| 345 | [Reverse Vowels of a String](<https://leetcode.com/problems/reverse-vowels-of-a-string>) | Easy | | [solution](<_345. Reverse Vowels of a String.md>) | py | May 23, 2024 |
4952
| 350 | [Intersection of Two Arrays II](<https://leetcode.com/problems/intersection-of-two-arrays-ii>) | Easy | Daily | [solution](<_350. Intersection of Two Arrays II.md>) | java, py | Jul 02, 2024 |

0 commit comments

Comments
 (0)