Questions
Questions
Questions
Dynamic Programming
Day 1 Climbing Stairs
Day 2 Min Cost Climbing Stairs
Day 3 0-1 Knapsack Problem
Day 4 Target Sum
Day 5 Revision
Day 6 Knapsack with Duplicate Items
Day 7 Rod Cutting
Day 8 Best Time to Buy and Sell Stock
Day 9 Jump Game
Day 10 Nth Catalan Number
Day 11 Unique Paths
Day 12 Minimum Falling Path Sum
Day 13 Number of Dice Rolls with Target Sum
Day 14 Longest Common Subsequence
Day 15 Edit Distance
HashMap
Day 1 Count frequencies of all elements in array
Day 2 Intersection of Two Arrays
Day 3 Check if Array Pairs are divisible by k
Day 4 Count distinct elements in every window
Day 5 Longest Substring without repeating characters
Day 6 Count of substrings having at most k unique charact
Day 7 Equal 0,1 and 2
Day 8 Subarray sums divisible by k
Day 9 Rabbits in Forest
Trees
Day 1 Maximum Depth of Binary Tree
Day 2 Binary Tree Pre-order Traversal
Day 3 Merge two binary trees
Day 4 Sum of Root To Leaf Binary Numbers
Day 5 Path Sum
Day 6 Binary Tree Pre-order Traversal
Day 7 Left view of Binary Tree
Day 8 Binary Tree inorder traversal
Day 9 Level order traversal
Day 10 Maximum Depth of Binary Tree
Day 11 Sum of left leaves
Day 12 Cousins in Binary Tree
Day 13 Construct Binary Tree from PreOrder and Inorder Tr
Day 14 Lowest Common Ancestor of a Binary Tree
Day 15 Lowest Common Ancestor of a Binary Tree 3
is gfg, cyan is lintcode , red is codingninja
Coin Change
Fibonacci Number
N-th Tribonacci Number
Coin Change 2
Dungeon Game
Leaf-similar trees
Invert Binary Tree
Binary Tree Inorder Travsersal
Same Tree
Best Time to Buy and Sell Stock with cooldown
Palindrome Partitioning 4
Graph
Day 1 DFS of a Graph
Day 2 Number of Provinces
Day 3 Number of Closed Islands
Day 4 Detect cycle in a directed graph
Day 5 Detect cycle in an undirected graph
Day 6 Course Schedule 2
Day 7 Implementing Djikstra Algorithm
Day 8 Flyod Warshal Algorithm
Day 9 Bellman-Ford Algorithm
Day 10 is Graph Bipartite ?
Day 11 Prims MST | Greedy Algo 5 (Article)
Day 12 Critical Connections in a Network
Day 13 Kruskals Mininmum Spanning Tree
Day 14 Number of Provinces
Binary Search
Day 1 Binary Search
Day 2 Search Insert Position
Day 3 Search in Rotated Sorted Array
Day 4 Allocate minimum number of pages
Day 5 Search in Rotated Sorted Array 2
Diameter of N-ary Tree
Subsets 2
Combination Sum 2
N-Queens
N Queens II
The Knight's Tour Problem
Power of 2
BFS of a Graph
Number of Islands
Word Search
Detect cycle in an undirected graph
Topological Sorting
Course Schedule
Network Delay Time
Floyd Warshal
Negative weight Cycle
Possible Bipartition
Minimum Spanning Tree
Tarjan's Algorithm to find Stro
Minimum Spanning Tree
The Celebrity Problem
Topological Sort
Topological Sort
Cheapest Flights Within K Stops
Find the city with the smallest number of neighbours at a threshold distance
Cheapest Flights Within K Stops
Cheapest Flights Within K Stops
Min Cost to Connect all points
Alien Dictionary
Number of Occurences
Guess number higher or lower
Search a 2d Matrix
Koko eating bananas
Validate Binary Search Tree
Binary Tree Inorder Traversal
Power of 2
Binary Watch
Knights tour official
Number of Provinces
Flood fill
Alien Dictionary
Find maximum
t a threshold distance
Power of 3
Combination Sum 4
Why prims and kruskal (GFG Article)
Power of 4
ets in groups