DSA

SELF PACED IMPROVEMENT

HOW TO WATCH EDITORIAL

01 Click on Editorial 02 Click on YES

03 PLAY
CONTENTS

Video Editorial of the following problems has been added.

BIT MAGIC
- Maximum AND Value

RECURSION
- Tower Of Hanoi

ARRAYS
- Rearrange Array Alternately
- Maximum Index
- Trapping Rain Water
- Stock buy and sell
- Kadane's Algorithm

SEARCHING
- Allocate minimum number of pages
- Median of Two sorted arrays

SORTING
- Quick Sort
- Count Inversions
- Count the number of possible triangles
- Number of pairs
- Minimum Platforms
- Triplet Sum in Array

MATRIX
- Spirally traversing a matrix
- Search in a row-column sorted Matrix
- Boolean Matrix
CONTENTS

HASHING
- Zero Sum Subarrays
- Sort an array according to the other
- Longest consecutive subsequence

STRING
- Smallest window in a string containing all the characters of another string
- Rabin Karp - Pattern Searching
- Pattern Search KMP

LINKED LIST
- Merge two sorted linked lists
- Merge Sort for Linked List
- Merge K sorted linked lists
- Intersection Point in Y Shapped Linked Lists
- Clone a linked list with next and random pointer
- LRU Cache
- Remove loop in Linked List
- Rotate a Linked List

STACK
- Stock span problem
- Next Greater Element
- Maximum Rectangular Area in a Histogram
- The Celebrity Problem
- Maximum of minimum for every window size

QUEUE
- Circular tour

DEQUE
- Maximum of all subarrays of size k
CONTENTS

TREE
- Height of Binary Tree
- Lowest Common Ancestor in a Binary Tree
- Check if subtree
- Binary Tree to DLL
- Connect Nodes at Same Level

BINARY SEARCH TREE

HEAP
- Heap Sort
- Kth largest element in a stream
- Merge k Sorted Arrays
- Rearrange characters
- Find median in a stream

GRAPH
- Find the number of islands
- Detect cycle in an undirected graph
- Detect cycle in a directed graph
- Find whether path exist
- Topological sort
- Unit Area of largest region of 1's
- Rotten Oranges
- Minimum Swaps to Sort
- Implementing Dijkstra Algorithm
- Minimum Spanning Tree

GREEDY
- Fractional Knapsack
- Job Sequencing Problem
CONTENTS

BACKTRACKING
- Solve the Sudoku

DYNAMIC PROGRAMMING
- Count ways to reach the n'th stair
- Minimum number of jumps
- Unique BST's
- Longest Increasing Subsequence
- Longest Common Subsequence
- Shortest Common Supersequence
- Maximize The Cut Segments
- Subset Sum Problem
- 0 - 1 Knapsack Problem
- Optimal Strategy For A Game
- Egg Dropping Puzzle

TRIE
- Trie | (Insert and Search)
- Most frequent word in an array of strings