From fc6737f22069341fc8068d2749de8d67fef62600 Mon Sep 17 00:00:00 2001 From: Zanger67 Date: Sun, 7 Jul 2024 02:55:29 -0700 Subject: [PATCH] Removed orphan markdowns --- markdowns/Topics.md | 58 ------ markdowns/_3168. Weekly Contest 400 - q.md | 45 ----- markdowns/_3169. Weekly Contest 400 - q.md | 61 ------ markdowns/_3174. Biweekly Contest 132 - q.md | 53 ------ markdowns/_3175. Biweekly Contest 132 - q.md | 53 ------ markdowns/_3178. Weekly Contest 401 - q.md | 40 ---- markdowns/_3179. Weekly Contest 401 - q.md | 64 ------- markdowns/_3180. Weekly Contest 401 - q.md | 128 ------------- markdowns/_3184. Question 3184 - q.md | 40 ---- markdowns/_3184. Weekly Contest 402 - q.md | 40 ---- markdowns/_3185. Question 3185 - q.md | 55 ------ markdowns/_3185. Weekly Contest 402 - q.md | 55 ------ markdowns/_3186. Question 3186 - q.md | 54 ------ markdowns/_3186. Weekly Contest 402 - q.md | 54 ------ markdowns/_3190. Question 319.md | 43 ----- markdowns/_3191. Question 319.md | 52 ----- markdowns/_3192. Question 319.md | 64 ------- markdowns/_3194. Question 3194 - q.md | 39 ---- markdowns/_3194. Weekly Contest 403 - q.md | 39 ---- markdowns/_3195. Question 3195 - q.md | 59 ------ markdowns/_3195. Weekly Contest 403 - q.md | 59 ------ markdowns/_3196. Question 3196 - q.md | 65 ------- markdowns/_3196. Weekly Contest 403 - q.md | 65 ------- markdowns/_3210. Question 3210 - q.md | 34 ---- markdowns/_3210. Weekly Contest 405 - q.md | 34 ---- markdowns/_3211. Question 3211 - q.md | 53 ------ markdowns/_3211. Weekly Contest 405 - q.md | 53 ------ markdowns/_3212. Question 3212 - q.md | 101 ---------- markdowns/_3212. Weekly Contest 405 - q.md | 101 ---------- markdowns/_3213. Question 3213 - q.md | 118 ------------ markdowns/_3213. Weekly Contest 405 - q.md | 65 ------- markdowns/by_topic/Array.md | 189 ------------------- markdowns/by_topic/Backtracking.md | 21 --- markdowns/by_topic/Binary Search Tree.md | 21 --- markdowns/by_topic/Binary Search.md | 26 --- markdowns/by_topic/Binary Tree.md | 69 ------- markdowns/by_topic/Bit Manipulation.md | 32 ---- markdowns/by_topic/Bitmask.md | 9 - markdowns/by_topic/Brainteaser.md | 10 - markdowns/by_topic/Breadth-First Search.md | 55 ------ markdowns/by_topic/Bucket Sort.md | 11 -- markdowns/by_topic/Combinatorics.md | 12 -- markdowns/by_topic/Counting Sort.md | 10 - markdowns/by_topic/Counting.md | 22 --- markdowns/by_topic/Data Stream.md | 10 - markdowns/by_topic/Database.md | 26 --- markdowns/by_topic/Depth-First Search.md | 76 -------- markdowns/by_topic/Design.md | 33 ---- markdowns/by_topic/Divide and Conquer.md | 14 -- markdowns/by_topic/Doubly-Linked List.md | 11 -- markdowns/by_topic/Dynamic Programming.md | 28 --- markdowns/by_topic/Game Theory.md | 10 - markdowns/by_topic/Geometry.md | 10 - markdowns/by_topic/Graph.md | 14 -- markdowns/by_topic/Greedy.md | 39 ---- markdowns/by_topic/Hash Function.md | 12 -- markdowns/by_topic/Hash Table.md | 97 ---------- markdowns/by_topic/Heap (Priority Queue).md | 24 --- markdowns/by_topic/Interactive.md | 10 - markdowns/by_topic/Iterator.md | 11 -- markdowns/by_topic/Linked List.md | 48 ----- markdowns/by_topic/Math.md | 58 ------ markdowns/by_topic/Matrix.md | 38 ---- markdowns/by_topic/Memoization.md | 10 - markdowns/by_topic/Merge Sort.md | 9 - markdowns/by_topic/Monotonic Queue.md | 11 -- markdowns/by_topic/Monotonic Stack.md | 17 -- markdowns/by_topic/Number Theory.md | 9 - markdowns/by_topic/Ordered Set.md | 9 - markdowns/by_topic/Prefix Sum.md | 18 -- markdowns/by_topic/Queue.md | 17 -- markdowns/by_topic/Quickselect.md | 10 - markdowns/by_topic/Randomized.md | 12 -- markdowns/by_topic/Recursion.md | 22 --- markdowns/by_topic/Reservoir Sampling.md | 9 - markdowns/by_topic/Rolling Hash.md | 10 - markdowns/by_topic/Shortest Path.md | 9 - markdowns/by_topic/Simulation.md | 35 ---- markdowns/by_topic/Sliding Window.md | 20 -- markdowns/by_topic/Sorting.md | 63 ------- markdowns/by_topic/Stack.md | 45 ----- markdowns/by_topic/String Matching.md | 14 -- markdowns/by_topic/String.md | 96 ---------- markdowns/by_topic/Suffix Array.md | 9 - markdowns/by_topic/Topological Sort.md | 9 - markdowns/by_topic/Tree.md | 74 -------- markdowns/by_topic/Trie.md | 26 --- markdowns/by_topic/Two Pointers.md | 52 ----- markdowns/by_topic/Union Find.md | 16 -- 89 files changed, 3531 deletions(-) delete mode 100644 markdowns/_3168. Weekly Contest 400 - q.md delete mode 100644 markdowns/_3169. Weekly Contest 400 - q.md delete mode 100644 markdowns/_3174. Biweekly Contest 132 - q.md delete mode 100644 markdowns/_3175. Biweekly Contest 132 - q.md delete mode 100644 markdowns/_3178. Weekly Contest 401 - q.md delete mode 100644 markdowns/_3179. Weekly Contest 401 - q.md delete mode 100644 markdowns/_3180. Weekly Contest 401 - q.md delete mode 100644 markdowns/_3184. Question 3184 - q.md delete mode 100644 markdowns/_3184. Weekly Contest 402 - q.md delete mode 100644 markdowns/_3185. Question 3185 - q.md delete mode 100644 markdowns/_3185. Weekly Contest 402 - q.md delete mode 100644 markdowns/_3186. Question 3186 - q.md delete mode 100644 markdowns/_3186. Weekly Contest 402 - q.md delete mode 100644 markdowns/_3190. Question 319.md delete mode 100644 markdowns/_3191. Question 319.md delete mode 100644 markdowns/_3192. Question 319.md delete mode 100644 markdowns/_3194. Question 3194 - q.md delete mode 100644 markdowns/_3194. Weekly Contest 403 - q.md delete mode 100644 markdowns/_3195. Question 3195 - q.md delete mode 100644 markdowns/_3195. Weekly Contest 403 - q.md delete mode 100644 markdowns/_3196. Question 3196 - q.md delete mode 100644 markdowns/_3196. Weekly Contest 403 - q.md delete mode 100644 markdowns/_3210. Question 3210 - q.md delete mode 100644 markdowns/_3210. Weekly Contest 405 - q.md delete mode 100644 markdowns/_3211. Question 3211 - q.md delete mode 100644 markdowns/_3211. Weekly Contest 405 - q.md delete mode 100644 markdowns/_3212. Question 3212 - q.md delete mode 100644 markdowns/_3212. Weekly Contest 405 - q.md delete mode 100644 markdowns/_3213. Question 3213 - q.md delete mode 100644 markdowns/_3213. Weekly Contest 405 - q.md delete mode 100644 markdowns/by_topic/Array.md delete mode 100644 markdowns/by_topic/Backtracking.md delete mode 100644 markdowns/by_topic/Binary Search Tree.md delete mode 100644 markdowns/by_topic/Binary Search.md delete mode 100644 markdowns/by_topic/Binary Tree.md delete mode 100644 markdowns/by_topic/Bit Manipulation.md delete mode 100644 markdowns/by_topic/Bitmask.md delete mode 100644 markdowns/by_topic/Brainteaser.md delete mode 100644 markdowns/by_topic/Breadth-First Search.md delete mode 100644 markdowns/by_topic/Bucket Sort.md delete mode 100644 markdowns/by_topic/Combinatorics.md delete mode 100644 markdowns/by_topic/Counting Sort.md delete mode 100644 markdowns/by_topic/Counting.md delete mode 100644 markdowns/by_topic/Data Stream.md delete mode 100644 markdowns/by_topic/Database.md delete mode 100644 markdowns/by_topic/Depth-First Search.md delete mode 100644 markdowns/by_topic/Design.md delete mode 100644 markdowns/by_topic/Divide and Conquer.md delete mode 100644 markdowns/by_topic/Doubly-Linked List.md delete mode 100644 markdowns/by_topic/Dynamic Programming.md delete mode 100644 markdowns/by_topic/Game Theory.md delete mode 100644 markdowns/by_topic/Geometry.md delete mode 100644 markdowns/by_topic/Graph.md delete mode 100644 markdowns/by_topic/Greedy.md delete mode 100644 markdowns/by_topic/Hash Function.md delete mode 100644 markdowns/by_topic/Hash Table.md delete mode 100644 markdowns/by_topic/Heap (Priority Queue).md delete mode 100644 markdowns/by_topic/Interactive.md delete mode 100644 markdowns/by_topic/Iterator.md delete mode 100644 markdowns/by_topic/Linked List.md delete mode 100644 markdowns/by_topic/Math.md delete mode 100644 markdowns/by_topic/Matrix.md delete mode 100644 markdowns/by_topic/Memoization.md delete mode 100644 markdowns/by_topic/Merge Sort.md delete mode 100644 markdowns/by_topic/Monotonic Queue.md delete mode 100644 markdowns/by_topic/Monotonic Stack.md delete mode 100644 markdowns/by_topic/Number Theory.md delete mode 100644 markdowns/by_topic/Ordered Set.md delete mode 100644 markdowns/by_topic/Prefix Sum.md delete mode 100644 markdowns/by_topic/Queue.md delete mode 100644 markdowns/by_topic/Quickselect.md delete mode 100644 markdowns/by_topic/Randomized.md delete mode 100644 markdowns/by_topic/Recursion.md delete mode 100644 markdowns/by_topic/Reservoir Sampling.md delete mode 100644 markdowns/by_topic/Rolling Hash.md delete mode 100644 markdowns/by_topic/Shortest Path.md delete mode 100644 markdowns/by_topic/Simulation.md delete mode 100644 markdowns/by_topic/Sliding Window.md delete mode 100644 markdowns/by_topic/Sorting.md delete mode 100644 markdowns/by_topic/Stack.md delete mode 100644 markdowns/by_topic/String Matching.md delete mode 100644 markdowns/by_topic/String.md delete mode 100644 markdowns/by_topic/Suffix Array.md delete mode 100644 markdowns/by_topic/Topological Sort.md delete mode 100644 markdowns/by_topic/Tree.md delete mode 100644 markdowns/by_topic/Trie.md delete mode 100644 markdowns/by_topic/Two Pointers.md delete mode 100644 markdowns/by_topic/Union Find.md diff --git a/markdowns/Topics.md b/markdowns/Topics.md index c23f3802..d3f42dee 100644 --- a/markdowns/Topics.md +++ b/markdowns/Topics.md @@ -4,61 +4,3 @@ ------ -- [Array]() (181 completed) -- [Hash Table]() (89 completed) -- [String]() (88 completed) -- [Depth-First Search]() (68 completed) -- [Tree]() (66 completed) -- [Binary Tree]() (61 completed) -- [Sorting]() (55 completed) -- [Math]() (50 completed) -- [Breadth-First Search]() (47 completed) -- [Two Pointers]() (44 completed) -- [Linked List]() (40 completed) -- [Stack]() (37 completed) -- [Greedy]() (31 completed) -- [Matrix]() (30 completed) -- [Simulation]() (27 completed) -- [Design]() (25 completed) -- [Bit Manipulation]() (24 completed) -- [Dynamic Programming]() (20 completed) -- [Database]() (18 completed) -- [Binary Search]() (18 completed) -- [Trie]() (18 completed) -- [Heap (Priority Queue)]() (16 completed) -- [Counting]() (14 completed) -- [Recursion]() (14 completed) -- [Backtracking]() (13 completed) -- [Binary Search Tree]() (13 completed) -- [Sliding Window]() (12 completed) -- [Prefix Sum]() (10 completed) -- [Queue]() (9 completed) -- [Monotonic Stack]() (9 completed) -- [Union Find]() (8 completed) -- [Divide and Conquer]() (6 completed) -- [String Matching]() (6 completed) -- [Graph]() (6 completed) -- [Hash Function]() (4 completed) -- [Combinatorics]() (4 completed) -- [Randomized]() (4 completed) -- [Monotonic Queue]() (3 completed) -- [Doubly-Linked List]() (3 completed) -- [Iterator]() (3 completed) -- [Bucket Sort]() (3 completed) -- [Geometry]() (2 completed) -- [Counting Sort]() (2 completed) -- [Brainteaser]() (2 completed) -- [Game Theory]() (2 completed) -- [Interactive]() (2 completed) -- [Memoization]() (2 completed) -- [Data Stream]() (2 completed) -- [Rolling Hash]() (2 completed) -- [Quickselect]() (2 completed) -- [Bitmask]() (1 completed) -- [Merge Sort]() (1 completed) -- [Ordered Set]() (1 completed) -- [Suffix Array]() (1 completed) -- [Topological Sort]() (1 completed) -- [Shortest Path]() (1 completed) -- [Number Theory]() (1 completed) -- [Reservoir Sampling]() (1 completed) diff --git a/markdowns/_3168. Weekly Contest 400 - q.md b/markdowns/_3168. Weekly Contest 400 - q.md deleted file mode 100644 index 7c96fa61..00000000 --- a/markdowns/_3168. Weekly Contest 400 - q.md +++ /dev/null @@ -1,45 +0,0 @@ -# 3168. Weekly Contest 400 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 01, 2024* -> -> *Last updated : June 01, 2024* - - ------- - -> **Related Topics** : **[String](), [Simulation]()** -> -> **Acceptance Rate** : **80.587 %** - - ------- - -## Solutions - -- [Weekly Contest 400/e3168 Weekly Contest 400 q1.py](<../my-submissions/Weekly Contest 400/e3168 Weekly Contest 400 q1.py>) -### Python -#### [e3168 Weekly Contest 400 q1.py](<../my-submissions/Weekly Contest 400/e3168 Weekly Contest 400 q1.py>) -```Python -# https://leetcode.com/problems/minimum-number-of-chairs-in-a-waiting-room/description/ - -# Did during Weekly Contest 400 - -class Solution: - def minimumChairs(self, s: str) -> int: - maxx = 0 - curr = 0 - for i in s : - if i == 'L' : - curr = max(0, curr - 1) - else : - curr += 1 - maxx = max(curr, maxx) - return maxx -``` - diff --git a/markdowns/_3169. Weekly Contest 400 - q.md b/markdowns/_3169. Weekly Contest 400 - q.md deleted file mode 100644 index f78d7cef..00000000 --- a/markdowns/_3169. Weekly Contest 400 - q.md +++ /dev/null @@ -1,61 +0,0 @@ -# 3169. Weekly Contest 400 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 01, 2024* -> -> *Last updated : June 01, 2024* - - ------- - -> **Related Topics** : **[Array](), [Sorting]()** -> -> **Acceptance Rate** : **33.105 %** - - ------- - -## Solutions - -- [Weekly Contest 400/m3169 Weekly Contest 400 q2.py](<../my-submissions/Weekly Contest 400/m3169 Weekly Contest 400 q2.py>) -### Python -#### [m3169 Weekly Contest 400 q2.py](<../my-submissions/Weekly Contest 400/m3169 Weekly Contest 400 q2.py>) -```Python -# https://leetcode.com/problems/count-days-without-meetings/ - -# Did in Weekly-Contest 400 -# https://leetcode.com/contest/weekly-contest-400/ - -''' Notes - days - meetingDays --> but meetingDays has overlaps - days - meetingDays + overlaps = answer - -''' - - -class Solution: - def countDays(self, days: int, meetings: List[List[int]]) -> int: - meetings = sorted(meetings) - - currentL, currentR = meetings[0] - counter = currentL - 1 - - # print(meetings) - for met in meetings[1:] : - # print(currentL, currentR) - if met[0] <= currentR : - currentR = max(met[1], currentR) - else : - counter += met[0] - currentR - 1 - currentL, currentR = met - - # print(counter, counter? - counter += days - currentR - return counter -``` - diff --git a/markdowns/_3174. Biweekly Contest 132 - q.md b/markdowns/_3174. Biweekly Contest 132 - q.md deleted file mode 100644 index bad9e049..00000000 --- a/markdowns/_3174. Biweekly Contest 132 - q.md +++ /dev/null @@ -1,53 +0,0 @@ -# 3174. Biweekly Contest 132 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 08, 2024* -> -> *Last updated : June 08, 2024* - - ------- - -> **Related Topics** : **[Hash Table](), [String](), [Simulation]()** -> -> **Acceptance Rate** : **72.042 %** - - ------- - -## Solutions - -- [Biweekly Contest 132/e3174 q1.py](<../my-submissions/Biweekly Contest 132/e3174 q1.py>) -### Python -#### [e3174 q1.py](<../my-submissions/Biweekly Contest 132/e3174 q1.py>) -```Python -# https://leetcode.com/problems/clear-digits/ - -# Pretty bad contest due to server issues and lag to a point where submissions and -# feedback were taking 10+ minutes each... - -# Last week's weekly contest was similar not with lag but with the servers being down -# for the first 15 minutes ;-;;;; - -class Solution: - def clearDigits(self, s: str) -> str: - output = list(s) - - lets = set(list('abcdefghijklmnopqrstuvwxyz')) - nums = set(list('0123456789')) - - for i in range(len(output)) : - if output[i] in nums: - output[i] = '' - for j in range(i - 1, -1, -1) : - if output[j] in lets : - output[j] = '' - break - return ''.join(output) -``` - diff --git a/markdowns/_3175. Biweekly Contest 132 - q.md b/markdowns/_3175. Biweekly Contest 132 - q.md deleted file mode 100644 index afd76a89..00000000 --- a/markdowns/_3175. Biweekly Contest 132 - q.md +++ /dev/null @@ -1,53 +0,0 @@ -# 3175. Biweekly Contest 132 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 08, 2024* -> -> *Last updated : June 08, 2024* - - ------- - -> **Related Topics** : **[Array](), [Simulation]()** -> -> **Acceptance Rate** : **38.974 %** - - ------- - -## Solutions - -- [Biweekly Contest 132/m3175 q2.py](<../my-submissions/Biweekly Contest 132/m3175 q2.py>) -### Python -#### [m3175 q2.py](<../my-submissions/Biweekly Contest 132/m3175 q2.py>) -```Python -# https://leetcode.com/problems/find-the-first-player-to-win-k-games-in-a-row/ - -from collections import deque - -class Solution: - def findWinningPlayer(self, skills: List[int], k: int) -> int: - gaming = deque(list(range(0,len(skills)))) - wins = {} - - currentKingOfHill = gaming.popleft() - counter = 0 - while wins.get(currentKingOfHill, 0) < k : - if counter > len(skills) : - return currentKingOfHill - if skills[currentKingOfHill] > skills[gaming[0]] : - gaming.append(gaming.popleft()) - counter += 1 - else : - counter = 0 - gaming.append(currentKingOfHill) - currentKingOfHill = gaming.popleft() - wins[currentKingOfHill] = wins.get(currentKingOfHill, 0) + 1 - return currentKingOfHill -``` - diff --git a/markdowns/_3178. Weekly Contest 401 - q.md b/markdowns/_3178. Weekly Contest 401 - q.md deleted file mode 100644 index 4b4b3f38..00000000 --- a/markdowns/_3178. Weekly Contest 401 - q.md +++ /dev/null @@ -1,40 +0,0 @@ -# 3178. Weekly Contest 401 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 08, 2024* -> -> *Last updated : June 08, 2024* - - ------- - -> **Related Topics** : **[Math](), [Simulation]()** -> -> **Acceptance Rate** : **62.369 %** - - ------- - -## Solutions - -- [Weekly Contest 401/e3178 q1.py](<../my-submissions/Weekly Contest 401/e3178 q1.py>) -### Python -#### [e3178 q1.py](<../my-submissions/Weekly Contest 401/e3178 q1.py>) -```Python -# https://leetcode.com/problems/find-the-child-who-has-the-ball-after-k-seconds/ -# https://leetcode.com/contest/weekly-contest-401/ - -class Solution: - def numberOfChild(self, n: int, k: int) -> int: - k %= (2 * n - 2) - if k >= n : - return (n - 1) - (k - (n - 1)) - return k - -``` - diff --git a/markdowns/_3179. Weekly Contest 401 - q.md b/markdowns/_3179. Weekly Contest 401 - q.md deleted file mode 100644 index 895921c3..00000000 --- a/markdowns/_3179. Weekly Contest 401 - q.md +++ /dev/null @@ -1,64 +0,0 @@ -# 3179. Weekly Contest 401 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 08, 2024* -> -> *Last updated : June 08, 2024* - - ------- - -> **Related Topics** : **[Array](), [Math](), [Simulation](), [Combinatorics](), [Prefix Sum]()** -> -> **Acceptance Rate** : **55.648 %** - - ------- - -## Solutions - -- [Weekly Contest 401/m3179 q2 brute force but worked.py](<../my-submissions/Weekly Contest 401/m3179 q2 brute force but worked.py>) -### Python -#### [m3179 q2 brute force but worked.py](<../my-submissions/Weekly Contest 401/m3179 q2 brute force but worked.py>) -```Python -# https://leetcode.com/problems/find-the-n-th-value-after-k-seconds/description/ -# https://leetcode.com/contest/weekly-contest-401/ - -class Solution: - def valueAfterKSeconds(self, n: int, k: int) -> int: - output = [1] * n - - for _ in range(k) : - for j in range(1, n) : - output[j] += output[j - 1] - return output[-1] % (10 ** 9 + 7) - - - -''' I DID NOT EXPECT BRUTE FORCE TO WORK- - - I wasted so much time trying to find the math behind it lol - 1 1 1 1 - 1 2 3 4 - 1 3 6 10 - 1 4 10 20 - - 0 [0] [1] [2] [3] - 1 [0] [0]+[1] a+b+c =0+1+2 a+b+c+d =0+1+2+3 - 2 [0] 0+0+1=2a+b 3a+2b+c = 0+0+1+0+1+2 4a+3b+2c+d =0+0+1+0+1+2+0+1+2+3 - 3 [0] 3a+b 6a+3b+c 10a+6b+3c+d - 4 [0] 4a+b 10a+4b+c 20a+10b+4c+d - 5 [0] - 6 [0] - 7 [0] - 0 - 1*prev + a 2 * prev - -''' -``` - diff --git a/markdowns/_3180. Weekly Contest 401 - q.md b/markdowns/_3180. Weekly Contest 401 - q.md deleted file mode 100644 index cd49a5d2..00000000 --- a/markdowns/_3180. Weekly Contest 401 - q.md +++ /dev/null @@ -1,128 +0,0 @@ -# 3180. Weekly Contest 401 - q3 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 08, 2024* -> -> *Last updated : June 10, 2024* - - ------- - -> **Related Topics** : **[Array](), [Dynamic Programming]()** -> -> **Acceptance Rate** : **27.832 %** - - ------- - -## Solutions - -- [Weekly Contest 401/m3180 q3 converted.py](<../my-submissions/Weekly Contest 401/m3180 q3 converted.py>) -- [Weekly Contest 401/m3180 q3 v2.py](<../my-submissions/Weekly Contest 401/m3180 q3 v2.py>) -- [Weekly Contest 401/m3180 q3.c](<../my-submissions/Weekly Contest 401/m3180 q3.c>) -### Python -#### [m3180 q3 converted.py](<../my-submissions/Weekly Contest 401/m3180 q3 converted.py>) -```Python -# https://leetcode.com/problems/find-the-n-th-value-after-k-seconds/description/ - -# Converted this from the C code and also passes :l - -''' Notes: - Max output will be at most 2x the max reward there is -''' - -class Solution: - def maxTotalReward(self, rewardValues: List[int]) -> int: - rewardValues.sort() - - helperArr = [True] + [False] * (2000 * 2) - - for reward in rewardValues : - for j in range(reward - 1, -1, -1) : - if helperArr[j] : - helperArr[j + reward] = True - - for i in range(2000 * 2, -1, -1) : - if helperArr[i] : - return i - return -1 - -``` - -#### [m3180 q3 v2.py](<../my-submissions/Weekly Contest 401/m3180 q3 v2.py>) -```Python -# https://leetcode.com/problems/find-the-n-th-value-after-k-seconds/description/ - -''' Notes: - Max output will be at most 2x the max reward there is -''' - -class Solution: - def maxTotalReward(self, rewardValues: List[int]) -> int: - rewardValues.sort() - - maxx = max(rewardValues) - helperArr = [True] + [False] * (maxx * 2) - - for reward in rewardValues : - for j in range(reward - 1, -1, -1) : - if helperArr[j] : - helperArr[j + reward] = True - - for i in range(maxx * 2, -1, -1) : - if helperArr[i] : - return i - return -1 - -``` - -### C -#### [m3180 q3.c](<../my-submissions/Weekly Contest 401/m3180 q3.c>) -```C -// https://leetcode.com/problems/maximum-total-reward-using-operations-i/description/ -// https://leetcode.com/contest/weekly-contest-401/ - - -// Tried doing this *after* the contest thinking huh if I spent an hour -// trying to do this quesiton in python and kept getting TLEs, what if I just -// wrote a brute forcey thing in C. Did it in 10 minutes right after the contest -// and it immediately passed. Sigh. - -int compareHelper(const void* one, const void* two) { - return *((int *) one) - *((int *) two); -} - -int maxTotalReward(int* rewardValues, int rewardValuesSize) { - int maxVall = 0; - for (int i = 0; i < rewardValuesSize; i++) { - if (maxVall < rewardValues[i]) - maxVall = rewardValues[i]; - } - - bool helper[2000 * 2 + 1] = {false}; - - qsort(rewardValues, rewardValuesSize, sizeof(int), compareHelper); - - helper[0] = true; - for (int i = 0; i < rewardValuesSize; i++) { - for (int j = rewardValues[i] - 1; j >= 0; j--) { - if (helper[j]) { - helper[j + rewardValues[i]] = true; - } - } - } - - for (int i = 2000 * 2; i >= 0; i--) { - if (helper[i]) - return i; - } - - return -1; -} -``` - diff --git a/markdowns/_3184. Question 3184 - q.md b/markdowns/_3184. Question 3184 - q.md deleted file mode 100644 index 185acd6a..00000000 --- a/markdowns/_3184. Question 3184 - q.md +++ /dev/null @@ -1,40 +0,0 @@ -# 3184. Question 3184 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 15, 2024* -> -> *Last updated : June 15, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 402/e3184 q1.py](<../my-submissions/Weekly Contest 402/e3184 q1.py>) -### Python -#### [e3184 q1.py](<../my-submissions/Weekly Contest 402/e3184 q1.py>) -```Python -class Solution: - def countCompleteDayPairs(self, hours: List[int]) -> int: - counter = 0 - - for i in range(0, len(hours) - 1) : - for j in range(i + 1, len(hours)) : - if (hours[i] + hours[j]) % 24 == 0 : - counter += 1 - - return counter -``` - diff --git a/markdowns/_3184. Weekly Contest 402 - q.md b/markdowns/_3184. Weekly Contest 402 - q.md deleted file mode 100644 index 692018c4..00000000 --- a/markdowns/_3184. Weekly Contest 402 - q.md +++ /dev/null @@ -1,40 +0,0 @@ -# 3184. Weekly Contest 402 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 15, 2024* -> -> *Last updated : June 15, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 402/e3184 q1.py](<../my-submissions/Weekly Contest 402/e3184 q1.py>) -### Python -#### [e3184 q1.py](<../my-submissions/Weekly Contest 402/e3184 q1.py>) -```Python -class Solution: - def countCompleteDayPairs(self, hours: List[int]) -> int: - counter = 0 - - for i in range(0, len(hours) - 1) : - for j in range(i + 1, len(hours)) : - if (hours[i] + hours[j]) % 24 == 0 : - counter += 1 - - return counter -``` - diff --git a/markdowns/_3185. Question 3185 - q.md b/markdowns/_3185. Question 3185 - q.md deleted file mode 100644 index 2b5722f5..00000000 --- a/markdowns/_3185. Question 3185 - q.md +++ /dev/null @@ -1,55 +0,0 @@ -# 3185. Question 3185 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 15, 2024* -> -> *Last updated : June 15, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 402/m3185 q2.py](<../my-submissions/Weekly Contest 402/m3185 q2.py>) -### Python -#### [m3185 q2.py](<../my-submissions/Weekly Contest 402/m3185 q2.py>) -```Python -class Solution: - def countCompleteDayPairs(self, hours: List[int]) -> int: - cnt = Counter([x % 24 for x in hours]) - - ''' - 0 - 1 23 - 2 22 - 3 21 - ... - 10 14 - 11 13 - 12 - ''' - - vals = [] - vals.append(cnt.get(0, 0) * (cnt.get(0, 0) - 1) // 2) - vals.append(cnt.get(12, 0) * (cnt.get(12, 0) - 1) // 2) - - for x in range(1, 12) : # [1, 11] - vals.append(cnt.get(x, 0) * cnt.get(24 - x, 0)) - - - return sum(vals) - -``` - diff --git a/markdowns/_3185. Weekly Contest 402 - q.md b/markdowns/_3185. Weekly Contest 402 - q.md deleted file mode 100644 index 1a82a8a4..00000000 --- a/markdowns/_3185. Weekly Contest 402 - q.md +++ /dev/null @@ -1,55 +0,0 @@ -# 3185. Weekly Contest 402 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 15, 2024* -> -> *Last updated : June 15, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 402/m3185 q2.py](<../my-submissions/Weekly Contest 402/m3185 q2.py>) -### Python -#### [m3185 q2.py](<../my-submissions/Weekly Contest 402/m3185 q2.py>) -```Python -class Solution: - def countCompleteDayPairs(self, hours: List[int]) -> int: - cnt = Counter([x % 24 for x in hours]) - - ''' - 0 - 1 23 - 2 22 - 3 21 - ... - 10 14 - 11 13 - 12 - ''' - - vals = [] - vals.append(cnt.get(0, 0) * (cnt.get(0, 0) - 1) // 2) - vals.append(cnt.get(12, 0) * (cnt.get(12, 0) - 1) // 2) - - for x in range(1, 12) : # [1, 11] - vals.append(cnt.get(x, 0) * cnt.get(24 - x, 0)) - - - return sum(vals) - -``` - diff --git a/markdowns/_3186. Question 3186 - q.md b/markdowns/_3186. Question 3186 - q.md deleted file mode 100644 index 0b16675c..00000000 --- a/markdowns/_3186. Question 3186 - q.md +++ /dev/null @@ -1,54 +0,0 @@ -# 3186. Question 3186 - q3 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 15, 2024* -> -> *Last updated : June 15, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 402/m3186 q3.py](<../my-submissions/Weekly Contest 402/m3186 q3.py>) -### Python -#### [m3186 q3.py](<../my-submissions/Weekly Contest 402/m3186 q3.py>) -```Python -# Did this *after* the contest finished (~1h later) with some discussion help -# Will redo later down the road once solution is no longer in my mind - -class Solution: - def maximumTotalDamage(self, power: List[int]) -> int: - cnt = Counter(power) - powerCounted = [(0, 0), (0, 0), (0, 0)] + \ - sorted([(p, p * c) for p, c in cnt.items()], key=lambda x: x[0]) - - dp = [0] * (len(powerCounted) + 3) - - def getIndexPrior(currentIndex: int) -> int : - if powerCounted[currentIndex][0] - powerCounted[currentIndex - 1][0] > 2 : - return currentIndex - 1 - if powerCounted[currentIndex][0] - powerCounted[currentIndex - 2][0] > 2 : - return currentIndex - 2 - return currentIndex - 3 - - for i in range(3, len(powerCounted)) : - priorIndx = getIndexPrior(i) - p, d = powerCounted[i] - dp[i] = max(dp[priorIndx], dp[priorIndx - 1], dp[priorIndx - 2]) + d - - return max(dp) -``` - diff --git a/markdowns/_3186. Weekly Contest 402 - q.md b/markdowns/_3186. Weekly Contest 402 - q.md deleted file mode 100644 index b2a31342..00000000 --- a/markdowns/_3186. Weekly Contest 402 - q.md +++ /dev/null @@ -1,54 +0,0 @@ -# 3186. Weekly Contest 402 - q3 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 15, 2024* -> -> *Last updated : June 15, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 402/m3186 q3.py](<../my-submissions/Weekly Contest 402/m3186 q3.py>) -### Python -#### [m3186 q3.py](<../my-submissions/Weekly Contest 402/m3186 q3.py>) -```Python -# Did this *after* the contest finished (~1h later) with some discussion help -# Will redo later down the road once solution is no longer in my mind - -class Solution: - def maximumTotalDamage(self, power: List[int]) -> int: - cnt = Counter(power) - powerCounted = [(0, 0), (0, 0), (0, 0)] + \ - sorted([(p, p * c) for p, c in cnt.items()], key=lambda x: x[0]) - - dp = [0] * (len(powerCounted) + 3) - - def getIndexPrior(currentIndex: int) -> int : - if powerCounted[currentIndex][0] - powerCounted[currentIndex - 1][0] > 2 : - return currentIndex - 1 - if powerCounted[currentIndex][0] - powerCounted[currentIndex - 2][0] > 2 : - return currentIndex - 2 - return currentIndex - 3 - - for i in range(3, len(powerCounted)) : - priorIndx = getIndexPrior(i) - p, d = powerCounted[i] - dp[i] = max(dp[priorIndx], dp[priorIndx - 1], dp[priorIndx - 2]) + d - - return max(dp) -``` - diff --git a/markdowns/_3190. Question 319.md b/markdowns/_3190. Question 319.md deleted file mode 100644 index a3aec2c0..00000000 --- a/markdowns/_3190. Question 319.md +++ /dev/null @@ -1,43 +0,0 @@ -# 3190. Question 3190 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [e3190.java](<../my-submissions/e3190.java>) -### Java -#### [e3190.java](<../my-submissions/e3190.java>) -```Java -class Solution { - public int minimumOperations(int[] nums) { - int turns = 0; - for (int num : nums) { - if (num % 3 != 0) { - turns += 1; - } - } - - return turns; - } -} - -``` - diff --git a/markdowns/_3191. Question 319.md b/markdowns/_3191. Question 319.md deleted file mode 100644 index b683da0f..00000000 --- a/markdowns/_3191. Question 319.md +++ /dev/null @@ -1,52 +0,0 @@ -# 3191. Question 3191 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [m3191.java](<../my-submissions/m3191.java>) -### Java -#### [m3191.java](<../my-submissions/m3191.java>) -```Java -class Solution { - public int minOperations(int[] nums) { - int turns = 0; - - int[] hasmap = new int[]{1, 0}; - - for (int i = 0; i < nums.length - 2; i++) { - if (nums[i] == 0) { - turns += 1; - nums[i] = hasmap[nums[i]]; - nums[i + 1] = hasmap[nums[i + 1]]; - nums[i + 2] = hasmap[nums[i + 2]]; - } - } - - if (nums[nums.length - 1] == 1 - && nums[nums.length - 2] == 1 - && nums[nums.length - 3] == 1) - return turns; - return -1; - } -} -``` - diff --git a/markdowns/_3192. Question 319.md b/markdowns/_3192. Question 319.md deleted file mode 100644 index 3d1f69d8..00000000 --- a/markdowns/_3192. Question 319.md +++ /dev/null @@ -1,64 +0,0 @@ -# 3192. Question 3192 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : July 03, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -> ``` -> Sigh. I decided I should rest today so I didn't wake up for -> the contest, choosing to just do the weekly one. Then when I woke -> up and was like let's try the questions out, I finished all 3 -> in sub-20 minutes. Welp. /shrug -> ``` - ------- - -## Solutions - -- [m3192.java](<../my-submissions/m3192.java>) -### Java -#### [m3192.java](<../my-submissions/m3192.java>) -```Java -class Solution { - public int minOperations(int[] nums) { - int turns = 0; - - int[] hasmap = new int[]{1, 0}; - boolean flipped = false; - - for (int i = 0; i < nums.length; i++) { - int current = flipped ? hasmap[nums[i]] : nums[i]; - if (current == 0) { - turns += 1; - flipped = !flipped; - } - } - - if (!flipped - && nums[nums.length - 1] == 1) - return turns; - - else if (nums[nums.length - 1] == 0) - return turns; - - return -1; - } -} -``` - diff --git a/markdowns/_3194. Question 3194 - q.md b/markdowns/_3194. Question 3194 - q.md deleted file mode 100644 index 3d30a6eb..00000000 --- a/markdowns/_3194. Question 3194 - q.md +++ /dev/null @@ -1,39 +0,0 @@ -# 3194. Question 3194 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 403/e3194 q1.py](<../my-submissions/Weekly Contest 403/e3194 q1.py>) -### Python -#### [e3194 q1.py](<../my-submissions/Weekly Contest 403/e3194 q1.py>) -```Python -class Solution: - def minimumAverage(self, nums: List[int]) -> float: - nums = deque(sorted(nums)) - output = [] - - while nums : - output.append((nums.popleft() + nums.pop()) / 2) - - return min(output) -``` - diff --git a/markdowns/_3194. Weekly Contest 403 - q.md b/markdowns/_3194. Weekly Contest 403 - q.md deleted file mode 100644 index b28144dc..00000000 --- a/markdowns/_3194. Weekly Contest 403 - q.md +++ /dev/null @@ -1,39 +0,0 @@ -# 3194. Weekly Contest 403 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 403/e3194 q1.py](<../my-submissions/Weekly Contest 403/e3194 q1.py>) -### Python -#### [e3194 q1.py](<../my-submissions/Weekly Contest 403/e3194 q1.py>) -```Python -class Solution: - def minimumAverage(self, nums: List[int]) -> float: - nums = deque(sorted(nums)) - output = [] - - while nums : - output.append((nums.popleft() + nums.pop()) / 2) - - return min(output) -``` - diff --git a/markdowns/_3195. Question 3195 - q.md b/markdowns/_3195. Question 3195 - q.md deleted file mode 100644 index 784700e1..00000000 --- a/markdowns/_3195. Question 3195 - q.md +++ /dev/null @@ -1,59 +0,0 @@ -# 3195. Question 3195 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 403/m3195 q2.py](<../my-submissions/Weekly Contest 403/m3195 q2.py>) -### Python -#### [m3195 q2.py](<../my-submissions/Weekly Contest 403/m3195 q2.py>) -```Python -class Solution: - def minimumArea(self, grid: List[List[int]]) -> int: - for r in grid : - print(r) - - rowMin, rowMax = inf, -inf - colMin, colMax = inf, -inf - - found = False - - for r in range(len(grid)) : - for c in range(len(grid[0])) : - if grid[r][c] : - # print(f'{r, c = }') - found = True - if r < rowMin : - rowMin = r - if r > rowMax : - rowMax = r - - if c < colMin : - colMin = c - if c > colMax : - colMax = c - - if not found : - return 0 - - return max((colMax - colMin + 1), 1) * max((rowMax - rowMin + 1), 1) -``` - diff --git a/markdowns/_3195. Weekly Contest 403 - q.md b/markdowns/_3195. Weekly Contest 403 - q.md deleted file mode 100644 index 84132f58..00000000 --- a/markdowns/_3195. Weekly Contest 403 - q.md +++ /dev/null @@ -1,59 +0,0 @@ -# 3195. Weekly Contest 403 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 403/m3195 q2.py](<../my-submissions/Weekly Contest 403/m3195 q2.py>) -### Python -#### [m3195 q2.py](<../my-submissions/Weekly Contest 403/m3195 q2.py>) -```Python -class Solution: - def minimumArea(self, grid: List[List[int]]) -> int: - for r in grid : - print(r) - - rowMin, rowMax = inf, -inf - colMin, colMax = inf, -inf - - found = False - - for r in range(len(grid)) : - for c in range(len(grid[0])) : - if grid[r][c] : - # print(f'{r, c = }') - found = True - if r < rowMin : - rowMin = r - if r > rowMax : - rowMax = r - - if c < colMin : - colMin = c - if c > colMax : - colMax = c - - if not found : - return 0 - - return max((colMax - colMin + 1), 1) * max((rowMax - rowMin + 1), 1) -``` - diff --git a/markdowns/_3196. Question 3196 - q.md b/markdowns/_3196. Question 3196 - q.md deleted file mode 100644 index 7ad411cb..00000000 --- a/markdowns/_3196. Question 3196 - q.md +++ /dev/null @@ -1,65 +0,0 @@ -# 3196. Question 3196 - q3 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 403/m3196 q3 v2.py](<../my-submissions/Weekly Contest 403/m3196 q3 v2.py>) -- [Weekly Contest 403/m3196 q3.py](<../my-submissions/Weekly Contest 403/m3196 q3.py>) -### Python -#### [m3196 q3 v2.py](<../my-submissions/Weekly Contest 403/m3196 q3 v2.py>) -```Python -class Solution: - def maximumTotalCost(self, nums: List[int]) -> int: - dp = [0, 0] + [0] * (len(nums)) - - for i in range(0, len(nums)) : - val1 = dp[i + 1] + nums[i] - val2 = dp[i] + nums[i - 1] - nums[i] - if i == 0 : - val2 = -inf - - dp[i + 2] = max(val1, val2) - - return dp[-1] -``` - -#### [m3196 q3.py](<../my-submissions/Weekly Contest 403/m3196 q3.py>) -```Python -class Solution: - def maximumTotalCost(self, nums: List[int]) -> int: - dp = [0, 0] + [0] * (len(nums)) - - for i in range(0, len(nums)) : - val1 = dp[i + 1] + nums[i] - if i == 0 : - val1 = nums[i] - - val2 = dp[i] + nums[i - 1] - nums[i] - if i == 0 : - val2 = -inf - elif i == 1 : - val2 = nums[i - 1] - nums[i] - dp[i + 2] = max(val1, val2) - - return dp[-1] -``` - diff --git a/markdowns/_3196. Weekly Contest 403 - q.md b/markdowns/_3196. Weekly Contest 403 - q.md deleted file mode 100644 index 76da24b1..00000000 --- a/markdowns/_3196. Weekly Contest 403 - q.md +++ /dev/null @@ -1,65 +0,0 @@ -# 3196. Weekly Contest 403 - q3 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : June 22, 2024* -> -> *Last updated : June 22, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 403/m3196 q3 v2.py](<../my-submissions/Weekly Contest 403/m3196 q3 v2.py>) -- [Weekly Contest 403/m3196 q3.py](<../my-submissions/Weekly Contest 403/m3196 q3.py>) -### Python -#### [m3196 q3 v2.py](<../my-submissions/Weekly Contest 403/m3196 q3 v2.py>) -```Python -class Solution: - def maximumTotalCost(self, nums: List[int]) -> int: - dp = [0, 0] + [0] * (len(nums)) - - for i in range(0, len(nums)) : - val1 = dp[i + 1] + nums[i] - val2 = dp[i] + nums[i - 1] - nums[i] - if i == 0 : - val2 = -inf - - dp[i + 2] = max(val1, val2) - - return dp[-1] -``` - -#### [m3196 q3.py](<../my-submissions/Weekly Contest 403/m3196 q3.py>) -```Python -class Solution: - def maximumTotalCost(self, nums: List[int]) -> int: - dp = [0, 0] + [0] * (len(nums)) - - for i in range(0, len(nums)) : - val1 = dp[i + 1] + nums[i] - if i == 0 : - val1 = nums[i] - - val2 = dp[i] + nums[i - 1] - nums[i] - if i == 0 : - val2 = -inf - elif i == 1 : - val2 = nums[i - 1] - nums[i] - dp[i + 2] = max(val1, val2) - - return dp[-1] -``` - diff --git a/markdowns/_3210. Question 3210 - q.md b/markdowns/_3210. Question 3210 - q.md deleted file mode 100644 index 44224c98..00000000 --- a/markdowns/_3210. Question 3210 - q.md +++ /dev/null @@ -1,34 +0,0 @@ -# 3210. Question 3210 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 06, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 405/e3210 q1 v1 DP + BF.py](<../my-submissions/Weekly Contest 405/e3210 q1 v1 DP + BF.py>) -### Python -#### [e3210 q1 v1 DP + BF.py](<../my-submissions/Weekly Contest 405/e3210 q1 v1 DP + BF.py>) -```Python -class Solution: - def getEncryptedString(self, s: str, k: int) -> str: - k %= len(s) - return s[k:] + s[:k] -``` - diff --git a/markdowns/_3210. Weekly Contest 405 - q.md b/markdowns/_3210. Weekly Contest 405 - q.md deleted file mode 100644 index 0ae455e3..00000000 --- a/markdowns/_3210. Weekly Contest 405 - q.md +++ /dev/null @@ -1,34 +0,0 @@ -# 3210. Weekly Contest 405 - q1 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 06, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 405/e3210 q1.py](<../my-submissions/Weekly Contest 405/e3210 q1.py>) -### Python -#### [e3210 q1.py](<../my-submissions/Weekly Contest 405/e3210 q1.py>) -```Python -class Solution: - def getEncryptedString(self, s: str, k: int) -> str: - k %= len(s) - return s[k:] + s[:k] -``` - diff --git a/markdowns/_3211. Question 3211 - q.md b/markdowns/_3211. Question 3211 - q.md deleted file mode 100644 index 0da27466..00000000 --- a/markdowns/_3211. Question 3211 - q.md +++ /dev/null @@ -1,53 +0,0 @@ -# 3211. Question 3211 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 06, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 405/m3211 q2.py](<../my-submissions/Weekly Contest 405/m3211 q2.py>) -### Python -#### [m3211 q2.py](<../my-submissions/Weekly Contest 405/m3211 q2.py>) -```Python -class Solution: - def validStrings(self, n: int) -> List[str]: - output = [] - - def dfs(curr: List[str], - output: List[str], - remaining: int, - prevIsOne: bool) -> None : - if not remaining : - output.append(''.join(curr)) - return - - curr.append('1') - remaining -= 1 - dfs(curr, output, remaining, True) - curr.pop() - - if prevIsOne : - curr.append('0') - dfs(curr, output, remaining, False) - curr.pop() - dfs([], output, n, True) - return output -``` - diff --git a/markdowns/_3211. Weekly Contest 405 - q.md b/markdowns/_3211. Weekly Contest 405 - q.md deleted file mode 100644 index d512b44f..00000000 --- a/markdowns/_3211. Weekly Contest 405 - q.md +++ /dev/null @@ -1,53 +0,0 @@ -# 3211. Weekly Contest 405 - q2 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 06, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -## Solutions - -- [Weekly Contest 405/m3211 q2.py](<../my-submissions/Weekly Contest 405/m3211 q2.py>) -### Python -#### [m3211 q2.py](<../my-submissions/Weekly Contest 405/m3211 q2.py>) -```Python -class Solution: - def validStrings(self, n: int) -> List[str]: - output = [] - - def dfs(curr: List[str], - output: List[str], - remaining: int, - prevIsOne: bool) -> None : - if not remaining : - output.append(''.join(curr)) - return - - curr.append('1') - remaining -= 1 - dfs(curr, output, remaining, True) - curr.pop() - - if prevIsOne : - curr.append('0') - dfs(curr, output, remaining, False) - curr.pop() - dfs([], output, n, True) - return output -``` - diff --git a/markdowns/_3212. Question 3212 - q.md b/markdowns/_3212. Question 3212 - q.md deleted file mode 100644 index 6b7a1163..00000000 --- a/markdowns/_3212. Question 3212 - q.md +++ /dev/null @@ -1,101 +0,0 @@ -# 3212. Question 3212 - q3 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 06, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -> ***Preface: During the contest, I ran out of time. I later did the question after*** -> ***the contest completed, revising my approach and successfully earning the AC.*** -> -> -> #### Notes from during the contest -> ``` -> - contains origin val -> - Cannot have 1x1 submatrix cause at least one X and equal XY -> -> Start on X spots and expand? -> Match X with nearest Y above, below, left, right? -> -> Weird prefix sum x2? Count by row and col, then also do a cumulative one to -> get the instantaneous difference? -> -> Wait si this a area based prefix sum where you take a corner's full sum, add -> the other corner, and remove the sides due to the overlap? -> -> add|| subtract -> ====||======================|| -> || || -> s || || -> u || add || -> b || || -> ====||======================||add? -> ``` -> -> #### Notes from after -> ``` -> I'm dumb lol. I interpretted the "contains grid[0][0]" as inside the box from (x1, y1) -> to (x2, y2) inclusive, there must be at least one value equal to the value found at -> grid[0][0]. -> -> I realized after that it meant that each submatrix MUST START at (0, 0), simplifying -> the question HEAVILY. -> -> ``` - ------- - -## Solutions - -- [Weekly Contest 405/m3212 q3 POST CONTEST.py](<../my-submissions/Weekly Contest 405/m3212 q3 POST CONTEST.py>) -### Python -#### [m3212 q3 POST CONTEST.py](<../my-submissions/Weekly Contest 405/m3212 q3 POST CONTEST.py>) -```Python -class Solution: - def numberOfSubmatrices(self, grid: List[List[str]]) -> int: - xes = [[0] * len(grid[0]) for _ in range(len(grid))] - yes = [[0] * len(grid[0]) for _ in range(len(grid))] - - for r in range(len(grid)) : - for c in range(len(grid[0])) : - if r > 0 : - xes[r][c] += xes[r - 1][c] - yes[r][c] += yes[r - 1][c] - if c > 0 : - xes[r][c] += xes[r][c - 1] - yes[r][c] += yes[r][c - 1] - if r > 0 and c > 0 : - xes[r][c] -= xes[r - 1][c - 1] - yes[r][c] -= yes[r - 1][c - 1] - - match grid[r][c] : - case 'X' : - xes[r][c] += 1 - case 'Y' : - yes[r][c] += 1 - - output = 0 - for x in range(len(grid)) : - for y in range(len(grid[0])) : - if xes[x][y] == yes[x][y] and xes[x][y] : - output += 1 - - return output - -``` - diff --git a/markdowns/_3212. Weekly Contest 405 - q.md b/markdowns/_3212. Weekly Contest 405 - q.md deleted file mode 100644 index 424f852e..00000000 --- a/markdowns/_3212. Weekly Contest 405 - q.md +++ /dev/null @@ -1,101 +0,0 @@ -# 3212. Weekly Contest 405 - q3 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 06, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -> ***Preface: During the contest, I ran out of time. I later did the question after*** -> ***the contest completed, revising my approach and successfully earning the AC.*** -> -> -> #### Notes from during the contest -> ``` -> - contains origin val -> - Cannot have 1x1 submatrix cause at least one X and equal XY -> -> Start on X spots and expand? -> Match X with nearest Y above, below, left, right? -> -> Weird prefix sum x2? Count by row and col, then also do a cumulative one to -> get the instantaneous difference? -> -> Wait si this a area based prefix sum where you take a corner's full sum, add -> the other corner, and remove the sides due to the overlap? -> -> add|| subtract -> ====||======================|| -> || || -> s || || -> u || add || -> b || || -> ====||======================||add? -> ``` -> -> #### Notes from after -> ``` -> I'm dumb lol. I interpretted the "contains grid[0][0]" as inside the box from (x1, y1) -> to (x2, y2) inclusive, there must be at least one value equal to the value found at -> grid[0][0]. -> -> I realized after that it meant that each submatrix MUST START at (0, 0), simplifying -> the question HEAVILY. -> -> ``` - ------- - -## Solutions - -- [Weekly Contest 405/m3212 q3 POST CONTEST.py](<../my-submissions/Weekly Contest 405/m3212 q3 POST CONTEST.py>) -### Python -#### [m3212 q3 POST CONTEST.py](<../my-submissions/Weekly Contest 405/m3212 q3 POST CONTEST.py>) -```Python -class Solution: - def numberOfSubmatrices(self, grid: List[List[str]]) -> int: - xes = [[0] * len(grid[0]) for _ in range(len(grid))] - yes = [[0] * len(grid[0]) for _ in range(len(grid))] - - for r in range(len(grid)) : - for c in range(len(grid[0])) : - if r > 0 : - xes[r][c] += xes[r - 1][c] - yes[r][c] += yes[r - 1][c] - if c > 0 : - xes[r][c] += xes[r][c - 1] - yes[r][c] += yes[r][c - 1] - if r > 0 and c > 0 : - xes[r][c] -= xes[r - 1][c - 1] - yes[r][c] -= yes[r - 1][c - 1] - - match grid[r][c] : - case 'X' : - xes[r][c] += 1 - case 'Y' : - yes[r][c] += 1 - - output = 0 - for x in range(len(grid)) : - for y in range(len(grid[0])) : - if xes[x][y] == yes[x][y] and xes[x][y] : - output += 1 - - return output - -``` - diff --git a/markdowns/_3213. Question 3213 - q.md b/markdowns/_3213. Question 3213 - q.md deleted file mode 100644 index 9438b11b..00000000 --- a/markdowns/_3213. Question 3213 - q.md +++ /dev/null @@ -1,118 +0,0 @@ -# 3213. Question 3213 - q4 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 07, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -> Did the contest live and got through Q1 & Q2 very quickly. When I saw Q3 however, -> I got really confused so I decided to just skip it for now. Somehow, I was able to get -> Q4 then when I got back to Q3, I realized what the solution was and laid out the steps, -> but didn't have enough time to implement it. So yeah... good contest lol. First time -> getting 3 questions too funny enough lol. -> -> -> #### Version 1 -> -> Did a `DP` + `String Comparison` to get my solution. If this TLEed or MLEed, I would have -> changed to a `DP` + `Trie` solution to optimize the `word == target[i:i+len(word)]` portion. -> This, however, was unnecessary to pass the contest test cases, and so I moved onto -> another question as the contest was still active. -> -> I do want to come back to this question and try the Aho–Corasick + DP solution. -> -> -> #### Version 2 -> -> Tried adjusting for a `DP` + `Trie` solution and was successful. Overall time savings -> brought runtimes down from an average of `12300ms` down to `11700ms`, though only -> after additional tinkering. Next step, Aho-Corasick! - ------- - -## Solutions - -- [Weekly Contest 405/h3213 q4 v2 DP + Trie.py](<../my-submissions/Weekly Contest 405/h3213 q4 v2 DP + Trie.py>) -- [Weekly Contest 405/h3213 q4.py](<../my-submissions/Weekly Contest 405/h3213 q4.py>) -### Python -#### [h3213 q4 v2 DP + Trie.py](<../my-submissions/Weekly Contest 405/h3213 q4 v2 DP + Trie.py>) -```Python -class Solution: - def minimumCost(self, target: str, words: List[str], costs: List[int]) -> int: - # Generate trie - trie = {} - for cost, word in zip(costs, words) : - curr = trie - for c in word : - if c not in curr : - curr[c] = {} - curr = curr[c] - # If identical word exists, use smallest cost - curr[False] = min(curr.get(False, inf), cost) - - # Dynamic Programming array - dp = [0] + [inf] * len(target) - - # Iterate through each - for i in range(len(target)) : - curr = trie - offset = 0 - while i + offset < len(target) and target[i + offset] in curr : - curr = curr[target[i + offset]] - offset += 1 - - # Word ends - if False in curr : - dp[i + offset] = min(dp[i + offset], dp[i] + curr[False]) - - # -1 if end was not reachable - return -1 if dp[-1] == inf else dp[-1] - -``` - -#### [h3213 q4.py](<../my-submissions/Weekly Contest 405/h3213 q4.py>) -```Python -class Solution: - def minimumCost(self, target: str, words: List[str], costs: List[int]) -> int: - wordToCost = Counter() - for w, c in zip(words, costs) : - # Always take the lowest cost case - if w in wordToCost and wordToCost[w] <= c : - continue - wordToCost[w] = c - - # Remove duplicates from being checked - words = sorted(set(words), key=lambda x: len(x)) - maxWrd = len(words) - 1 - - dp = [0] + [inf] * len(target) - - for i in range(len(target)) : - while maxWrd >= 0 and len(words[maxWrd]) > len(target) - i : - maxWrd -= 1 - if maxWrd < 0 : - break - - for word in words[:maxWrd + 1] : - if word == target[i:i+len(word)] : - dp[i + len(word)] = min(dp[i + len(word)], dp[i] + wordToCost[word]) - - return -1 if dp[-1] == inf else dp[-1] - -``` - diff --git a/markdowns/_3213. Weekly Contest 405 - q.md b/markdowns/_3213. Weekly Contest 405 - q.md deleted file mode 100644 index b5d2c680..00000000 --- a/markdowns/_3213. Weekly Contest 405 - q.md +++ /dev/null @@ -1,65 +0,0 @@ -# 3213. Weekly Contest 405 - q4 - -*All prompts are owned by LeetCode. To view the prompt, click the title link above.* - -*[Back to top](<../README.md>)* - ------- - -> *First completed : July 06, 2024* -> -> *Last updated : July 06, 2024* - - ------- - -> **Related Topics** : **N/A** -> -> **Acceptance Rate** : **Unknown** - - ------- - -> Did the contest live and got through Q1 & Q2 very quickly. When I saw Q3 however, -> I got really confused so I decided to just skip it for now. Somehow, I was able to get -> Q4 then when I got back to Q3, I realized what the solution was and laid out the steps, -> but didn't have enough time to implement it. So yeah... good contest lol. First time -> getting 3 questions too funny enough lol. - ------- - -## Solutions - -- [Weekly Contest 405/h3213 q4.py](<../my-submissions/Weekly Contest 405/h3213 q4.py>) -### Python -#### [h3213 q4.py](<../my-submissions/Weekly Contest 405/h3213 q4.py>) -```Python -class Solution: - def minimumCost(self, target: str, words: List[str], costs: List[int]) -> int: - wordToCost = Counter() - for w, c in zip(words, costs) : - # Always take the lowest cost case - if w in wordToCost and wordToCost[w] <= c : - continue - wordToCost[w] = c - - # Remove duplicates from being checked - words = sorted(set(words), key=lambda x: len(x)) - maxWrd = len(words) - 1 - - dp = [0] + [inf] * len(target) - - for i in range(len(target)) : - while maxWrd >= 0 and len(words[maxWrd]) > len(target) - i : - maxWrd -= 1 - if maxWrd < 0 : - break - - for word in words[:maxWrd + 1] : - if word == target[i:i+len(word)] : - dp[i + len(word)] = min(dp[i + len(word)], dp[i] + wordToCost[word]) - - return -1 if dp[-1] == inf else dp[-1] - -``` - diff --git a/markdowns/by_topic/Array.md b/markdowns/by_topic/Array.md deleted file mode 100644 index 0469be41..00000000 --- a/markdowns/by_topic/Array.md +++ /dev/null @@ -1,189 +0,0 @@ -# [Array]() (181 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 1 | [Two Sum]() | Easy | B75, N150 | [solution](<../_1. Two Sum.md>) | java, py | May 22, 2024 | -| 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<../_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | -| 27 | [Remove Element]() | Easy | | [solution](<../_27. Remove Element.md>) | java, py | Jun 02, 2024 | -| 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | -| 46 | [Permutations]() | Medium | N150 | [solution](<../_46. Permutations.md>) | py | Jun 07, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 56 | [Merge Intervals]() | Medium | B75, N150 | [solution](<../_56. Merge Intervals.md>) | py | Jun 18, 2024 | -| 57 | [Insert Interval]() | Medium | B75, N150 | [solution](<../_57. Insert Interval.md>) | py | Jun 18, 2024 | -| 66 | [Plus One]() | Easy | N150 | [solution](<../_66. Plus One.md>) | c | Jun 03, 2024 | -| 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<../_74. Search a 2D Matrix.md>) | py | Jun 14, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 11, 2024 | -| 78 | [Subsets]() | Medium | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | -| 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<../_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | -| 90 | [Subsets II]() | Medium | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 | -| 118 | [Pascal's Triangle]() | Easy | | [solution](<../_118. Pascal's Triangle.md>) | py | May 22, 2024 | -| 121 | [Best Time to Buy and Sell Stock]() | Easy | B75, N150 | [solution](<../_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | -| 136 | [Single Number]() | Easy | N150 | [solution](<../_136. Single Number.md>) | py | Jul 03, 2024 | -| 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<../_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | -| 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<../_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 | -| 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | -| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution](<../_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | -| 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | -| 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | -| 260 | [Single Number III]() | Medium | Daily | [solution](<../_260. Single Number III.md>) | py | May 30, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | -| 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 14, 2024 | -| 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 25, 2024 | -| 330 | [Patching Array]() | Hard | Daily | [solution](<../_330. Patching Array.md>) | py | Jun 15, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution](<../_348. Design Tic-Tac-Toe.md>) | py | Jul 04, 2024 | -| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | -| 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | -| 380 | [Insert Delete GetRandom O(1)]() | Medium | | [solution](<../_380. Insert Delete GetRandom O(1).md>) | java | Jul 05, 2024 | -| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed]() | Hard | | [solution](<../_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>) | java | Jul 05, 2024 | -| 384 | [Shuffle an Array]() | Medium | | [solution](<../_384. Shuffle an Array.md>) | py | Jun 28, 2024 | -| 414 | [Third Maximum Number]() | Easy | | [solution](<../_414. Third Maximum Number.md>) | py | May 23, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | -| 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | -| 502 | [IPO]() | Hard | Daily | [solution](<../_502. IPO.md>) | py | Jun 14, 2024 | -| 503 | [Next Greater Element II]() | Medium | | [solution](<../_503. Next Greater Element II.md>) | py | Jul 05, 2024 | -| 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<../_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | -| 540 | [Single Element in a Sorted Array]() | Medium | | [solution](<../_540. Single Element in a Sorted Array.md>) | py | Jul 05, 2024 | -| 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | -| 565 | [Array Nesting]() | Medium | | [solution](<../_565. Array Nesting.md>) | py | Jul 02, 2024 | -| 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | -| 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | -| 622 | [Design Circular Queue]() | Medium | | [solution](<../_622. Design Circular Queue.md>) | py | Jul 05, 2024 | -| 645 | [Set Mismatch]() | Easy | | [solution](<../_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | -| 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 665 | [Non-decreasing Array]() | Medium | | [solution](<../_665. Non-decreasing Array.md>) | java, py | Jun 13, 2024 | -| 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | -| 690 | [Employee Importance]() | Medium | | [solution](<../_690. Employee Importance.md>) | java | Jul 02, 2024 | -| 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | -| 713 | [Subarray Product Less Than K]() | Medium | | [solution](<../_713. Subarray Product Less Than K.md>) | py | Jul 01, 2024 | -| 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | -| 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution](<../_744. Find Smallest Letter Greater Than Target.md>) | java, py | Jun 01, 2024 | -| 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution](<../_746. Min Cost Climbing Stairs.md>) | py | Jul 04, 2024 | -| 758 | [Bold Words in String]() | Medium | | [solution](<../_758. Bold Words in String.md>) | py | Jun 27, 2024 | -| 794 | [Valid Tic-Tac-Toe State]() | Medium | | [solution](<../_794. Valid Tic-Tac-Toe State.md>) | py | Jul 04, 2024 | -| 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<../_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | -| 817 | [Linked List Components]() | Medium | | [solution](<../_817. Linked List Components.md>) | java | Jul 04, 2024 | -| 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | -| 846 | [Hand of Straights]() | Medium | Daily, N150 | [solution](<../_846. Hand of Straights.md>) | py | Jun 06, 2024 | -| 848 | [Shifting Letters]() | Medium | | [solution](<../_848. Shifting Letters.md>) | py | Jun 29, 2024 | -| 849 | [Maximize Distance to Closest Person]() | Medium | | [solution](<../_849. Maximize Distance to Closest Person.md>) | py | Jun 29, 2024 | -| 853 | [Car Fleet]() | Medium | N150 | [solution](<../_853. Car Fleet.md>) | py | Jun 13, 2024 | -| 861 | [Score After Flipping Matrix]() | Medium | | [solution](<../_861. Score After Flipping Matrix.md>) | c, py | Jun 09, 2024 | -| 867 | [Transpose Matrix]() | Easy | | [solution](<../_867. Transpose Matrix.md>) | py | Jun 14, 2024 | -| 890 | [Find and Replace Pattern]() | Medium | | [solution](<../_890. Find and Replace Pattern.md>) | py | Jul 02, 2024 | -| 909 | [Snakes and Ladders]() | Medium | | [solution](<../_909. Snakes and Ladders.md>) | py | Jun 11, 2024 | -| 930 | [Binary Subarrays With Sum]() | Medium | | [solution](<../_930. Binary Subarrays With Sum.md>) | py | Jun 21, 2024 | -| 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<../_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | -| 946 | [Validate Stack Sequences]() | Medium | | [solution](<../_946. Validate Stack Sequences.md>) | c, py | Jun 11, 2024 | -| 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<../_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | -| 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | -| 977 | [Squares of a Sorted Array]() | Easy | | [solution](<../_977. Squares of a Sorted Array.md>) | py | Jun 20, 2024 | -| 994 | [Rotting Oranges]() | Medium | N150 | [solution](<../_994. Rotting Oranges.md>) | py | Jun 14, 2024 | -| 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | -| 1002 | [Find Common Characters]() | Easy | Daily | [solution](<../_1002. Find Common Characters.md>) | py | Jun 04, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 26, 2024 | -| 1018 | [Binary Prefix Divisible By 5]() | Easy | | [solution](<../_1018. Binary Prefix Divisible By 5.md>) | py | Jul 04, 2024 | -| 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | -| 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | -| 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | -| 1046 | [Last Stone Weight]() | Easy | N150 | [solution](<../_1046. Last Stone Weight.md>) | py | Jun 03, 2024 | -| 1051 | [Height Checker]() | Easy | Daily | [solution](<../_1051. Height Checker.md>) | c, py | Jun 09, 2024 | -| 1052 | [Grumpy Bookstore Owner]() | Medium | Daily | [solution](<../_1052. Grumpy Bookstore Owner.md>) | py | Jun 20, 2024 | -| 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution](<../_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 03, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | -| 1184 | [Distance Between Bus Stops]() | Easy | | [solution](<../_1184. Distance Between Bus Stops.md>) | py | May 31, 2024 | -| 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | -| 1233 | [Remove Sub-Folders from the Filesystem]() | Medium | | [solution](<../_1233. Remove Sub-Folders from the Filesystem.md>) | py | Jun 27, 2024 | -| 1239 | [Maximum Length of a Concatenated String with Unique Characters]() | Medium | | [solution](<../_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py | Jun 29, 2024 | -| 1248 | [Count Number of Nice Subarrays]() | Medium | Daily | [solution](<../_1248. Count Number of Nice Subarrays.md>) | py | Jun 21, 2024 | -| 1252 | [Cells with Odd Values in a Matrix]() | Easy | | [solution](<../_1252. Cells with Odd Values in a Matrix.md>) | c | Jun 04, 2024 | -| 1254 | [Number of Closed Islands]() | Medium | | [solution](<../_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | -| 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | -| 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | -| 1282 | [Group the People Given the Group Size They Belong To]() | Medium | | [solution](<../_1282. Group the People Given the Group Size They Belong To.md>) | py | Jun 27, 2024 | -| 1284 | [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 08, 2024 | -| 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution](<../_1351. Count Negative Numbers in a Sorted Matrix.md>) | java, py | Jun 01, 2024 | -| 1381 | [Design a Stack With Increment Operation]() | Medium | | [solution](<../_1381. Design a Stack With Increment Operation.md>) | py | Jul 05, 2024 | -| 1426 | [Counting Elements]() | Easy | | [solution](<../_1426. Counting Elements.md>) | c | Jun 04, 2024 | -| 1436 | [Destination City]() | Easy | | [solution](<../_1436. Destination City.md>) | java | Jun 01, 2024 | -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | -| 1460 | [Make Two Arrays Equal by Reversing Subarrays]() | Easy | | [solution](<../_1460. Make Two Arrays Equal by Reversing Subarrays.md>) | c | Jun 04, 2024 | -| 1470 | [Shuffle the Array]() | Easy | | [solution](<../_1470. Shuffle the Array.md>) | c | Jun 03, 2024 | -| 1472 | [Design Browser History]() | Medium | | [solution](<../_1472. Design Browser History.md>) | py | Jul 05, 2024 | -| 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | -| 1482 | [Minimum Number of Days to Make m Bouquets]() | Medium | | [solution](<../_1482. Minimum Number of Days to Make m Bouquets.md>) | py | Jun 18, 2024 | -| 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution](<../_1502. Can Make Arithmetic Progression From Sequence.md>) | c, py | Jun 04, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, cpp, java, py | Jul 02, 2024 | -| 1535 | [Find the Winner of an Array Game]() | Medium | | [solution](<../_1535. Find the Winner of an Array Game.md>) | py | Jun 08, 2024 | -| 1550 | [Three Consecutive Odds]() | Easy | Daily | [solution](<../_1550. Three Consecutive Odds.md>) | c, py | Jun 30, 2024 | -| 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<../_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | -| 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | -| 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution](<../_1564. Put Boxes Into the Warehouse I.md>) | py | Jun 14, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | -| 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<../_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 14, 2024 | -| 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution](<../_1684. Count the Number of Consistent Strings.md>) | c, py | Jun 06, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | -| 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | -| 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<../_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | -| 1743 | [Restore the Array From Adjacent Pairs]() | Medium | | [solution](<../_1743. Restore the Array From Adjacent Pairs.md>) | py | Jun 26, 2024 | -| 1748 | [Sum of Unique Elements]() | Easy | | [solution](<../_1748. Sum of Unique Elements.md>) | c | Jun 06, 2024 | -| 1762 | [Buildings With an Ocean View]() | Medium | | [solution](<../_1762. Buildings With an Ocean View.md>) | py | Jun 10, 2024 | -| 1822 | [Sign of the Product of an Array]() | Easy | | [solution](<../_1822. Sign of the Product of an Array.md>) | c | Jun 06, 2024 | -| 1833 | [Maximum Ice Cream Bars]() | Medium | | [solution](<../_1833. Maximum Ice Cream Bars.md>) | c, java, py | Jun 23, 2024 | -| 1852 | [Distinct Numbers in Each Subarray]() | Medium | | [solution](<../_1852. Distinct Numbers in Each Subarray.md>) | java | Jun 26, 2024 | -| 1874 | [Minimize Product Sum of Two Arrays]() | Medium | | [solution](<../_1874. Minimize Product Sum of Two Arrays.md>) | c, java | Jun 22, 2024 | -| 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | -| 1885 | [Count Pairs in Two Arrays]() | Medium | Weekly Premium | [solution](<../_1885. Count Pairs in Two Arrays.md>) | py | May 21, 2024 | -| 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | -| 1909 | [Remove One Element to Make the Array Strictly Increasing]() | Easy | | [solution](<../_1909. Remove One Element to Make the Array Strictly Increasing.md>) | c | Jun 16, 2024 | -| 1929 | [Concatenation of Array]() | Easy | | [solution](<../_1929. Concatenation of Array.md>) | c, java, py | Jun 03, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | -| 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | -| 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution](<../_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 | -| 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | -| 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 09, 2024 | -| 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | -| 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | -| 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | -| 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | -| 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 14, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | -| 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 26, 2024 | -| 2365 | [Task Scheduler II]() | Medium | | [solution](<../_2365. Task Scheduler II.md>) | py | Jun 29, 2024 | -| 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | -| 2395 | [Find Subarrays With Equal Sum]() | Easy | | [solution](<../_2395. Find Subarrays With Equal Sum.md>) | py | May 30, 2024 | -| 2433 | [Find The Original Array of Prefix Xor]() | Medium | | [solution](<../_2433. Find The Original Array of Prefix Xor.md>) | py | May 30, 2024 | -| 2455 | [Average Value of Even Numbers That Are Divisible by Three]() | Easy | | [solution](<../_2455. Average Value of Even Numbers That Are Divisible by Three.md>) | java | Jul 04, 2024 | -| 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution](<../_2473. Minimum Cost to Buy Apples.md>) | py | Jun 28, 2024 | -| 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution](<../_2482. Difference Between Ones and Zeros in Row and Column.md>) | py | Jun 07, 2024 | -| 2545 | [Sort the Students by Their Kth Score]() | Medium | | [solution](<../_2545. Sort the Students by Their Kth Score.md>) | java, py | Jun 24, 2024 | -| 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<../_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | -| 2610 | [Convert an Array Into a 2D Array With Conditions]() | Medium | | [solution](<../_2610. Convert an Array Into a 2D Array With Conditions.md>) | py | Jun 07, 2024 | -| 2678 | [Number of Senior Citizens]() | Easy | | [solution](<../_2678. Number of Senior Citizens.md>) | java | May 22, 2024 | -| 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | -| 2942 | [Find Words Containing Character]() | Easy | | [solution](<../_2942. Find Words Containing Character.md>) | c | Jun 03, 2024 | -| 2954 | [Count the Number of Infection Sequences]() | Hard | | [solution](<../_2954. Count the Number of Infection Sequences.md>) | py | Jun 26, 2024 | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<../_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | java, py | Jun 11, 2024 | -| 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | -| 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | -| 3074 | [Apple Redistribution into Boxes]() | Easy | | [solution](<../_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 | -| 3169 | [Count Days Without Meetings]() - q2 | Medium | Contest | [solution](<../_3169. Count Days Without Meetings.md>) | py | Jun 01, 2024 | -| 3175 | [Find The First Player to win K Games in a Row]() - q2 | Medium | Contest | [solution](<../_3175. Find The First Player to win K Games in a Row.md>) | py | Jun 08, 2024 | -| 3179 | [Find the N-th Value After K Seconds]() - q2 | Medium | Contest | [solution](<../_3179. Find the N-th Value After K Seconds.md>) | py | Jun 08, 2024 | -| 3180 | [Maximum Total Reward Using Operations I]() - q3 | Medium | Contest | [solution](<../_3180. Maximum Total Reward Using Operations I.md>) | c, py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Backtracking.md b/markdowns/by_topic/Backtracking.md deleted file mode 100644 index 1894527b..00000000 --- a/markdowns/by_topic/Backtracking.md +++ /dev/null @@ -1,21 +0,0 @@ -# [Backtracking]() (13 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:------------------------------------------------------------------------------------------|:------------|:----------------| -| 22 | [Generate Parentheses]() | Medium | N150 | [solution](<../_22. Generate Parentheses.md>) | py | Jun 13, 2024 | -| 46 | [Permutations]() | Medium | N150 | [solution](<../_46. Permutations.md>) | py | Jun 07, 2024 | -| 77 | [Combinations]() | Medium | | [solution](<../_77. Combinations.md>) | py | Jun 07, 2024 | -| 78 | [Subsets]() | Medium | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | -| 90 | [Subsets II]() | Medium | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 | -| 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | -| 784 | [Letter Case Permutation]() | Medium | | [solution](<../_784. Letter Case Permutation.md>) | py | Jun 14, 2024 | -| 1087 | [Brace Expansion]() | Medium | | [solution](<../_1087. Brace Expansion.md>) | py | Jun 14, 2024 | -| 1239 | [Maximum Length of a Concatenated String with Unique Characters]() | Medium | | [solution](<../_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py | Jun 29, 2024 | -| 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Binary Search Tree.md b/markdowns/by_topic/Binary Search Tree.md deleted file mode 100644 index 3e2cfaad..00000000 --- a/markdowns/by_topic/Binary Search Tree.md +++ /dev/null @@ -1,21 +0,0 @@ -# [Binary Search Tree]() (13 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------|:-------------|:----------------| -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | -| 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 450 | [Delete Node in a BST]() | Medium | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | -| 703 | [Kth Largest Element in a Stream]() | Easy | N150 | [solution](<../_703. Kth Largest Element in a Stream.md>) | py | Jul 04, 2024 | -| 776 | [Split BST]() | Medium | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 28, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 26, 2024 | -| 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | -| 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | -| 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Binary Search.md b/markdowns/by_topic/Binary Search.md deleted file mode 100644 index ab2374ae..00000000 --- a/markdowns/by_topic/Binary Search.md +++ /dev/null @@ -1,26 +0,0 @@ -# [Binary Search]() (18 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:---------------------------------------------------------------------|:------------|:----------------| -| 69 | [Sqrt(x)]() | Easy | | [solution](<../_69. Sqrt(x).md>) | py | Jun 07, 2024 | -| 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<../_74. Search a 2D Matrix.md>) | py | Jun 14, 2024 | -| 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<../_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 | -| 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 25, 2024 | -| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | -| 374 | [Guess Number Higher or Lower]() | Easy | | [solution](<../_374. Guess Number Higher or Lower.md>) | java, py | Jun 02, 2024 | -| 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | -| 540 | [Single Element in a Sorted Array]() | Medium | | [solution](<../_540. Single Element in a Sorted Array.md>) | py | Jul 05, 2024 | -| 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | -| 744 | [Find Smallest Letter Greater Than Target]() | Easy | | [solution](<../_744. Find Smallest Letter Greater Than Target.md>) | java, py | Jun 01, 2024 | -| 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | -| 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | -| 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution](<../_1351. Count Negative Numbers in a Sorted Matrix.md>) | java, py | Jun 01, 2024 | -| 1482 | [Minimum Number of Days to Make m Bouquets]() | Medium | | [solution](<../_1482. Minimum Number of Days to Make m Bouquets.md>) | py | Jun 18, 2024 | -| 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<../_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | -| 1885 | [Count Pairs in Two Arrays]() | Medium | Weekly Premium | [solution](<../_1885. Count Pairs in Two Arrays.md>) | py | May 21, 2024 | -| 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 14, 2024 | -| 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Binary Tree.md b/markdowns/by_topic/Binary Tree.md deleted file mode 100644 index 1d75396a..00000000 --- a/markdowns/by_topic/Binary Tree.md +++ /dev/null @@ -1,69 +0,0 @@ -# [Binary Tree]() (61 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------|:-------------|:----------------| -| 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | -| 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution](<../_103. Binary Tree Zigzag Level Order Traversal.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | -| 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<../_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | -| 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<../_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | -| 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | -| 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | -| 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | -| 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution](<../_129. Sum Root to Leaf Numbers.md>) | py | Jun 07, 2024 | -| 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | cpp, java | Jul 04, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 366 | [Find Leaves of Binary Tree]() | Medium | | [solution](<../_366. Find Leaves of Binary Tree.md>) | py | Jun 11, 2024 | -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | -| 437 | [Path Sum III]() | Medium | | [solution](<../_437. Path Sum III.md>) | py | Jul 03, 2024 | -| 450 | [Delete Node in a BST]() | Medium | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | -| 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<../_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | -| 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<../_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | -| 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<../_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | -| 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | -| 687 | [Longest Univalue Path]() | Medium | | [solution](<../_687. Longest Univalue Path.md>) | py | Jul 03, 2024 | -| 703 | [Kth Largest Element in a Stream]() | Easy | N150 | [solution](<../_703. Kth Largest Element in a Stream.md>) | py | Jul 04, 2024 | -| 776 | [Split BST]() | Medium | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 28, 2024 | -| 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | -| 919 | [Complete Binary Tree Inserter]() | Medium | | [solution](<../_919. Complete Binary Tree Inserter.md>) | py | Jul 05, 2024 | -| 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | -| 993 | [Cousins in Binary Tree]() | Easy | | [solution](<../_993. Cousins in Binary Tree.md>) | py | Jul 03, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 26, 2024 | -| 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution](<../_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 | -| 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<../_1028. Recover a Tree From Preorder Traversal.md>) | py | Jun 30, 2024 | -| 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | -| 1302 | [Deepest Leaves Sum]() | Medium | | [solution](<../_1302. Deepest Leaves Sum.md>) | c, py | Jun 07, 2024 | -| 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | -| 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Medium | | [solution](<../_1315. Sum of Nodes with Even-Valued Grandparent.md>) | py | Jun 11, 2024 | -| 1372 | [Longest ZigZag Path in a Binary Tree]() | Medium | | [solution](<../_1372. Longest ZigZag Path in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | -| 1448 | [Count Good Nodes in Binary Tree]() | Medium | N150 | [solution](<../_1448. Count Good Nodes in Binary Tree.md>) | java | Jul 04, 2024 | -| 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution](<../_1457. Pseudo-Palindromic Paths in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution](<../_1602. Find Nearest Right Node in Binary Tree.md>) | java, py | Jul 02, 2024 | -| 1609 | [Even Odd Tree]() | Medium | | [solution](<../_1609. Even Odd Tree.md>) | py | Jul 05, 2024 | -| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 09, 2024 | -| 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | -| 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution](<../_1676. Lowest Common Ancestor of a Binary Tree IV.md>) | py | Jun 29, 2024 | -| 1973 | [Count Nodes Equal to Sum of Descendants]() | Medium | | [solution](<../_1973. Count Nodes Equal to Sum of Descendants.md>) | c | Jun 23, 2024 | -| 2265 | [Count Nodes Equal to Average of Subtree]() | Medium | | [solution](<../_2265. Count Nodes Equal to Average of Subtree.md>) | py | Jun 07, 2024 | -| 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<../_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | -| 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution](<../_2415. Reverse Odd Levels of Binary Tree.md>) | py | Jun 23, 2024 | -| 3157 | [Find the Level of Tree with Minimum Sum]() | Medium | | [solution](<../_3157. Find the Level of Tree with Minimum Sum.md>) | py | Jul 05, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Bit Manipulation.md b/markdowns/by_topic/Bit Manipulation.md deleted file mode 100644 index 40e61acf..00000000 --- a/markdowns/by_topic/Bit Manipulation.md +++ /dev/null @@ -1,32 +0,0 @@ -# [Bit Manipulation]() (24 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 78 | [Subsets]() | Medium | N150 | [solution](<../_78. Subsets.md>) | py | Jun 02, 2024 | -| 90 | [Subsets II]() | Medium | N150 | [solution](<../_90. Subsets II.md>) | py | Jul 03, 2024 | -| 136 | [Single Number]() | Easy | N150 | [solution](<../_136. Single Number.md>) | py | Jul 03, 2024 | -| 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution](<../_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | -| 260 | [Single Number III]() | Medium | Daily | [solution](<../_260. Single Number III.md>) | py | May 30, 2024 | -| 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 25, 2024 | -| 645 | [Set Mismatch]() | Easy | | [solution](<../_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | -| 784 | [Letter Case Permutation]() | Medium | | [solution](<../_784. Letter Case Permutation.md>) | py | Jun 14, 2024 | -| 861 | [Score After Flipping Matrix]() | Medium | | [solution](<../_861. Score After Flipping Matrix.md>) | c, py | Jun 09, 2024 | -| 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | -| 1018 | [Binary Prefix Divisible By 5]() | Easy | | [solution](<../_1018. Binary Prefix Divisible By 5.md>) | py | Jul 04, 2024 | -| 1239 | [Maximum Length of a Concatenated String with Unique Characters]() | Medium | | [solution](<../_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py | Jun 29, 2024 | -| 1255 | [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]() | Hard | | [solution](<../_1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.md>) | py | Jun 08, 2024 | -| 1404 | [Number of Steps to Reduce a Number in Binary Representation to One]() | Medium | Daily | [solution](<../_1404. Number of Steps to Reduce a Number in Binary Representation to One.md>) | py | May 29, 2024 | -| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | -| 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution](<../_1457. Pseudo-Palindromic Paths in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution](<../_1525. Number of Good Ways to Split a String.md>) | py | Jun 01, 2024 | -| 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution](<../_1684. Count the Number of Consistent Strings.md>) | c, py | Jun 06, 2024 | -| 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | -| 2433 | [Find The Original Array of Prefix Xor]() | Medium | | [solution](<../_2433. Find The Original Array of Prefix Xor.md>) | py | May 30, 2024 | -| 2997 | [Minimum Number of Operations to Make Array XOR Equal to K]() | Medium | | [solution](<../_2997. Minimum Number of Operations to Make Array XOR Equal to K.md>) | java, py | Jun 11, 2024 | -| 3064 | [Guess the Number Using Bitwise Questions I]() | Medium | | [solution](<../_3064. Guess the Number Using Bitwise Questions I.md>) | c, py | Jun 06, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Bitmask.md b/markdowns/by_topic/Bitmask.md deleted file mode 100644 index 7a79e5d5..00000000 --- a/markdowns/by_topic/Bitmask.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Bitmask]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------|:--------|:-------|:-----------------------------------------------------------------|:------------|:----------------| -| 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Brainteaser.md b/markdowns/by_topic/Brainteaser.md deleted file mode 100644 index cdbd9018..00000000 --- a/markdowns/by_topic/Brainteaser.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Brainteaser]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------|:--------|:-------|:-------------------------------------------------------|:---------------------------------|:----------------| -| 292 | [Nim Game]() | Easy | | [solution](<../_292. Nim Game.md>) | py | May 23, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | c, cpp, java, js, kt, py, rb, rs | Jun 09, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Breadth-First Search.md b/markdowns/by_topic/Breadth-First Search.md deleted file mode 100644 index 81eb5de7..00000000 --- a/markdowns/by_topic/Breadth-First Search.md +++ /dev/null @@ -1,55 +0,0 @@ -# [Breadth-First Search]() (47 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------------------|:------------|:----------------| -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | -| 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution](<../_103. Binary Tree Zigzag Level Order Traversal.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | -| 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<../_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | -| 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | -| 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | -| 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | cpp, java | Jul 04, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 14, 2024 | -| 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 339 | [Nested List Weight Sum]() | Medium | | [solution](<../_339. Nested List Weight Sum.md>) | c, py | Jul 02, 2024 | -| 364 | [Nested List Weight Sum II]() | Medium | | [solution](<../_364. Nested List Weight Sum II.md>) | java, py | Jul 02, 2024 | -| 429 | [N-ary Tree Level Order Traversal]() | Medium | | [solution](<../_429. N-ary Tree Level Order Traversal.md>) | py | Jul 03, 2024 | -| 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | -| 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<../_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | -| 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | -| 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<../_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | -| 690 | [Employee Importance]() | Medium | | [solution](<../_690. Employee Importance.md>) | java | Jul 02, 2024 | -| 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | -| 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | -| 909 | [Snakes and Ladders]() | Medium | | [solution](<../_909. Snakes and Ladders.md>) | py | Jun 11, 2024 | -| 919 | [Complete Binary Tree Inserter]() | Medium | | [solution](<../_919. Complete Binary Tree Inserter.md>) | py | Jul 05, 2024 | -| 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | -| 993 | [Cousins in Binary Tree]() | Easy | | [solution](<../_993. Cousins in Binary Tree.md>) | py | Jul 03, 2024 | -| 994 | [Rotting Oranges]() | Medium | N150 | [solution](<../_994. Rotting Oranges.md>) | py | Jun 14, 2024 | -| 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | -| 1087 | [Brace Expansion]() | Medium | | [solution](<../_1087. Brace Expansion.md>) | py | Jun 14, 2024 | -| 1254 | [Number of Closed Islands]() | Medium | | [solution](<../_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | -| 1284 | [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 08, 2024 | -| 1302 | [Deepest Leaves Sum]() | Medium | | [solution](<../_1302. Deepest Leaves Sum.md>) | c, py | Jun 07, 2024 | -| 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Medium | | [solution](<../_1315. Sum of Nodes with Even-Valued Grandparent.md>) | py | Jun 11, 2024 | -| 1448 | [Count Good Nodes in Binary Tree]() | Medium | N150 | [solution](<../_1448. Count Good Nodes in Binary Tree.md>) | java | Jul 04, 2024 | -| 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution](<../_1457. Pseudo-Palindromic Paths in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1490 | [Clone N-ary Tree]() | Medium | | [solution](<../_1490. Clone N-ary Tree.md>) | java, py | Jun 01, 2024 | -| 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution](<../_1602. Find Nearest Right Node in Binary Tree.md>) | java, py | Jul 02, 2024 | -| 1609 | [Even Odd Tree]() | Medium | | [solution](<../_1609. Even Odd Tree.md>) | py | Jul 05, 2024 | -| 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | -| 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<../_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | -| 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | -| 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | -| 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 14, 2024 | -| 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<../_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | -| 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution](<../_2415. Reverse Odd Levels of Binary Tree.md>) | py | Jun 23, 2024 | -| 3157 | [Find the Level of Tree with Minimum Sum]() | Medium | | [solution](<../_3157. Find the Level of Tree with Minimum Sum.md>) | py | Jul 05, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Bucket Sort.md b/markdowns/by_topic/Bucket Sort.md deleted file mode 100644 index b215a172..00000000 --- a/markdowns/by_topic/Bucket Sort.md +++ /dev/null @@ -1,11 +0,0 @@ -# [Bucket Sort]() (3 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|----:|:---------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------|:------------|:----------------| -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | -| 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Combinatorics.md b/markdowns/by_topic/Combinatorics.md deleted file mode 100644 index 41fda9ca..00000000 --- a/markdowns/by_topic/Combinatorics.md +++ /dev/null @@ -1,12 +0,0 @@ -# [Combinatorics]() (4 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------|:--------|:--------|:-------------------------------------------------------------------|:-------------|:----------------| -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | -| 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | -| 2954 | [Count the Number of Infection Sequences]() | Hard | | [solution](<../_2954. Count the Number of Infection Sequences.md>) | py | Jun 26, 2024 | -| 3179 | [Find the N-th Value After K Seconds]() - q2 | Medium | Contest | [solution](<../_3179. Find the N-th Value After K Seconds.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Counting Sort.md b/markdowns/by_topic/Counting Sort.md deleted file mode 100644 index a9277cda..00000000 --- a/markdowns/by_topic/Counting Sort.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Counting Sort]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------|:--------|:-------|:-----------------------------------------------|:------------|:----------------| -| 1051 | [Height Checker]() | Easy | Daily | [solution](<../_1051. Height Checker.md>) | c, py | Jun 09, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Counting.md b/markdowns/by_topic/Counting.md deleted file mode 100644 index 4340589f..00000000 --- a/markdowns/by_topic/Counting.md +++ /dev/null @@ -1,22 +0,0 @@ -# [Counting]() (14 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------|:------------|:----------------| -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | -| 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | -| 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<../_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | -| 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | -| 1748 | [Sum of Unique Elements]() | Easy | | [solution](<../_1748. Sum of Unique Elements.md>) | c | Jun 06, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | -| 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | -| 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | -| 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | -| 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | -| 2268 | [Minimum Number of Keypresses]() | Medium | | [solution](<../_2268. Minimum Number of Keypresses.md>) | py | Jul 05, 2024 | -| 2423 | [Remove Letter To Equalize Frequency]() | Easy | | [solution](<../_2423. Remove Letter To Equalize Frequency.md>) | py | Jun 16, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Data Stream.md b/markdowns/by_topic/Data Stream.md deleted file mode 100644 index 26d1e409..00000000 --- a/markdowns/by_topic/Data Stream.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Data Stream]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------|:------------|:----------------| -| 703 | [Kth Largest Element in a Stream]() | Easy | N150 | [solution](<../_703. Kth Largest Element in a Stream.md>) | py | Jul 04, 2024 | -| 1472 | [Design Browser History]() | Medium | | [solution](<../_1472. Design Browser History.md>) | py | Jul 05, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Database.md b/markdowns/by_topic/Database.md deleted file mode 100644 index 7f92b1b0..00000000 --- a/markdowns/by_topic/Database.md +++ /dev/null @@ -1,26 +0,0 @@ -# [Database]() (18 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:------------------------------------------------------------------------|:------------|:----------------| -| 175 | [Combine Two Tables]() | Easy | | [solution](<../_175. Combine Two Tables.md>) | py, sql | May 22, 2024 | -| 176 | [Second Highest Salary]() | Medium | | [solution](<../_176. Second Highest Salary.md>) | sql | May 22, 2024 | -| 177 | [Nth Highest Salary]() | Medium | | [solution](<../_177. Nth Highest Salary.md>) | sql | May 22, 2024 | -| 181 | [Employees Earning More Than Their Managers]() | Easy | | [solution](<../_181. Employees Earning More Than Their Managers.md>) | sql | May 22, 2024 | -| 182 | [Duplicate Emails]() | Easy | | [solution](<../_182. Duplicate Emails.md>) | sql | May 22, 2024 | -| 183 | [Customers Who Never Order]() | Easy | | [solution](<../_183. Customers Who Never Order.md>) | sql | May 22, 2024 | -| 184 | [Department Highest Salary]() | Medium | | [solution](<../_184. Department Highest Salary.md>) | sql | Jun 07, 2024 | -| 196 | [Delete Duplicate Emails]() | Easy | | [solution](<../_196. Delete Duplicate Emails.md>) | py, sql | Jun 07, 2024 | -| 197 | [Rising Temperature]() | Easy | | [solution](<../_197. Rising Temperature.md>) | sql | May 22, 2024 | -| 577 | [Employee Bonus]() | Easy | | [solution](<../_577. Employee Bonus.md>) | sql | May 22, 2024 | -| 584 | [Find Customer Referee]() | Easy | | [solution](<../_584. Find Customer Referee.md>) | sql | May 22, 2024 | -| 586 | [Customer Placing the Largest Number of Orders]() | Easy | | [solution](<../_586. Customer Placing the Largest Number of Orders.md>) | sql | May 22, 2024 | -| 595 | [Big Countries]() | Easy | | [solution](<../_595. Big Countries.md>) | sql | May 22, 2024 | -| 596 | [Classes More Than 5 Students]() | Easy | | [solution](<../_596. Classes More Than 5 Students.md>) | sql | May 22, 2024 | -| 607 | [Sales Person]() | Easy | | [solution](<../_607. Sales Person.md>) | sql | May 22, 2024 | -| 619 | [Biggest Single Number]() | Easy | | [solution](<../_619. Biggest Single Number.md>) | sql | May 22, 2024 | -| 1068 | [Product Sales Analysis I]() | Easy | | [solution](<../_1068. Product Sales Analysis I.md>) | sql | May 22, 2024 | -| 1783 | [Grand Slam Titles]() | Medium | | [solution](<../_1783. Grand Slam Titles.md>) | sql | Jun 07, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Depth-First Search.md b/markdowns/by_topic/Depth-First Search.md deleted file mode 100644 index 9c44d7b1..00000000 --- a/markdowns/by_topic/Depth-First Search.md +++ /dev/null @@ -1,76 +0,0 @@ -# [Depth-First Search]() (68 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------|:------------|:----------------| -| 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | -| 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<../_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | -| 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | -| 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | -| 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | -| 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution](<../_129. Sum Root to Leaf Numbers.md>) | py | Jun 07, 2024 | -| 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | cpp, java | Jul 04, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 339 | [Nested List Weight Sum]() | Medium | | [solution](<../_339. Nested List Weight Sum.md>) | c, py | Jul 02, 2024 | -| 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | -| 364 | [Nested List Weight Sum II]() | Medium | | [solution](<../_364. Nested List Weight Sum II.md>) | java, py | Jul 02, 2024 | -| 366 | [Find Leaves of Binary Tree]() | Medium | | [solution](<../_366. Find Leaves of Binary Tree.md>) | py | Jun 11, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 430 | [Flatten a Multilevel Doubly Linked List]() | Medium | | [solution](<../_430. Flatten a Multilevel Doubly Linked List.md>) | cpp, java | Jun 26, 2024 | -| 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | -| 437 | [Path Sum III]() | Medium | | [solution](<../_437. Path Sum III.md>) | py | Jul 03, 2024 | -| 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<../_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | -| 565 | [Array Nesting]() | Medium | | [solution](<../_565. Array Nesting.md>) | py | Jul 02, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | -| 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<../_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | -| 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<../_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | -| 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | -| 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | -| 687 | [Longest Univalue Path]() | Medium | | [solution](<../_687. Longest Univalue Path.md>) | py | Jul 03, 2024 | -| 690 | [Employee Importance]() | Medium | | [solution](<../_690. Employee Importance.md>) | java | Jul 02, 2024 | -| 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | -| 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | -| 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | -| 993 | [Cousins in Binary Tree]() | Easy | | [solution](<../_993. Cousins in Binary Tree.md>) | py | Jul 03, 2024 | -| 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | -| 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution](<../_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 | -| 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<../_1028. Recover a Tree From Preorder Traversal.md>) | py | Jun 30, 2024 | -| 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | -| 1233 | [Remove Sub-Folders from the Filesystem]() | Medium | | [solution](<../_1233. Remove Sub-Folders from the Filesystem.md>) | py | Jun 27, 2024 | -| 1254 | [Number of Closed Islands]() | Medium | | [solution](<../_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | -| 1302 | [Deepest Leaves Sum]() | Medium | | [solution](<../_1302. Deepest Leaves Sum.md>) | c, py | Jun 07, 2024 | -| 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | -| 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Medium | | [solution](<../_1315. Sum of Nodes with Even-Valued Grandparent.md>) | py | Jun 11, 2024 | -| 1372 | [Longest ZigZag Path in a Binary Tree]() | Medium | | [solution](<../_1372. Longest ZigZag Path in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | -| 1448 | [Count Good Nodes in Binary Tree]() | Medium | N150 | [solution](<../_1448. Count Good Nodes in Binary Tree.md>) | java | Jul 04, 2024 | -| 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution](<../_1457. Pseudo-Palindromic Paths in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1490 | [Clone N-ary Tree]() | Medium | | [solution](<../_1490. Clone N-ary Tree.md>) | java, py | Jun 01, 2024 | -| 1522 | [Diameter of N-Ary Tree]() | Medium | | [solution](<../_1522. Diameter of N-Ary Tree.md>) | py | Jul 02, 2024 | -| 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | -| 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution](<../_1676. Lowest Common Ancestor of a Binary Tree IV.md>) | py | Jun 29, 2024 | -| 1858 | [Longest Word With All Prefixes]() | Medium | | [solution](<../_1858. Longest Word With All Prefixes.md>) | py | Jun 29, 2024 | -| 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | -| 1973 | [Count Nodes Equal to Sum of Descendants]() | Medium | | [solution](<../_1973. Count Nodes Equal to Sum of Descendants.md>) | c | Jun 23, 2024 | -| 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | -| 2265 | [Count Nodes Equal to Average of Subtree]() | Medium | | [solution](<../_2265. Count Nodes Equal to Average of Subtree.md>) | py | Jun 07, 2024 | -| 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<../_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | -| 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution](<../_2415. Reverse Odd Levels of Binary Tree.md>) | py | Jun 23, 2024 | -| 3157 | [Find the Level of Tree with Minimum Sum]() | Medium | | [solution](<../_3157. Find the Level of Tree with Minimum Sum.md>) | py | Jul 05, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Design.md b/markdowns/by_topic/Design.md deleted file mode 100644 index 13589ecb..00000000 --- a/markdowns/by_topic/Design.md +++ /dev/null @@ -1,33 +0,0 @@ -# [Design]() (25 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------|:------------|:----------------| -| 155 | [Min Stack]() | Medium | N150 | [solution](<../_155. Min Stack.md>) | py | Jun 13, 2024 | -| 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | -| 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | -| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution](<../_348. Design Tic-Tac-Toe.md>) | py | Jul 04, 2024 | -| 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | -| 380 | [Insert Delete GetRandom O(1)]() | Medium | | [solution](<../_380. Insert Delete GetRandom O(1).md>) | java | Jul 05, 2024 | -| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed]() | Hard | | [solution](<../_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>) | java | Jul 05, 2024 | -| 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | -| 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<../_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | -| 622 | [Design Circular Queue]() | Medium | | [solution](<../_622. Design Circular Queue.md>) | py | Jul 05, 2024 | -| 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | -| 703 | [Kth Largest Element in a Stream]() | Easy | N150 | [solution](<../_703. Kth Largest Element in a Stream.md>) | py | Jul 04, 2024 | -| 707 | [Design Linked List]() | Medium | | [solution](<../_707. Design Linked List.md>) | java | Jun 21, 2024 | -| 919 | [Complete Binary Tree Inserter]() | Medium | | [solution](<../_919. Complete Binary Tree Inserter.md>) | py | Jul 05, 2024 | -| 1166 | [Design File System]() | Medium | | [solution](<../_1166. Design File System.md>) | py | Jun 27, 2024 | -| 1381 | [Design a Stack With Increment Operation]() | Medium | | [solution](<../_1381. Design a Stack With Increment Operation.md>) | py | Jul 05, 2024 | -| 1472 | [Design Browser History]() | Medium | | [solution](<../_1472. Design Browser History.md>) | py | Jul 05, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | -| 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | -| 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2671 | [Frequency Tracker]() | Medium | | [solution](<../_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Divide and Conquer.md b/markdowns/by_topic/Divide and Conquer.md deleted file mode 100644 index 90a016b0..00000000 --- a/markdowns/by_topic/Divide and Conquer.md +++ /dev/null @@ -1,14 +0,0 @@ -# [Divide and Conquer]() (6 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------|:--------|:----------|:--------------------------------------------------------|:------------|:----------------| -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | -| 191 | [Number of 1 Bits]() | Easy | B75, N150 | [solution](<../_191. Number of 1 Bits.md>) | py | Jul 03, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | -| 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Doubly-Linked List.md b/markdowns/by_topic/Doubly-Linked List.md deleted file mode 100644 index 319727c8..00000000 --- a/markdowns/by_topic/Doubly-Linked List.md +++ /dev/null @@ -1,11 +0,0 @@ -# [Doubly-Linked List]() (3 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------------------------------|:------------|:----------------| -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 430 | [Flatten a Multilevel Doubly Linked List]() | Medium | | [solution](<../_430. Flatten a Multilevel Doubly Linked List.md>) | cpp, java | Jun 26, 2024 | -| 1472 | [Design Browser History]() | Medium | | [solution](<../_1472. Design Browser History.md>) | py | Jul 05, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Dynamic Programming.md b/markdowns/by_topic/Dynamic Programming.md deleted file mode 100644 index e8953f08..00000000 --- a/markdowns/by_topic/Dynamic Programming.md +++ /dev/null @@ -1,28 +0,0 @@ -# [Dynamic Programming]() (20 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------|:-------------|:----------------| -| 5 | [Longest Palindromic Substring]() | Medium | B75, N150 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | -| 22 | [Generate Parentheses]() | Medium | N150 | [solution](<../_22. Generate Parentheses.md>) | py | Jun 13, 2024 | -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | -| 118 | [Pascal's Triangle]() | Easy | | [solution](<../_118. Pascal's Triangle.md>) | py | May 22, 2024 | -| 121 | [Best Time to Buy and Sell Stock]() | Easy | B75, N150 | [solution](<../_121. Best Time to Buy and Sell Stock.md>) | py | Jul 03, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | -| 392 | [Is Subsequence]() | Easy | | [solution](<../_392. Is Subsequence.md>) | java | Jun 21, 2024 | -| 509 | [Fibonacci Number]() | Easy | | [solution](<../_509. Fibonacci Number.md>) | c | Jun 16, 2024 | -| 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | -| 647 | [Palindromic Substrings]() | Medium | B75, N150 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | -| 651 | [4 Keys Keyboard]() | Medium | | [solution](<../_651. 4 Keys Keyboard.md>) | py | May 29, 2024 | -| 746 | [Min Cost Climbing Stairs]() | Easy | N150 | [solution](<../_746. Min Cost Climbing Stairs.md>) | py | Jul 04, 2024 | -| 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | -| 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | -| 1372 | [Longest ZigZag Path in a Binary Tree]() | Medium | | [solution](<../_1372. Longest ZigZag Path in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution](<../_1525. Number of Good Ways to Split a String.md>) | py | Jun 01, 2024 | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | -| 2086 | [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 | -| 3180 | [Maximum Total Reward Using Operations I]() - q3 | Medium | Contest | [solution](<../_3180. Maximum Total Reward Using Operations I.md>) | c, py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Game Theory.md b/markdowns/by_topic/Game Theory.md deleted file mode 100644 index 4ba82f9d..00000000 --- a/markdowns/by_topic/Game Theory.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Game Theory]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------|:--------|:-------|:---------------------------------------------------------------|:------------|:----------------| -| 292 | [Nim Game]() | Easy | | [solution](<../_292. Nim Game.md>) | py | May 23, 2024 | -| 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Geometry.md b/markdowns/by_topic/Geometry.md deleted file mode 100644 index 545622a5..00000000 --- a/markdowns/by_topic/Geometry.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Geometry]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------|:------------|:----------------| -| 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | -| 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Graph.md b/markdowns/by_topic/Graph.md deleted file mode 100644 index cbb0018b..00000000 --- a/markdowns/by_topic/Graph.md +++ /dev/null @@ -1,14 +0,0 @@ -# [Graph]() (6 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:--------------------------------------------------------------------------------------|:-----------------|:----------------| -| 1579 | [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 | -| 1791 | [Find Center of Star Graph]() | Easy | Daily | [solution](<../_1791. Find Center of Star Graph.md>) | c, cpp, java, py | Jun 26, 2024 | -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, cpp, java, py | Jun 27, 2024 | -| 2374 | [Node With Highest Edge Score]() | Medium | | [solution](<../_2374. Node With Highest Edge Score.md>) | py | Jun 17, 2024 | -| 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution](<../_2473. Minimum Cost to Buy Apples.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Greedy.md b/markdowns/by_topic/Greedy.md deleted file mode 100644 index 10af2bbc..00000000 --- a/markdowns/by_topic/Greedy.md +++ /dev/null @@ -1,39 +0,0 @@ -# [Greedy]() (31 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 330 | [Patching Array]() | Hard | Daily | [solution](<../_330. Patching Array.md>) | py | Jun 15, 2024 | -| 409 | [Longest Palindrome]() | Easy | Daily | [solution](<../_409. Longest Palindrome.md>) | c, py | Jun 03, 2024 | -| 502 | [IPO]() | Hard | Daily | [solution](<../_502. IPO.md>) | py | Jun 14, 2024 | -| 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | -| 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<../_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | -| 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | -| 846 | [Hand of Straights]() | Medium | Daily, N150 | [solution](<../_846. Hand of Straights.md>) | py | Jun 06, 2024 | -| 861 | [Score After Flipping Matrix]() | Medium | | [solution](<../_861. Score After Flipping Matrix.md>) | c, py | Jun 09, 2024 | -| 921 | [Minimum Add to Make Parentheses Valid]() | Medium | | [solution](<../_921. Minimum Add to Make Parentheses Valid.md>) | java, py | Jun 11, 2024 | -| 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<../_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | -| 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | -| 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, cpp, java, py | Jul 02, 2024 | -| 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | -| 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution](<../_1564. Put Boxes Into the Warehouse I.md>) | py | Jun 14, 2024 | -| 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<../_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 14, 2024 | -| 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers]() | Medium | | [solution](<../_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md>) | c, java | Jun 22, 2024 | -| 1736 | [Latest Time by Replacing Hidden Digits]() | Easy | | [solution](<../_1736. Latest Time by Replacing Hidden Digits.md>) | c | Jun 03, 2024 | -| 1833 | [Maximum Ice Cream Bars]() | Medium | | [solution](<../_1833. Maximum Ice Cream Bars.md>) | c, java, py | Jun 23, 2024 | -| 1874 | [Minimize Product Sum of Two Arrays]() | Medium | | [solution](<../_1874. Minimize Product Sum of Two Arrays.md>) | c, java | Jun 22, 2024 | -| 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | -| 2086 | [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 | -| 2268 | [Minimum Number of Keypresses]() | Medium | | [solution](<../_2268. Minimum Number of Keypresses.md>) | py | Jul 05, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, cpp, java, py | Jun 27, 2024 | -| 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | -| 2405 | [Optimal Partition of String]() | Medium | | [solution](<../_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | -| 2734 | [Lexicographically Smallest String After Substring Operation]() | Medium | | [solution](<../_2734. Lexicographically Smallest String After Substring Operation.md>) | py | Jun 29, 2024 | -| 3074 | [Apple Redistribution into Boxes]() | Easy | | [solution](<../_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 | -| 3106 | [Lexicographically Smallest String After Operations With Constraint]() | Medium | | [solution](<../_3106. Lexicographically Smallest String After Operations With Constraint.md>) | py | Jun 29, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Hash Function.md b/markdowns/by_topic/Hash Function.md deleted file mode 100644 index c12f17d0..00000000 --- a/markdowns/by_topic/Hash Function.md +++ /dev/null @@ -1,12 +0,0 @@ -# [Hash Function]() (4 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------|:--------|:----------|:---------------------------------------------------------------------|:------------|:----------------| -| 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<../_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | -| 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<../_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 01, 2024 | -| 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Hash Table.md b/markdowns/by_topic/Hash Table.md deleted file mode 100644 index 3129cdf7..00000000 --- a/markdowns/by_topic/Hash Table.md +++ /dev/null @@ -1,97 +0,0 @@ -# [Hash Table]() (89 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:-------------------------------------------------------------------------------------------|:------------|:----------------| -| 1 | [Two Sum]() | Easy | B75, N150 | [solution](<../_1. Two Sum.md>) | java, py | May 22, 2024 | -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | -| 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | -| 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution](<../_138. Copy List with Random Pointer.md>) | py | Jun 27, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | -| 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | -| 166 | [Fraction to Recurring Decimal]() | Medium | | [solution](<../_166. Fraction to Recurring Decimal.md>) | py | May 31, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<../_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | -| 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution](<../_348. Design Tic-Tac-Toe.md>) | py | Jul 04, 2024 | -| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | -| 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | -| 380 | [Insert Delete GetRandom O(1)]() | Medium | | [solution](<../_380. Insert Delete GetRandom O(1).md>) | java | Jul 05, 2024 | -| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed]() | Hard | | [solution](<../_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>) | java | Jul 05, 2024 | -| 409 | [Longest Palindrome]() | Easy | Daily | [solution](<../_409. Longest Palindrome.md>) | c, py | Jun 03, 2024 | -| 424 | [Longest Repeating Character Replacement]() | Medium | B75, N150 | [solution](<../_424. Longest Repeating Character Replacement.md>) | py | Jul 05, 2024 | -| 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | -| 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<../_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | -| 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<../_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | -| 567 | [Permutation in String]() | Medium | N150 | [solution](<../_567. Permutation in String.md>) | py | Jul 05, 2024 | -| 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | -| 645 | [Set Mismatch]() | Easy | | [solution](<../_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | -| 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | -| 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | -| 690 | [Employee Importance]() | Medium | | [solution](<../_690. Employee Importance.md>) | java | Jul 02, 2024 | -| 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | -| 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | -| 758 | [Bold Words in String]() | Medium | | [solution](<../_758. Bold Words in String.md>) | py | Jun 27, 2024 | -| 771 | [Jewels and Stones]() | Easy | | [solution](<../_771. Jewels and Stones.md>) | java, py | Jun 02, 2024 | -| 791 | [Custom Sort String]() | Medium | | [solution](<../_791. Custom Sort String.md>) | java | Jun 24, 2024 | -| 817 | [Linked List Components]() | Medium | | [solution](<../_817. Linked List Components.md>) | java | Jul 04, 2024 | -| 846 | [Hand of Straights]() | Medium | Daily, N150 | [solution](<../_846. Hand of Straights.md>) | py | Jun 06, 2024 | -| 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | -| 890 | [Find and Replace Pattern]() | Medium | | [solution](<../_890. Find and Replace Pattern.md>) | py | Jul 02, 2024 | -| 930 | [Binary Subarrays With Sum]() | Medium | | [solution](<../_930. Binary Subarrays With Sum.md>) | py | Jun 21, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | -| 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | -| 1002 | [Find Common Characters]() | Easy | Daily | [solution](<../_1002. Find Common Characters.md>) | py | Jun 04, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | -| 1166 | [Design File System]() | Medium | | [solution](<../_1166. Design File System.md>) | py | Jun 27, 2024 | -| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List]() | Medium | | [solution](<../_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>) | py | Jun 15, 2024 | -| 1218 | [Longest Arithmetic Subsequence of Given Difference]() | Medium | | [solution](<../_1218. Longest Arithmetic Subsequence of Given Difference.md>) | py | May 31, 2024 | -| 1248 | [Count Number of Nice Subarrays]() | Medium | Daily | [solution](<../_1248. Count Number of Nice Subarrays.md>) | py | Jun 21, 2024 | -| 1282 | [Group the People Given the Group Size They Belong To]() | Medium | | [solution](<../_1282. Group the People Given the Group Size They Belong To.md>) | py | Jun 27, 2024 | -| 1284 | [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 08, 2024 | -| 1426 | [Counting Elements]() | Easy | | [solution](<../_1426. Counting Elements.md>) | c | Jun 04, 2024 | -| 1436 | [Destination City]() | Easy | | [solution](<../_1436. Destination City.md>) | java | Jun 01, 2024 | -| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | -| 1460 | [Make Two Arrays Equal by Reversing Subarrays]() | Easy | | [solution](<../_1460. Make Two Arrays Equal by Reversing Subarrays.md>) | c | Jun 04, 2024 | -| 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | -| 1490 | [Clone N-ary Tree]() | Medium | | [solution](<../_1490. Clone N-ary Tree.md>) | java, py | Jun 01, 2024 | -| 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution](<../_1525. Number of Good Ways to Split a String.md>) | py | Jun 01, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | -| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 09, 2024 | -| 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | -| 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution](<../_1676. Lowest Common Ancestor of a Binary Tree IV.md>) | py | Jun 29, 2024 | -| 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution](<../_1684. Count the Number of Consistent Strings.md>) | c, py | Jun 06, 2024 | -| 1743 | [Restore the Array From Adjacent Pairs]() | Medium | | [solution](<../_1743. Restore the Array From Adjacent Pairs.md>) | py | Jun 26, 2024 | -| 1748 | [Sum of Unique Elements]() | Easy | | [solution](<../_1748. Sum of Unique Elements.md>) | c | Jun 06, 2024 | -| 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | -| 1836 | [Remove Duplicates From an Unsorted Linked List]() | Medium | | [solution](<../_1836. Remove Duplicates From an Unsorted Linked List.md>) | py | Jul 04, 2024 | -| 1852 | [Distinct Numbers in Each Subarray]() | Medium | | [solution](<../_1852. Distinct Numbers in Each Subarray.md>) | java | Jun 26, 2024 | -| 1940 | [Longest Common Subsequence Between Sorted Arrays]() | Medium | Weekly Premium | [solution](<../_1940. Longest Common Subsequence Between Sorted Arrays.md>) | java, py | Jun 01, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | -| 2013 | [Detect Squares]() | Medium | N150 | [solution](<../_2013. Detect Squares.md>) | py | Jun 28, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | -| 2206 | [Divide Array Into Equal Pairs]() | Easy | | [solution](<../_2206. Divide Array Into Equal Pairs.md>) | c, py | Jun 08, 2024 | -| 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | -| 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | -| 2268 | [Minimum Number of Keypresses]() | Medium | | [solution](<../_2268. Minimum Number of Keypresses.md>) | py | Jul 05, 2024 | -| 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 26, 2024 | -| 2365 | [Task Scheduler II]() | Medium | | [solution](<../_2365. Task Scheduler II.md>) | py | Jun 29, 2024 | -| 2374 | [Node With Highest Edge Score]() | Medium | | [solution](<../_2374. Node With Highest Edge Score.md>) | py | Jun 17, 2024 | -| 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<../_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | -| 2395 | [Find Subarrays With Equal Sum]() | Easy | | [solution](<../_2395. Find Subarrays With Equal Sum.md>) | py | May 30, 2024 | -| 2405 | [Optimal Partition of String]() | Medium | | [solution](<../_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 | -| 2423 | [Remove Letter To Equalize Frequency]() | Easy | | [solution](<../_2423. Remove Letter To Equalize Frequency.md>) | py | Jun 16, 2024 | -| 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<../_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | -| 2610 | [Convert an Array Into a 2D Array With Conditions]() | Medium | | [solution](<../_2610. Convert an Array Into a 2D Array With Conditions.md>) | py | Jun 07, 2024 | -| 2671 | [Frequency Tracker]() | Medium | | [solution](<../_2671. Frequency Tracker.md>) | py | Jun 28, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | -| 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | -| 3174 | [Clear Digits]() - q1 | Easy | Contest | [solution](<../_3174. Clear Digits.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Heap (Priority Queue).md b/markdowns/by_topic/Heap (Priority Queue).md deleted file mode 100644 index d8f446c5..00000000 --- a/markdowns/by_topic/Heap (Priority Queue).md +++ /dev/null @@ -1,24 +0,0 @@ -# [Heap (Priority Queue)]() (16 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:------------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | -| 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | -| 502 | [IPO]() | Hard | Daily | [solution](<../_502. IPO.md>) | py | Jun 14, 2024 | -| 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | -| 703 | [Kth Largest Element in a Stream]() | Easy | N150 | [solution](<../_703. Kth Largest Element in a Stream.md>) | py | Jul 04, 2024 | -| 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | -| 1046 | [Last Stone Weight]() | Easy | N150 | [solution](<../_1046. Last Stone Weight.md>) | py | Jun 03, 2024 | -| 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, cpp, java, py | Jun 27, 2024 | -| 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution](<../_2473. Minimum Cost to Buy Apples.md>) | py | Jun 28, 2024 | -| 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Interactive.md b/markdowns/by_topic/Interactive.md deleted file mode 100644 index bd519850..00000000 --- a/markdowns/by_topic/Interactive.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Interactive]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------------------|:------------|:----------------| -| 374 | [Guess Number Higher or Lower]() | Easy | | [solution](<../_374. Guess Number Higher or Lower.md>) | java, py | Jun 02, 2024 | -| 3064 | [Guess the Number Using Bitwise Questions I]() | Medium | | [solution](<../_3064. Guess the Number Using Bitwise Questions I.md>) | c, py | Jun 06, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Iterator.md b/markdowns/by_topic/Iterator.md deleted file mode 100644 index c82a6ac6..00000000 --- a/markdowns/by_topic/Iterator.md +++ /dev/null @@ -1,11 +0,0 @@ -# [Iterator]() (3 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|----:|:---------------------------------------------------------------------------------------------|:--------|:-------|:-------------------------------------------------------|:------------|:----------------| -| 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | -| 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Linked List.md b/markdowns/by_topic/Linked List.md deleted file mode 100644 index e6ccf8ca..00000000 --- a/markdowns/by_topic/Linked List.md +++ /dev/null @@ -1,48 +0,0 @@ -# [Linked List]() (40 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 2 | [Add Two Numbers]() | Medium | N150 | [solution](<../_2. Add Two Numbers.md>) | java | May 22, 2024 | -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<../_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 06, 2024 | -| 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution](<../_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | -| 24 | [Swap Nodes in Pairs]() | Medium | | [solution](<../_24. Swap Nodes in Pairs.md>) | c | Jun 06, 2024 | -| 25 | [Reverse Nodes in k-Group]() | Hard | N150 | [solution](<../_25. Reverse Nodes in k-Group.md>) | c | Jun 06, 2024 | -| 61 | [Rotate List]() | Medium | | [solution](<../_61. Rotate List.md>) | py | Jun 21, 2024 | -| 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution](<../_82. Remove Duplicates from Sorted List II.md>) | py | Jul 04, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | -| 138 | [Copy List with Random Pointer]() | Medium | N150 | [solution](<../_138. Copy List with Random Pointer.md>) | py | Jun 27, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | -| 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution](<../_206. Reverse Linked List.md>) | java | Jun 27, 2024 | -| 328 | [Odd Even Linked List]() | Medium | | [solution](<../_328. Odd Even Linked List.md>) | py | Jun 21, 2024 | -| 369 | [Plus One Linked List]() | Medium | | [solution](<../_369. Plus One Linked List.md>) | c | Jul 04, 2024 | -| 382 | [Linked List Random Node]() | Medium | | [solution](<../_382. Linked List Random Node.md>) | c, java, py | Jun 21, 2024 | -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 430 | [Flatten a Multilevel Doubly Linked List]() | Medium | | [solution](<../_430. Flatten a Multilevel Doubly Linked List.md>) | cpp, java | Jun 26, 2024 | -| 622 | [Design Circular Queue]() | Medium | | [solution](<../_622. Design Circular Queue.md>) | py | Jul 05, 2024 | -| 707 | [Design Linked List]() | Medium | | [solution](<../_707. Design Linked List.md>) | java | Jun 21, 2024 | -| 708 | [Insert into a Sorted Circular Linked List]() | Medium | | [solution](<../_708. Insert into a Sorted Circular Linked List.md>) | py | Jun 21, 2024 | -| 725 | [Split Linked List in Parts]() | Medium | | [solution](<../_725. Split Linked List in Parts.md>) | py | Jun 21, 2024 | -| 817 | [Linked List Components]() | Medium | | [solution](<../_817. Linked List Components.md>) | java | Jul 04, 2024 | -| 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | -| 1171 | [Remove Zero Sum Consecutive Nodes from Linked List]() | Medium | | [solution](<../_1171. Remove Zero Sum Consecutive Nodes from Linked List.md>) | py | Jun 15, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | -| 1472 | [Design Browser History]() | Medium | | [solution](<../_1472. Design Browser History.md>) | py | Jul 05, 2024 | -| 1474 | [Delete N Nodes After M Nodes of a Linked List]() | Easy | | [solution](<../_1474. Delete N Nodes After M Nodes of a Linked List.md>) | c, java | Jun 06, 2024 | -| 1669 | [Merge In Between Linked Lists]() | Medium | | [solution](<../_1669. Merge In Between Linked Lists.md>) | c | Jun 24, 2024 | -| 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<../_1721. Swapping Nodes in a Linked List.md>) | c | Jun 06, 2024 | -| 1836 | [Remove Duplicates From an Unsorted Linked List]() | Medium | | [solution](<../_1836. Remove Duplicates From an Unsorted Linked List.md>) | py | Jul 04, 2024 | -| 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<../_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | -| 2058 | [Find the Minimum and Maximum Number of Nodes Between Critical Points]() | Medium | Daily | [solution](<../_2058. Find the Minimum and Maximum Number of Nodes Between Critical Points.md>) | cpp, java, py | Jul 04, 2024 | -| 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<../_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 06, 2024 | -| 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 20, 2024 | -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<../_2181. Merge Nodes in Between Zeros.md>) | c, cpp, java, py | Jul 03, 2024 | -| 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | -| 2807 | [Insert Greatest Common Divisors in Linked List]() | Medium | | [solution](<../_2807. Insert Greatest Common Divisors in Linked List.md>) | py | Jun 12, 2024 | -| 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution](<../_2816. Double a Number Represented as a Linked List.md>) | c | Jul 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Math.md b/markdowns/by_topic/Math.md deleted file mode 100644 index 111a7e17..00000000 --- a/markdowns/by_topic/Math.md +++ /dev/null @@ -1,58 +0,0 @@ -# [Math]() (50 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:-------------------------------------------------------------------------------------|:---------------------------------|:----------------| -| 2 | [Add Two Numbers]() | Medium | N150 | [solution](<../_2. Add Two Numbers.md>) | java | May 22, 2024 | -| 7 | [Reverse Integer]() | Medium | N150 | [solution](<../_7. Reverse Integer.md>) | py | May 29, 2024 | -| 9 | [Palindrome Number]() | Easy | | [solution](<../_9. Palindrome Number.md>) | java | May 22, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | -| 50 | [Pow(x, n)]() | Medium | N150 | [solution](<../_50. Pow(x, n).md>) | c, java, py | Jun 22, 2024 | -| 66 | [Plus One]() | Easy | N150 | [solution](<../_66. Plus One.md>) | c | Jun 03, 2024 | -| 69 | [Sqrt(x)]() | Easy | | [solution](<../_69. Sqrt(x).md>) | py | Jun 07, 2024 | -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | -| 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<../_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | -| 166 | [Fraction to Recurring Decimal]() | Medium | | [solution](<../_166. Fraction to Recurring Decimal.md>) | py | May 31, 2024 | -| 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | -| 224 | [Basic Calculator]() | Hard | | [solution](<../_224. Basic Calculator.md>) | py | Jun 10, 2024 | -| 227 | [Basic Calculator II]() | Medium | | [solution](<../_227. Basic Calculator II.md>) | py | Jun 10, 2024 | -| 273 | [Integer to English Words]() | Hard | | [solution](<../_273. Integer to English Words.md>) | py | Jun 10, 2024 | -| 292 | [Nim Game]() | Easy | | [solution](<../_292. Nim Game.md>) | py | May 23, 2024 | -| 369 | [Plus One Linked List]() | Medium | | [solution](<../_369. Plus One Linked List.md>) | c | Jul 04, 2024 | -| 380 | [Insert Delete GetRandom O(1)]() | Medium | | [solution](<../_380. Insert Delete GetRandom O(1).md>) | java | Jul 05, 2024 | -| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed]() | Hard | | [solution](<../_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>) | java | Jul 05, 2024 | -| 382 | [Linked List Random Node]() | Medium | | [solution](<../_382. Linked List Random Node.md>) | c, java, py | Jun 21, 2024 | -| 384 | [Shuffle an Array]() | Medium | | [solution](<../_384. Shuffle an Array.md>) | py | Jun 28, 2024 | -| 412 | [Fizz Buzz]() | Easy | | [solution](<../_412. Fizz Buzz.md>) | java, py | Jun 02, 2024 | -| 509 | [Fibonacci Number]() | Easy | | [solution](<../_509. Fibonacci Number.md>) | c | Jun 16, 2024 | -| 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<../_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | -| 651 | [4 Keys Keyboard]() | Medium | | [solution](<../_651. 4 Keys Keyboard.md>) | py | May 29, 2024 | -| 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | -| 1006 | [Clumsy Factorial]() | Medium | | [solution](<../_1006. Clumsy Factorial.md>) | c, py | Jun 11, 2024 | -| 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | -| 1248 | [Count Number of Nice Subarrays]() | Medium | Daily | [solution](<../_1248. Count Number of Nice Subarrays.md>) | py | Jun 21, 2024 | -| 1252 | [Cells with Odd Values in a Matrix]() | Easy | | [solution](<../_1252. Cells with Odd Values in a Matrix.md>) | c | Jun 04, 2024 | -| 1317 | [Convert Integer to the Sum of Two No-Zero Integers]() | Easy | | [solution](<../_1317. Convert Integer to the Sum of Two No-Zero Integers.md>) | c | Jun 04, 2024 | -| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | -| 1518 | [Water Bottles]() | Easy | Daily | [solution](<../_1518. Water Bottles.md>) | c, cpp, cs, java, js, py, ts | Jul 06, 2024 | -| 1551 | [Minimum Operations to Make Array Equal]() | Medium | | [solution](<../_1551. Minimum Operations to Make Array Equal.md>) | c, java, js, kt, py, rb, rs | Jun 12, 2024 | -| 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | -| 1641 | [Count Sorted Vowel Strings]() | Medium | | [solution](<../_1641. Count Sorted Vowel Strings.md>) | c, cpp, java | Jun 24, 2024 | -| 1759 | [Count Number of Homogenous Substrings]() | Medium | | [solution](<../_1759. Count Number of Homogenous Substrings.md>) | c, java | Jun 10, 2024 | -| 1822 | [Sign of the Product of an Array]() | Easy | | [solution](<../_1822. Sign of the Product of an Array.md>) | c | Jun 06, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | -| 2165 | [Smallest Value of the Rearranged Number]() | Medium | | [solution](<../_2165. Smallest Value of the Rearranged Number.md>) | py | Jun 30, 2024 | -| 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | -| 2317 | [Maximum XOR After Operations ]() | Medium | | [solution](<../_2317. Maximum XOR After Operations .md>) | c, cpp, java, py | Jun 24, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | c, cpp, java, js, kt, py, rb, rs | Jun 09, 2024 | -| 2455 | [Average Value of Even Numbers That Are Divisible by Three]() | Easy | | [solution](<../_2455. Average Value of Even Numbers That Are Divisible by Three.md>) | java | Jul 04, 2024 | -| 2582 | [Pass the Pillow]() | Easy | Daily | [solution](<../_2582. Pass the Pillow.md>) | c, cpp, cs, java, js, py | Jul 05, 2024 | -| 2807 | [Insert Greatest Common Divisors in Linked List]() | Medium | | [solution](<../_2807. Insert Greatest Common Divisors in Linked List.md>) | py | Jun 12, 2024 | -| 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution](<../_2816. Double a Number Represented as a Linked List.md>) | c | Jul 04, 2024 | -| 2894 | [Divisible and Non-divisible Sums Difference]() | Easy | | [solution](<../_2894. Divisible and Non-divisible Sums Difference.md>) | py | May 22, 2024 | -| 2954 | [Count the Number of Infection Sequences]() | Hard | | [solution](<../_2954. Count the Number of Infection Sequences.md>) | py | Jun 26, 2024 | -| 3178 | [Find the Child Who Has the Ball After K Seconds]() - q1 | Easy | Contest | [solution](<../_3178. Find the Child Who Has the Ball After K Seconds.md>) | py | Jun 08, 2024 | -| 3179 | [Find the N-th Value After K Seconds]() - q2 | Medium | Contest | [solution](<../_3179. Find the N-th Value After K Seconds.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Matrix.md b/markdowns/by_topic/Matrix.md deleted file mode 100644 index 1d0516f9..00000000 --- a/markdowns/by_topic/Matrix.md +++ /dev/null @@ -1,38 +0,0 @@ -# [Matrix]() (30 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:-------------------------------------------------------------------------------------------|:------------|:----------------| -| 36 | [Valid Sudoku]() | Medium | N150 | [solution](<../_36. Valid Sudoku.md>) | py | Jun 13, 2024 | -| 48 | [Rotate Image]() | Medium | B75, N150 | [solution](<../_48. Rotate Image.md>) | c, py | Jun 14, 2024 | -| 74 | [Search a 2D Matrix]() | Medium | N150 | [solution](<../_74. Search a 2D Matrix.md>) | py | Jun 14, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | -| 286 | [Walls and Gates]() | Medium | N150 | [solution](<../_286. Walls and Gates.md>) | py | Jun 14, 2024 | -| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution](<../_348. Design Tic-Tac-Toe.md>) | py | Jul 04, 2024 | -| 419 | [Battleships in a Board]() | Medium | | [solution](<../_419. Battleships in a Board.md>) | c, py | Jun 23, 2024 | -| 542 | [01 Matrix]() | Medium | | [solution](<../_542. 01 Matrix.md>) | py | Jun 26, 2024 | -| 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | -| 794 | [Valid Tic-Tac-Toe State]() | Medium | | [solution](<../_794. Valid Tic-Tac-Toe State.md>) | py | Jul 04, 2024 | -| 807 | [Max Increase to Keep City Skyline]() | Medium | | [solution](<../_807. Max Increase to Keep City Skyline.md>) | java | Jun 22, 2024 | -| 861 | [Score After Flipping Matrix]() | Medium | | [solution](<../_861. Score After Flipping Matrix.md>) | c, py | Jun 09, 2024 | -| 867 | [Transpose Matrix]() | Easy | | [solution](<../_867. Transpose Matrix.md>) | py | Jun 14, 2024 | -| 909 | [Snakes and Ladders]() | Medium | | [solution](<../_909. Snakes and Ladders.md>) | py | Jun 11, 2024 | -| 994 | [Rotting Oranges]() | Medium | N150 | [solution](<../_994. Rotting Oranges.md>) | py | Jun 14, 2024 | -| 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | -| 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | -| 1254 | [Number of Closed Islands]() | Medium | | [solution](<../_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | -| 1284 | [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 08, 2024 | -| 1351 | [Count Negative Numbers in a Sorted Matrix]() | Easy | | [solution](<../_1351. Count Negative Numbers in a Sorted Matrix.md>) | java, py | Jun 01, 2024 | -| 1730 | [Shortest Path to Get Food]() | Medium | | [solution](<../_1730. Shortest Path to Get Food.md>) | py | Jun 26, 2024 | -| 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | -| 1992 | [Find All Groups of Farmland]() | Medium | | [solution](<../_1992. Find All Groups of Farmland.md>) | java, py | Jun 23, 2024 | -| 2258 | [Escape the Spreading Fire]() | Hard | | [solution](<../_2258. Escape the Spreading Fire.md>) | py | Jun 14, 2024 | -| 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 26, 2024 | -| 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution](<../_2482. Difference Between Ones and Zeros in Row and Column.md>) | py | Jun 07, 2024 | -| 2545 | [Sort the Students by Their Kth Score]() | Medium | | [solution](<../_2545. Sort the Students by Their Kth Score.md>) | java, py | Jun 24, 2024 | -| 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Memoization.md b/markdowns/by_topic/Memoization.md deleted file mode 100644 index 772ccb1a..00000000 --- a/markdowns/by_topic/Memoization.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Memoization]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|----:|:---------------------------------------------------------------------|:--------|:----------|:-------------------------------------------|:------------|:----------------| -| 70 | [Climbing Stairs]() | Easy | B75, N150 | [solution](<../_70. Climbing Stairs.md>) | py | May 22, 2024 | -| 509 | [Fibonacci Number]() | Easy | | [solution](<../_509. Fibonacci Number.md>) | c | Jun 16, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Merge Sort.md b/markdowns/by_topic/Merge Sort.md deleted file mode 100644 index 2f4be0f1..00000000 --- a/markdowns/by_topic/Merge Sort.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Merge Sort]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|----:|:-----------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------|:------------|:----------------| -| 23 | [Merge k Sorted Lists]() | Hard | B75, N150 | [solution](<../_23. Merge k Sorted Lists.md>) | py | Jun 17, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Monotonic Queue.md b/markdowns/by_topic/Monotonic Queue.md deleted file mode 100644 index bec3787d..00000000 --- a/markdowns/by_topic/Monotonic Queue.md +++ /dev/null @@ -1,11 +0,0 @@ -# [Monotonic Queue]() (3 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:------------------------------------------------------------------------------------------------------|:------------|:----------------| -| 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Monotonic Stack.md b/markdowns/by_topic/Monotonic Stack.md deleted file mode 100644 index ca9f972c..00000000 --- a/markdowns/by_topic/Monotonic Stack.md +++ /dev/null @@ -1,17 +0,0 @@ -# [Monotonic Stack]() (9 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:--------------------------------------------------------------------------------|:-------------|:----------------| -| 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<../_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | -| 503 | [Next Greater Element II]() | Medium | | [solution](<../_503. Next Greater Element II.md>) | py | Jul 05, 2024 | -| 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | -| 853 | [Car Fleet]() | Medium | N150 | [solution](<../_853. Car Fleet.md>) | py | Jun 13, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 26, 2024 | -| 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | -| 1762 | [Buildings With an Ocean View]() | Medium | | [solution](<../_1762. Buildings With an Ocean View.md>) | py | Jun 10, 2024 | -| 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Number Theory.md b/markdowns/by_topic/Number Theory.md deleted file mode 100644 index 4784a365..00000000 --- a/markdowns/by_topic/Number Theory.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Number Theory]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:--------------------------------------------------------------------------|:------------|:----------------| -| 2807 | [Insert Greatest Common Divisors in Linked List]() | Medium | | [solution](<../_2807. Insert Greatest Common Divisors in Linked List.md>) | py | Jun 12, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Ordered Set.md b/markdowns/by_topic/Ordered Set.md deleted file mode 100644 index 471343b3..00000000 --- a/markdowns/by_topic/Ordered Set.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Ordered Set]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:------------------------------------------------------------------------------------------------------|:------------|:----------------| -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Prefix Sum.md b/markdowns/by_topic/Prefix Sum.md deleted file mode 100644 index 30ccaf1a..00000000 --- a/markdowns/by_topic/Prefix Sum.md +++ /dev/null @@ -1,18 +0,0 @@ -# [Prefix Sum]() (10 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:--------------------------------------------------------------------------------|:------------|:----------------| -| 238 | [Product of Array Except Self]() | Medium | B75, N150 | [solution](<../_238. Product of Array Except Self.md>) | py | Jun 12, 2024 | -| 523 | [Continuous Subarray Sum]() | Medium | Daily | [solution](<../_523. Continuous Subarray Sum.md>) | py | Jun 08, 2024 | -| 848 | [Shifting Letters]() | Medium | | [solution](<../_848. Shifting Letters.md>) | py | Jun 29, 2024 | -| 930 | [Binary Subarrays With Sum]() | Medium | | [solution](<../_930. Binary Subarrays With Sum.md>) | py | Jun 21, 2024 | -| 974 | [Subarray Sums Divisible by K]() | Medium | Daily | [solution](<../_974. Subarray Sums Divisible by K.md>) | java, py | Jun 09, 2024 | -| 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | -| 1442 | [Count Triplets That Can Form Two Arrays of Equal XOR]() | Medium | Daily | [solution](<../_1442. Count Triplets That Can Form Two Arrays of Equal XOR.md>) | py | May 29, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | -| 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | -| 3179 | [Find the N-th Value After K Seconds]() - q2 | Medium | Contest | [solution](<../_3179. Find the N-th Value After K Seconds.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Queue.md b/markdowns/by_topic/Queue.md deleted file mode 100644 index 2242b9b1..00000000 --- a/markdowns/by_topic/Queue.md +++ /dev/null @@ -1,17 +0,0 @@ -# [Queue]() (9 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:------------------------------------------------------------------------------------------------------|:------------|:----------------| -| 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | -| 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | -| 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | -| 622 | [Design Circular Queue]() | Medium | | [solution](<../_622. Design Circular Queue.md>) | py | Jul 05, 2024 | -| 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<../_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | -| 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1696 | [Jump Game VI]() | Medium | | [solution](<../_1696. Jump Game VI.md>) | java, py | Jul 02, 2024 | -| 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Quickselect.md b/markdowns/by_topic/Quickselect.md deleted file mode 100644 index 8b48c80a..00000000 --- a/markdowns/by_topic/Quickselect.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Quickselect]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|----:|:-----------------------------------------------------------------------------------------|:--------|:----------|:-----------------------------------------------------|:------------|:----------------| -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Randomized.md b/markdowns/by_topic/Randomized.md deleted file mode 100644 index 187da892..00000000 --- a/markdowns/by_topic/Randomized.md +++ /dev/null @@ -1,12 +0,0 @@ -# [Randomized]() (4 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|----:|:-----------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:----------------------------------------------------------------------------|:------------|:----------------| -| 380 | [Insert Delete GetRandom O(1)]() | Medium | | [solution](<../_380. Insert Delete GetRandom O(1).md>) | java | Jul 05, 2024 | -| 381 | [Insert Delete GetRandom O(1) - Duplicates allowed]() | Hard | | [solution](<../_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>) | java | Jul 05, 2024 | -| 382 | [Linked List Random Node]() | Medium | | [solution](<../_382. Linked List Random Node.md>) | c, java, py | Jun 21, 2024 | -| 384 | [Shuffle an Array]() | Medium | | [solution](<../_384. Shuffle an Array.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Recursion.md b/markdowns/by_topic/Recursion.md deleted file mode 100644 index 98cc6b3a..00000000 --- a/markdowns/by_topic/Recursion.md +++ /dev/null @@ -1,22 +0,0 @@ -# [Recursion]() (14 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------|:------------|:----------------| -| 2 | [Add Two Numbers]() | Medium | N150 | [solution](<../_2. Add Two Numbers.md>) | java | May 22, 2024 | -| 21 | [Merge Two Sorted Lists]() | Easy | B75, N150 | [solution](<../_21. Merge Two Sorted Lists.md>) | java | May 22, 2024 | -| 24 | [Swap Nodes in Pairs]() | Medium | | [solution](<../_24. Swap Nodes in Pairs.md>) | c | Jun 06, 2024 | -| 25 | [Reverse Nodes in k-Group]() | Hard | N150 | [solution](<../_25. Reverse Nodes in k-Group.md>) | c | Jun 06, 2024 | -| 50 | [Pow(x, n)]() | Medium | N150 | [solution](<../_50. Pow(x, n).md>) | c, java, py | Jun 22, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 206 | [Reverse Linked List]() | Easy | B75, N150 | [solution](<../_206. Reverse Linked List.md>) | java | Jun 27, 2024 | -| 224 | [Basic Calculator]() | Hard | | [solution](<../_224. Basic Calculator.md>) | py | Jun 10, 2024 | -| 273 | [Integer to English Words]() | Hard | | [solution](<../_273. Integer to English Words.md>) | py | Jun 10, 2024 | -| 394 | [Decode String]() | Medium | | [solution](<../_394. Decode String.md>) | py | Jun 14, 2024 | -| 509 | [Fibonacci Number]() | Easy | | [solution](<../_509. Fibonacci Number.md>) | c | Jun 16, 2024 | -| 776 | [Split BST]() | Medium | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 28, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | -| 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Reservoir Sampling.md b/markdowns/by_topic/Reservoir Sampling.md deleted file mode 100644 index ffb0149e..00000000 --- a/markdowns/by_topic/Reservoir Sampling.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Reservoir Sampling]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|----:|:-----------------------------------------------------------------------------------|:--------|:-------|:--------------------------------------------------|:------------|:----------------| -| 382 | [Linked List Random Node]() | Medium | | [solution](<../_382. Linked List Random Node.md>) | c, java, py | Jun 21, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Rolling Hash.md b/markdowns/by_topic/Rolling Hash.md deleted file mode 100644 index ae73e05e..00000000 --- a/markdowns/by_topic/Rolling Hash.md +++ /dev/null @@ -1,10 +0,0 @@ -# [Rolling Hash]() (2 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------|:--------|:-------|:---------------------------------------------------------------------|:------------|:----------------| -| 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<../_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 01, 2024 | -| 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Shortest Path.md b/markdowns/by_topic/Shortest Path.md deleted file mode 100644 index 362e7329..00000000 --- a/markdowns/by_topic/Shortest Path.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Shortest Path]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------|:--------|:-------|:------------------------------------------------------|:------------|:----------------| -| 2473 | [Minimum Cost to Buy Apples]() | Medium | | [solution](<../_2473. Minimum Cost to Buy Apples.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Simulation.md b/markdowns/by_topic/Simulation.md deleted file mode 100644 index 02c01518..00000000 --- a/markdowns/by_topic/Simulation.md +++ /dev/null @@ -1,35 +0,0 @@ -# [Simulation]() (27 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------|:--------|:--------|:-------------------------------------------------------------------------------|:-----------------------------|:----------------| -| 348 | [Design Tic-Tac-Toe]() | Medium | | [solution](<../_348. Design Tic-Tac-Toe.md>) | py | Jul 04, 2024 | -| 353 | [Design Snake Game]() | Medium | | [solution](<../_353. Design Snake Game.md>) | py | Jun 28, 2024 | -| 412 | [Fizz Buzz]() | Easy | | [solution](<../_412. Fizz Buzz.md>) | java, py | Jun 02, 2024 | -| 867 | [Transpose Matrix]() | Easy | | [solution](<../_867. Transpose Matrix.md>) | py | Jun 14, 2024 | -| 946 | [Validate Stack Sequences]() | Medium | | [solution](<../_946. Validate Stack Sequences.md>) | c, py | Jun 11, 2024 | -| 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<../_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | -| 1006 | [Clumsy Factorial]() | Medium | | [solution](<../_1006. Clumsy Factorial.md>) | c, py | Jun 11, 2024 | -| 1252 | [Cells with Odd Values in a Matrix]() | Easy | | [solution](<../_1252. Cells with Odd Values in a Matrix.md>) | c | Jun 04, 2024 | -| 1518 | [Water Bottles]() | Easy | Daily | [solution](<../_1518. Water Bottles.md>) | c, cpp, cs, java, js, py, ts | Jul 06, 2024 | -| 1535 | [Find the Winner of an Array Game]() | Medium | | [solution](<../_1535. Find the Winner of an Array Game.md>) | py | Jun 08, 2024 | -| 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | -| 1929 | [Concatenation of Array]() | Easy | | [solution](<../_1929. Concatenation of Array.md>) | c, java, py | Jun 03, 2024 | -| 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution](<../_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 | -| 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 09, 2024 | -| 2181 | [Merge Nodes in Between Zeros]() | Medium | Daily | [solution](<../_2181. Merge Nodes in Between Zeros.md>) | c, cpp, java, py | Jul 03, 2024 | -| 2221 | [Find Triangular Sum of an Array]() | Medium | | [solution](<../_2221. Find Triangular Sum of an Array.md>) | c, java | Jun 26, 2024 | -| 2352 | [Equal Row and Column Pairs]() | Medium | | [solution](<../_2352. Equal Row and Column Pairs.md>) | py | Jun 26, 2024 | -| 2365 | [Task Scheduler II]() | Medium | | [solution](<../_2365. Task Scheduler II.md>) | py | Jun 29, 2024 | -| 2390 | [Removing Stars From a String]() | Medium | | [solution](<../_2390. Removing Stars From a String.md>) | java, py | Jun 01, 2024 | -| 2482 | [Difference Between Ones and Zeros in Row and Column]() | Medium | | [solution](<../_2482. Difference Between Ones and Zeros in Row and Column.md>) | py | Jun 07, 2024 | -| 2582 | [Pass the Pillow]() | Easy | Daily | [solution](<../_2582. Pass the Pillow.md>) | c, cpp, cs, java, js, py | Jul 05, 2024 | -| 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | -| 3168 | [Minimum Number of Chairs in a Waiting Room]() - q1 | Easy | Contest | [solution](<../_3168. Minimum Number of Chairs in a Waiting Room.md>) | py | Jun 01, 2024 | -| 3174 | [Clear Digits]() - q1 | Easy | Contest | [solution](<../_3174. Clear Digits.md>) | py | Jun 08, 2024 | -| 3175 | [Find The First Player to win K Games in a Row]() - q2 | Medium | Contest | [solution](<../_3175. Find The First Player to win K Games in a Row.md>) | py | Jun 08, 2024 | -| 3178 | [Find the Child Who Has the Ball After K Seconds]() - q1 | Easy | Contest | [solution](<../_3178. Find the Child Who Has the Ball After K Seconds.md>) | py | Jun 08, 2024 | -| 3179 | [Find the N-th Value After K Seconds]() - q2 | Medium | Contest | [solution](<../_3179. Find the N-th Value After K Seconds.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Sliding Window.md b/markdowns/by_topic/Sliding Window.md deleted file mode 100644 index aca178b5..00000000 --- a/markdowns/by_topic/Sliding Window.md +++ /dev/null @@ -1,20 +0,0 @@ -# [Sliding Window]() (12 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------------------------------|:------------|:----------------| -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | -| 239 | [Sliding Window Maximum]() | Hard | N150 | [solution](<../_239. Sliding Window Maximum.md>) | py | Jun 03, 2024 | -| 424 | [Longest Repeating Character Replacement]() | Medium | B75, N150 | [solution](<../_424. Longest Repeating Character Replacement.md>) | py | Jul 05, 2024 | -| 567 | [Permutation in String]() | Medium | N150 | [solution](<../_567. Permutation in String.md>) | py | Jul 05, 2024 | -| 713 | [Subarray Product Less Than K]() | Medium | | [solution](<../_713. Subarray Product Less Than K.md>) | py | Jul 01, 2024 | -| 930 | [Binary Subarrays With Sum]() | Medium | | [solution](<../_930. Binary Subarrays With Sum.md>) | py | Jun 21, 2024 | -| 995 | [Minimum Number of K Consecutive Bit Flips]() | Hard | Daily | [solution](<../_995. Minimum Number of K Consecutive Bit Flips.md>) | c, py | Jun 23, 2024 | -| 1052 | [Grumpy Bookstore Owner]() | Medium | Daily | [solution](<../_1052. Grumpy Bookstore Owner.md>) | py | Jun 20, 2024 | -| 1248 | [Count Number of Nice Subarrays]() | Medium | Daily | [solution](<../_1248. Count Number of Nice Subarrays.md>) | py | Jun 21, 2024 | -| 1438 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit]() | Medium | Daily | [solution](<../_1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.md>) | java | Jun 22, 2024 | -| 1852 | [Distinct Numbers in Each Subarray]() | Medium | | [solution](<../_1852. Distinct Numbers in Each Subarray.md>) | java | Jun 26, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Sorting.md b/markdowns/by_topic/Sorting.md deleted file mode 100644 index a0fd0016..00000000 --- a/markdowns/by_topic/Sorting.md +++ /dev/null @@ -1,63 +0,0 @@ -# [Sorting]() (55 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:------------------------------------------------------------------------------------------------|:-----------------|:----------------| -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 56 | [Merge Intervals]() | Medium | B75, N150 | [solution](<../_56. Merge Intervals.md>) | py | Jun 18, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 11, 2024 | -| 217 | [Contains Duplicate]() | Easy | B75, N150 | [solution](<../_217. Contains Duplicate.md>) | py | Jun 11, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<../_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | -| 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 347 | [Top K Frequent Elements]() | Medium | B75, N150 | [solution](<../_347. Top K Frequent Elements.md>) | py | Jun 12, 2024 | -| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | -| 414 | [Third Maximum Number]() | Easy | | [solution](<../_414. Third Maximum Number.md>) | py | May 23, 2024 | -| 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | -| 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | -| 502 | [IPO]() | Hard | Daily | [solution](<../_502. IPO.md>) | py | Jun 14, 2024 | -| 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | -| 645 | [Set Mismatch]() | Easy | | [solution](<../_645. Set Mismatch.md>) | java, py | Jun 01, 2024 | -| 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | -| 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | -| 791 | [Custom Sort String]() | Medium | | [solution](<../_791. Custom Sort String.md>) | java | Jun 24, 2024 | -| 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | -| 846 | [Hand of Straights]() | Medium | Daily, N150 | [solution](<../_846. Hand of Straights.md>) | py | Jun 06, 2024 | -| 853 | [Car Fleet]() | Medium | N150 | [solution](<../_853. Car Fleet.md>) | py | Jun 13, 2024 | -| 945 | [Minimum Increment to Make Array Unique]() | Medium | Daily | [solution](<../_945. Minimum Increment to Make Array Unique.md>) | py | Jun 13, 2024 | -| 950 | [Reveal Cards In Increasing Order]() | Medium | | [solution](<../_950. Reveal Cards In Increasing Order.md>) | py | Jun 11, 2024 | -| 973 | [K Closest Points to Origin]() | Medium | N150 | [solution](<../_973. K Closest Points to Origin.md>) | py | Jun 29, 2024 | -| 977 | [Squares of a Sorted Array]() | Easy | | [solution](<../_977. Squares of a Sorted Array.md>) | py | Jun 20, 2024 | -| 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | -| 1030 | [Matrix Cells in Distance Order]() | Easy | | [solution](<../_1030. Matrix Cells in Distance Order.md>) | py | Jun 03, 2024 | -| 1051 | [Height Checker]() | Easy | Daily | [solution](<../_1051. Height Checker.md>) | c, py | Jun 09, 2024 | -| 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution](<../_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 03, 2024 | -| 1122 | [Relative Sort Array]() | Easy | Daily | [solution](<../_1122. Relative Sort Array.md>) | java, py | Jun 10, 2024 | -| 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | -| 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | -| 1460 | [Make Two Arrays Equal by Reversing Subarrays]() | Easy | | [solution](<../_1460. Make Two Arrays Equal by Reversing Subarrays.md>) | c | Jun 04, 2024 | -| 1481 | [Least Number of Unique Integers after K Removals]() | Medium | | [solution](<../_1481. Least Number of Unique Integers after K Removals.md>) | py | Jun 15, 2024 | -| 1502 | [Can Make Arithmetic Progression From Sequence]() | Easy | | [solution](<../_1502. Can Make Arithmetic Progression From Sequence.md>) | c, py | Jun 04, 2024 | -| 1509 | [Minimum Difference Between Largest and Smallest Value in Three Moves]() | Medium | Daily | [solution](<../_1509. Minimum Difference Between Largest and Smallest Value in Three Moves.md>) | c, cpp, java, py | Jul 02, 2024 | -| 1552 | [Magnetic Force Between Two Balls]() | Medium | Daily | [solution](<../_1552. Magnetic Force Between Two Balls.md>) | py | Jun 20, 2024 | -| 1561 | [Maximum Number of Coins You Can Get]() | Medium | | [solution](<../_1561. Maximum Number of Coins You Can Get.md>) | py | Jun 23, 2024 | -| 1564 | [Put Boxes Into the Warehouse I]() | Medium | | [solution](<../_1564. Put Boxes Into the Warehouse I.md>) | py | Jun 14, 2024 | -| 1580 | [Put Boxes Into the Warehouse II]() | Medium | Weekly Premium | [solution](<../_1580. Put Boxes Into the Warehouse II.md>) | py | Jun 14, 2024 | -| 1833 | [Maximum Ice Cream Bars]() | Medium | | [solution](<../_1833. Maximum Ice Cream Bars.md>) | c, java, py | Jun 23, 2024 | -| 1874 | [Minimize Product Sum of Two Arrays]() | Medium | | [solution](<../_1874. Minimize Product Sum of Two Arrays.md>) | c, java | Jun 22, 2024 | -| 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | -| 1885 | [Count Pairs in Two Arrays]() | Medium | Weekly Premium | [solution](<../_1885. Count Pairs in Two Arrays.md>) | py | May 21, 2024 | -| 2037 | [Minimum Number of Moves to Seat Everyone]() | Easy | Daily | [solution](<../_2037. Minimum Number of Moves to Seat Everyone.md>) | c, py | Jun 03, 2024 | -| 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<../_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | -| 2165 | [Smallest Value of the Rearranged Number]() | Medium | | [solution](<../_2165. Smallest Value of the Rearranged Number.md>) | py | Jun 30, 2024 | -| 2225 | [Find Players With Zero or One Losses]() | Medium | | [solution](<../_2225. Find Players With Zero or One Losses.md>) | java | Jun 24, 2024 | -| 2248 | [Intersection of Multiple Arrays]() | Easy | | [solution](<../_2248. Intersection of Multiple Arrays.md>) | py | May 29, 2024 | -| 2268 | [Minimum Number of Keypresses]() | Medium | | [solution](<../_2268. Minimum Number of Keypresses.md>) | py | Jul 05, 2024 | -| 2285 | [Maximum Total Importance of Roads]() | Medium | Daily | [solution](<../_2285. Maximum Total Importance of Roads.md>) | c, cpp, java, py | Jun 27, 2024 | -| 2389 | [Longest Subsequence With Limited Sum]() | Easy | | [solution](<../_2389. Longest Subsequence With Limited Sum.md>) | py | May 31, 2024 | -| 2545 | [Sort the Students by Their Kth Score]() | Medium | | [solution](<../_2545. Sort the Students by Their Kth Score.md>) | java, py | Jun 24, 2024 | -| 2679 | [Sum in a Matrix]() | Medium | | [solution](<../_2679. Sum in a Matrix.md>) | java | May 22, 2024 | -| 3074 | [Apple Redistribution into Boxes]() | Easy | | [solution](<../_3074. Apple Redistribution into Boxes.md>) | py | May 23, 2024 | -| 3169 | [Count Days Without Meetings]() - q2 | Medium | Contest | [solution](<../_3169. Count Days Without Meetings.md>) | py | Jun 01, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Stack.md b/markdowns/by_topic/Stack.md deleted file mode 100644 index 7237220d..00000000 --- a/markdowns/by_topic/Stack.md +++ /dev/null @@ -1,45 +0,0 @@ -# [Stack]() (37 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------|:-------------|:----------------| -| 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution](<../_20. Valid Parentheses.md>) | java | May 22, 2024 | -| 71 | [Simplify Path]() | Medium | | [solution](<../_71. Simplify Path.md>) | py | Jun 10, 2024 | -| 84 | [Largest Rectangle in Histogram]() | Hard | N150 | [solution](<../_84. Largest Rectangle in Histogram.md>) | py | Jun 10, 2024 | -| 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 150 | [Evaluate Reverse Polish Notation]() | Medium | N150 | [solution](<../_150. Evaluate Reverse Polish Notation.md>) | py | Jun 10, 2024 | -| 155 | [Min Stack]() | Medium | N150 | [solution](<../_155. Min Stack.md>) | py | Jun 13, 2024 | -| 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 224 | [Basic Calculator]() | Hard | | [solution](<../_224. Basic Calculator.md>) | py | Jun 10, 2024 | -| 227 | [Basic Calculator II]() | Medium | | [solution](<../_227. Basic Calculator II.md>) | py | Jun 10, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | -| 364 | [Nested List Weight Sum II]() | Medium | | [solution](<../_364. Nested List Weight Sum II.md>) | java, py | Jul 02, 2024 | -| 394 | [Decode String]() | Medium | | [solution](<../_394. Decode String.md>) | py | Jun 14, 2024 | -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 503 | [Next Greater Element II]() | Medium | | [solution](<../_503. Next Greater Element II.md>) | py | Jul 05, 2024 | -| 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 739 | [Daily Temperatures]() | Medium | N150 | [solution](<../_739. Daily Temperatures.md>) | c, java, py | Jun 13, 2024 | -| 853 | [Car Fleet]() | Medium | N150 | [solution](<../_853. Car Fleet.md>) | py | Jun 13, 2024 | -| 856 | [Score of Parentheses]() | Medium | | [solution](<../_856. Score of Parentheses.md>) | py | Jun 17, 2024 | -| 921 | [Minimum Add to Make Parentheses Valid]() | Medium | | [solution](<../_921. Minimum Add to Make Parentheses Valid.md>) | java, py | Jun 11, 2024 | -| 946 | [Validate Stack Sequences]() | Medium | | [solution](<../_946. Validate Stack Sequences.md>) | c, py | Jun 11, 2024 | -| 1006 | [Clumsy Factorial]() | Medium | | [solution](<../_1006. Clumsy Factorial.md>) | c, py | Jun 11, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 26, 2024 | -| 1019 | [Next Greater Node In Linked List]() | Medium | | [solution](<../_1019. Next Greater Node In Linked List.md>) | py | Jun 21, 2024 | -| 1209 | [Remove All Adjacent Duplicates in String II]() | Medium | | [solution](<../_1209. Remove All Adjacent Duplicates in String II.md>) | py | Jun 17, 2024 | -| 1249 | [Minimum Remove to Make Valid Parentheses]() | Medium | | [solution](<../_1249. Minimum Remove to Make Valid Parentheses.md>) | py | Jun 10, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | -| 1381 | [Design a Stack With Increment Operation]() | Medium | | [solution](<../_1381. Design a Stack With Increment Operation.md>) | py | Jul 05, 2024 | -| 1472 | [Design Browser History]() | Medium | | [solution](<../_1472. Design Browser History.md>) | py | Jul 05, 2024 | -| 1700 | [Number of Students Unable to Eat Lunch]() | Easy | | [solution](<../_1700. Number of Students Unable to Eat Lunch.md>) | py | Jun 01, 2024 | -| 1762 | [Buildings With an Ocean View]() | Medium | | [solution](<../_1762. Buildings With an Ocean View.md>) | py | Jun 10, 2024 | -| 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 20, 2024 | -| 2390 | [Removing Stars From a String]() | Medium | | [solution](<../_2390. Removing Stars From a String.md>) | java, py | Jun 01, 2024 | -| 2487 | [Remove Nodes From Linked List]() | Medium | | [solution](<../_2487. Remove Nodes From Linked List.md>) | py | Jun 11, 2024 | -| 2816 | [Double a Number Represented as a Linked List]() | Medium | | [solution](<../_2816. Double a Number Represented as a Linked List.md>) | c | Jul 04, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/String Matching.md b/markdowns/by_topic/String Matching.md deleted file mode 100644 index 6937def5..00000000 --- a/markdowns/by_topic/String Matching.md +++ /dev/null @@ -1,14 +0,0 @@ -# [String Matching]() (6 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:----------------------------------------------------------------------------------------|:------------|:----------------| -| 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | -| 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | -| 758 | [Bold Words in String]() | Medium | | [solution](<../_758. Bold Words in String.md>) | py | Jun 27, 2024 | -| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<../_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | -| 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/String.md b/markdowns/by_topic/String.md deleted file mode 100644 index c3bdbf35..00000000 --- a/markdowns/by_topic/String.md +++ /dev/null @@ -1,96 +0,0 @@ -# [String]() (88 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------------|:------------|:----------------| -| 3 | [Longest Substring Without Repeating Characters]() | Medium | B75, N150 | [solution](<../_3. Longest Substring Without Repeating Characters.md>) | java | May 22, 2024 | -| 5 | [Longest Palindromic Substring]() | Medium | B75, N150 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | -| 8 | [String to Integer (atoi)]() | Medium | | [solution](<../_8. String to Integer (atoi).md>) | py | Jun 10, 2024 | -| 14 | [Longest Common Prefix]() | Easy | | [solution](<../_14. Longest Common Prefix.md>) | java | May 22, 2024 | -| 20 | [Valid Parentheses]() | Easy | B75, N150 | [solution](<../_20. Valid Parentheses.md>) | java | May 22, 2024 | -| 22 | [Generate Parentheses]() | Medium | N150 | [solution](<../_22. Generate Parentheses.md>) | py | Jun 13, 2024 | -| 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | -| 49 | [Group Anagrams]() | Medium | B75, N150 | [solution](<../_49. Group Anagrams.md>) | py | Jun 12, 2024 | -| 71 | [Simplify Path]() | Medium | | [solution](<../_71. Simplify Path.md>) | py | Jun 10, 2024 | -| 79 | [Word Search]() | Medium | B75, N150 | [solution](<../_79. Word Search.md>) | py | Jun 27, 2024 | -| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | -| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | -| 166 | [Fraction to Recurring Decimal]() | Medium | | [solution](<../_166. Fraction to Recurring Decimal.md>) | py | May 31, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | -| 224 | [Basic Calculator]() | Hard | | [solution](<../_224. Basic Calculator.md>) | py | Jun 10, 2024 | -| 227 | [Basic Calculator II]() | Medium | | [solution](<../_227. Basic Calculator II.md>) | py | Jun 10, 2024 | -| 242 | [Valid Anagram]() | Easy | B75, N150 | [solution](<../_242. Valid Anagram.md>) | c, py | Jun 12, 2024 | -| 271 | [Encode and Decode Strings]() | Medium | B75, N150 | [solution](<../_271. Encode and Decode Strings.md>) | py | Jun 12, 2024 | -| 273 | [Integer to English Words]() | Hard | | [solution](<../_273. Integer to English Words.md>) | py | Jun 10, 2024 | -| 344 | [Reverse String]() | Easy | Daily | [solution](<../_344. Reverse String.md>) | java, py | Jun 01, 2024 | -| 345 | [Reverse Vowels of a String]() | Easy | | [solution](<../_345. Reverse Vowels of a String.md>) | py | May 23, 2024 | -| 392 | [Is Subsequence]() | Easy | | [solution](<../_392. Is Subsequence.md>) | java | Jun 21, 2024 | -| 394 | [Decode String]() | Medium | | [solution](<../_394. Decode String.md>) | py | Jun 14, 2024 | -| 408 | [Valid Word Abbreviation]() | Easy | | [solution](<../_408. Valid Word Abbreviation.md>) | py | Jun 02, 2024 | -| 409 | [Longest Palindrome]() | Easy | Daily | [solution](<../_409. Longest Palindrome.md>) | c, py | Jun 03, 2024 | -| 412 | [Fizz Buzz]() | Easy | | [solution](<../_412. Fizz Buzz.md>) | java, py | Jun 02, 2024 | -| 424 | [Longest Repeating Character Replacement]() | Medium | B75, N150 | [solution](<../_424. Longest Repeating Character Replacement.md>) | py | Jul 05, 2024 | -| 451 | [Sort Characters By Frequency]() | Medium | | [solution](<../_451. Sort Characters By Frequency.md>) | py | Jun 17, 2024 | -| 535 | [Encode and Decode TinyURL]() | Medium | | [solution](<../_535. Encode and Decode TinyURL.md>) | py | Jun 07, 2024 | -| 567 | [Permutation in String]() | Medium | N150 | [solution](<../_567. Permutation in String.md>) | py | Jul 05, 2024 | -| 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | -| 647 | [Palindromic Substrings]() | Medium | B75, N150 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | -| 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | -| 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | -| 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | -| 758 | [Bold Words in String]() | Medium | | [solution](<../_758. Bold Words in String.md>) | py | Jun 27, 2024 | -| 771 | [Jewels and Stones]() | Easy | | [solution](<../_771. Jewels and Stones.md>) | java, py | Jun 02, 2024 | -| 784 | [Letter Case Permutation]() | Medium | | [solution](<../_784. Letter Case Permutation.md>) | py | Jun 14, 2024 | -| 791 | [Custom Sort String]() | Medium | | [solution](<../_791. Custom Sort String.md>) | java | Jun 24, 2024 | -| 848 | [Shifting Letters]() | Medium | | [solution](<../_848. Shifting Letters.md>) | py | Jun 29, 2024 | -| 856 | [Score of Parentheses]() | Medium | | [solution](<../_856. Score of Parentheses.md>) | py | Jun 17, 2024 | -| 890 | [Find and Replace Pattern]() | Medium | | [solution](<../_890. Find and Replace Pattern.md>) | py | Jul 02, 2024 | -| 921 | [Minimum Add to Make Parentheses Valid]() | Medium | | [solution](<../_921. Minimum Add to Make Parentheses Valid.md>) | java, py | Jun 11, 2024 | -| 1002 | [Find Common Characters]() | Easy | Daily | [solution](<../_1002. Find Common Characters.md>) | py | Jun 04, 2024 | -| 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<../_1028. Recover a Tree From Preorder Traversal.md>) | py | Jun 30, 2024 | -| 1087 | [Brace Expansion]() | Medium | | [solution](<../_1087. Brace Expansion.md>) | py | Jun 14, 2024 | -| 1166 | [Design File System]() | Medium | | [solution](<../_1166. Design File System.md>) | py | Jun 27, 2024 | -| 1209 | [Remove All Adjacent Duplicates in String II]() | Medium | | [solution](<../_1209. Remove All Adjacent Duplicates in String II.md>) | py | Jun 17, 2024 | -| 1233 | [Remove Sub-Folders from the Filesystem]() | Medium | | [solution](<../_1233. Remove Sub-Folders from the Filesystem.md>) | py | Jun 27, 2024 | -| 1239 | [Maximum Length of a Concatenated String with Unique Characters]() | Medium | | [solution](<../_1239. Maximum Length of a Concatenated String with Unique Characters.md>) | py | Jun 29, 2024 | -| 1249 | [Minimum Remove to Make Valid Parentheses]() | Medium | | [solution](<../_1249. Minimum Remove to Make Valid Parentheses.md>) | py | Jun 10, 2024 | -| 1255 | [Maximum Score Words Formed by Letters]() | Hard | | [solution](<../_1255. Maximum Score Words Formed by Letters.md>) | py | Jun 15, 2024 | -| 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | -| 1404 | [Number of Steps to Reduce a Number in Binary Representation to One]() | Medium | Daily | [solution](<../_1404. Number of Steps to Reduce a Number in Binary Representation to One.md>) | py | May 29, 2024 | -| 1436 | [Destination City]() | Easy | | [solution](<../_1436. Destination City.md>) | java | Jun 01, 2024 | -| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<../_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | -| 1525 | [Number of Good Ways to Split a String]() | Medium | | [solution](<../_1525. Number of Good Ways to Split a String.md>) | py | Jun 01, 2024 | -| 1684 | [Count the Number of Consistent Strings]() | Easy | | [solution](<../_1684. Count the Number of Consistent Strings.md>) | c, py | Jun 06, 2024 | -| 1689 | [Partitioning Into Minimum Number Of Deci-Binary Numbers]() | Medium | | [solution](<../_1689. Partitioning Into Minimum Number Of Deci-Binary Numbers.md>) | c, java | Jun 22, 2024 | -| 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<../_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 01, 2024 | -| 1736 | [Latest Time by Replacing Hidden Digits]() | Easy | | [solution](<../_1736. Latest Time by Replacing Hidden Digits.md>) | c | Jun 03, 2024 | -| 1759 | [Count Number of Homogenous Substrings]() | Medium | | [solution](<../_1759. Count Number of Homogenous Substrings.md>) | c, java | Jun 10, 2024 | -| 1768 | [Merge Strings Alternately]() | Easy | | [solution](<../_1768. Merge Strings Alternately.md>) | java | Jul 01, 2024 | -| 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | -| 1844 | [Replace All Digits with Characters]() | Easy | | [solution](<../_1844. Replace All Digits with Characters.md>) | py | Jun 29, 2024 | -| 1980 | [Find Unique Binary String]() | Medium | | [solution](<../_1980. Find Unique Binary String.md>) | c, py | Jun 26, 2024 | -| 2011 | [Final Value of Variable After Performing Operations]() | Easy | | [solution](<../_2011. Final Value of Variable After Performing Operations.md>) | c | Jun 03, 2024 | -| 2083 | [Substrings That Begin and End With the Same Letter]() | Medium | Weekly Premium | [solution](<../_2083. Substrings That Begin and End With the Same Letter.md>) | c, py | Jun 10, 2024 | -| 2086 | [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 | -| 2268 | [Minimum Number of Keypresses]() | Medium | | [solution](<../_2268. Minimum Number of Keypresses.md>) | py | Jul 05, 2024 | -| 2390 | [Removing Stars From a String]() | Medium | | [solution](<../_2390. Removing Stars From a String.md>) | java, py | Jun 01, 2024 | -| 2405 | [Optimal Partition of String]() | Medium | | [solution](<../_2405. Optimal Partition of String.md>) | py | Jun 23, 2024 | -| 2423 | [Remove Letter To Equalize Frequency]() | Easy | | [solution](<../_2423. Remove Letter To Equalize Frequency.md>) | py | Jun 16, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | -| 2678 | [Number of Senior Citizens]() | Easy | | [solution](<../_2678. Number of Senior Citizens.md>) | java | May 22, 2024 | -| 2734 | [Lexicographically Smallest String After Substring Operation]() | Medium | | [solution](<../_2734. Lexicographically Smallest String After Substring Operation.md>) | py | Jun 29, 2024 | -| 2743 | [Count Substrings Without Repeating Character]() | Medium | Weekly Premium | [solution](<../_2743. Count Substrings Without Repeating Character.md>) | java, py | Jun 21, 2024 | -| 2942 | [Find Words Containing Character]() | Easy | | [solution](<../_2942. Find Words Containing Character.md>) | c | Jun 03, 2024 | -| 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | -| 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | -| 3106 | [Lexicographically Smallest String After Operations With Constraint]() | Medium | | [solution](<../_3106. Lexicographically Smallest String After Operations With Constraint.md>) | py | Jun 29, 2024 | -| 3110 | [Score of a String]() | Easy | Daily | [solution](<../_3110. Score of a String.md>) | java, py | May 31, 2024 | -| 3136 | [Valid Word]() | Easy | | [solution](<../_3136. Valid Word.md>) | c, py | Jul 03, 2024 | -| 3168 | [Minimum Number of Chairs in a Waiting Room]() - q1 | Easy | Contest | [solution](<../_3168. Minimum Number of Chairs in a Waiting Room.md>) | py | Jun 01, 2024 | -| 3174 | [Clear Digits]() - q1 | Easy | Contest | [solution](<../_3174. Clear Digits.md>) | py | Jun 08, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Suffix Array.md b/markdowns/by_topic/Suffix Array.md deleted file mode 100644 index e693c1b8..00000000 --- a/markdowns/by_topic/Suffix Array.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Suffix Array]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------|:--------|:-------|:---------------------------------------------------------------------|:------------|:----------------| -| 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<../_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 01, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Topological Sort.md b/markdowns/by_topic/Topological Sort.md deleted file mode 100644 index 6ed50423..00000000 --- a/markdowns/by_topic/Topological Sort.md +++ /dev/null @@ -1,9 +0,0 @@ -# [Topological Sort]() (1 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------|:--------|:-------|:-------------------------------------------------------------------------------|:------------|:----------------| -| 2192 | [All Ancestors of a Node in a Directed Acyclic Graph]() | Medium | Daily | [solution](<../_2192. All Ancestors of a Node in a Directed Acyclic Graph.md>) | java, py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Tree.md b/markdowns/by_topic/Tree.md deleted file mode 100644 index 529b250a..00000000 --- a/markdowns/by_topic/Tree.md +++ /dev/null @@ -1,74 +0,0 @@ -# [Tree]() (66 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------|:-------------|:----------------| -| 94 | [Binary Tree Inorder Traversal]() | Easy | | [solution](<../_94. Binary Tree Inorder Traversal.md>) | java, py | Jun 28, 2024 | -| 98 | [Validate Binary Search Tree]() | Medium | B75, N150 | [solution](<../_98. Validate Binary Search Tree.md>) | c | Jun 22, 2024 | -| 100 | [Same Tree]() | Easy | B75, N150 | [solution](<../_100. Same Tree.md>) | py | Jul 03, 2024 | -| 102 | [Binary Tree Level Order Traversal]() | Medium | B75, N150 | [solution](<../_102. Binary Tree Level Order Traversal.md>) | java | Jul 03, 2024 | -| 103 | [Binary Tree Zigzag Level Order Traversal]() | Medium | | [solution](<../_103. Binary Tree Zigzag Level Order Traversal.md>) | py | Jul 03, 2024 | -| 104 | [Maximum Depth of Binary Tree]() | Easy | B75, N150 | [solution](<../_104. Maximum Depth of Binary Tree.md>) | py | Jul 04, 2024 | -| 107 | [Binary Tree Level Order Traversal II]() | Medium | | [solution](<../_107. Binary Tree Level Order Traversal II.md>) | java | Jul 03, 2024 | -| 110 | [Balanced Binary Tree]() | Easy | N150 | [solution](<../_110. Balanced Binary Tree.md>) | py | Jul 04, 2024 | -| 111 | [Minimum Depth of Binary Tree]() | Easy | | [solution](<../_111. Minimum Depth of Binary Tree.md>) | c, java | Jun 07, 2024 | -| 112 | [Path Sum]() | Easy | | [solution](<../_112. Path Sum.md>) | py | Jul 03, 2024 | -| 113 | [Path Sum II]() | Medium | | [solution](<../_113. Path Sum II.md>) | py | Jul 03, 2024 | -| 114 | [Flatten Binary Tree to Linked List]() | Medium | | [solution](<../_114. Flatten Binary Tree to Linked List.md>) | c, py | Jun 10, 2024 | -| 124 | [Binary Tree Maximum Path Sum]() | Hard | B75, N150 | [solution](<../_124. Binary Tree Maximum Path Sum.md>) | py | Jul 04, 2024 | -| 129 | [Sum Root to Leaf Numbers]() | Medium | | [solution](<../_129. Sum Root to Leaf Numbers.md>) | py | Jun 07, 2024 | -| 173 | [Binary Search Tree Iterator]() | Medium | | [solution](<../_173. Binary Search Tree Iterator.md>) | py | Jun 26, 2024 | -| 199 | [Binary Tree Right Side View]() | Medium | N150 | [solution](<../_199. Binary Tree Right Side View.md>) | cpp, java | Jul 04, 2024 | -| 226 | [Invert Binary Tree]() | Easy | B75, N150 | [solution](<../_226. Invert Binary Tree.md>) | py | Jul 03, 2024 | -| 230 | [Kth Smallest Element in a BST]() | Medium | B75, N150 | [solution](<../_230. Kth Smallest Element in a BST.md>) | py | Jun 28, 2024 | -| 235 | [Lowest Common Ancestor of a Binary Search Tree]() | Medium | B75, N150 | [solution](<../_235. Lowest Common Ancestor of a Binary Search Tree.md>) | py | Jul 04, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 314 | [Binary Tree Vertical Order Traversal]() | Medium | | [solution](<../_314. Binary Tree Vertical Order Traversal.md>) | py | Jun 11, 2024 | -| 341 | [Flatten Nested List Iterator]() | Medium | | [solution](<../_341. Flatten Nested List Iterator.md>) | java | Jul 02, 2024 | -| 366 | [Find Leaves of Binary Tree]() | Medium | | [solution](<../_366. Find Leaves of Binary Tree.md>) | py | Jun 11, 2024 | -| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List]() | Medium | | [solution](<../_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py | Jun 11, 2024 | -| 429 | [N-ary Tree Level Order Traversal]() | Medium | | [solution](<../_429. N-ary Tree Level Order Traversal.md>) | py | Jul 03, 2024 | -| 431 | [Encode N-ary Tree to Binary Tree]() | Hard | | [solution](<../_431. Encode N-ary Tree to Binary Tree.md>) | java, py | Jun 28, 2024 | -| 437 | [Path Sum III]() | Medium | | [solution](<../_437. Path Sum III.md>) | py | Jul 03, 2024 | -| 450 | [Delete Node in a BST]() | Medium | | [solution](<../_450. Delete Node in a BST.md>) | py | Jun 28, 2024 | -| 513 | [Find Bottom Left Tree Value]() | Medium | | [solution](<../_513. Find Bottom Left Tree Value.md>) | java | Jul 03, 2024 | -| 543 | [Diameter of Binary Tree]() | Easy | N150 | [solution](<../_543. Diameter of Binary Tree.md>) | c, java, py | Jun 03, 2024 | -| 572 | [Subtree of Another Tree]() | Easy | B75, N150 | [solution](<../_572. Subtree of Another Tree.md>) | py | Jun 03, 2024 | -| 637 | [Average of Levels in Binary Tree]() | Easy | | [solution](<../_637. Average of Levels in Binary Tree.md>) | py | Jul 03, 2024 | -| 654 | [Maximum Binary Tree]() | Medium | | [solution](<../_654. Maximum Binary Tree.md>) | py | Jun 11, 2024 | -| 663 | [Equal Tree Partition]() | Medium | Daily | [solution](<../_663. Equal Tree Partition.md>) | py | Jun 16, 2024 | -| 666 | [Path Sum IV]() | Medium | | [solution](<../_666. Path Sum IV.md>) | py | Jul 03, 2024 | -| 687 | [Longest Univalue Path]() | Medium | | [solution](<../_687. Longest Univalue Path.md>) | py | Jul 03, 2024 | -| 690 | [Employee Importance]() | Medium | | [solution](<../_690. Employee Importance.md>) | java | Jul 02, 2024 | -| 703 | [Kth Largest Element in a Stream]() | Easy | N150 | [solution](<../_703. Kth Largest Element in a Stream.md>) | py | Jul 04, 2024 | -| 776 | [Split BST]() | Medium | Weekly Premium | [solution](<../_776. Split BST.md>) | py | Jun 28, 2024 | -| 863 | [All Nodes Distance K in Binary Tree]() | Medium | | [solution](<../_863. All Nodes Distance K in Binary Tree.md>) | py | Jun 26, 2024 | -| 919 | [Complete Binary Tree Inserter]() | Medium | | [solution](<../_919. Complete Binary Tree Inserter.md>) | py | Jul 05, 2024 | -| 987 | [Vertical Order Traversal of a Binary Tree]() | Hard | | [solution](<../_987. Vertical Order Traversal of a Binary Tree.md>) | py | Jun 11, 2024 | -| 993 | [Cousins in Binary Tree]() | Easy | | [solution](<../_993. Cousins in Binary Tree.md>) | py | Jul 03, 2024 | -| 1008 | [Construct Binary Search Tree from Preorder Traversal]() | Medium | | [solution](<../_1008. Construct Binary Search Tree from Preorder Traversal.md>) | c, cpp, java | Jun 26, 2024 | -| 1026 | [Maximum Difference Between Node and Ancestor]() | Medium | | [solution](<../_1026. Maximum Difference Between Node and Ancestor.md>) | py | Jun 23, 2024 | -| 1028 | [Recover a Tree From Preorder Traversal]() | Hard | | [solution](<../_1028. Recover a Tree From Preorder Traversal.md>) | py | Jun 30, 2024 | -| 1038 | [Binary Search Tree to Greater Sum Tree]() | Medium | Daily | [solution](<../_1038. Binary Search Tree to Greater Sum Tree.md>) | c | Jun 23, 2024 | -| 1302 | [Deepest Leaves Sum]() | Medium | | [solution](<../_1302. Deepest Leaves Sum.md>) | c, py | Jun 07, 2024 | -| 1305 | [All Elements in Two Binary Search Trees]() | Medium | | [solution](<../_1305. All Elements in Two Binary Search Trees.md>) | java | Jun 24, 2024 | -| 1315 | [Sum of Nodes with Even-Valued Grandparent]() | Medium | | [solution](<../_1315. Sum of Nodes with Even-Valued Grandparent.md>) | py | Jun 11, 2024 | -| 1372 | [Longest ZigZag Path in a Binary Tree]() | Medium | | [solution](<../_1372. Longest ZigZag Path in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1382 | [Balance a Binary Search Tree]() | Medium | Daily | [solution](<../_1382. Balance a Binary Search Tree.md>) | py | Jun 25, 2024 | -| 1448 | [Count Good Nodes in Binary Tree]() | Medium | N150 | [solution](<../_1448. Count Good Nodes in Binary Tree.md>) | java | Jul 04, 2024 | -| 1457 | [Pseudo-Palindromic Paths in a Binary Tree]() | Medium | | [solution](<../_1457. Pseudo-Palindromic Paths in a Binary Tree.md>) | py | Jul 05, 2024 | -| 1490 | [Clone N-ary Tree]() | Medium | | [solution](<../_1490. Clone N-ary Tree.md>) | java, py | Jun 01, 2024 | -| 1522 | [Diameter of N-Ary Tree]() | Medium | | [solution](<../_1522. Diameter of N-Ary Tree.md>) | py | Jul 02, 2024 | -| 1602 | [Find Nearest Right Node in Binary Tree]() | Medium | | [solution](<../_1602. Find Nearest Right Node in Binary Tree.md>) | java, py | Jul 02, 2024 | -| 1609 | [Even Odd Tree]() | Medium | | [solution](<../_1609. Even Odd Tree.md>) | py | Jul 05, 2024 | -| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 09, 2024 | -| 1660 | [Correct a Binary Tree]() | Medium | | [solution](<../_1660. Correct a Binary Tree.md>) | py | Jun 26, 2024 | -| 1676 | [Lowest Common Ancestor of a Binary Tree IV]() | Medium | | [solution](<../_1676. Lowest Common Ancestor of a Binary Tree IV.md>) | py | Jun 29, 2024 | -| 1973 | [Count Nodes Equal to Sum of Descendants]() | Medium | | [solution](<../_1973. Count Nodes Equal to Sum of Descendants.md>) | c | Jun 23, 2024 | -| 2265 | [Count Nodes Equal to Average of Subtree]() | Medium | | [solution](<../_2265. Count Nodes Equal to Average of Subtree.md>) | py | Jun 07, 2024 | -| 2385 | [Amount of Time for Binary Tree to Be Infected]() | Medium | | [solution](<../_2385. Amount of Time for Binary Tree to Be Infected.md>) | py | Jun 26, 2024 | -| 2415 | [Reverse Odd Levels of Binary Tree]() | Medium | | [solution](<../_2415. Reverse Odd Levels of Binary Tree.md>) | py | Jun 23, 2024 | -| 3157 | [Find the Level of Tree with Minimum Sum]() | Medium | | [solution](<../_3157. Find the Level of Tree with Minimum Sum.md>) | py | Jul 05, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Trie.md b/markdowns/by_topic/Trie.md deleted file mode 100644 index 0a2ffccd..00000000 --- a/markdowns/by_topic/Trie.md +++ /dev/null @@ -1,26 +0,0 @@ -# [Trie]() (18 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-----------------------------------------------------------------------------------------------------------------------------|:--------|:----------|:------------------------------------------------------------------------|:------------|:----------------| -| 14 | [Longest Common Prefix]() | Easy | | [solution](<../_14. Longest Common Prefix.md>) | java | May 22, 2024 | -| 208 | [Implement Trie (Prefix Tree)]() | Medium | B75, N150 | [solution](<../_208. Implement Trie (Prefix Tree).md>) | py | Jun 27, 2024 | -| 211 | [Design Add and Search Words Data Structure]() | Medium | B75, N150 | [solution](<../_211. Design Add and Search Words Data Structure.md>) | py | Jun 27, 2024 | -| 212 | [Word Search II]() | Hard | B75, N150 | [solution](<../_212. Word Search II.md>) | py | Jun 27, 2024 | -| 616 | [Add Bold Tag in String]() | Medium | | [solution](<../_616. Add Bold Tag in String.md>) | py | Jun 27, 2024 | -| 648 | [Replace Words]() | Medium | Daily | [solution](<../_648. Replace Words.md>) | java, py | Jun 06, 2024 | -| 676 | [Implement Magic Dictionary]() | Medium | | [solution](<../_676. Implement Magic Dictionary.md>) | py | Jun 27, 2024 | -| 692 | [Top K Frequent Words]() | Medium | | [solution](<../_692. Top K Frequent Words.md>) | py | Jun 08, 2024 | -| 720 | [Longest Word in Dictionary]() | Medium | | [solution](<../_720. Longest Word in Dictionary.md>) | py | Jun 27, 2024 | -| 758 | [Bold Words in String]() | Medium | | [solution](<../_758. Bold Words in String.md>) | py | Jun 27, 2024 | -| 1166 | [Design File System]() | Medium | | [solution](<../_1166. Design File System.md>) | py | Jun 27, 2024 | -| 1233 | [Remove Sub-Folders from the Filesystem]() | Medium | | [solution](<../_1233. Remove Sub-Folders from the Filesystem.md>) | py | Jun 27, 2024 | -| 1268 | [Search Suggestions System]() | Medium | | [solution](<../_1268. Search Suggestions System.md>) | py | Jun 28, 2024 | -| 1698 | [Number of Distinct Substrings in a String]() | Medium | | [solution](<../_1698. Number of Distinct Substrings in a String.md>) | java, py | Jun 01, 2024 | -| 1804 | [Implement Trie II (Prefix Tree)]() | Medium | | [solution](<../_1804. Implement Trie II (Prefix Tree).md>) | py | Jun 27, 2024 | -| 1858 | [Longest Word With All Prefixes]() | Medium | | [solution](<../_1858. Longest Word With All Prefixes.md>) | py | Jun 29, 2024 | -| 3043 | [Find the Length of the Longest Common Prefix]() | Medium | | [solution](<../_3043. Find the Length of the Longest Common Prefix.md>) | py | Jun 27, 2024 | -| 3045 | [Count Prefix and Suffix Pairs II]() | Hard | | [solution](<../_3045. Count Prefix and Suffix Pairs II.md>) | py | Jun 28, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Two Pointers.md b/markdowns/by_topic/Two Pointers.md deleted file mode 100644 index b8403682..00000000 --- a/markdowns/by_topic/Two Pointers.md +++ /dev/null @@ -1,52 +0,0 @@ -# [Two Pointers]() (44 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:----------------------------------------------------------------------------------------|:---------------------------------|:----------------| -| 5 | [Longest Palindromic Substring]() | Medium | B75, N150 | [solution](<../_5. Longest Palindromic Substring.md>) | py | Jul 04, 2024 | -| 19 | [Remove Nth Node From End of List]() | Medium | B75, N150 | [solution](<../_19. Remove Nth Node From End of List.md>) | c, java, py | Jun 06, 2024 | -| 26 | [Remove Duplicates from Sorted Array]() | Easy | | [solution](<../_26. Remove Duplicates from Sorted Array.md>) | java | May 22, 2024 | -| 27 | [Remove Element]() | Easy | | [solution](<../_27. Remove Element.md>) | java, py | Jun 02, 2024 | -| 28 | [Find the Index of the First Occurrence in a String]() | Easy | | [solution](<../_28. Find the Index of the First Occurrence in a String.md>) | py | May 22, 2024 | -| 61 | [Rotate List]() | Medium | | [solution](<../_61. Rotate List.md>) | py | Jun 21, 2024 | -| 75 | [Sort Colors]() | Medium | Daily | [solution](<../_75. Sort Colors.md>) | c, py | Jun 11, 2024 | -| 82 | [Remove Duplicates from Sorted List II]() | Medium | | [solution](<../_82. Remove Duplicates from Sorted List II.md>) | py | Jul 04, 2024 | -| 125 | [Valid Palindrome]() | Easy | B75, N150 | [solution](<../_125. Valid Palindrome.md>) | c, py | Jun 07, 2024 | -| 141 | [Linked List Cycle]() | Easy | B75, N150 | [solution](<../_141. Linked List Cycle.md>) | c, py | Jun 03, 2024 | -| 142 | [Linked List Cycle II]() | Medium | | [solution](<../_142. Linked List Cycle II.md>) | py | Jun 25, 2024 | -| 143 | [Reorder List]() | Medium | B75, N150 | [solution](<../_143. Reorder List.md>) | java, py | Jun 10, 2024 | -| 165 | [Compare Version Numbers]() | Medium | | [solution](<../_165. Compare Version Numbers.md>) | c, py | Jul 02, 2024 | -| 167 | [Two Sum II - Input Array Is Sorted]() | Medium | N150 | [solution](<../_167. Two Sum II - Input Array Is Sorted.md>) | py | Jun 13, 2024 | -| 189 | [Rotate Array]() | Medium | | [solution](<../_189. Rotate Array.md>) | py | Jun 02, 2024 | -| 251 | [Flatten 2D Vector]() | Medium | | [solution](<../_251. Flatten 2D Vector.md>) | py | May 22, 2024 | -| 272 | [Closest Binary Search Tree Value II]() | Hard | | [solution](<../_272. Closest Binary Search Tree Value II.md>) | py | Jun 30, 2024 | -| 287 | [Find the Duplicate Number]() | Medium | N150 | [solution](<../_287. Find the Duplicate Number.md>) | c | Jun 25, 2024 | -| 344 | [Reverse String]() | Easy | Daily | [solution](<../_344. Reverse String.md>) | java, py | Jun 01, 2024 | -| 345 | [Reverse Vowels of a String]() | Easy | | [solution](<../_345. Reverse Vowels of a String.md>) | py | May 23, 2024 | -| 350 | [Intersection of Two Arrays II]() | Easy | Daily | [solution](<../_350. Intersection of Two Arrays II.md>) | java, py | Jul 01, 2024 | -| 392 | [Is Subsequence]() | Easy | | [solution](<../_392. Is Subsequence.md>) | java | Jun 21, 2024 | -| 408 | [Valid Word Abbreviation]() | Easy | | [solution](<../_408. Valid Word Abbreviation.md>) | py | Jun 02, 2024 | -| 475 | [Heaters]() | Medium | | [solution](<../_475. Heaters.md>) | py | Jun 07, 2024 | -| 567 | [Permutation in String]() | Medium | N150 | [solution](<../_567. Permutation in String.md>) | py | Jul 05, 2024 | -| 611 | [Valid Triangle Number]() | Medium | | [solution](<../_611. Valid Triangle Number.md>) | py | May 22, 2024 | -| 647 | [Palindromic Substrings]() | Medium | B75, N150 | [solution](<../_647. Palindromic Substrings.md>) | py | Jul 04, 2024 | -| 826 | [Most Profit Assigning Work]() | Medium | Daily | [solution](<../_826. Most Profit Assigning Work.md>) | py | Jun 17, 2024 | -| 977 | [Squares of a Sorted Array]() | Easy | | [solution](<../_977. Squares of a Sorted Array.md>) | py | Jun 20, 2024 | -| 1265 | [Print Immutable Linked List in Reverse]() | Medium | | [solution](<../_1265. Print Immutable Linked List in Reverse.md>) | c, py | Jun 06, 2024 | -| 1455 | [Check If a Word Occurs As a Prefix of Any Word in a Sentence]() | Easy | | [solution](<../_1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence.md>) | py | Jun 01, 2024 | -| 1570 | [Dot Product of Two Sparse Vectors]() | Medium | | [solution](<../_1570. Dot Product of Two Sparse Vectors.md>) | c, java, py | Jun 06, 2024 | -| 1650 | [Lowest Common Ancestor of a Binary Tree III]() | Medium | | [solution](<../_1650. Lowest Common Ancestor of a Binary Tree III.md>) | py | Jun 09, 2024 | -| 1721 | [Swapping Nodes in a Linked List]() | Medium | | [solution](<../_1721. Swapping Nodes in a Linked List.md>) | c | Jun 06, 2024 | -| 1768 | [Merge Strings Alternately]() | Easy | | [solution](<../_1768. Merge Strings Alternately.md>) | java | Jul 01, 2024 | -| 1877 | [Minimize Maximum Pair Sum in Array]() | Medium | | [solution](<../_1877. Minimize Maximum Pair Sum in Array.md>) | py | Jun 23, 2024 | -| 1885 | [Count Pairs in Two Arrays]() | Medium | Weekly Premium | [solution](<../_1885. Count Pairs in Two Arrays.md>) | py | May 21, 2024 | -| 2046 | [Sort Linked List Already Sorted Using Absolute Values]() | Medium | | [solution](<../_2046. Sort Linked List Already Sorted Using Absolute Values.md>) | py | Jul 04, 2024 | -| 2095 | [Delete the Middle Node of a Linked List]() | Medium | | [solution](<../_2095. Delete the Middle Node of a Linked List.md>) | c, java | Jun 06, 2024 | -| 2130 | [Maximum Twin Sum of a Linked List]() | Medium | | [solution](<../_2130. Maximum Twin Sum of a Linked List.md>) | py | Jun 20, 2024 | -| 2149 | [Rearrange Array Elements by Sign]() | Medium | | [solution](<../_2149. Rearrange Array Elements by Sign.md>) | c, py | Jun 09, 2024 | -| 2396 | [Strictly Palindromic Number]() | Medium | | [solution](<../_2396. Strictly Palindromic Number.md>) | c, cpp, java, js, kt, py, rb, rs | Jun 09, 2024 | -| 2486 | [Append Characters to String to Make Subsequence]() | Medium | Daily | [solution](<../_2486. Append Characters to String to Make Subsequence.md>) | c, java, py | Jun 03, 2024 | -| 2570 | [Merge Two 2D Arrays by Summing Values]() | Easy | | [solution](<../_2570. Merge Two 2D Arrays by Summing Values.md>) | c | Jun 10, 2024 | \ No newline at end of file diff --git a/markdowns/by_topic/Union Find.md b/markdowns/by_topic/Union Find.md deleted file mode 100644 index 43192773..00000000 --- a/markdowns/by_topic/Union Find.md +++ /dev/null @@ -1,16 +0,0 @@ -# [Union Find]() (8 completed) - -*[Back to top](<../../README.md>)* - ------- - -| # | Title | Level | Cats | Solution | Languages | Date Complete | -|-----:|:---------------------------------------------------------------------------------------------------------------------------------------------------------|:--------|:---------------|:--------------------------------------------------------------------------------------|:------------|:----------------| -| 128 | [Longest Consecutive Sequence]() | Medium | B75, N150 | [solution](<../_128. Longest Consecutive Sequence.md>) | java, py | Jun 12, 2024 | -| 200 | [Number of Islands]() | Medium | B75, N150 | [solution](<../_200. Number of Islands.md>) | py | Jun 16, 2024 | -| 695 | [Max Area of Island]() | Medium | N150 | [solution](<../_695. Max Area of Island.md>) | c | Jun 23, 2024 | -| 1020 | [Number of Enclaves]() | Medium | | [solution](<../_1020. Number of Enclaves.md>) | py | Jun 26, 2024 | -| 1101 | [The Earliest Moment When Everyone Become Friends]() | Medium | Weekly Premium | [solution](<../_1101. The Earliest Moment When Everyone Become Friends.md>) | py | Jul 03, 2024 | -| 1254 | [Number of Closed Islands]() | Medium | | [solution](<../_1254. Number of Closed Islands.md>) | py | Jun 26, 2024 | -| 1579 | [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 | -| 1905 | [Count Sub Islands]() | Medium | | [solution](<../_1905. Count Sub Islands.md>) | py | Jun 24, 2024 | \ No newline at end of file