| Week-1 |
|
Find Pivot Index
|
|
|
|
|
|
|
|
|
|
|
|
First Unique Character in a String
|
|
|
|
|
|
|
|
|
|
|
|
Longest Common Prefix
|
|
|
|
|
|
|
|
|
|
|
|
Move Zeroes
|
|
|
|
|
|
|
|
|
|
|
|
Remove Duplicates from Sorted Array
|
|
|
|
|
|
|
|
|
|
|
|
Reverse String
|
|
|
|
|
|
|
|
|
|
|
|
Reverse Words in a String
|
|
|
|
|
|
|
|
|
|
|
|
Squares of a Sorted Array
|
|
|
|
|
|
|
|
|
|
|
|
Two Sum
|
|
|
|
|
|
|
|
|
|
|
|
Valid Anagram
|
|
|
|
|
|
|
|
|
|
|
| Week-2 |
|
Assign Cookies
|
|
|
|
|
|
|
|
|
|
|
|
Best Time to Buy and Sell Stock
|
|
|
|
|
|
|
|
|
|
|
|
Contains Duplicate II
|
|
|
|
|
|
|
|
|
|
|
|
Find All Anagrams in a String
|
|
|
|
|
|
|
|
|
|
|
|
Intersection of Two Arrays
|
|
|
|
|
|
|
|
|
|
|
|
Majority Element
|
|
|
|
|
|
|
|
|
|
|
|
Maximum Average Subarray I
|
|
|
|
|
|
|
|
|
|
|
|
Permutation in String
|
|
|
|
|
|
|
|
|
|
|
|
Range Sum Query - Immutable
|
|
|
|
|
|
|
|
|
|
|
|
Subarray Sum Equals K
|
|
|
|
|
|
|
|
|
|
|
|
Two Sum II - Input Array Is Sorted
|
|
|
|
|
|
|
|
|
|
|
|
Valid Palindrome
|
|
|
|
|
|
|
|
|
|
|
| Week-3 |
|
Baseball Game
|
|
|
|
|
|
|
|
|
|
|
|
Daily Temperatures
|
|
|
|
|
|
|
|
|
|
|
|
Design Circular Queue
|
|
|
|
|
|
|
|
|
|
|
|
Final Prices With a Special Discount in a Shop
|
|
|
|
|
|
|
|
|
|
|
|
Implement Queue using Stacks
|
|
|
|
|
|
|
|
|
|
|
|
Implement Stack using Queues
|
|
|
|
|
|
|
|
|
|
|
|
Linked List Cycle
|
|
|
|
|
|
|
|
|
|
|
|
Middle of the Linked List
|
|
|
|
|
|
|
|
|
|
|
|
Next Greater Element I
|
|
|
|
|
|
|
|
|
|
|
|
Number of Recent Calls
|
|
|
|
|
|
|
|
|
|
|
|
Online Stock Span
|
|
|
|
|
|
|
|
|
|
|
|
Remove All Adjacent Duplicates In String
|
|
|
|
|
|
|
|
|
|
|
|
Remove Element
|
|
|
|
|
|
|
|
|
|
|
|
Remove Nth Node From End of List
|
|
|
|
|
|
|
|
|
|
|
|
Valid Parentheses
|
|
|
|
|
|
|
|
|
|
|
| Week-4 |
|
Binary Search
|
|
|
|
|
|
|
|
|
|
|
|
Count of Smaller Numbers After Self
|
|
|
|
|
|
|
|
|
|
|
|
Find First and Last Position of Element in Sorted Array
|
|
|
|
|
|
|
|
|
|
|
|
Guess Number Higher or Lower
|
|
|
|
|
|
|
|
|
|
|
|
Height Checker
|
|
|
|
|
|
|
|
|
|
|
|
Koko Eating Bananas
|
|
|
|
|
|
|
|
|
|
|
|
Maximum Product of Two Elements in an Array
|
|
|
|
|
|
|
|
|
|
|
|
Merge Sorted Array
|
|
|
|
|
|
|
|
|
|
|
|
Minimum Absolute Difference
|
|
|
|
|
|
|
|
|
|
|
|
Relative Sort Array
|
|
|
|
|
|
|
|
|
|
|
|
Search Insert Position
|
|
|
|
|
|
|
|
|
|
|
|
Search a 2D Matrix
|
|
|
|
|
|
|
|
|
|
|
|
Sort Array By Parity
|
|
|
|
|
|
|
|
|
|
|
|
Sort Colors
|
|
|
|
|
|
|
|
|
|
|
|
Sort an Array
|
|
|
|
|
|
|
|
|
|
|
| Week-5 |
|
Contains Duplicate
|
|
|
|
|
|
|
|
|
|
|
|
Word Pattern
|
|
|
|
|
|
|
|
|
|
|
|
Isomorphic Strings
|
|
|
|
|
|
|
|
|
|
|
|
Longest Palindrome
|
|
|
|
|
|
|
|
|
|
|
|
Maximum Number of Balloons
|
|
|
|
|
|
|
|
|
|
|
|
Happy Number
|
|
|
|
|
|
|
|
|
|
|
|
Unique Morse Code Words
|
|
|
|
|
|
|
|
|
|
|
|
Unique Email Addresses
|
|
|
|
|
|
|
|
|
|
|
|
Find the Difference
|
|
|
|
|
|
|
|
|
|
|
|
Find the Difference of Two Arrays
|
|
|
|
|
|
|
|
|
|
|
|
Longest Consecutive Sequence
|
|
|
|
|
|
|
|
|
|
|
|
Kth Largest Element in a Stream
|
|
|
|
|
|
|
|
|
|
|
|
Last Stone Weight
|
|
|
|
|
|
|
|
|
|
|
|
Kth Largest Element in an Array
|
|
|
|
|
|
|
|
|
|
|
|
K Closest Points to Origin
|
|
|
|
|
|
|
|
|
|
|
|
Top K Frequent Elements
|
|
|
|
|
|
|
|
|
|
|
| Week-6 |
|
Find if Path Exists in Graph
|
|
|
|
|
|
|
|
|
|
|
|
Find Center of Star Graph
|
|
|
|
|
|
|
|
|
|
|
|
Count Unreachable Pairs of Nodes in an Undirected Graph
|
|
|
|
|
|
|
|
|
|
|
|
Number of Islands
|
|
|
|
|
|
|
|
|
|
|
|
Max Area of Island
|
|
|
|
|
|
|
|
|
|
|
|
Island Perimeter
|
|
|
|
|
|
|
|
|
|
|
|
Surrounded Regions
|
|
|
|
|
|
|
|
|
|
|
|
Rotting Oranges
|
|
|
|
|
|
|
|
|
|
|
|
01 Matrix
|
|
|
|
|
|
|
|
|
|
|
|
Nearest Exit from Entrance in Maze
|
|
|
|
|
|
|
|
|
|
|
|
Course Schedule
|
|
|
|
|
|
|
|
|
|
|
|
Course Schedule II
|
|
|
|
|
|
|
|
|
|
|
|
Find Eventual Safe States
|
|
|
|
|
|
|
|
|
|
|
|
Pacific Atlantic Water Flow
|
|
|
|
|
|
|
|
|
|
|
|
Flood Fill
|
|
|
|
|
|
|
|
|
|
|
|
Count Sub Islands
|
|
|
|
|
|
|
|
|
|
|
| Week-7 |
|
Binary Tree Inorder Traversal
|
|
|
|
|
|
|
|
|
|
|
|
Binary Tree Preorder Traversal
|
|
|
|
|
|
|
|
|
|
|
|
Binary Tree Postorder Traversal
|
|
|
|
|
|
|
|
|
|
|
|
Maximum Depth of N-ary Tree
|
|
|
|
|
|
|
|
|
|
|
|
Minimum Depth of Binary Tree
|
|
|
|
|
|
|
|
|
|
|
|
Maximum Depth of Binary Tree
|
|
|
|
|
|
|
|
|
|
|
|
Same Tree
|
|
|
|
|
|
|
|
|
|
|
|
Search in a Binary Search Tree
|
|
|
|
|
|
|
|
|
|
|
|
Insert into a Binary Search Tree
|
|
|
|
|
|
|
|
|
|
|
|
Validate Binary Search Tree
|
|
|
|
|
|
|
|
|
|
|
|
Lowest Common Ancestor of a Binary Search Tree
|
|
|
|
|
|
|
|
|
|
|
|
Binary Tree Level Order Traversal
|
|
|
|
|
|
|
|
|
|
|
|
Binary Tree Level Order Traversal II
|
|
|
|
|
|
|
|
|
|
|
|
Average of Levels in Binary Tree
|
|
|
|
|
|
|
|
|
|
|
|
Symmetric Tree
|
|
|
|
|
|
|
|
|
|
|
|
Invert Binary Tree
|
|
|
|
|
|
|
|
|
|
|
| Week-8 |
|
Subsets
|
|
|
|
|
|
|
|
|
|
|
|
Subsets II
|
|
|
|
|
|
|
|
|
|
|
|
Permutations
|
|
|
|
|
|
|
|
|
|
|
|
Permutations II
|
|
|
|
|
|
|
|
|
|
|
|
Combinations
|
|
|
|
|
|
|
|
|
|
|
|
Combination Sum
|
|
|
|
|
|
|
|
|
|
|
|
Combination Sum II
|
|
|
|
|
|
|
|
|
|
|
|
Letter Combinations of a Phone Number
|
|
|
|
|
|
|
|
|
|
|
|
Generate Parentheses
|
|
|
|
|
|
|
|
|
|
|
|
Word Search
|
|
|
|
|
|
|
|
|
|
|
|
Water and Jug Problem
|
|
|
|
|
|
|
|
|
|
|
| Week-9 |
|
Single Number
|
|
|
|
|
|
|
|
|
|
|
|
Number of 1 Bits
|
|
|
|
|
|
|
|
|
|
|
|
Hamming Distance
|
|
|
|
|
|
|
|
|
|
|
|
Counting Bits
|
|
|
|
|
|
|
|
|
|
|
|
Missing Number
|
|
|
|
|
|
|
|
|
|
|
|
Reverse Bits
|
|
|
|
|
|
|
|
|
|
|
|
Power of Two
|
|
|
|
|
|
|
|
|
|
|
|
Power of Four
|
|
|
|
|
|
|
|
|
|
|
|
Power of Three
|
|
|
|
|
|
|
|
|
|
|
|
Bitwise AND of Numbers Range
|
|
|
|
|
|
|
|
|
|
|
|
Complement of Base 10 Integer
|
|
|
|
|
|
|
|
|
|
|
|
Binary Number with Alternating Bits
|
|
|
|
|
|
|
|
|
|
|
|
Number Complement
|
|
|
|
|
|
|
|
|
|
|
|
Divide Two Integers
|
|
|
|
|
|
|
|
|
|
|
|
Sort Integers by The Number of 1 Bits
|
|
|
|
|
|
|
|
|
|
|