Introduction

If you are looking for a resource where you can learn Data structures in-depth. TakeUForward SDE sheet is highly recommended.

SDE Sheet contains very handily crafted and picked top coding interview questions from different topics of Data Structures & Algorithms.

---

Day 1: Arrays (6)

• Set Matrix Zeros
• Pascal's Triangle
• Next Permutation
• Kadane's Algorithm
• Sort an array of 0's, 1's and 2's
• Stock Buy and Sell

Day 2: Arrays Part-II (6)

• Rotate Matrix
• Merge Overlapping Subintervals
• Merge two sorted arrays without extra spac...
• Find the duplicate in an array of N+1 inte...
• Repeat and Missing Number
• Inversion of Array (Pre-req: Merge Sort)

Day 3: Arrays Part-III (6)

• Search in a 2 D matrix
• Pow(x, n)
• Majority Element (>n/2 times)
• Majority Element (n/3 times)
• Grid Unique Paths
• Reverse Pairs (Leetcode)

Day 4: Arrays Part-IV (6)

• 2Sum Problem
• 4-Sum Problem
• Longest Consecutive Sequence
• Largest Subarray with K sum
• Count number of subarrays with given xor K
• Longest Substring without repeat

Day 5: Linked List (6)

• Reverse a LinkedList
• Find the middle of LinkedList
• Merge two sorted Linked List (use method u...
• Remove N-th node from back of LinkedList
• Add two numbers as LinkedList
• Delete a given Node when a node is given.(...

Day 6: Linked List Part-II (6)

• Find intersection point of Y LinkedList
• Detect a cycle in Linked List
• Reverse a LinkedList in groups of size k.
• Check if a LinkedList is palindrome or not...
• Find the starting point of the Loop of Lin...
• Flattening of a LinkedList

Day 7: Linked List and Arrays (6)

• Rotate a LinkedList
• Clone a Linked List with random and next p...
• 3 sum
• Trapping Rainwater
• Remove Duplicate from Sorted array
• Max consecutive ones

Day 8: Greedy Algorithm (6)

• N meetings in one room
• Minimum number of platforms required for a...
• Job sequencing Problem
• Fractional Knapsack Problem
• Greedy algorithm to find minimum number of...
• Activity Selection it is the same as N me...

Day 9: Recursion (6)

• Subset Sums
• Subset-II
• Combination sum-1
• Combination sum-2
• Palindrome Partitioning
• K-th permutation Sequence

Day 10: Recursion and Backtracking (0/6)

• Print all permutations of a string/array
• N queens Problem
• Sudoko Solver
• M Coloring Problem
• Rat in a Maze
• Word Break (print all ways)

Day 11: Binary Search (8)

• The N-th root of an integer
• Matrix Median
• Find the element that appears once in a so...
• Search element in a sorted and rotated arr...
• Median of 2 sorted arrays
• K-th element of two sorted arrays
• Allocate Minimum Number of Pages
• Aggressive Cows

Day 12: Heaps (6)

• Max heap, Min Heap Implementation Only fo...
• Kth Largest Element
• Maximum Sum Combination
• Find Median from Data Stream
• Merge K sorted arrays
• K most frequent elements

Day 13: Stack and Queue (7)

• Implement Stack using Arrays
• Implement Queue using Arrays
• Implement Stack using Queue using single ...
• Implement Queue using Stack 0(1) amortize...
• Check for balanced parentheses
• Next Greater Element
• Sort a Stack

Day 14: Stack and Queue Part-II (10)

• Next Smaller Element
• LRU cache (IMPORTANT)
• LFU cache
• Largest rectangle in a histogram
• Sliding Window maximum
• Implement Min Stack
• Rotten Orange (Using BFS)
• Stock span problem
• Find the maximum of minimums of every wind...
• The Celebrity Problem

Day 15: String (6)

• Reverse Words in a String
• Longest Palindrome in a string
• Roman Number to Integer and vice versa
• Implement ATOI/STRSTR
• Longest Common Prefix
• Rabin Karp

Day 16: String Part-II (6)

• Z-Function
• KMP algo / LPS(pi) array
• Minimum characters needed to be inserted i...
• Check for Anagrams
• Count and say
• Compare version numbers

Day 17: Binary Tree (12)

• Inorder Traversal
• Preorder Traversal
• Postorder Traversal
• Morris Inorder Traversal
• Morris Preorder Traversal
• LeftView Of Binary Tree
• Bottom View of Binary Tree
• Top View of Binary Tree
• Preorder inorder postorder in a single tra...
• Vertical order traversal
• Root to Node Path in Binary Tree
• Max width of a Binary Tree

Day 18: Binary Tree part-II (8)

• Level order Traversal / Level order traver...
• Height of a Binary Tree
• Diameter of Binary Tree
• Check if the Binary tree is height-balance...
• LCA in Binary Tree
• Check if two trees are identical or not
• Zig Zag Traversal of Binary Tree
• Boundary Traversal of Binary Tree

Day 19: Binary Tree part-III (7)

• Maximum path sum
• Construct Binary Tree from inorder and pre...
• Construct Binary Tree from Inorder and Pos...
• Symmetric Binary Tree
• Flatten Binary Tree to LinkedList
• Check if Binary Tree is the mirror of itse...
• Check for Children Sum Property

Day 20: Binary Search Tree (7)

• Populate Next Right pointers of Tree
• Search given Key in BST
• Construct BST from given keys
• Construct a BST from a preorder traversal
• Check is a BT is BST or not
• Find LCA of two nodes in BST
• Find the inorder predecessor/successor of ...

Day 21: Binary Search Tree Part-II (8)

• Floor in a BST
• Ceil in a BST
• Find K-th smallest element in BST
• Find K-th largest element in BST
• Find a pair with a given sum in BST
• BST iterator
• Size of the largest BST in a Binary Tree
• Serialize and deserialize Binary Tree

Day 22: Binary Trees[Miscellaneous] (6)

• Binary Tree to Double Linked List
• Find median in a stream of running integer...
• K-th largest element in a stream.
• Distinct numbers in Window.
• K-th largest element in an unsorted array.
• Flood-fill Algorithm

Day 23: Graph (12)

• Clone a graph (Not that easy as it looks)
• DFS
• BFS
• Detect A cycle in Undirected Graph using B...
• Detect A cycle in Undirected Graph using D...
• Detect A cycle in a Directed Graph using D...
• Detect A cycle in a Directed Graph using B...
• Topological Sort BFS
• Topological Sort DFS
• Number of islands Do in Grid and Graph Bot...
• Bipartite Check using BFS
• Bipartite Check using DFS

Day 24: Graph Part-II (6)

• Strongly Connected Component using KosaRaj...
• Dijkstra's Algorithm
• Bellman-Ford Algo
• Floyd Warshall Algorithm
• MST using Prim's Algo
• MST using Kruskal's Algo

Day 25: Dynamic Programming (7)

• Max Product Subarray
• Longest Increasing Subsequence
• Longest Common Subsequence
• 0-1 Knapsack
• Edit Distance
• Maximum sum increasing subsequence
• Matrix Chain Multiplication

Day 26: Dynamic Programming Part-II (8)

• Minimum sum path in the matrix, count pat...
• Coin change
• Subset Sum
• Rod Cutting
• Egg Dropping
• Word Break
• Palindrome Partitioning (MCM Variation)
• Maximum profit in Job scheduling

Day 27: Trie (7)

• Implement Trie (Prefix Tree)
• Implement Trie - 2 (Prefix Tree)
• Longest String with All Prefixes
• Number of Distinct Substrings in a String
• Power Set (this is very important)
• Maximum XOR of two numbers in an array
• Maximum XOR With an Element From Array

Day 28: Operating System

1. Refer Sheet for revision.
2. Revise OS notes that you would have made during your sem
3. If not made notes, spend 2 or 3 days and make notes from Knowledge Gate.

Day 29: DBMS

1. Refer Sheet for revision.
2. Revise DBMS notes that you would have made during your sem
3. If not made notes, spend 2 or 3 days and make notes from Knowledge Gate.

Day 30: Computer Networks

1. Refer Sheet for revision.
2. Revise CN notes that you would have made during your sem
3. If not made notes, spend 2 or 3 days and make notes from Knowledge Gate.

Day 31: Project Overview

Make a note of how will your represent your projects, and prepare all questions related to tech which you have used in your projects. Prepare a note which you can say for 3-10 minutes when he asks you that say something about the project.

Credits

• Striver

Prerequisite

• Javascript Basics
• Willingness to learn

Github

Follow me on Github.