Skip to content

Commit ec950ad

Browse files
committed
Tested leetcode extension compat
1 parent b0d80ce commit ec950ad

11 files changed

+220
-0
lines changed

Diff for: README.md

+4
Original file line numberDiff line numberDiff line change
@@ -67,9 +67,11 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
6767
| 111 | [Minimum Depth of Binary Tree](<https://leetcode.com/problems/minimum-depth-of-binary-tree>) | Easy | | [solution](<markdowns/_111. Minimum Depth of Binary Tree.md>) | c |
6868
| 114 | [Flatten Binary Tree to Linked List](<https://leetcode.com/problems/flatten-binary-tree-to-linked-list>) | Medium | | [solution](<markdowns/_114. Flatten Binary Tree to Linked List.md>) | py, c |
6969
| 118 | [Pascal's Triangle](<https://leetcode.com/problems/pascals-triangle>) | Easy | | [solution](<markdowns/_118. Pascal's Triangle.md>) | py |
70+
| 121 | [Best Time to Buy and Sell Stock](<https://leetcode.com/problems/best-time-to-buy-and-sell-stock>) | Easy | B75, N150 | [solution](<markdowns/_121. Best Time to Buy and Sell Stock.md>) | py |
7071
| 125 | [Valid Palindrome](<https://leetcode.com/problems/valid-palindrome>) | Easy | B75, N150 | [solution](<markdowns/_125. Valid Palindrome.md>) | py, c |
7172
| 128 | [Longest Consecutive Sequence](<https://leetcode.com/problems/longest-consecutive-sequence>) | Medium | B75, N150 | [solution](<markdowns/_128. Longest Consecutive Sequence.md>) | java, py |
7273
| 129 | [Sum Root to Leaf Numbers](<https://leetcode.com/problems/sum-root-to-leaf-numbers>) | Medium | | [solution](<markdowns/_129. Sum Root to Leaf Numbers.md>) | py |
74+
| 136 | [Single Number](<https://leetcode.com/problems/single-number>) | Easy | N150 | [solution](<markdowns/_136. Single Number.md>) | py |
7375
| 138 | [Copy List with Random Pointer](<https://leetcode.com/problems/copy-list-with-random-pointer>) | Medium | N150 | [solution](<markdowns/_138. Copy List with Random Pointer.md>) | py |
7476
| 141 | [Linked List Cycle](<https://leetcode.com/problems/linked-list-cycle>) | Easy | B75, N150 | [solution](<markdowns/_141. Linked List Cycle.md>) | py, c |
7577
| 142 | [Linked List Cycle II](<https://leetcode.com/problems/linked-list-cycle-ii>) | Medium | | [solution](<markdowns/_142. Linked List Cycle II.md>) | py |
@@ -88,6 +90,7 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
8890
| 183 | [Customers Who Never Order](<https://leetcode.com/problems/customers-who-never-order>) | Easy | | [solution](<markdowns/_183. Customers Who Never Order.md>) | sql |
8991
| 184 | [Department Highest Salary](<https://leetcode.com/problems/department-highest-salary>) | Medium | | [solution](<markdowns/_184. Department Highest Salary.md>) | sql |
9092
| 189 | [Rotate Array](<https://leetcode.com/problems/rotate-array>) | Medium | | [solution](<markdowns/_189. Rotate Array.md>) | py |
93+
| 191 | [Number of 1 Bits](<https://leetcode.com/problems/number-of-1-bits>) | Easy | B75, N150 | [solution](<markdowns/_191. Number of 1 Bits.md>) | py |
9194
| 196 | [Delete Duplicate Emails](<https://leetcode.com/problems/delete-duplicate-emails>) | Easy | | [solution](<markdowns/_196. Delete Duplicate Emails.md>) | sql, py |
9295
| 197 | [Rising Temperature](<https://leetcode.com/problems/rising-temperature>) | Easy | | [solution](<markdowns/_197. Rising Temperature.md>) | sql |
9396
| 200 | [Number of Islands](<https://leetcode.com/problems/number-of-islands>) | Medium | B75, N150 | [solution](<markdowns/_200. Number of Islands.md>) | py |
@@ -97,6 +100,7 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
97100
| 212 | [Word Search II](<https://leetcode.com/problems/word-search-ii>) | Hard | B75, N150 | [solution](<markdowns/_212. Word Search II.md>) | py |
98101
| 217 | [Contains Duplicate](<https://leetcode.com/problems/contains-duplicate>) | Easy | B75, N150 | [solution](<markdowns/_217. Contains Duplicate.md>) | py |
99102
| 224 | [Basic Calculator](<https://leetcode.com/problems/basic-calculator>) | Hard | | [solution](<markdowns/_224. Basic Calculator.md>) | py |
103+
| 226 | [Invert Binary Tree](<https://leetcode.com/problems/invert-binary-tree>) | Easy | B75, N150 | [solution](<markdowns/_226. Invert Binary Tree.md>) | py |
100104
| 227 | [Basic Calculator II](<https://leetcode.com/problems/basic-calculator-ii>) | Medium | | [solution](<markdowns/_227. Basic Calculator II.md>) | py |
101105
| 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 |
102106
| 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 |

Diff for: markdowns/Questions_By_Code_Length.md

+4
Original file line numberDiff line numberDiff line change
@@ -260,6 +260,7 @@ Calculations are based on the code files's byte sizes.
260260
| 1233 | [Remove Sub-Folders from the Filesystem](<https://leetcode.com/problems/remove-sub-folders-from-the-filesystem>) | Medium | | [solution](<_1233. Remove Sub-Folders from the Filesystem.md>) | py | Jun 27, 2024 |
261261
| 27 | [Remove Element](<https://leetcode.com/problems/remove-element>) | Easy | | [solution](<_27. Remove Element.md>) | java, py | Jun 02, 2024 |
262262
| 2086 | [Minimum Number of Food Buckets to Feed the Hamsters](<https://leetcode.com/problems/minimum-number-of-food-buckets-to-feed-the-hamsters>) | Medium | | [solution](<_2086. Minimum Number of Food Buckets to Feed the Hamsters.md>) | java | Jul 01, 2024 |
263+
| 226 | [Invert Binary Tree](<https://leetcode.com/problems/invert-binary-tree>) | Easy | B75, N150 | [solution](<_226. Invert Binary Tree.md>) | py | Jul 03, 2024 |
263264
| 57 | [Insert Interval](<https://leetcode.com/problems/insert-interval>) | Medium | B75, N150 | [solution](<_57. Insert Interval.md>) | py | Jun 18, 2024 |
264265
| 3191 | Question 3191 | Medium | | [solution](<_3191. Question 319.md>) | java | Jun 22, 2024 |
265266
| 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 |
@@ -288,6 +289,7 @@ Calculations are based on the code files's byte sizes.
288289
| 663 | [Equal Tree Partition](<https://leetcode.com/problems/equal-tree-partition>) | Medium | Daily | [solution](<_663. Equal Tree Partition.md>) | py | Jun 16, 2024 |
289290
| 3110 | [Score of a String](<https://leetcode.com/problems/score-of-a-string>) | Easy | Daily | [solution](<_3110. Score of a String.md>) | java, py | May 31, 2024 |
290291
| 292 | [Nim Game](<https://leetcode.com/problems/nim-game>) | Easy | | [solution](<_292. Nim Game.md>) | py | May 23, 2024 |
292+
| 121 | [Best Time to Buy and Sell Stock](<https://leetcode.com/problems/best-time-to-buy-and-sell-stock>) | Easy | B75, N150 | [solution](<_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 |
291293
| 189 | [Rotate Array](<https://leetcode.com/problems/rotate-array>) | Medium | | [solution](<_189. Rotate Array.md>) | py | Jun 02, 2024 |
292294
| 392 | [Is Subsequence](<https://leetcode.com/problems/is-subsequence>) | Easy | | [solution](<_392. Is Subsequence.md>) | java | Jun 21, 2024 |
293295
| 167 | [Two Sum II - Input Array Is Sorted](<https://leetcode.com/problems/two-sum-ii-input-array-is-sorted>) | Medium | N150 | [solution](<_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 |
@@ -317,12 +319,14 @@ Calculations are based on the code files's byte sizes.
317319
| 867 | [Transpose Matrix](<https://leetcode.com/problems/transpose-matrix>) | Easy | | [solution](<_867. Transpose Matrix.md>) | py | Jun 14, 2024 |
318320
| 1844 | [Replace All Digits with Characters](<https://leetcode.com/problems/replace-all-digits-with-characters>) | Easy | | [solution](<_1844. Replace All Digits with Characters.md>) | py | Jun 29, 2024 |
319321
| 3178 | w contest 401 - q1 | Easy | Contest | [solution](<_3178. w contest 401 - q.md>) | py | Jun 08, 2024 |
322+
| 191 | [Number of 1 Bits](<https://leetcode.com/problems/number-of-1-bits>) | Easy | B75, N150 | [solution](<_191. Number of 1 Bits.md>) | py | Jul 03, 2024 |
320323
| 3074 | [Apple Redistribution into Boxes](<https://leetcode.com/problems/apple-redistribution-into-boxes>) | Easy | | [solution](<_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 |
321324
| 9 | [Palindrome Number](<https://leetcode.com/problems/palindrome-number>) | Easy | | [solution](<_9. Palindrome Number.md>) | java | May 22, 2024 |
322325
| 1030 | [Matrix Cells in Distance Order](<https://leetcode.com/problems/matrix-cells-in-distance-order>) | Easy | | [solution](<_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 |
323326
| 184 | [Department Highest Salary](<https://leetcode.com/problems/department-highest-salary>) | Medium | | [solution](<_184. Department Highest Salary.md>) | sql | Jun 07, 2024 |
324327
| 2011 | [Final Value of Variable After Performing Operations](<https://leetcode.com/problems/final-value-of-variable-after-performing-operations>) | Easy | | [solution](<_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 |
325328
| 2678 | [Number of Senior Citizens](<https://leetcode.com/problems/number-of-senior-citizens>) | Easy | | [solution](<_2678. Number of Senior Citizens.md>) | java | May 22, 2024 |
329+
| 136 | [Single Number](<https://leetcode.com/problems/single-number>) | Easy | N150 | [solution](<_136. Single Number.md>) | py | Jul 03, 2024 |
326330
| 2389 | [Longest Subsequence With Limited Sum](<https://leetcode.com/problems/longest-subsequence-with-limited-sum>) | Easy | | [solution](<_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 |
327331
| 1561 | [Maximum Number of Coins You Can Get](<https://leetcode.com/problems/maximum-number-of-coins-you-can-get>) | Medium | | [solution](<_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 |
328332
| 2248 | [Intersection of Multiple Arrays](<https://leetcode.com/problems/intersection-of-multiple-arrays>) | Easy | | [solution](<_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 |

0 commit comments

Comments
 (0)