Skip to content
BranchesTags

Latest commit

 

History

629 Commits

Folders and files

NameName
Last commit message
Last commit date
.idea
.idea
 
 
1. TwoSum [Easy]
1. TwoSum [Easy]
 
 
10. Regular Expression Matching [HARD]
10. Regular Expression Matching [HARD]
 
 
1004. Max Consecutive Ones III [MEDIUM]
1004. Max Consecutive Ones III [MEDIUM]
 
 
102. Binary Tree Level Order Traversal [MEDIUM]
102. Binary Tree Level Order Traversal [MEDIUM]
 
 
1047. Remove All Adjacent Duplicates In String [EASY]
1047. Remove All Adjacent Duplicates In String [EASY]
 
 
1071. Greatest Common Divisor of Strings [EASY]
1071. Greatest Common Divisor of Strings [EASY]
 
 
1091. Shortest Path in Binary Matrix [MEDIUM]
1091. Shortest Path in Binary Matrix [MEDIUM]
 
 
11. Container With Most Water [MEDIUM]
11. Container With Most Water [MEDIUM]
 
 
1123. Lowest Common Ancestor of Deepest Leaves [MEDIUM]
1123. Lowest Common Ancestor of Deepest Leaves [MEDIUM]
 
 
1146. Snapshot Array [MEDIUM]
1146. Snapshot Array [MEDIUM]
 
 
1169. Invalid Transactions [MEDIUM]
1169. Invalid Transactions [MEDIUM]
 
 
118. Pascal's Triangle [EASY]
118. Pascal's Triangle [EASY]
 
 
12. Integer to Roman [MEDIUM]
12. Integer to Roman [MEDIUM]
 
 
1209. Remove All Adjacent Duplicates in String II [MEDIUM]
1209. Remove All Adjacent Duplicates in String II [MEDIUM]
 
 
121. Best Time to Buy and Sell Stock [EASY]
121. Best Time to Buy and Sell Stock [EASY]
 
 
1216. Valid Palindrome III [HARD]
1216. Valid Palindrome III [HARD]
 
 
122. Best Time to Buy and Sell Stock II [MEDIUM]
122. Best Time to Buy and Sell Stock II [MEDIUM]
 
 
123. Best Time to Buy and Sell Stock III [HARD]
123. Best Time to Buy and Sell Stock III [HARD]
 
 
1235. Maximum Profit in Job Scheduling [HARD]
1235. Maximum Profit in Job Scheduling [HARD]
 
 
124. Binary Tree Maximum Path Sum [HARD]
124. Binary Tree Maximum Path Sum [HARD]
 
 
1242. Web Crawler Multithreaded [MEDIUM]
1242. Web Crawler Multithreaded [MEDIUM]
 
 
1244. Design A Leaderboard [MEDIUM]
1244. Design A Leaderboard [MEDIUM]
 
 
1249. Minimum Remove to Make Valid Parentheses [MEDIUM]
1249. Minimum Remove to Make Valid Parentheses [MEDIUM]
 
 
125. Valid Palindrome [EASY]
125. Valid Palindrome [EASY]
 
 
127. Word Ladder [HARD]
127. Word Ladder [HARD]
 
 
128. Longest Consecutive Sequence[MEDIUM]
128. Longest Consecutive Sequence[MEDIUM]
 
 
129. Sum Root to Leaf Numbers [MEDIUM]
129. Sum Root to Leaf Numbers [MEDIUM]
 
 
13. Roman to Integer [EASY]
13. Roman to Integer [EASY]
 
 
131. Palindrome Partitioning [MEDIUM]
131. Palindrome Partitioning [MEDIUM]
 
 
133. Clone Graph [MEDIUM]
133. Clone Graph [MEDIUM]
 
 
1353. Maximum Number of Events That Can Be Attended [MEDIUM]
1353. Maximum Number of Events That Can Be Attended [MEDIUM]
 
 
1371. Find the Longest Substring Containing Vowels in Even Counts [MEDIUM]
1371. Find the Longest Substring Containing Vowels in Even Counts [MEDIUM]
 
 
138. Copy List with Random Pointer [MEDIUM]
138. Copy List with Random Pointer [MEDIUM]
 
 
1382. Balance a Binary Search Tree [MEDIUM]
1382. Balance a Binary Search Tree [MEDIUM]
 
 
139. Word Break [MEDIUM]
139. Word Break [MEDIUM]
 
 
14. Longest Common Prefix [Easy]
14. Longest Common Prefix [Easy]
 
 
140. Word Break II [HARD]
140. Word Break II [HARD]
 
 
142. Linked List Cycle II [MEDIUM]
142. Linked List Cycle II [MEDIUM]
 
 
1428. Leftmost Column with at Least a One [MEDIUM]
1428. Leftmost Column with at Least a One [MEDIUM]
 
 
146. LRU Cache [MEDIUM]
146. LRU Cache [MEDIUM]
 
 
1475. Final Prices With a Special Discount in a Shop[Easy]
1475. Final Prices With a Special Discount in a Shop[Easy]
 
 
1488. Avoid Flood in The City [MEDIUM]
1488. Avoid Flood in The City [MEDIUM]
 
 
15. 3Sum [Medium]
15. 3Sum [Medium]
 
 
152. Maximum Product Subarray [MEDIUM]
152. Maximum Product Subarray [MEDIUM]
 
 
1539. Kth Missing Positive Number [EASY]
1539. Kth Missing Positive Number [EASY]
 
 
155. Min Stack[MEDIUM]
155. Min Stack[MEDIUM]
 
 
1570. Dot Product of Two Sparse Vectors [MEDIUM]
1570. Dot Product of Two Sparse Vectors [MEDIUM]
 
 
159. Longest Substring with At Most Two Distinct Characters[MEDIUM]
159. Longest Substring with At Most Two Distinct Characters[MEDIUM]
 
 
16. 3Sum Closest [MEDIUM]
16. 3Sum Closest [MEDIUM]
 
 
16. 3Sum Closest[MEDIUM]
16. 3Sum Closest[MEDIUM]
 
 
162. Find Peak Element [MEDIUM]
162. Find Peak Element [MEDIUM]
 
 
163. Missing Ranges [EASY]
163. Missing Ranges [EASY]
 
 
1644. Lowest Common Ancestor of a Binary Tree II [MEDIUM]
1644. Lowest Common Ancestor of a Binary Tree II [MEDIUM]
 
 
1650. Lowest Common Ancestor of a Binary Tree III [MEDIUM]
1650. Lowest Common Ancestor of a Binary Tree III [MEDIUM]
 
 
1669. Merge In Between Linked Lists [MEDIUM]
1669. Merge In Between Linked Lists [MEDIUM]
 
 
167. Two Sum II - Input Array Is Sorted [MEDIUM]
167. Two Sum II - Input Array Is Sorted [MEDIUM]
 
 
169. Majority Element [EASY]
169. Majority Element [EASY]
 
 
17. Letter Combinations of a Phone Number [MEDIUM]
17. Letter Combinations of a Phone Number [MEDIUM]
 
 
173. Binary Search Tree Iterator [MEDIUM]
173. Binary Search Tree Iterator [MEDIUM]
 
 
1762. Buildings With an Ocean View [MEDIUM]
1762. Buildings With an Ocean View [MEDIUM]
 
 
1768. Merge Strings Alternately [EASY]
1768. Merge Strings Alternately [EASY]
 
 
179. Largest Number [MEDIUM]
179. Largest Number [MEDIUM]
 
 
1797. Design Authentication Manager[MEDIUM]
1797. Design Authentication Manager[MEDIUM]
 
 
18. 4Sum
18. 4Sum
 
 
1868. Product of Two Run-Length Encoded Arrays [MEDIUM]
1868. Product of Two Run-Length Encoded Arrays [MEDIUM]
 
 
188. Best Time to Buy and Sell Stock IV [HARD]
188. Best Time to Buy and Sell Stock IV [HARD]
 
 
189. Rotate Array [MEDIUM]
189. Rotate Array [MEDIUM]
 
 
19. Remove Nth Node From End of List [MEDIUM]
19. Remove Nth Node From End of List [MEDIUM]
 
 
1929. Concatenation of Array [EASY]
1929. Concatenation of Array [EASY]
 
 
1971. Find if Path Exists in Graph[EASY]
1971. Find if Path Exists in Graph[EASY]
 
 
198. House Robber [MEDIUM]
198. House Robber [MEDIUM]
 
 
199. Binary Tree Right Side View [MEDIUM]
199. Binary Tree Right Side View [MEDIUM]
 
 
2. AddTwoNumbers
2. AddTwoNumbers
 
 
200. Number of Islands [MEDIUM]
200. Number of Islands [MEDIUM]
 
 
204. Count Primes [MEDIUM]
204. Count Primes [MEDIUM]
 
 
206. Reverse Linked List [EASY]
206. Reverse Linked List [EASY]
 
 
207. Course Schedule [MEDIUM]
207. Course Schedule [MEDIUM]
 
 
208. Implement Trie (Prefix Tree)[MEDIUM]
208. Implement Trie (Prefix Tree)[MEDIUM]
 
 
2096. Step-By-Step Directions From a Binary Tree Node to Another
2096. Step-By-Step Directions From a Binary Tree Node to Another
 
 
21. Merge Two Sorted Lists[EASY]
21. Merge Two Sorted Lists[EASY]
 
 
210. Course Schedule II[MEDIUM]
210. Course Schedule II[MEDIUM]
 
 
212. Word Search II [HARD]
212. Word Search II [HARD]
 
 
213. House Robber II [MEDIUM]
213. House Robber II [MEDIUM]
 
 
215. Kth Largest Element in an Array [MEDIUM]
215. Kth Largest Element in an Array [MEDIUM]
 
 
217. Contains Duplicate [EASY]
217. Contains Duplicate [EASY]
 
 
219. Contains Duplicate II [EASY]
219. Contains Duplicate II [EASY]
 
 
22. Generate Parentheses [MEDIUM]
22. Generate Parentheses [MEDIUM]
 
 
2204. Distance to a Cycle in Undirected Graph[HARD]
2204. Distance to a Cycle in Undirected Graph[HARD]
 
 
224. Basic Calculator [HARD]
224. Basic Calculator [HARD]
 
 
2251. Number of Flowers in Full Bloom [HARD]
2251. Number of Flowers in Full Bloom [HARD]
 
 
226. Invert Binary Tree [EASY]
226. Invert Binary Tree [EASY]
 
 
227. Basic Calculator II [MEDIUM]
227. Basic Calculator II [MEDIUM]
 
 
23. Merge k Sorted Lists [HARD]
23. Merge k Sorted Lists [HARD]
 
 
230. Kth Smallest Element in a BST[MEDIUM]
230. Kth Smallest Element in a BST[MEDIUM]
 
 
232. Implement Queue using Stacks
232. Implement Queue using Stacks
 
 
2330. Valid Palindrome IV [MEDIUM]
2330. Valid Palindrome IV [MEDIUM]
 
 
235. Lowest Common Ancestor of a Binary Search Tree [MEDIUM]
235. Lowest Common Ancestor of a Binary Search Tree [MEDIUM]
 
 
236. Lowest Common Ancestor of a Binary Tree [MEDIUM]
236. Lowest Common Ancestor of a Binary Tree [MEDIUM]
 
 
2365. Task Scheduler II [MEDIUM]
2365. Task Scheduler II [MEDIUM]
 
 

About

LeetCode preparation

Activity

Stars

4 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages