Byte Depth
© 2026 ByteDepth. All rights reserved.Built with care for curious engineers.

DSA · SDE Sheet 200107

107 problems
Implement Queue using StacksStackQueueEasyAug 8, 2026
Online Stock SpanStackQueueMediumAug 8, 2026
Implement Min StackStackQueueMediumAug 8, 2026
Sliding Window MaximumStackQueueHardAug 8, 2026
Maximum Rectangle in HistogramStackQueueHardAug 8, 2026
LFU CacheStackQueueHardAug 8, 2026
Balanced ParenthesesStackQueueEasyAug 8, 2026
Next Greater Element IStackQueueEasyAug 8, 2026
Implement Stack using QueuesStackQueueEasyAug 8, 2026
Queue Using ArrayStackQueueEasyAug 8, 2026
Stack Using ArrayStackQueueEasyAug 8, 2026
Longest Substring Without Repeating CharactersSliding WindowTwo PointersMediumAug 8, 2026
String to Integer (atoi)StringsMediumAug 8, 2026
Compare Version NumbersStringsMediumAug 8, 2026
Count And SayStringsMediumAug 8, 2026
Valid AnagramStringsEasyAug 8, 2026
Longest Common PrefixStringsDPEasyAug 8, 2026
Reverse Linked ListLinked ListEasyAug 8, 2026
Roman to Int or vice versaStringsEasyAug 8, 2026
Longest Palindromic SubstringStringsBSTMediumAug 8, 2026
Reverse Words in a StringStringsMediumAug 8, 2026
Trapping RainwaterStackQueueHardAug 8, 2026
Next Smaller ElementStackQueueMediumAug 8, 2026
Linked List CycleLinked ListEasyAug 8, 2026
Check if LL is palindrome or notLinked ListEasyAug 8, 2026
Reverse Nodes in k-GroupLinked ListHardAug 8, 2026
Find the intersection point of Y LLLinked ListEasyAug 8, 2026
Delete Node in a Linked List O(1)Linked ListEasyAug 8, 2026
Add two numbers as LLLinked ListMediumAug 8, 2026
Remove Nth Node From End of ListLinked ListMediumAug 8, 2026
Merge Two Sorted ListsLinked ListSortingEasyAug 8, 2026
3 SumLinked ListArraysMediumAug 8, 2026
Middle of Linked ListLinked ListEasyAug 8, 2026
Sudoku SolverBacktrackingRecursionHardAug 8, 2026
Rat in a MazeBacktrackingRecursionMediumAug 8, 2026
M Coloring ProblemBacktrackingRecursionMediumAug 8, 2026
N QueensBacktrackingRecursionHardAug 8, 2026
Permutations of a StringBacktrackingRecursionMediumAug 8, 2026
Palindrome partitioningBacktrackingRecursionMediumAug 8, 2026
Combination Sum IIBacktrackingRecursionMediumAug 8, 2026
Combination SumBacktrackingRecursionMediumAug 8, 2026
Subset IIBacktrackingRecursionMediumAug 8, 2026
Search in 2D matrixArraysMatrixMediumAug 8, 2026
Majority Element (n/2 times)ArraysEasyAug 8, 2026
Reverse pairsArraysHardAug 8, 2026
2 SumArraysEasyAug 8, 2026
4 SumArraysMediumAug 8, 2026
Longest Consecutive SequenceArraysHashingMediumAug 8, 2026
Largest subarray with 0 sumArraysMediumAug 8, 2026
Count Number of Subarrays with Given XorArraysMediumAug 8, 2026
Single Element in a Sorted ArrayBinary SearchMediumAug 8, 2026
Median of 2 sorted ArraysBinary SearchHeapHardAug 8, 2026
K-th element of two ArraysBinary SearchHeapMediumAug 8, 2026
Allocate BooksBinary SearchMediumAug 8, 2026
Power SetTrieEasyAug 8, 2026
Count Distinct SubstringsTrieBSTMediumAug 8, 2026
Complete StringTrieStringsMediumAug 8, 2026
Implement Trie - IITrieDesignMediumAug 8, 2026
Implement TrieTrieDesignMediumAug 8, 2026
Search in Rotated Sorted ArrayArraysBinary SearchMediumAug 8, 2026
Coin ChangeDynamic ProgrammingDPMediumAug 8, 2026
Egg Dropping ProblemDynamic ProgrammingDPHardAug 8, 2026
Partition Equal Subset SumDynamic ProgrammingDPMediumAug 8, 2026
Minimum Path SumDynamic ProgrammingDPMediumAug 8, 2026
Matrix Chain MultiplicationDynamic ProgrammingDPHardAug 8, 2026
0-1 KnapsackDynamic ProgrammingDPMediumAug 8, 2026
Longest Common SubsequenceDynamic ProgrammingDPMediumAug 8, 2026
Longest Increasing SubsequenceDynamic ProgrammingDPMediumAug 8, 2026
Minimum Cost to cut the stickDynamic ProgrammingDPHardAug 8, 2026
Maximum Sum Increasing SubsequenceDynamic ProgrammingDPMediumAug 8, 2026
MAXIMUM PRODUCT SUBARRAYDynamic ProgrammingDPMediumAug 8, 2026
Edit DistanceDynamic ProgrammingDPMediumAug 8, 2026
Kth Largest in unsorted ArrayBinary TreeHeapMediumAug 8, 2026
Distinct Numbers in WindowBinary TreeMediumAug 8, 2026
Kth Largest Element in a StreamBinary TreeHeapEasyAug 8, 2026
Find Median in Data StreamBinary TreeHeapHardAug 8, 2026
Flatten Binary Tree to Linked ListBinary TreeLinked ListMediumAug 8, 2026
Ceil in BSTBinary Search TreeBSTEasyAug 8, 2026
Floor in BSTBinary Search TreeBSTEasyAug 8, 2026
LRU CacheDesignCacheMediumAug 8, 2026
Binary Tree Maximum Path SumBinary TreeDFSHardAug 8, 2026
Rotten OrangesGraphsBFSMediumAug 8, 2026
Job SequencingGreedyMediumAug 8, 2026
Flood FillGraphsBFSEasyAug 8, 2026
Find Median from Data StreamHeapPriority QueueHardAug 8, 2026
Top K Frequent ElementsHeapPriority QueueMediumAug 8, 2026
Merge K sorted arraysHeapPriority QueueHardAug 8, 2026
Maximum Sum CombinationHeapPriority QueueMediumAug 8, 2026
Kth Largest Element in an ArrayHeapPriority QueueMediumAug 8, 2026
MinHeap/MaxHeap ImplementationHeapPriority QueueMediumAug 8, 2026
Topological sort - BFSGraphsBFSMediumAug 8, 2026
Detect Cycle in an directed graph - BFSGraphsBFSMediumAug 8, 2026
Detect Cycle in an directed graph - DFSGraphsBFSMediumAug 8, 2026
Detect Cycle in an undirected graph - DFSGraphsBFSMediumAug 8, 2026
Detect Cycle in an undirected graph - BFSGraphsBFSMediumAug 8, 2026
BFS TRAVERSALGraphsBFSMediumAug 8, 2026
DFS TRAVERSALGraphsBFSMediumAug 8, 2026
Minimum Spanning Tree: Prim's AlgorithmGraphsBFSMediumAug 8, 2026
Minimum Spanning Tree: Kruskal's AlgorithmGraphsBFSMediumAug 8, 2026
Shortest Path: Floyd Warshall AlgorithmGraphsBFSMediumAug 8, 2026
Shortest Path Algorithm - Bellman Ford algorithmGraphsBFSMediumAug 8, 2026
Shortest Path Algorithm - Dijkstra algorithmGraphsBFSMediumAug 8, 2026
Strongly Connected Components - Kosaraju's algorithmGraphsBFSHardAug 8, 2026
Bipartite Graph - DFSGraphsBFSMediumAug 8, 2026
Bipartite Graph - BFSGraphsBFSMediumAug 8, 2026
Number of IslandsGraphsBFSMediumAug 8, 2026
Topological sort - DFSGraphsBFSMediumAug 8, 2026