Name	Name	Last commit message	Last commit date
Latest commit History 99 Commits
101. Symmetric Tree	101. Symmetric Tree
103. Binary Tree Zigzag Level Order Traversal	103. Binary Tree Zigzag Level Order Traversal
104. Maximum Depth of Binary Tree	104. Maximum Depth of Binary Tree
106. Construct Binary Tree from Inorder and Postorder Traversal	106. Construct Binary Tree from Inorder and Postorder Traversal
1071. Greatest Common Divisor of Strings	1071. Greatest Common Divisor of Strings
109. Convert Sorted List to Binary Search Tree	109. Convert Sorted List to Binary Search Tree
1129. Shortest Path with Alternating Colors	1129. Shortest Path with Alternating Colors
1137. N-th Tribonacci Number	1137. N-th Tribonacci Number
1162. As Far from Land as Possible	1162. As Far from Land as Possible
121. Best Time to Buy and Sell Stock	121. Best Time to Buy and Sell Stock
129. Sum Root to Leaf Numbers Medium 6.4K 98	129. Sum Root to Leaf Numbers Medium 6.4K 98
131. Palindrome Partitioning	131. Palindrome Partitioning
1319. Number of Operations to Make Network Connected	1319. Number of Operations to Make Network Connected
1345. Jump Game IV	1345. Jump Game IV
1402. Reducing Dishes	1402. Reducing Dishes
142. Linked List Cycle II	142. Linked List Cycle II
1466. Reorder Routes to Make All Paths Lead to the City Zero	1466. Reorder Routes to Make All Paths Lead to the City Zero
1470. Shuffle the Array	1470. Shuffle the Array
1472. Design Browser History	1472. Design Browser History
1523. Count Odd Numbers in an Interval Range	1523. Count Odd Numbers in an Interval Range
1539. Kth Missing Positive Number	1539. Kth Missing Positive Number
1626. Best Team With No Conflicts	1626. Best Team With No Conflicts
1675. Minimize Deviation in Array	1675. Minimize Deviation in Array
208. Implement Trie (Prefix Tree)	208. Implement Trie (Prefix Tree)
211. Design Add and Search Words Data Structure	211. Design Add and Search Words Data Structure
2187. Minimum Time to Complete Trips	2187. Minimum Time to Complete Trips
226. Invert Binary Tree	226. Invert Binary Tree
23. Merge k Sorted Lists	23. Merge k Sorted Lists
2306. Naming a Company	2306. Naming a Company
2316. Count Unreachable Pairs of Nodes in an Undirected Graph	2316. Count Unreachable Pairs of Nodes in an Undirected Graph
2348. Number of Zero-Filled Subarrays	2348. Number of Zero-Filled Subarrays
2359. Find Closest Node to Given Two Nodes	2359. Find Closest Node to Given Two Nodes
2360. Longest Cycle in a Graph	2360. Longest Cycle in a Graph
2444. Count Subarrays With Fixed Bounds	2444. Count Subarrays With Fixed Bounds
2477. Minimum Fuel Cost to Report to the Capital	2477. Minimum Fuel Cost to Report to the Capital
2492. Minimum Score of a Path Between Two Cities	2492. Minimum Score of a Path Between Two Cities
28. Find the Index of the First Occurrence in a String	28. Find the Index of the First Occurrence in a String
35. Search Insert Position	35. Search Insert Position
352. Data Stream as Disjoint Intervals	352. Data Stream as Disjoint Intervals
382. Linked List Random Node	382. Linked List Random Node
427. Construct Quad Tree	427. Construct Quad Tree
438. Find All Anagrams in a String	438. Find All Anagrams in a String
443. String Compression	443. String Compression
45. Jump Game II	45. Jump Game II
460. LFU Cache	460. LFU Cache
472. Concatenated Words	472. Concatenated Words
491. Non-decreasing Subsequences	491. Non-decreasing Subsequences
502. IPO	502. IPO
540. Single Element in a Sorted Array	540. Single Element in a Sorted Array
6. Zigzag Conversion	6. Zigzag Conversion
605. Can Place Flowers	605. Can Place Flowers
64. Minimum Path Sum	64. Minimum Path Sum
652. Find Duplicate Subtrees	652. Find Duplicate Subtrees
783. Minimum Distance Between BST Nodes	783. Minimum Distance Between BST Nodes
787. Cheapest Flights Within K Stops	787. Cheapest Flights Within K Stops
87. Scramble String	87. Scramble String
875. Koko Eating Bananas	875. Koko Eating Bananas
904. Fruit Into Baskets	904. Fruit Into Baskets
909. Snakes and Ladders	909. Snakes and Ladders
912. Sort an Array	912. Sort an Array
93. Restore IP Addresses	93. Restore IP Addresses
958. Check Completeness of a Binary Tree	958. Check Completeness of a Binary Tree
974. Subarray Sums Divisible by K	974. Subarray Sums Divisible by K
983. Minimum Cost For Tickets	983. Minimum Cost For Tickets
989. Add to Array-Form of Integer	989. Add to Array-Form of Integer
997. Find the Town Judge	997. Find the Town Judge
Add Binary	Add Binary
All Paths From Source to Target	All Paths From Source to Target
Best Time to Buy and Sell Stock with Cooldown	Best Time to Buy and Sell Stock with Cooldown
Binary Tree Preorder Traversal	Binary Tree Preorder Traversal
Delete Columns to Make Sorted	Delete Columns to Make Sorted
Detect Capital	Detect Capital
Domino and Tromino Tiling	Domino and Tromino Tiling
Edit Distance	Edit Distance
Find if Path Exists in Graph	Find if Path Exists in Graph
Flip String to Monotone Increasing	Flip String to Monotone Increasing
Gas Station	Gas Station
Insert Interval	Insert Interval
Jump Game	Jump Game
Keys and Rooms	Keys and Rooms
Longest Subsequence With Limited Sum	Longest Subsequence With Limited Sum
Max Points on a Line	Max Points on a Line
Maximum Bags With Full Capacity of Rocks	Maximum Bags With Full Capacity of Rocks
Maximum Sum Circular Subarray	Maximum Sum Circular Subarray
Minimum Rounds to Complete All Tasks	Minimum Rounds to Complete All Tasks
Minimum Time to Collect All Apples in a Tree	Minimum Time to Collect All Apples in a Tree
Number of Nodes in the Sub-Tree With the Same Label	Number of Nodes in the Sub-Tree With the Same Label
Number of good paths	Number of good paths
Permutation in String	Permutation in String
Possible Bipartition	Possible Bipartition
README.md	README.md
Remove Stones to Minimize the Total	Remove Stones to Minimize the Total
Same Tree	Same Tree
Single-Threaded CPU	Single-Threaded CPU
Sum of Distances in Tree	Sum of Distances in Tree
Unique Paths III	Unique Paths III
Word Pattern	Word Pattern

Name

Last commit message

Last commit date