Skip to content

NinePiece2/Leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 
Β 

Repository files navigation

Leetcode Solutions

Table Of Contents


Open App

Description

This is a repo to store my leetcode solutions but I went a bit Schizo with it and it pulls the leetcode solutions, creates READMEs with the problema and solution and then converts it into an Mkdocs website hosted on GitHub Pages.

If you want to use this project

If you want to use this project follow the steps here.

Steps

  1. Uses the joshcai/leetcode-sync GitHub action to will the problems and solutions from leetcode into the /Solutions folder.
  2. Uses the Script update_project_readme.py to compile all of the completed problems into a table in 2 readme files that can be used for GitHub and the Mkdocs site
  3. Uses the Script update_readmes.py.py to create README files from the problems and solutions and embed their difficulty, tags and the solution's statistics.
  4. Uses Mkdocs to convert the READMEs created in Step 3 to a website.
  5. The website is then deployed using the GitHub Pages deploy action.

My Leetcode Stats

leetcode stats

Table of my Solutions

Problem Solution Difficulty Tags
1. Two Sum πŸ”— Easy Array, Hash Table
2. Add Two Numbers πŸ”— Medium Linked List, Math, Recursion
3. Longest Substring Without Repeating Characters πŸ”— Medium Hash Table, String, Sliding Window
4. Median Of Two Sorted Arrays πŸ”— Hard Array, Binary Search, Divide and Conquer
5. Longest Palindromic Substring πŸ”— Medium Two Pointers, String, Dynamic Programming
6. Zigzag Conversion πŸ”— Medium String
7. Reverse Integer πŸ”— Medium Math
8. String To Integer Atoi πŸ”— Medium String
9. Palindrome Number πŸ”— Easy Math
10. Regular Expression Matching πŸ”— Hard String, Dynamic Programming, Recursion
11. Container With Most Water πŸ”— Medium Array, Two Pointers, Greedy
12. Integer To Roman πŸ”— Medium Hash Table, Math, String
13. Roman To Integer πŸ”— Easy Hash Table, Math, String
14. Longest Common Prefix πŸ”— Easy Array, String, Trie
15. 3sum πŸ”— Medium Array, Two Pointers, Sorting
16. 3sum Closest πŸ”— Medium Array, Two Pointers, Sorting
17. Letter Combinations Of A Phone Number πŸ”— Medium Hash Table, String, Backtracking
18. 4sum πŸ”— Medium Array, Two Pointers, Sorting
19. Remove Nth Node From End Of List πŸ”— Medium Linked List, Two Pointers
20. Valid Parentheses πŸ”— Easy String, Stack
21. Merge Two Sorted Lists πŸ”— Easy Linked List, Recursion
22. Generate Parentheses πŸ”— Medium String, Dynamic Programming, Backtracking
23. Merge K Sorted Lists πŸ”— Hard Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
24. Swap Nodes In Pairs πŸ”— Medium Linked List, Recursion
25. Reverse Nodes In K Group πŸ”— Hard Linked List, Recursion
26. Remove Duplicates From Sorted Array πŸ”— Easy Array, Two Pointers
27. Remove Element πŸ”— Easy Array, Two Pointers
28. Find The Index Of The First Occurrence In A String πŸ”— Easy Two Pointers, String, String Matching
29. Divide Two Integers πŸ”— Medium Math, Bit Manipulation
30. Substring With Concatenation Of All Words πŸ”— Hard Hash Table, String, Sliding Window
31. Next Permutation πŸ”— Medium Array, Two Pointers
32. Longest Valid Parentheses πŸ”— Hard String, Dynamic Programming, Stack
33. Search In Rotated Sorted Array πŸ”— Medium Array, Binary Search
34. Find First And Last Position Of Element In Sorted Array πŸ”— Medium Array, Binary Search
35. Search Insert Position πŸ”— Easy Array, Binary Search
36. Valid Sudoku πŸ”— Medium Array, Hash Table, Matrix
37. Sudoku Solver πŸ”— Hard Array, Hash Table, Backtracking, Matrix
38. Count And Say πŸ”— Medium String
39. Combination Sum πŸ”— Medium Array, Backtracking
40. Combination Sum II πŸ”— Medium Array, Backtracking
41. First Missing Positive πŸ”— Hard Array, Hash Table
42. Trapping Rain Water πŸ”— Hard Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
43. Multiply Strings πŸ”— Medium Math, String, Simulation
44. Wildcard Matching πŸ”— Hard String, Dynamic Programming, Greedy, Recursion
45. Jump Game II πŸ”— Medium Array, Dynamic Programming, Greedy
46. Permutations πŸ”— Medium Array, Backtracking
47. Permutations II πŸ”— Medium Array, Backtracking, Sorting
48. Rotate Image πŸ”— Medium Array, Math, Matrix
49. Group Anagrams πŸ”— Medium Array, Hash Table, String, Sorting
50. Powx N πŸ”— Medium Math, Recursion
51. N Queens πŸ”— Hard Array, Backtracking
52. N Queens II πŸ”— Hard Backtracking
54. Spiral Matrix πŸ”— Medium Array, Matrix, Simulation
55. Jump Game πŸ”— Medium Array, Dynamic Programming, Greedy
56. Merge Intervals πŸ”— Medium Array, Sorting
57. Insert Interval πŸ”— Medium Array
58. Length Of Last Word πŸ”— Easy String
59. Spiral Matrix II πŸ”— Medium Array, Matrix, Simulation
62. Unique Paths πŸ”— Medium Math, Dynamic Programming, Combinatorics
63. Unique Paths II πŸ”— Medium Array, Dynamic Programming, Matrix
64. Minimum Path Sum πŸ”— Medium Array, Dynamic Programming, Matrix
66. Plus One πŸ”— Easy Array, Math
67. Add Binary πŸ”— Easy Math, String, Bit Manipulation, Simulation
68. Text Justification πŸ”— Hard Array, String, Simulation
69. Sqrtx πŸ”— Easy Math, Binary Search
70. Climbing Stairs πŸ”— Easy Math, Dynamic Programming, Memoization
72. Edit Distance πŸ”— Medium String, Dynamic Programming
73. Set Matrix Zeroes πŸ”— Medium Array, Hash Table, Matrix
74. Search A 2d Matrix πŸ”— Medium Array, Binary Search, Matrix
76. Minimum Window Substring πŸ”— Hard Hash Table, String, Sliding Window
78. Subsets πŸ”— Medium Array, Backtracking, Bit Manipulation
79. Word Search πŸ”— Medium Array, String, Backtracking, Depth-First Search, Matrix
80. Remove Duplicates From Sorted Array II πŸ”— Medium Array, Two Pointers
81. Search In Rotated Sorted Array II πŸ”— Medium Array, Binary Search
83. Remove Duplicates From Sorted List πŸ”— Easy Linked List
84. Largest Rectangle In Histogram πŸ”— Hard Array, Stack, Monotonic Stack
88. Merge Sorted Array πŸ”— Easy Array, Two Pointers, Sorting
89. Gray Code πŸ”— Medium Math, Backtracking, Bit Manipulation
90. Subsets II πŸ”— Medium Array, Backtracking, Bit Manipulation
94. Binary Tree Inorder Traversal πŸ”— Easy Stack, Tree, Depth-First Search, Binary Tree
96. Unique Binary Search Trees πŸ”— Medium Math, Dynamic Programming, Tree, Binary Search Tree, Binary Tree
98. Validate Binary Search Tree πŸ”— Medium Tree, Depth-First Search, Binary Search Tree, Binary Tree
99. Recover Binary Search Tree πŸ”— Medium Tree, Depth-First Search, Binary Search Tree, Binary Tree
100. Same Tree πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
101. Symmetric Tree πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
104. Maximum Depth Of Binary Tree πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
105. Construct Binary Tree From Preorder And Inorder Traversal πŸ”— Medium Array, Hash Table, Divide and Conquer, Tree, Binary Tree
106. Construct Binary Tree From Inorder And Postorder Traversal πŸ”— Medium Array, Hash Table, Divide and Conquer, Tree, Binary Tree
108. Convert Sorted Array To Binary Search Tree πŸ”— Easy Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree
110. Balanced Binary Tree πŸ”— Easy Tree, Depth-First Search, Binary Tree
111. Minimum Depth Of Binary Tree πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
112. Path Sum πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
113. Path Sum II πŸ”— Medium Backtracking, Tree, Depth-First Search, Binary Tree
114. Flatten Binary Tree To Linked List πŸ”— Medium Linked List, Stack, Tree, Depth-First Search, Binary Tree
115. Distinct Subsequences πŸ”— Hard String, Dynamic Programming
116. Populating Next Right Pointers In Each Node πŸ”— Medium Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree
117. Populating Next Right Pointers In Each Node II πŸ”— Medium Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree
118. Pascals Triangle πŸ”— Easy Array, Dynamic Programming
119. Pascals Triangle II πŸ”— Easy Array, Dynamic Programming
120. Triangle πŸ”— Medium Array, Dynamic Programming
121. Best Time To Buy And Sell Stock πŸ”— Easy Array, Dynamic Programming
122. Best Time To Buy And Sell Stock II πŸ”— Medium Array, Dynamic Programming, Greedy
123. Best Time To Buy And Sell Stock III πŸ”— Hard Array, Dynamic Programming
129. Sum Root To Leaf Numbers πŸ”— Medium Tree, Depth-First Search, Binary Tree
130. Surrounded Regions πŸ”— Medium Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
133. Clone Graph πŸ”— Medium Hash Table, Depth-First Search, Breadth-First Search, Graph
134. Gas Station πŸ”— Medium Array, Greedy
135. Candy πŸ”— Hard Array, Greedy
136. Single Number πŸ”— Easy Array, Bit Manipulation
137. Single Number II πŸ”— Medium Array, Bit Manipulation
139. Word Break πŸ”— Medium Array, Hash Table, String, Dynamic Programming, Trie, Memoization
141. Linked List Cycle πŸ”— Easy Hash Table, Linked List, Two Pointers
144. Binary Tree Preorder Traversal πŸ”— Easy Stack, Tree, Depth-First Search, Binary Tree
145. Binary Tree Postorder Traversal πŸ”— Easy Stack, Tree, Depth-First Search, Binary Tree
146. Lru Cache πŸ”— Medium Hash Table, Linked List, Design, Doubly-Linked List
153. Find Minimum In Rotated Sorted Array πŸ”— Medium Array, Binary Search
154. Find Minimum In Rotated Sorted Array II πŸ”— Hard Array, Binary Search
162. Find Peak Element πŸ”— Medium Array, Binary Search
165. Compare Version Numbers πŸ”— Medium Two Pointers, String
166. Fraction To Recurring Decimal πŸ”— Medium Hash Table, Math, String
167. Two Sum II Input Array Is Sorted πŸ”— Medium Array, Two Pointers, Binary Search
169. Majority Element πŸ”— Easy Array, Hash Table, Divide and Conquer, Sorting, Counting
175. Combine Two Tables πŸ”— Easy Database
176. Second Highest Salary πŸ”— Medium Database
177. Nth Highest Salary πŸ”— Medium Database
178. Rank Scores πŸ”— Medium Database
179. Largest Number πŸ”— Medium Array, String, Greedy, Sorting
181. Employees Earning More Than Their Managers πŸ”— Easy Database
182. Duplicate Emails πŸ”— Easy Database
183. Customers Who Never Order πŸ”— Easy Database
184. Department Highest Salary πŸ”— Medium Database
185. Department Top Three Salaries πŸ”— Hard Database
187. Repeated Dna Sequences πŸ”— Medium Hash Table, String, Bit Manipulation, Sliding Window, Rolling Hash, Hash Function
188. Best Time To Buy And Sell Stock IV πŸ”— Hard Array, Dynamic Programming
190. Reverse Bits πŸ”— Easy Divide and Conquer, Bit Manipulation
191. Number Of 1 Bits πŸ”— Easy Divide and Conquer, Bit Manipulation
196. Delete Duplicate Emails πŸ”— Easy Database
197. Rising Temperature πŸ”— Easy Database
198. House Robber πŸ”— Medium Array, Dynamic Programming
199. Binary Tree Right Side View πŸ”— Medium Tree, Depth-First Search, Breadth-First Search, Binary Tree
200. Number Of Islands πŸ”— Medium Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
201. Bitwise And Of Numbers Range πŸ”— Medium Bit Manipulation
203. Remove Linked List Elements πŸ”— Easy Linked List, Recursion
206. Reverse Linked List πŸ”— Easy Linked List, Recursion
207. Course Schedule πŸ”— Medium Depth-First Search, Breadth-First Search, Graph, Topological Sort
209. Minimum Size Subarray Sum πŸ”— Medium Array, Binary Search, Sliding Window, Prefix Sum
210. Course Schedule II πŸ”— Medium Depth-First Search, Breadth-First Search, Graph, Topological Sort
215. Kth Largest Element In An Array πŸ”— Medium Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
217. Contains Duplicate πŸ”— Easy Array, Hash Table, Sorting
218. The Skyline Problem πŸ”— Hard Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Line Sweep, Sorting, Heap (Priority Queue), Ordered Set
221. Maximal Square πŸ”— Medium Array, Dynamic Programming, Matrix
222. Count Complete Tree Nodes πŸ”— Easy Binary Search, Bit Manipulation, Tree, Binary Tree
226. Invert Binary Tree πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
231. Power Of Two πŸ”— Easy Math, Bit Manipulation, Recursion
234. Palindrome Linked List πŸ”— Easy Linked List, Two Pointers, Stack, Recursion
237. Delete Node In A Linked List πŸ”— Medium Linked List
238. Product Of Array Except Self πŸ”— Medium Array, Prefix Sum
239. Sliding Window Maximum πŸ”— Hard Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
240. Search A 2d Matrix II πŸ”— Medium Array, Binary Search, Divide and Conquer, Matrix
257. Binary Tree Paths πŸ”— Easy String, Backtracking, Tree, Depth-First Search, Binary Tree
260. Single Number III πŸ”— Medium Array, Bit Manipulation
264. Ugly Number II πŸ”— Medium Hash Table, Math, Dynamic Programming, Heap (Priority Queue)
268. Missing Number πŸ”— Easy Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting
275. H Index II πŸ”— Medium Array, Binary Search
278. First Bad Version πŸ”— Easy Binary Search, Interactive
283. Move Zeroes πŸ”— Easy Array, Two Pointers
287. Find The Duplicate Number πŸ”— Medium Array, Two Pointers, Binary Search, Bit Manipulation
295. Find Median From Data Stream πŸ”— Hard Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
300. Longest Increasing Subsequence πŸ”— Medium Array, Binary Search, Dynamic Programming
303. Range Sum Query Immutable πŸ”— Easy Array, Design, Prefix Sum
309. Best Time To Buy And Sell Stock With Cooldown πŸ”— Medium Array, Dynamic Programming
315. Count Of Smaller Numbers After Self πŸ”— Hard Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
316. Remove Duplicate Letters πŸ”— Medium String, Stack, Greedy, Monotonic Stack
321. Create Maximum Number πŸ”— Hard Array, Two Pointers, Stack, Greedy, Monotonic Stack
324. Wiggle Sort II πŸ”— Medium Array, Divide and Conquer, Greedy, Sorting, Quickselect
326. Power Of Three πŸ”— Easy Math, Recursion
327. Count Of Range Sum πŸ”— Hard Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
330. Patching Array πŸ”— Hard Array, Greedy
334. Increasing Triplet Subsequence πŸ”— Medium Array, Greedy
338. Counting Bits πŸ”— Easy Dynamic Programming, Bit Manipulation
342. Power Of Four πŸ”— Easy Math, Bit Manipulation, Recursion
347. Top K Frequent Elements πŸ”— Medium Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
349. Intersection Of Two Arrays πŸ”— Easy Array, Hash Table, Two Pointers, Binary Search, Sorting
350. Intersection Of Two Arrays II πŸ”— Easy Array, Hash Table, Two Pointers, Binary Search, Sorting
352. Data Stream As Disjoint Intervals πŸ”— Hard Binary Search, Design, Ordered Set
354. Russian Doll Envelopes πŸ”— Hard Array, Binary Search, Dynamic Programming, Sorting
355. Design Twitter πŸ”— Medium Hash Table, Linked List, Design, Heap (Priority Queue)
363. Max Sum Of Rectangle No Larger Than K πŸ”— Hard Array, Binary Search, Matrix, Prefix Sum, Ordered Set
367. Valid Perfect Square πŸ”— Easy Math, Binary Search
371. Sum Of Two Integers πŸ”— Medium Math, Bit Manipulation
373. Find K Pairs With Smallest Sums πŸ”— Medium Array, Heap (Priority Queue)
374. Guess Number Higher Or Lower πŸ”— Easy Binary Search, Interactive
376. Wiggle Subsequence πŸ”— Medium Array, Dynamic Programming, Greedy
378. Kth Smallest Element In A Sorted Matrix πŸ”— Medium Array, Binary Search, Sorting, Heap (Priority Queue), Matrix
389. Find The Difference πŸ”— Easy Hash Table, String, Bit Manipulation, Sorting
392. Is Subsequence πŸ”— Easy Two Pointers, String, Dynamic Programming
397. Integer Replacement πŸ”— Medium Dynamic Programming, Greedy, Bit Manipulation, Memoization
400. Nth Digit πŸ”— Medium Math, Binary Search
401. Binary Watch πŸ”— Easy Backtracking, Bit Manipulation
402. Remove K Digits πŸ”— Medium String, Stack, Greedy, Monotonic Stack
404. Sum Of Left Leaves πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
405. Convert A Number To Hexadecimal πŸ”— Easy Math, String, Bit Manipulation
407. Trapping Rain Water II πŸ”— Hard Array, Breadth-First Search, Heap (Priority Queue), Matrix
409. Longest Palindrome πŸ”— Easy Hash Table, String, Greedy
410. Split Array Largest Sum πŸ”— Hard Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum
412. Fizz Buzz πŸ”— Easy Math, String, Simulation
414. Third Maximum Number πŸ”— Easy Array, Sorting
417. Pacific Atlantic Water Flow πŸ”— Medium Array, Depth-First Search, Breadth-First Search, Matrix
421. Maximum Xor Of Two Numbers In An Array πŸ”— Medium Array, Hash Table, Bit Manipulation, Trie
434. Number Of Segments In A String πŸ”— Easy String
436. Find Right Interval πŸ”— Medium Array, Binary Search, Sorting
441. Arranging Coins πŸ”— Easy Math, Binary Search
442. Find All Duplicates In An Array πŸ”— Medium Array, Hash Table
448. Find All Numbers Disappeared In An Array πŸ”— Easy Array, Hash Table
451. Sort Characters By Frequency πŸ”— Medium Hash Table, String, Sorting, Heap (Priority Queue), Bucket Sort, Counting
455. Assign Cookies πŸ”— Easy Array, Two Pointers, Greedy, Sorting
456. 132 Pattern πŸ”— Medium Array, Binary Search, Stack, Monotonic Stack, Ordered Set
459. Repeated Substring Pattern πŸ”— Easy String, String Matching
461. Hamming Distance πŸ”— Easy Bit Manipulation
463. Island Perimeter πŸ”— Easy Array, Depth-First Search, Breadth-First Search, Matrix
464. Can I Win πŸ”— Medium Math, Dynamic Programming, Bit Manipulation, Memoization, Game Theory, Bitmask
473. Matchsticks To Square πŸ”— Medium Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
476. Number Complement πŸ”— Easy Bit Manipulation
477. Total Hamming Distance πŸ”— Medium Array, Math, Bit Manipulation
482. License Key Formatting πŸ”— Easy String
485. Max Consecutive Ones πŸ”— Easy Array
491. Non Decreasing Subsequences πŸ”— Medium Array, Hash Table, Backtracking, Bit Manipulation
492. Construct The Rectangle πŸ”— Easy Math
495. Teemo Attacking πŸ”— Easy Array, Simulation
496. Next Greater Element I πŸ”— Easy Array, Hash Table, Stack, Monotonic Stack
498. Diagonal Traverse πŸ”— Medium Array, Matrix, Simulation
500. Keyboard Row πŸ”— Easy Array, Hash Table, String
501. Find Mode In Binary Search Tree πŸ”— Easy Tree, Depth-First Search, Binary Search Tree, Binary Tree
502. Ipo πŸ”— Hard Array, Greedy, Sorting, Heap (Priority Queue)
504. Base 7 πŸ”— Easy Math, String
506. Relative Ranks πŸ”— Easy Array, Sorting, Heap (Priority Queue)
507. Perfect Number πŸ”— Easy Math
516. Longest Palindromic Subsequence πŸ”— Medium String, Dynamic Programming
520. Detect Capital πŸ”— Easy String
521. Longest Uncommon Subsequence I πŸ”— Easy String
530. Minimum Absolute Difference In Bst πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree
541. Reverse String II πŸ”— Easy Two Pointers, String
543. Diameter Of Binary Tree πŸ”— Easy Tree, Depth-First Search, Binary Tree
551. Student Attendance Record I πŸ”— Easy String
557. Reverse Words In A String III πŸ”— Easy Two Pointers, String
561. Array Partition πŸ”— Easy Array, Greedy, Sorting, Counting Sort
563. Binary Tree Tilt πŸ”— Easy Tree, Depth-First Search, Binary Tree
566. Reshape The Matrix πŸ”— Easy Array, Matrix, Simulation
567. Permutation In String πŸ”— Medium Hash Table, Two Pointers, String, Sliding Window
570. Managers With At Least 5 Direct Reports πŸ”— Medium Database
572. Subtree Of Another Tree πŸ”— Easy Tree, Depth-First Search, String Matching, Binary Tree, Hash Function
575. Distribute Candies πŸ”— Easy Array, Hash Table
577. Employee Bonus πŸ”— Easy Database
584. Find Customer Referee πŸ”— Easy Database
586. Customer Placing The Largest Number Of Orders πŸ”— Easy Database
594. Longest Harmonious Subsequence πŸ”— Easy Array, Hash Table, Sliding Window, Sorting, Counting
595. Big Countries πŸ”— Easy Database
596. Classes With At Least 5 Students πŸ”— Easy Database
598. Range Addition II πŸ”— Easy Array, Math
599. Minimum Index Sum Of Two Lists πŸ”— Easy Array, Hash Table, String
601. Human Traffic Of Stadium πŸ”— Hard Database
602. Friend Requests II Who Has The Most Friends πŸ”— Medium Database
605. Can Place Flowers πŸ”— Easy Array, Greedy
607. Sales Person πŸ”— Easy Database
608. Tree Node πŸ”— Medium Database
610. Triangle Judgement πŸ”— Easy Database
611. Valid Triangle Number πŸ”— Medium Array, Two Pointers, Binary Search, Greedy, Sorting
617. Merge Two Binary Trees πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
619. Biggest Single Number πŸ”— Easy Database
620. Not Boring Movies πŸ”— Easy Database
621. Task Scheduler πŸ”— Medium Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting
626. Exchange Seats πŸ”— Medium Database
627. Swap Salary πŸ”— Easy Database
628. Maximum Product Of Three Numbers πŸ”— Easy Array, Math, Sorting
637. Average Of Levels In Binary Tree πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Tree
643. Maximum Average Subarray I πŸ”— Easy Array, Sliding Window
645. Set Mismatch πŸ”— Easy Array, Hash Table, Bit Manipulation, Sorting
646. Maximum Length Of Pair Chain πŸ”— Medium Array, Dynamic Programming, Greedy, Sorting
653. Two Sum IV Input Is A Bst πŸ”— Easy Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree
657. Robot Return To Origin πŸ”— Easy String, Simulation
658. Find K Closest Elements πŸ”— Medium Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)
659. Split Array Into Consecutive Subsequences πŸ”— Medium Array, Hash Table, Greedy, Heap (Priority Queue)
661. Image Smoother πŸ”— Easy Array, Matrix
671. Second Minimum Node In A Binary Tree πŸ”— Easy Tree, Depth-First Search, Binary Tree
673. Number Of Longest Increasing Subsequence πŸ”— Medium Array, Dynamic Programming, Binary Indexed Tree, Segment Tree
674. Longest Continuous Increasing Subsequence πŸ”— Easy Array
679. 24 Game πŸ”— Hard Array, Math, Backtracking
680. Valid Palindrome II πŸ”— Easy Two Pointers, String, Greedy
682. Baseball Game πŸ”— Easy Array, Stack, Simulation
692. Top K Frequent Words πŸ”— Medium Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting
693. Binary Number With Alternating Bits πŸ”— Easy Bit Manipulation
696. Count Binary Substrings πŸ”— Easy Two Pointers, String
697. Degree Of An Array πŸ”— Easy Array, Hash Table
712. Minimum Ascii Delete Sum For Two Strings πŸ”— Medium String, Dynamic Programming
714. Best Time To Buy And Sell Stock With Transaction Fee πŸ”— Medium Array, Dynamic Programming, Greedy
717. 1 Bit And 2 Bit Characters πŸ”— Easy Array
724. Find Pivot Index πŸ”— Easy Array, Prefix Sum
728. Self Dividing Numbers πŸ”— Easy Math
733. Flood Fill πŸ”— Easy Array, Depth-First Search, Breadth-First Search, Matrix
740. Delete And Earn πŸ”— Medium Array, Hash Table, Dynamic Programming
742. To Lower Case πŸ”— Easy String
744. Network Delay Time πŸ”— Medium Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path
745. Find Smallest Letter Greater Than Target πŸ”— Easy Array, Binary Search
747. Min Cost Climbing Stairs πŸ”— Easy Array, Dynamic Programming
748. Largest Number At Least Twice Of Others πŸ”— Easy Array, Sorting
749. Shortest Completing Word πŸ”— Easy Array, Hash Table, String
767. Prime Number Of Set Bits In Binary Representation πŸ”— Easy Math, Bit Manipulation
774. Maximum Depth Of N Ary Tree πŸ”— Easy Tree, Depth-First Search, Breadth-First Search
775. N Ary Tree Preorder Traversal πŸ”— Easy Stack, Tree, Depth-First Search
776. N Ary Tree Postorder Traversal πŸ”— Easy Stack, Tree, Depth-First Search
777. Toeplitz Matrix πŸ”— Easy Array, Matrix
778. Reorganize String πŸ”— Medium Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting
782. Jewels And Stones πŸ”— Easy Hash Table, String
783. Search In A Binary Search Tree πŸ”— Easy Tree, Binary Search Tree, Binary Tree
784. Insert Into A Binary Search Tree πŸ”— Medium Tree, Binary Search Tree, Binary Tree
789. Kth Largest Element In A Stream πŸ”— Easy Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Stream
792. Binary Search πŸ”— Easy Array, Binary Search
794. Swim In Rising Water πŸ”— Hard Array, Binary Search, Depth-First Search, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix
799. Minimum Distance Between Bst Nodes πŸ”— Easy Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree
802. K Th Smallest Prime Fraction πŸ”— Medium Array, Two Pointers, Binary Search, Sorting, Heap (Priority Queue)
803. Cheapest Flights Within K Stops πŸ”— Medium Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path
812. Rotate String πŸ”— Easy String, String Matching
816. Design Hashset πŸ”— Easy Array, Hash Table, Linked List, Design, Hash Function
817. Design Hashmap πŸ”— Easy Array, Hash Table, Linked List, Design, Hash Function
822. Unique Morse Code Words πŸ”— Easy Array, Hash Table, String
824. Number Of Lines To Write String πŸ”— Easy Array, String
826. Soup Servings πŸ”— Medium Math, Dynamic Programming, Probability and Statistics
829. Subdomain Visit Count πŸ”— Medium Array, Hash Table, String, Counting
830. Largest Triangle Area πŸ”— Easy Array, Math, Geometry
837. Most Common Word πŸ”— Easy Array, Hash Table, String, Counting
867. New 21 Game πŸ”— Medium Math, Dynamic Programming, Sliding Window, Probability and Statistics
874. Backspace String Compare πŸ”— Easy Two Pointers, String, Stack, Simulation
879. Maximize Distance To Closest Person πŸ”— Medium Array
882. Peak Index In A Mountain Array πŸ”— Medium Array, Binary Search
900. Reordered Power Of 2 πŸ”— Medium Hash Table, Math, Sorting, Counting, Enumeration
908. Middle Of The Linked List πŸ”— Easy Linked List, Two Pointers
940. Fruit Into Baskets πŸ”— Medium Array, Hash Table, Sliding Window
967. Minimum Falling Path Sum πŸ”— Medium Array, Dynamic Programming, Matrix
1006. Vowel Spellchecker πŸ”— Medium Array, Hash Table, String
1013. Fibonacci Number πŸ”— Easy Math, Dynamic Programming, Recursion, Memoization
1018. Largest Perimeter Triangle πŸ”— Easy Array, Math, Greedy, Sorting
1019. Squares Of A Sorted Array πŸ”— Easy Array, Two Pointers, Sorting
1054. Complement Of Base 10 Integer πŸ”— Easy Bit Manipulation
1087. Longest Arithmetic Subsequence πŸ”— Medium Array, Hash Table, Binary Search, Dynamic Programming
1105. Uncrossed Lines πŸ”— Medium Array, Dynamic Programming
1111. Minimum Score Triangulation Of Polygon πŸ”— Medium Array, Dynamic Programming
1135. Customers Who Bought All Products πŸ”— Medium Database
1153. Product Sales Analysis I πŸ”— Easy Database
1179. Game Play Analysis I πŸ”— Easy Database
1182. Game Play Analysis IV πŸ”— Medium Database
1236. N Th Tribonacci Number πŸ”— Easy Math, Dynamic Programming, Memoization
1245. User Activity For The Past 30 Days I πŸ”— Easy Database
1250. Longest Common Subsequence πŸ”— Medium String, Dynamic Programming
1258. Article Views I πŸ”— Easy Database
1264. Maximum Number Of Words You Can Type πŸ”— Easy Hash Table, String
1330. Longest Arithmetic Subsequence Of Given Difference πŸ”— Medium Array, Hash Table, Dynamic Programming
1353. Find Resultant Array After Removing Anagrams πŸ”— Easy Array, Hash Table, String, Sorting
1364. Tuple With Same Product πŸ”— Medium Array, Hash Table, Counting
1370. Count Number Of Nice Subarrays πŸ”— Medium Array, Hash Table, Math, Sliding Window, Prefix Sum
1390. Average Selling Price πŸ”— Easy Database
1402. Count Square Submatrices With All Ones πŸ”— Medium Array, Dynamic Programming, Matrix
1407. Group The People Given The Group Size They Belong To πŸ”— Medium Array, Hash Table, Greedy
1411. Convert Binary Number In A Linked List To Integer πŸ”— Easy Linked List, Math
1415. Students And Examinations πŸ”— Easy Database
1421. Find Numbers With Even Number Of Digits πŸ”— Easy Array, Math
1423. Maximum Number Of Occurrences Of A Substring πŸ”— Medium Hash Table, String, Sliding Window
1426. Find N Unique Integers Sum Up To Zero πŸ”— Easy Array, Math
1437. Minimum Insertion Steps To Make A String Palindrome πŸ”— Hard String, Dynamic Programming
1440. Convert Integer To The Sum Of Two No Zero Integers πŸ”— Easy Math
1448. Maximum 69 Number πŸ”— Easy Math, Greedy
1509. Replace Employee Id With The Unique Identifier πŸ”— Easy Database
1582. Design Browser History πŸ”— Medium Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream
1586. Longest Subarray Of 1s After Deleting One Element πŸ”— Medium Array, Dynamic Programming, Sliding Window
1612. Avoid Flood In The City πŸ”— Medium Array, Hash Table, Binary Search, Greedy, Heap (Priority Queue)
1619. Path Crossing πŸ”— Easy Hash Table, String
1628. Count Submatrices With All Ones πŸ”— Medium Array, Dynamic Programming, Stack, Matrix, Monotonic Stack
1642. Water Bottles πŸ”— Easy Math, Simulation
1675. Magnetic Force Between Two Balls πŸ”— Medium Array, Binary Search, Sorting
1765. Merge In Between Linked Lists πŸ”— Medium Linked List
1827. Invalid Tweets πŸ”— Easy Database
1834. Minimum Number Of People To Teach πŸ”— Medium Array, Hash Table, Greedy
1908. Recyclable And Low Fat Products πŸ”— Easy Database
1917. Maximum Average Pass Ratio πŸ”— Medium Array, Greedy, Heap (Priority Queue)
1923. Sentence Similarity III πŸ”— Medium Array, Two Pointers, String
2006. Find The Student That Will Replace The Chalk πŸ”— Medium Array, Binary Search, Simulation, Prefix Sum
2023. Design Movie Rental System πŸ”— Hard Array, Hash Table, Design, Heap (Priority Queue), Ordered Set
2076. Sum Of Digits Of String After Convert πŸ”— Easy String, Simulation
2096. Find The Longest Valid Obstacle Course At Each Position πŸ”— Hard Array, Binary Search, Binary Indexed Tree
2102. Find The Middle Index In Array πŸ”— Easy Array, Prefix Sum
2132. Convert 1d Array Into 2d Array πŸ”— Easy Array, Matrix, Simulation
2174. Next Greater Numerically Balanced Number πŸ”— Medium Hash Table, Math, Backtracking, Counting, Enumeration
2229. Maximum Fruits Harvested After At Most K Steps πŸ”— Hard Array, Binary Search, Sliding Window, Prefix Sum
2307. Replace Non Coprime Numbers In Array πŸ”— Hard Array, Math, Stack, Number Theory
2316. Count Hills And Valleys In An Array πŸ”— Easy Array
2324. Find Triangular Sum Of An Array πŸ”— Medium Array, Math, Simulation, Combinatorics
2346. Largest 3 Same Digit Number In String πŸ”— Easy String
2392. Successful Pairs Of Spells And Potions πŸ”— Medium Array, Two Pointers, Binary Search, Sorting
2408. Number Of People Aware Of A Secret πŸ”— Medium Dynamic Programming, Queue, Simulation
2429. Design A Food Rating System πŸ”— Medium Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Set
2432. Number Of Zero Filled Subarrays πŸ”— Medium Array, Math
2497. Maximum Matching Of Players With Trainers πŸ”— Medium Array, Two Pointers, Greedy, Sorting
2529. Range Product Queries Of Powers πŸ”— Medium Array, Bit Manipulation, Prefix Sum
2661. Smallest Missing Non Negative Integer After Operations πŸ”— Medium Array, Hash Table, Math, Greedy
2689. Rearranging Fruits πŸ”— Hard Array, Hash Table, Greedy, Sort
2734. Array Prototype Last πŸ”— Easy
2758. Check If Object Instance Of Class πŸ”— Medium
2837. Minimum Operations To Make The Integer Zero πŸ”— Medium Bit Manipulation, Brainteaser, Enumeration
2882. Ways To Express An Integer As Sum Of Powers πŸ”— Medium Dynamic Programming
2887. Sort Vowels In A String πŸ”— Medium String, Sorting
3242. Count Elements With Maximum Frequency πŸ”— Easy Array, Hash Table, Counting
3251. Maximum Area Of Longest Diagonal Rectangle πŸ”— Easy Array
3277. Find The Number Of Ways To Place People II πŸ”— Hard Array, Math, Geometry, Sorting, Enumeration
3278. Find The Number Of Ways To Place People I πŸ”— Medium Array, Math, Geometry, Sorting, Enumeration
3279. Alice And Bob Playing Flower Game πŸ”— Medium Math
3336. Water Bottles II πŸ”— Medium Math, Simulation
3383. Taking Maximum Energy From The Mystic Dungeon πŸ”— Medium Array, Prefix Sum
3437. Maximum Total Damage With Spell Casting πŸ”— Medium Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Counting
3459. Find The Minimum Area To Cover All Ones II πŸ”— Hard Array, Matrix, Enumeration
3461. Find The Minimum Area To Cover All Ones I πŸ”— Medium Array, Matrix
3462. Vowels Game In A String πŸ”— Medium Math, String, Brainteaser, Game Theory
3612. Adjacent Increasing Subarrays Detection I πŸ”— Easy Array
3619. Adjacent Increasing Subarrays Detection II πŸ”— Medium Array, Binary Search
3648. Find The Maximum Number Of Fruits Collected πŸ”— Hard Array, Dynamic Programming, Matrix
3678. Design Task Manager πŸ”— Medium Hash Table, Design, Heap (Priority Queue), Ordered Set
3733. Length Of Longest V Shaped Diagonal Segment πŸ”— Hard Array, Dynamic Programming, Memoization, Matrix
3744. Minimum Operations To Make Array Elements Zero πŸ”— Hard Array, Math, Bit Manipulation
3748. Sort Matrix By Diagonals πŸ”— Medium Array, Sorting, Matrix
3790. Fruits Into Baskets II πŸ”— Easy Array, Binary Search, Segment Tree, Simulation, Ordered Set
3791. Fruits Into Baskets III πŸ”— Medium Array, Binary Search, Segment Tree, Ordered Set
3794. Find The Minimum Amount Of Time To Brew Potions πŸ”— Medium Array, Simulation, Prefix Sum
3797. Design Spreadsheet πŸ”— Medium Array, Hash Table, String, Design, Matrix
3827. Implement Router πŸ”— Medium Array, Hash Table, Binary Search, Design, Queue, Ordered Set
3830. Find Closest Person πŸ”— Easy Math
3851. Find Sum Of Array Product Of Magical Sequences πŸ”— Hard Array, Math, Dynamic Programming, Bit Manipulation, Combinatorics, Bitmask
3872. Find Most Frequent Vowel And Consonant πŸ”— Easy Hash Table, String, Counting

About

My Leetcode solutions. Automated to pull submissions and create a website with them.

Topics

Resources

Stars

Watchers

Forks

Contributors 3

  •  
  •  
  •  

Languages