- Add Binary
- Two Sum
- Add Two Numbers
- Add To Array Form Of Integer
- Maximum Depth of Binary Tree
- Minimum Distance Between BST Nodes
- Invert Binary Tree
- Binary Tree Zigzag Level Order Traversal
- Single Element in a Sorted Array
- Capacity To Ship Packages Within D Days
- IPO
- Minimize Deviation in Array
- Best Time to Buy and Sell Stock
- Edit Distance
- Construct Quad Tree
- Sort an Array
- String Compression
- Find the Index of the First Occurrence in a String
- Count Subarrays With Fixed Bounds
- Jump Game IV
- Kth Missing Positive Number
- Minimum Time to Complete Trips
- Koko Eating Bananas
- Linked List Cycle II
- Linked List Random Node
- Convert Sorted List to Binary Search Tree
- Merge k Sorted Lists
- Symmetric Tree
- Sum Root to Leaf Numbers
- Check Completeness of a Binary Tree
- Construct Binary Tree from Inorder and Postorder Traversal
- Implement Trie (Prefix Tree)
- Design Browser History
- Design Add and Search Words Data Structure
- Can Place Flowers
- Number of Zero-Filled Subarrays
- Minimum Score of a Path Between Two Cities
- Number Of Operations To Make Network Connected
- Reorder Routes to Make All Paths Lead to the City Zero
- Count Unreachable Pairs of Nodes in an Undirected Graph
- Longest Cycle in a Graph
- Minimum Path Sum
- Minimum Cost For Tickets
- Reducing Dishes
- Scramble String
- Number of Ways of Cutting a Pizza
- Successful Pairs of Spells and Potions
- Boats to Save People
- Optimal Partition of String
- Minimize Maximum of Array
- Number of Closed Islands
- Number of Enclaves
- Clone Graph
- Largest Color Value in a Directed Graph
- Valid Parantheses
- Removing Stars From a String
- Simplify Path
- Validate Stack Sequences
- Longest Palindromic Subsequence
- Maximum Value of K Coins From Piles
- Number of Ways to Form a Target String Given a Dictionary
- Kids With the Greatest Number of Candies
- Merge Strings Alternately
- Longest ZigZag Path in a Binary Tree
- Maximum Width of Binary Tree
- Profitable Schemes
- Minimum Insertion Steps to Make a String Palindrome
- Restore The Array
- Smallest Number in Infinite Set
- Add Digits
- Bulb Switcher
- Similar String Groups
- Checking Existence of Edge Length Limited Paths
- Remove Max Number of Edges to Keep Graph Fully Traversable
- Sign of the Product of an array
- Dota2 Senate
- Maximum Number of Vowels in a Substring of Given Length
- Number of Subsequences That Satisfy the Given Sum Condition
- Find the Longest Valid Obstacle Course at Each Position
- Matrix Diagonal Sum
- Spiral Matrix
- Spiral Matrix II
- Uncrossed Lines
- Solving Questions With Brainpower
- Count Ways To Build Good Strings
- Maximize Score After N Operations
- Swapping Nodes in A Linked List
- Swap Nodes in Pairs
- Maximum Twin Sum of a Linked List
- Minimum Number of Vertices to Reach All Nodes
- Is Graph Bipartite ?
- Evaluate Division
- Shortest Bridge
- Top K Frequent Elements
- Kth Largest Element in a Stream
- Maximum Subsequence Score
- New 21 Game
- Stone Game II
- Stone Game III
- Min Cost to Cut a Stick
- Desgin Parking System
- Design HashSet
- Design Underground System
- Shortest Path in Binary Matrix
- Detonate the Maximum Bombs
- Time Needed to Inform All Employees
- Number of Provinces
- Check If It Is a Straight Line
- Can Make Arithmetic Progression From Sequence
- Minimum Flips to Make a OR b Equal to c
- Count Negative Numbers in a Sorted Matrix
- Find Smallest Letter Greater Than Target
- Maximum Value at a Given Index in a Bounded Array
- Snapshot Array
- Summary Ranges
- Equal Row and Column Pair
- Minimum Absolute Difference in BST
- Maximum Level Sum of a Binary Tree
- Number of Ways to Reorder Array to Get Same BST
- Make Array Strictly Increasing
- Number of Increasing Paths in a Grid
- Find the Highest Altitude
- K Radius Subarray Averages
- Minimum Cost to Make Array Equal
- Best Time to Buy and Sell Stock with Transaction Fee
- Longest Arithmetic Subsequence
- Tallest Billboard
- Count All Possible Routes
- Total Cost to Hire K Workers
- Find K Pairs with Smallest Sums
- Path With Maximum Probability
- Shortest Path to Get All Keys
- Last Day Where You Can Still Cross
- Fair Distribution of Cookies
- Maximum Number of Achievable Transfer Requests
- Buddy Strings
- Single Number II
- Longest Subarray of 1's After Deleting One Element
- Minimum Size Subarray Sum
- Maximize the Confusion of an Exam
- Put Marbles in Bags
- Substring With Largest Variance
-
Day 1
-
Day 2
-
Day 3
-
Day 4
-
Day 5
-
Day 6
-
Day 7
-
Day 8
-
Day 9
-
Day 10
-
Day 11
-
Day 12
-
Day 13
-
Day 14
-
Prefix Sum (Day 1)
-
String (Day 2)
-
Linked List (Day 3)
-
Linked List (Day 4)
-
Greedy (Day 5)
-
Tree (Day 6)
-
Binary Search (Day 7)
-
Binary Search Tree (Day 8)
-
Graph/BFS/DFS (Day 9)
-
Dynamic Programming (Day 10)
-
Dynamic Programming (Day 11)
-
Sliding Window/Two Pointer (Day 12)
-
Hashmap (Day 13)
-
Stack (Day 14)
-
Heap (Day 15)
-
Select (Day 1)
-
Select & Order (Day 2)
-
String Processing Functions (Day 3)
-
Union & Select (Day 4)
-
Union (Day 5)
-
Union (Day 6)
-
Function (Day 7)
-
Function (Day 8)
-
Control of Flow (Day 9)
-
Where (Day 10)