Striver-SDE-Sheet-Challenge

Start Date	End Date
5 June 2022	29 June 2022

🔴 No Question Solved 🟥
🟡 Some Questions Solved🟨
🟢 All Questions Solved 🟩

Day-1: (Arrays)

S.No.	Topic:	Problems	Solutions
1	`Array`	Set Matrix Zeroes	✔️
2	`Array`	Pascal’s Triangler	✔️
3	`Array`	Next Permutation	✔️
4	`Array`	Kadane’s Algorithm	✔️
5	`Array`	Sort an array of 0’s 1’s 2’s	✔️
6	`Array`	Stock buy and Sell	✔️

⬆️ Back to Top

Day-2: (Arrays)

S.No.	Topic:	Problems	Solutions
1	`Array`	Rotate Matrix	✔️
2	`Array`	Pascal’s Triangler	✔️
3	`Array`	Merge two sorted Arrays without extra space	✔️
4	`Array`	Find the duplicate in an array of N+1 integers	✔️
5	`Array`	Repeat and Missing Number	✔️
6	`Array`	Inversion of Array (Pre-req: Merge Sort)	✔️

⬆️ Back to Top

Day-3: (Arrays)

S.No.	Topic:	Problems	Solutions
1	`Array`	Search in a 2d Matrix	✔️
2	`Array`	Pow(X,n)	✔️
3	`Array`	Majority Element (>N/2 times)	✔️
4	`Array`	Majority Element (>N/3 times)	✔️
5	`Array`	Grid Unique Paths	✔️
6	`Array`	Reverse Pairs	✔️

⬆️ Back to Top

Day-4: (Arrays)

S.No.	Topic:	Problems	Solutions
1	`Array`	2-Sum-Problem	✔️
2	`Array`	4-Sum-Problem	✔️
3	`Array`	Longest Consecutive Sequence	✔️
4	`Array`	Largest Subarray with 0 sum	✔️
5	`Array`	Count number of subarrays with given Xor K	✔️
6	`Array`	Longest Substring without repeat	✔️

⬆️ Back to Top

Day-5: (Linked List)

S.No.	Topic:	Problems	Solutions
1	`Linked List`	Reverse a LinkedList	✔️
2	`Linked List`	Find the middle of LinkedList	✔️
3	`Linked List`	Merge two sorted Linked List (use method used in mergeSort)	✔️
4	`Linked List`	Remove N-th node from back of LinkedList	✔️
5	`Linked List`	Add two numbers as LinkedList	✔️
6	`Linked List`	Delete a given Node when a node is given.(0(1) solution)	✔️

⬆️ Back to Top

Day-6: (Linked List)

S.No.	Topic:	Problems	Solutions
1	`Linked List`	Find intersection point of Y LinkedList	✔️
2	`Linked List`	Detect a cycle in Linked List	✔️
3	`Linked List`	Reverse a LinkedList in groups of size k	✔️
4	`Linked List`	Check if a LinkedList is palindrome or not	✔️
5	`Linked List`	Find the starting point of the Loop of LinkedList	✔️
6	`Linked List`	Flattening of a LinkedList	✔️

⬆️ Back to Top

Day-7: (Linked List and Arrays)

S.No.	Topic:	Problems	Solutions
1	`Linked List and Arrays`	Rotate a LinkedList	✔️
2	`Linked List and Arrays`	Clone a Linked List with random and next pointer	✔️
3	`Linked List and Arrays`	3 sum	✔️
4	`Linked List and Arrays`	Trapping rainwater	✔️
5	`Linked List and Arrays`	Remove Duplicate from Sorted array	✔️
6	`Linked List and Arrays`	Max consecutive ones	✔️

⬆️ Back to Top

Day-8: (Greedy Algorithm)

S.No.	Topic:	Problems	Solutions
1	`Greedy Algorithm`	N meetings in one room	✔️
2	`Greedy Algorithm`	Minimum number of platforms required for a railway	✔️
3	`Greedy Algorithm`	Job sequencing Problem	✔️
4	`Greedy Algorithm`	Fractional Knapsack Problem	✔️
5	`Greedy Algorithm`	Greedy algorithm to find minimum number of coins	✔️
6	`Greedy Algorithm`	Activity Selection (it is the same as N meeting in one room)	✔️

⬆️ Back to Top

Day-9: (Recursion)

S.No.	Topic:	Problems	Solutions
1	`Recursion`	Subset Sums	✔️
2	`Recursion`	Subset-II	✔️
3	`Recursion`	Combination sum-1	✔️
4	`Recursion`	Combination sum-2	✔️
5	`Recursion`	Palindrome Partitioning	✔️
6	`Recursion`	K-th permutation Sequence	✔️

⬆️ Back to Top

Day-10: (Recursion and Backtracking)

S.No.	Topic:	Problems	Solutions
1	`Recursion and Backtracking`	Print all permutations of a string/array	✔️
2	`Recursion and Backtracking`	N queens Problem	✔️
3	`Recursion and Backtracking`	Sudoku Solver	✔️
4	`Recursion and Backtracking`	M coloring Problem	✔️
5	`Recursion and Backtracking`	Rat in a Maze	✔️
6	`Recursion and Backtracking`	Word Break (print all ways)	✔️

⬆️ Back to Top

Day-11: (Binary Search)

S.No.	Topic:	Problems	Solutions
1	`Binary Search`	The N-th root of an integer	✔️
2	`Binary Search`	Matrix Median	✔️
3	`Binary Search`	Find the element that appears once in a sorted array, and the rest element appears twice (Binary search)	✔️
4	`Binary Search`	Search element in a sorted and rotated array/ find pivot where it is rotated	✔️
5	`Binary Search`	Median of 2 sorted arrays	✔️
6	`Binary Search`	K-th element of two sorted arrays	✔️
7	`Binary Search`	Allocate Minimum Number of Pages	✔️
8	`Binary Search`	Aggressive Cows	✔️

⬆️ Back to Top

Day-12: (Heaps)

S.No.	Topic:	Problems	Solutions
1	`Heaps`	Max heap, Min Heap Implementation (Only for interviews)	✔️
2	`Heaps`	Kth Largest Element	✔️
3	`Heaps`	Maximum Sum Combination	✔️
4	`Heaps`	Find Median from Data Stream	✔️
5	`Heaps`	Merge K sorted arrays	✔️
6	`Heaps`	K most frequent elements	✔️

⬆️ Back to Top

Day-13: (Stack and Queue)

S.No.	Topic:	Problems	Solutions
1	`Stack and Queue`	Implement Stack Using Arrays	✔️
2	`Stack and Queue`	Implement Queue Using Arrays	✔️
3	`Stack and Queue`	Implement Stack using Queue (using single queue)	✔️
4	`Stack and Queue`	Implement Queue using Stack (0(1) amortized method)	✔️
5	`Stack and Queue`	Check for balanced parentheses	✔️
6	`Stack and Queue`	Next Greater Element	✔️
7	`Stack and Queue`	Sort a Stack	✔️

⬆️ Back to Top

Day-14: (Stack and Queue)

S.No.	Topic:	Problems	Solutions
1	`Stack and Queue`	Next Smaller Element	✔️
2	`Stack and Queue`	LRU cache (IMPORTANT)	✔️
3	`Stack and Queue`	LFU Cache	✔️
4	`Stack and Queue`	Largest rectangle in a histogram	✔️
5	`Stack and Queue`	Sliding Window maximum	✔️
6	`Stack and Queue`	Implement Min Stack	✔️
7	`Stack and Queue`	Rotten Orange (Using BFS)	✔️
8	`Stack and Queue`	Stock Span Problem	✔️
9	`Stack and Queue`	Find the maximum of minimums of every window size	✔️
10	`Stack and Queue`	The Celebrity Problem	✔️

⬆️ Back to Top

Day-15: (String)

S.No.	Topic:	Problems	Solutions
1	`String`	Reverse Words in a String	✔️
2	`String`	Longest Palindrome in a string	✔️
3	`String`	Roman Number to Integer and vice versa	✔️
4	`String`	Implement ATOI/STRSTR	✔️
5	`String`	Longest Common Prefix	✔️
6	`String`	Rabin Karp	✔️

⬆️ Back to Top

Day-16: (String)

S.No.	Topic:	Problems	Solutions
1	`String`	Z-Function	✔️
2	`String`	KMP algo / LPS(pi) array	✔️
3	`String`	Minimum characters needed to be inserted in the beginning to make it palindromic	✔️
4	`String`	Check for Anagrams	✔️
5	`String`	Count and Say	✔️
6	`String`	Compare version numbers	✔️

⬆️ Back to Top

Day-17: (Binary Tree)

S.No.	Topic:	Problems	Solutions
1	`Binary Tree`	Inorder Traversal	✔️
2	`Binary Tree`	Preorder Traversal	✔️
3	`Binary Tree`	Postorder Traversal	✔️
4	`Binary Tree`	Morris Inorder Traversal	✔️
5	`Binary Tree`	Morris Preorder Traversal	✔️
6	`Binary Tree`	LeftView Of Binary Tree	✔️
7	`Binary Tree`	Bottom View of Binary Tree	✔️
8	`Binary Tree`	Top View of Binary Tree	✔️
9	`Binary Tree`	Preorder inorder postorder in a single traversal	✔️
10	`Binary Tree`	Vertical order traversal	✔️
11	`Binary Tree`	Root to node path in a Binary Tree	✔️
12	`Binary Tree`	Max width of a Binary Tree	✔️

⬆️ Back to Top

Day-18: (Binary Tree)

S.No.	Topic:	Problems	Solutions
1	`Binary Tree`	Level order Traversal / Level order traversal in spiral form	✔️
2	`Binary Tree`	Height of a Binary Tree	✔️
3	`Binary Tree`	Diameter of Binary Tree	✔️
4	`Binary Tree`	Check if the Binary tree is height-balanced or not	✔️
5	`Binary Tree`	LCA in Binary Tree	✔️
6	`Binary Tree`	Check if two trees are identical or not	✔️
7	`Binary Tree`	Zig Zag Traversal of Binary Tree	✔️
8	`Binary Tree`	Boundary Traversal of Binary Tree	✔️

⬆️ Back to Top

Day-19: (Binary Tree)

S.No.	Topic:	Problems	Solutions
1	`Binary Tree`	Maximum path sum	✔️
2	`Binary Tree`	Construct Binary Tree from inorder and preorder	✔️
3	`Binary Tree`	Construct Binary Tree from Inorder and Postorder	✔️
4	`Binary Tree`	Symmetric Binary Tree	✔️
5	`Binary Tree`	Flatten Binary Tree to LinkedList	✔️
6	`Binary Tree`	Check if Binary Tree is the mirror of itself or not	✔️
7	`Binary Tree`	Check for Children Sum Property	✔️

⬆️ Back to Top

Day-20: (Binary Search Tree)

S.No.	Topic:	Problems	Solutions
1	`Binary Search Tree`	Populate Next Right pointers of Tree	✔️
2	`Binary Search Tree`	Search given Key in BST	✔️
3	`Binary Search Tree`	Construct BST from given keys	✔️
4	`Binary Search Tree`	Construct BST from preorder traversal	✔️
5	`Binary Search Tree`	Check is a BT is BST or not	✔️
6	`Binary Search Tree`	Find LCA of two nodes in BST	✔️
7	`Binary Search Tree`	Find the inorder predecessor/successor of a given Key in BST	✔️

⬆️ Back to Top

Day-21: (Binary Search Tree)

S.No.	Topic:	Problems	Solutions
1	`Binary Search Tree`	Floor in a BST	✔️
2	`Binary Search Tree`	Ceil in a BST	✔️
3	`Binary Search Tree`	Find K-th smallest element in BST	✔️
4	`Binary Search Tree`	Find K-th largest element in BST	✔️
5	`Binary Search Tree`	Find a pair with a given sum in BST	✔️
6	`Binary Search Tree`	BST iterator	✔️
7	`Binary Search Tree`	Size of the largest BST in a Binary Tree	✔️
8	`Binary Search Tree`	Serialize and deserialize Binary Tree	✔️

⬆️ Back to Top

Day-22: (Binary Trees [Miscellaneous])

S.No.	Topic:	Problems	Solutions
1	`Binary Trees [Miscellaneous]`	Binary Tree to Double Linked List	✔️
2	`Binary Trees [Miscellaneous]`	Find median in a stream of running integers	✔️
3	`Binary Trees [Miscellaneous]`	K-th largest element in a stream	✔️
4	`Binary Trees [Miscellaneous]`	Distinct numbers in Window	✔️
5	`Binary Trees [Miscellaneous]`	K-th largest element in an unsorted array	✔️
6	`Binary Trees [Miscellaneous]`	Flood-fill Algorithm	✔️

⬆️ Back to Top

Day-23: (Graph)

S.No.	Topic:	Problems	Solutions
1	`Graph`	Clone a graph (Not that easy as it looks)	✔️
2	`Graph`	DFS	✔️
3	`Graph`	BFS	✔️
4	`Graph`	Detect A cycle in Undirected Graph using BFS	✔️
5	`Graph`	Detect A cycle in Undirected Graph using DFS	✔️
6	`Graph`	Detect A cycle in a Directed Graph using DFS	✔️
7	`Graph`	Detect A cycle in a Directed Graph using BFS	✔️
8	`Graph`	Topological Sort BFS	✔️
9	`Graph`	Topological Sort DFS	✔️
10	`Graph`	Number of islands(Do in Grid and Graph Both)	✔️
11	`Graph`	Bipartite Check using BFS	✔️
12	`Graph`	Bipartite Check using DFS	❌

⬆️ Back to Top

Day-24: (Graph)

S.No.	Topic:	Problems	Solutions
1	`Graph`	Strongly Connected Component(using KosaRaju’s algo)	✔️
2	`Graph`	Dijkstra’s Algorithm	✔️
3	`Graph`	Bellman-Ford Algo	✔️
4	`Graph`	Floyd Warshall Algorithm	✔️
5	`Graph`	MST using Prim’s Algo	✔️
6	`Graph`	MST using Kruskal’s Algo	✔️

⬆️ Back to Top

Day-25: (Dynamic Programming)

S.No.	Topic:	Problems	Solutions
1	`Dynamic Programming`	Max Product Subarray	✔️
2	`Dynamic Programming`	Longest Increasing Subsequence	✔️
3	`Dynamic Programming`	Longest Common Subsequence	✔️
4	`Dynamic Programming`	0-1 Knapsack	✔️
5	`Dynamic Programming`	Edit Distance	✔️
6	`Dynamic Programming`	Maximum sum increasing subsequence	✔️
7	`Dynamic Programming`	Matrix Chain Multiplication	✔️

⬆️ Back to Top

Day-26: (Dynamic Programming)

S.No.	Topic:	Problems	Solutions
1	`Dynamic Programming`	Minimum sum path in the matrix, (count paths and similar type do, also backtrack to find the Minimum path)	✔️
2	`Dynamic Programming`	Coin change	✔️
3	`Dynamic Programming`	Subset Sum	✔️
4	`Dynamic Programming`	Rod Cutting	✔️
5	`Dynamic Programming`	Egg Dropping	✔️
6	`Dynamic Programming`	Word Break	✔️
7	`Dynamic Programming`	Palindrome Partitioning (MCM Variation)	✔️
8	`Dynamic Programming`	Maximum profit in Job scheduling	✔️

⬆️ Back to Top

Day-27: (Trie)

S.No.	Topic:	Problems	Solutions
1	`Trie`	Implement Trie (Prefix Tree)	✔️
2	`Trie`	Implement Trie – 2 (Prefix Tree)	✔️
3	`Trie`	Longest String with All Prefixes	✔️
4	`Trie`	Number of Distinct Substrings in a String	✔️
5	`Trie`	Power Set (this is very important)	✔️
6	`Trie`	Maximum XOR of two numbers in an array	✔️
7	`Trie`	Maximum XOR With an Element From Array	✔️

Name		Name	Last commit message	Last commit date
Latest commit History 194 Commits
01]. Day-1 (Arrays)		01]. Day-1 (Arrays)
02]. Day-2 (Arrays)		02]. Day-2 (Arrays)
03]. Day-3 (Arrays)		03]. Day-3 (Arrays)
04]. Day-4 (Arrays)		04]. Day-4 (Arrays)
05]. Day-5 (Linked List)		05]. Day-5 (Linked List)
06]. Day-6 (Linked List)		06]. Day-6 (Linked List)
07]. Day-7 (Linked List and Arrays)		07]. Day-7 (Linked List and Arrays)
08]. Day-8 (Greedy Algorithm)		08]. Day-8 (Greedy Algorithm)
09]. Day-9 (Recursion)		09]. Day-9 (Recursion)
10]. Day-10 (Recursion and Backtracking)		10]. Day-10 (Recursion and Backtracking)
11]. Day-11 (Binary Search)		11]. Day-11 (Binary Search)
12]. Day-12 (Heaps)		12]. Day-12 (Heaps)
13]. Day-13 (Stack and Queue)		13]. Day-13 (Stack and Queue)
14]. Day-14 (Stack and Queue)		14]. Day-14 (Stack and Queue)
15]. Day-15 (String)		15]. Day-15 (String)
16]. Day-16 (String)		16]. Day-16 (String)
17]. Day-17 (Binary Tree)		17]. Day-17 (Binary Tree)
18]. Day-18 (Binary Tree)		18]. Day-18 (Binary Tree)
19]. Day-19 (Binary Tree)		19]. Day-19 (Binary Tree)
20]. Day-20 (Binary Search Tree)		20]. Day-20 (Binary Search Tree)
21]. Day-21 (Binary Search Tree)		21]. Day-21 (Binary Search Tree)
22]. Day-22 (Binary Trees [Miscellaneous])		22]. Day-22 (Binary Trees [Miscellaneous])
23]. Day-23 (Graph)		23]. Day-23 (Graph)
24]. Day-24 (Graph)		24]. Day-24 (Graph)
25]. Day-25 (Dynamic Programming)		25]. Day-25 (Dynamic Programming)
26]. Day-26 (Dynamic Programming)		26]. Day-26 (Dynamic Programming)
27]. Day-27 (Trie)		27]. Day-27 (Trie)
README.md		README.md

AkashSingh3031/Striver-SDE-Sheet-Challenge

Folders and files

Latest commit

History

Repository files navigation

Day-1: (Arrays)

Day-2: (Arrays)

Day-3: (Arrays)

Day-4: (Arrays)

Day-5: (Linked List)

Day-6: (Linked List)

Day-7: (Linked List and Arrays)

Day-8: (Greedy Algorithm)

Day-9: (Recursion)

Day-10: (Recursion and Backtracking)

Day-11: (Binary Search)

Day-12: (Heaps)

Day-13: (Stack and Queue)

Day-14: (Stack and Queue)

Day-15: (String)

Day-16: (String)

Day-17: (Binary Tree)

Day-18: (Binary Tree)

Day-19: (Binary Tree)

Day-20: (Binary Search Tree)

Day-21: (Binary Search Tree)

Day-22: (Binary Trees [Miscellaneous])

Day-23: (Graph)

Day-24: (Graph)

Day-25: (Dynamic Programming)

Day-26: (Dynamic Programming)

Day-27: (Trie)

About

Topics

Resources

Stars

Watchers

Forks

Languages