0% found this document useful (0 votes)
19 views85 pages

Dsa Sheet

Uploaded by

Robin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views85 pages

Dsa Sheet

Uploaded by

Robin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 85

LOVE BABBAR DSA SH

TOPIC
Array

Array

Array

Array

Array

Array

Array

Array

Array

Array

Array
Array

Array

Array

Array

Array

Array

Array
Array

Array

Array

Array

Array

Array

Array

Array

Array

Array

Array

Array

Array

Array

Array

Matrix

Matrix

Matrix

Matrix

Matrix
Matrix

Matrix

Matrix

Matrix

Matrix

String

String

String

String

String

String

String

String
String

String

String

String

String

String

String
String

String

String

String

String

String

String

String

String

String

String

String

String

String

String
String

String

String

String

String

String

String
String

String

String

String

String

String

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting


Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting


Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting


Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting

Searching & Sorting


LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList
LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList
LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList

LinkedList
LinkedList

Binary Trees

Binary Trees

Binary Trees

Binary Trees
Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees
Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees
Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees


Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees


Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Binary Search Trees

Greedy

Greedy
Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy
Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy
Greedy

Greedy

Greedy

Greedy

Greedy

Greedy

Greedy
Greedy

Greedy

Greedy

Greedy

BackTracking

BackTracking

BackTracking

BackTracking

BackTracking

BackTracking

BackTracking

BackTracking

BackTracking
BackTracking

BackTracking

BackTracking

BackTracking

BackTracking

BackTracking

BackTracking
BackTracking

BackTracking

BackTracking

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues


Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues


Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues


Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues

Stacks & Queues


Heap

Heap

Heap

Heap

Heap

Heap

Heap

Heap

Heap

Heap

Heap

Heap

Heap

Heap
Heap

Heap

Heap

Heap

Graph
Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph
Graph

Graph

Graph

Graph

Graph

Graph

Graph
Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph

Graph
Graph

Graph

Graph

Graph

Graph

Graph
Trie

Trie

Trie

Trie

Trie

Trie

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming

Dynamic Programming
Dynamic Programming

Dynamic Programming

Dynamic Programming

Bit Manipulation

Bit Manipulation

Bit Manipulation

Bit Manipulation

Bit Manipulation

Bit Manipulation

Bit Manipulation

Bit Manipulation

Bit Manipulation

Bit Manipulation
VE BABBAR DSA SHEET

QUESTION
Given an array which consists of only 0, 1 and 2. Sort the array without using any sortin
Move all the negative elements to one side of the array
Find the Union and Intersection of the two sorted arrays.
Write a program to cyclically rotate an array by one.
find Largest sum contiguous Subarray [V. IMP]
Minimise the maximum difference between heights [V.IMP]
Minimum no. of Jumps to reach end of an array
find duplicate in an array of N+1 Integers
Merge 2 sorted arrays without using Extra space.
Kadane's Algo [V.V.V.V.V IMP]
Merge Intervals
Next Permutation
Count Inversion
Best time to buy and Sell stock
find all pairs on integer array whose sum is equal to given number
find common elements In 3 sorted arrays
Rearrange the array in alternating positive and negative items with O(1) extra space
sd
Find factorial of a large number
find maximum product subarray
Find longest coinsecutive subsequence
Given an array of size n and a number k, fin all elements that appear more than " n/k "
Maximum profit by buying and selling a share atmost twice
Find whether an array is a subset of another array
Find the triplet that sum to a given value
Trapping Rain water problem
Chocolate Distribution problem
Smallest Subarray with sum greater than a given value
Three way partitioning of an array around a given value
Minimum swaps required bring elements less equal K together
Minimum no. of operations required to make an array palindrome
Median of 2 sorted arrays of equal size
Median of 2 sorted arrays of different size

Spiral traversal on a Matrix


Search an element in a matriix
Find median in a row wise sorted matrix
Find row with maximum no. of 1's
Print elements in sorted order using row-column wise sorted matrix
Maximum size rectangle
Find a specific pair in matrix
Rotate matrix by 90 degrees
Kth smallest element in a row-cpumn wise sorted matrix
Common elements in all rows of a given matrix

Reverse a String
Check whether a String is Palindrome or not
Find Duplicate characters in a string
Why strings are immutable in Java?
Write a Code to check whether one string is a rotation of another
Write a Program to check whether a string is a valid shuffle of two strings or not
Count and Say problem
Write a program to find the longest Palindrome in a string.[ Longest palindromic Substr
Find Longest Recurring Subsequence in String
Print all Subsequences of a string.
Print all the permutations of the given string
Split the Binary string into two substring with equal 0’s and 1’s
Word Wrap Problem [VERY IMP].
EDIT Distance [Very Imp]
Find next greater number with same set of digits. [Very Very IMP]
Balanced Parenthesis problem.[Imp]
Word break Problem[ Very Imp]
Rabin Karp Algo
KMP Algo
Convert a Sentence into its equivalent mobile numeric keypad sequence.
Minimum number of bracket reversals needed to make an expression balanced.
Count All Palindromic Subsequence in a given String.
Count of number of given string in 2D character array
Search a Word in a 2D Grid of characters.
Boyer Moore Algorithm for Pattern Searching.
Converting Roman Numerals to Decimal
Longest Common Prefix
Number of flips to make binary string alternate
Find the first repeated word in string.
Minimum number of swaps for bracket balancing.
Find the longest common subsequence between two strings.
Program to generate all possible valid IP addresses from given string.
Write a program tofind the smallest window that contains all characters of string itself.
Rearrange characters in a string such that no two adjacent are same
Minimum characters to be added at front to make string palindrome
Given a sequence of words, print all anagrams together
Find the smallest window in a string containing all characters of another string
Recursively remove all adjacent duplicates
String matching where one string contains wildcard characters
Function to find Number of customers who could not get a computer
Transform One String to Another using Minimum Number of Given Operation
Check if two given strings are isomorphic to each other
Recursively print all sentences that can be formed from list of word lists

Find first and last positions of an element in a sorted array


Find a Fixed Point (Value equal to index) in a given array
Search in a rotated sorted array
square root of an integer
Maximum and minimum of an array using minimum number of comparisons
Optimum location of point to minimize total distance
Find the repeating and the missing
find majority element
Searching in an array where adjacent differ by at most k
find a pair with a given difference
find four elements that sum to a given value
maximum sum such that no 2 elements are adjacent
Count triplet with sum smaller than a given value
merge 2 sorted arrays
print all subarrays with 0 sum
Product array Puzzle
Sort array according to count of set bits
minimum no. of swaps required to sort the array
Bishu and Soldiers
Rasta and Kheshtak
Kth smallest number again
Find pivot element in a sorted array
K-th Element of Two Sorted Arrays
Aggressive cows
Book Allocation Problem
EKOSPOJ:
Job Scheduling Algo
Missing Number in AP
Smallest number with atleastn trailing zeroes infactorial
Painters Partition Problem:
ROTI-Prata SPOJ
DoubleHelix SPOJ
Subset Sums
Findthe inversion count
Implement Merge-sort in-place
Partitioning and Sorting Arrays with Many Repeated Entries
Write a Program to reverse the Linked List. (Both Iterative and recursive)
Reverse a Linked List in group of Given Size. [Very Imp]
Write a program to Detect loop in a linked list.
Write a program to Delete loop in a linked list.
Find the starting point of the loop.
Remove Duplicates in a sorted Linked List.
Remove Duplicates in a Un-sorted Linked List.
Write a Program to Move the last element to Front in a Linked List.
Add “1” to a number represented as a Linked List.
Add two numbers represented by linked lists.
Intersection of two Sorted Linked List.
Intersection Point of two Linked Lists.
Merge Sort For Linked lists.[Very Important]
Quicksort for Linked Lists.[Very Important]
Find the middle Element of a linked list.
Check if a linked list is a circular linked list.
Split a Circular linked list into two halves.
Write a Program to check whether the Singly Linked list is a palindrome or not.
Deletion from a Circular Linked List.
Reverse a Doubly Linked list.
Find pairs with a given sum in a DLL.
Count triplets in a sorted DLL whose sum is equal to given value “X”.
Sort a “k”sorted Doubly Linked list.[Very IMP]
Rotate DoublyLinked list by N nodes.
Rotate a Doubly Linked list in group of Given Size.[Very IMP]
Can we reverse a linked list in less than O(n) ?
Why Quicksort is preferred for. Arrays and Merge Sort for LinkedLists ?
Flatten a Linked List
Sort a LL of 0's, 1's and 2's
Clone a linked list with next and random pointer
Merge K sorted Linked list
Multiply 2 no. represented by LL
Delete nodes which have a greater value on right side
Segregate even and odd nodes in a Linked List
Program for n’th node from the end of a Linked List
Find the first non-repeating character from a stream of characters

level order traversal


Reverse Level Order traversal
Height of a tree
Diameter of a tree
Mirror of a tree
Inorder Traversal of a tree both using recursion and Iteration
Preorder Traversal of a tree both using recursion and Iteration
Postorder Traversal of a tree both using recursion and Iteration
Left View of a tree
Right View of Tree
Top View of a tree
Bottom View of a tree
Zig-Zag traversal of a binary tree
Check if a tree is balanced or not
Diagnol Traversal of a Binary tree
Boundary traversal of a Binary tree
Construct Binary Tree from String with Bracket Representation
Convert Binary tree into Doubly Linked List
Convert Binary tree into Sum tree
Construct Binary tree from Inorder and preorder traversal
Find minimum swaps required to convert a Binary tree into BST
Check if Binary tree is Sum tree or not
Check if all leaf nodes are at same level or not
Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ]
Check if 2 trees are mirror or not
Sum of Nodes on the Longest path from root to leaf node
Check if given graph is tree or not. [ IMP ]
Find Largest subtree sum in a tree
Maximum Sum of nodes in Binary tree such that no two are adjacent
Print all "K" Sum paths in a Binary tree
Find LCA in a Binary tree
Find distance between 2 nodes in a Binary tree
Kth Ancestor of node in a Binary tree
Find all Duplicate subtrees in a Binary tree [ IMP ]
Tree Isomorphism Problem

Fina a value in a BST


Deletion of a node in a BST
Find min and max value in a BST
Find inorder successor and inorder predecessor in a BST
Check if a tree is a BST or not
Populate Inorder successor of all nodes
Find LCA of 2 nodes in a BST
Construct BST from preorder traversal
Convert Binary tree into BST
Convert a normal BST into a Balanced BST
Merge two BST [ V.V.V>IMP ]
Find Kth largest element in a BST
Find Kth smallest element in a BST
Count pairs from 2 BST whose sum is equal to given value "X"
Find the median of BST in O(n) time and O(1) space
Count BST ndoes that lie in a given range
Replace every element with the least greater element on its right
Given "n" appointments, find the conflicting appointments
Check preorder is valid or not
Check whether BST contains Dead end
Largest BST in a Binary Tree [ V.V.V.V.V IMP ]
Flatten BST to sorted list

Activity Selection Problem


Job SequencingProblem
Huffman Coding
Water Connection Problem
Fractional Knapsack Problem
Greedy Algorithm to find Minimum number of Coins
Maximum trains for which stoppage can be provided
Minimum Platforms Problem
Buy Maximum Stocks if i stocks can be bought on i-th day
Find the minimum and maximum amount to buy all N candies
Minimize Cash Flow among a given set of friends who have borrowed money from each
Minimum Cost to cut a board into squares
Check if it is possible to survive on Island
Find maximum meetings in one room
Maximum product subset of an array
Maximize array sum after K negations
Maximize the sum of arr[i]*i
Maximum sum of absolute difference of an array
Maximize sum of consecutive differences in a circular array
Minimum sum of absolute difference of pairs of two arrays
Program for Shortest Job First (or SJF) CPU Scheduling
Program for Least Recently Used (LRU) Page Replacement algorithm
Smallest subset with sum greater than all other elements
Chocolate Distribution Problem
DEFKIN -Defense of a Kingdom
DIEHARD -DIE HARD
GERGOVIA -Wine trading in Gergovia
Picking Up Chicks
CHOCOLA –Chocolate
ARRANGE -Arranging Amplifiers
K Centers Problem
Minimum Cost of ropes
Find smallest number with given number of digits and sum of digits
Rearrange characters in a string such that no two adjacent are same
Find maximum sum possible equal sum of three stacks

Rat in a maze Problem


Printing all solutions in N-Queen Problem
Word Break Problem using Backtracking
Remove Invalid Parentheses
Sudoku Solver
m Coloring Problem
Print all palindromic partitions of a string
Subset Sum Problem
The Knight’s tour problem
Tug of War
Find shortest safe route in a path with landmines
Combinational Sum
Find Maximum number possible by doing at-most K swaps
Print all permutations of a string
Find if there is a path of more than k length from a source
Longest Possible Route in a Matrix with Hurdles
Print all possible paths from top left to bottom right of a mXn matrix
Partition of a set intoK subsets with equal sum
Find the K-th Permutation Sequence of first N natural numbers

Implement Stack from Scratch


Implement Queue from Scratch
Implement 2 stack in an array
find the middle element of a stack
Implement "N" stacks in an Array
Check the expression has valid or Balanced parenthesis or not.
Reverse a String using Stack
Design a Stack that supports getMin() in O(1) time and O(1) extra space.
Find the next Greater element
The celebrity Problem
Arithmetic Expression evaluation
Evaluation of Postfix expression
Implement a method to insert an element at its bottom without using any other data s
Reverse a stack using recursion
Sort a Stack using recursion
Merge Overlapping Intervals
Largest rectangular Area in Histogram
Length of the Longest Valid Substring
Expression contains redundant bracket or not
Implement Stack using Queue
Implement Stack using Deque
Stack Permutations (Check if an array is stack permutation of other)
Implement Queue using Stack
Implement "n" queue in an array
Implement a Circular queue
LRU Cache Implementationa
Reverse a Queue using recursion
Reverse the first “K” elements of a queue
Interleave the first half of the queue with second half
Find the first circular tour that visits all Petrol Pumps
Minimum time required to rot all oranges
Distance of nearest cell having 1 in a binary matrix
First negative integer in every window of size “k”
Check if all levels of two trees are anagrams or not.
Sum of minimum and maximum elements of all subarrays of size “k”.
Minimum sum of squares of character counts in a given string after removing “k” chara
Queue based approach or first non-repeating character in a stream.
Next Smaller Element
Implement a Maxheap/MinHeap using arrays and recursion.
Sort an Array using heap. (HeapSort)
Maximum of all subarrays of size k.
“k” largest element in an array
Kth smallest and largest element in an unsorted array
Merge “K” sorted arrays. [ IMP ]
Merge 2 Binary Max Heaps
Kth largest sum continuous subarrays
Leetcode- reorganize strings
Merge “K” Sorted Linked Lists [V.IMP]
Smallest range in “K” Lists
Median in a stream of Integers
Check if a Binary Tree is Heap
Connect “n” ropes with minimum cost
Convert BST to Min Heap
Convert min heap to max heap
Rearrange characters in a string such that no two adjacent are same.
Minimum sum of two numbers formed from digits of an array

Create a Graph, print it


Implement BFS algorithm
Implement DFS Algo
Detect Cycle in Directed Graph using BFS/DFS Algo
Detect Cycle in UnDirected Graph using BFS/DFS Algo
Search in a Maze
Minimum Step by Knight
flood fill algo
Clone a graph
Making wired Connections
word Ladder
Dijkstra algo
Implement Topological Sort
Minimum time taken by each job to be completed given by a Directed Acyclic Graph
Find whether it is possible to finish all tasks or not from given dependencies
Find the no. of Isalnds
Given a sorted Dictionary of an Alien Language, find order of characters
Implement Kruksal’sAlgorithm
Implement Prim’s Algorithm
Total no. of Spanning tree in a graph
Implement Bellman Ford Algorithm
Implement Floyd warshallAlgorithm
Travelling Salesman Problem
Graph ColouringProblem
Snake and Ladders Problem
Find bridge in a graph
Count Strongly connected Components(Kosaraju Algo)
Check whether a graph is Bipartite or Not
Detect Negative cycle in a graph
Longest path in a Directed Acyclic Graph
Journey to the Moon
Cheapest Flights Within K Stops
Oliver and the Game
Water Jug problem using BFS
Water Jug problem using BFS
Find if there is a path of more thank length from a source
M-ColouringProblem
Minimum edges to reverse o make path from source to destination
Paths to travel each nodes using each edge(Seven Bridges)
Vertex Cover Problem
Chinese Postman or Route Inspection
Number of Triangles in a Directed and Undirected Graph
Minimise the cashflow among a given set of friends who have borrowed money from e
Two Clique Problem
Construct a trie from scratch
Find shortest unique prefix for every word in a given list
Word Break Problem | (Trie solution)
Given a sequence of words, print all anagrams together
Implement a Phone Directory
Print unique rows in a given boolean matrix

Coin ChangeProblem
Knapsack Problem
Binomial CoefficientProblem
Permutation CoefficientProblem
Program for nth Catalan Number
Matrix Chain Multiplication
Edit Distance
Subset Sum Problem
Friends Pairing Problem
Gold Mine Problem
Assembly Line SchedulingProblem
Painting the Fenceproblem
Maximize The Cut Segments
Longest Common Subsequence
Longest Repeated Subsequence
Longest Increasing Subsequence
Space Optimized Solution of LCS
LCS (Longest Common Subsequence) of three strings
Maximum Sum Increasing Subsequence
Count all subsequences having product less than K
Longest subsequence such that difference between adjacent is one
Maximum subsequence sum such that no three are consecutive
Egg Dropping Problem
Maximum Length Chain of Pairs
Maximum size square sub-matrix with all 1s
Maximum sum of pairs with specific difference
Min Cost PathProblem
Maximum difference of zeros and ones in binary string
Minimum number of jumps to reach end
Minimum cost to fill given weight in a bag
Minimum removals from array to make max –min <= K
Longest Common Substring
Count number of ways to reacha given score in a game
Count Balanced Binary Trees of Height h
LargestSum Contiguous Subarray [V>V>V>V IMP ]
Smallest sum contiguous subarray
Unbounded Knapsack (Repetition of items allowed)
Word Break Problem
Largest Independent Set Problem
Partition problem
Longest Palindromic Subsequence
Count All Palindromic Subsequence in a given String
Longest Palindromic Substring
Longest alternating subsequence
Weighted Job Scheduling
Coin game winner where every player has three choices
Count Derangements (Permutation such that no element appears in its original position
Maximum profit by buying and selling a share at most twice [ IMP ]
Optimal Strategy for a Game
Optimal Binary Search Tree
Palindrome PartitioningProblem
Word Wrap Problem
Mobile Numeric Keypad Problem [ IMP ]
Boolean Parenthesization Problem
Largest rectangular sub-matrix whose sum is 0
Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ]
Maximum sum rectangle in a 2D matrix
Maximum profit by buying and selling a share at most k times
Find if a string is interleaved of two other strings
Maximum Length of Pair Chain

Count set bits in an integer


Find the two non-repeating elements in an array of repeating elements
Count number of bits to be flipped to convert A to B
Count total set bits in all numbers from 1 to n
Program to find whether a no is power of two
Find position of the only set bit
Copy set bits in a range
Divide two integers without using multiplication, division and mod operator
Calculate square of a number without using *, / and pow()
Power Set
DIFFICULTY
REMARK
Ideal Time : 5-10 mins
Easy
Medium
Hard

Topics
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays
Arrays

Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings
Strings

2D Arrays
2D Arrays
2D Arrays
2D Arrays
2D Arrays
2D Arrays
2D Arrays
2D Arrays
2D Arrays
2D Arrays

Searching & Sorting


Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting
Searching & Sorting

Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking
Backtracking

Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List
Linked List

Stacks & Queues


Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues
Stacks & Queues

Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy
Greedy

Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees
Binary Trees

Binary Search Trees


Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees
Binary Search Trees

Heaps & Hashing


Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing
Heaps & Hashing

Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs
Graphs

Tries
Tries
Tries
Tries
Tries
Tries

DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP
DP

Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation
Bit Manipulation

Segment Trees
Segment Trees
Segment Trees
Segment Trees
Segment Trees
Segment Trees
DSA

Ideal Time : 5-10 mins


Ideal Time : 15-20 mins
Ideal Time : 40-60 mins (based on Qs) | 88 Qs

Question (375)
Maximum and Minimum Element in an Array
Reverse the Array
Maximum-Subarray
Contains Duplicate
Chocolate Distribution Problem
Search in Rotated Sorted Array
Next Permutation
Best time to Buy and Sell Stock
Repeat and Missing Number Array
Kth-Largest Element in an Array
Trapping Rain Water
Product of Array Except Self
Maximum Product Subarray
Find Minimum in Rotated Sorted Array
Find Pair with Sum in Sorted & Rotated Array
3Sum
Container With Most Water
Given Sum Pair
Kth - Smallest Element
Merge Overlapping Intervals
Find Minimum Number of Merge Operations to Make an Array Palindrome
Given an Array of Numbers Arrange the Numbers to Form the Biggest Number
Space Optimization Using Bit Manipulations
Subarray Sum Divisible K
Print all Possible Combinations of r Elements in a Given Array of Size n
Mo's Algorithm

Valid Palindrome
Valid Anagram
Valid parentheses
Remove Consecutive Characters
Longest Common Prefix
Convert a Sentence into its Equivalent Mobile Numeric Keypad Sequence
Print all the Duplicates in the Input String
Longest Substring without Repeating Characters
Longest Repeating Character Replacement
Group Anagrams
Longest Palindromic Substring
Palindromic Substrings
Next Permutation
Count Palindromic Subsequences
Smallest Window in a String Containing all the Characters of Another String
Wildcard String Matching
Longest Prefix Suffix
Rabin-Karp Algorithm for Pattern Searching
Transform One String to Another using Minimum Number of Given Operation
Minimum Window Substring
Boyer Moore Algorithm for Pattern Searching
Word Wrap

Zigzag (or diagonal) Traversal of Matrix


Set Matrix Zeroes
Spiral Matrix
Rotate Image
Word Search
Find the Number of Islands | Set 1 (Using DFS)
Given a Matrix of ‘O’ and ‘X’, Replace ‘O’ with ‘X’ if Surrounded by ‘X’
Find a Common Element in all Rows of a Given Row-Wise Sorted Matrix
Create a Matrix with Alternating Rectangles of O and X
Maximum Size Rectangle of all 1s

Permute Two Arrays such that Sum of Every Pair is Greater or Equal to K
counting sort
find common elements three sorted arrays
Searching in an array where adjacent differ by at most k
ceiling in a sorted array
Piar with given difference
majority element
count triplets with sum smaller that a given value
Maximum Sum Subsequence with no adjacent elements
Merge Sorted Arrays using O(1) Space
Inversion of Array
Find Duplicates in O(n) Time and O(1) Extra Space
Radix Sort
Product of Array except itself
Make all Array Elements Equal
Check if Reversing a Sub Array Make the Array Sorted
Find Four Elements that Sum to a Given Value
Median of Two Sorted Array with Different Size
Median of Stream of Integers Running Integers
Print Subarrays with 0 Sum
Aggressive Cows
Allocate Minimum number of Pages
Minimum Swaps to Sort

Backtracking Set 2 Rat in a Maze


Combinational Sum
Crossword-Puzzle
Longest Possible Route in a Matrix with Hurdles
Printing all solutions in N-Queen Problem
Solve the Sudoku
Partition Equal Subset Sum
M Coloring Problem
Knight Tour
Soduko
Remove Invalid Parentheses
Word Break Problem using Backtracking
Print all Palindromic Partitions of a String
Find Shortest Safe Route in a Path with Landmines
Partition of Set into K Subsets with Equal Sum
Backtracking set-7 hamiltonian cycle
tug-of-war
Maximum Possible Number by doing at most K swaps
Backtracking set-8 solving cryptarithmetic puzzles
Find paths from corner cell to middle cell in maze
Arithmetic Expressions

Reverse Linked List


Linked List Cycle
Merge Two Sorted Lists
Delete without Head node
Remove duplicates from an unsorted linked list
Sort a linked list of 0s-1s-or-2s
Multiply two numbers represented linked lists
Remove nth node from end of list
Reorder List
Detect and remove loop in a linked list
Write a Function to get the Intersection Point of two Linked Lists
Flatten a linked list with next and child pointers
Linked list in zig-zag fashion
Reverse a doubly linked list
Delete nodes which have a greater value on right side
Segregate even and odd Elements in a Linked List
Point to next higher value node in a linked list with an Arbitrary Pointer
Rearrange a given linked list in place
Sort Biotonic Doubly Linked Lists
Merge K Sorted Lists
Merge sort for linked list
Quicksort on singly-linked list
Sum of two linked lists
Flattening a linked list
Clone a linked list with next and random Pointer
Subtract two numbers represented as linked lists

Implement two stacks in an Array


Evaluation of Postfix Expression
Implement Stack using Queues
Queue Reversal
Implement Stack Queue using Deque
Reverse first k elements of queue
Design Stack with Middle Operation
Infix to Postfix
Design and Implement Special stack
Longest Valid String
Find if an expression has duplicate parenthesis or not
Stack permutations check if an array is stack permutation of other
Count natural numbers whose permutation greater number
Sort a stack using Recursion
Queue based approach for first non repeating character in a stream
The Celebrity Problem
Next larger Element
Distance of nearest cell
Rotten-oranges
Next smaller element
Circular-tour
Efficiently implement k-stacks single array
The celebrity problem
Iterative tower of hanoi
Find the maximum of minimums for every window size in a given array
lru cache implementation
Find a tour that visits all stations

Activity selection problem greedy algo


Greedy algorithm to find minimum number of coins
Minimum sum two numbers formed digits array-2
Minimum sum absolute difference pairs two arrays
Find maximum height pyramid from the given array of objects
Minimum cost for acquiring all coins with k extra coins allowed with every coin
Find maximum equal sum of every three stacks
Job sequencing problem
Greedy algorithm egyptian fraction
Fractional knapsack problem
Maximum length chain of pairs
Find smallest number with given number of digits and digit sum
Maximize sum of consecutive differences circular-array
paper-cut minimum number squares
Lexicographically smallest array-k consecutive swaps
Problems-CHOCOLA
Find minimum time to finish all jobs with given constraints
Job sequencing using disjoint set union
Rearrange characters string such that no two adjacent are same
Minimum edges to reverse to make path from a source to a destination
Minimize Cash Flow among a given set of friends who have borrowed money from each other
Minimum Cost to cut a board into squares

Maximum Depth of Binary Tree


Reverse Level Order Traversal
Subtree of Another Tree
Invert Binary Tree
Binary Tree Level Order Traversal
Left View of Binary Tree
Right View of Binary Tree
ZigZag Tree Traversal
Create a mirror tree from the given binary tree
Leaf at same level
Check for Balanced Tree
Transform to Sum Tree
Check if Tree is Isomorphic
Same Tree
Construct Binary Tree from Preorder and Inorder Traversal
Height of Binary Tree
Diameter of a Binary Tree
Top View of Binary Tree
Bottom View of Binary Tree
Diagonal Traversal of Binary Tree
Boundary Traversal of binary tree
Construct Binary Tree from String with Brackets
Minimum swap required to convert binary tree to binary search tree
Duplicate subtree in Binary Tree
Check if a given graph is tree or not
Lowest Common Ancestor in a Binary Tree
Min distance between two given nodes of a Binary Tree
Duplicate Subtrees
Kth ancestor of a node in binary tree
Binary Tree Maximum Path Sum
Serialize and Deserialize Binary Tree
Binary Tree to DLL
Print all k-sum paths in a binary tree

Lowest Common Ancestor of a Binary Search Tree


Binary Search Tree | Set 1 (Search and Insertion)
Minimum element in BST
Predecessor and Successor
Check whether BST contains Dead End
Binary Tree to BST
Kth largest element in BST
Validate Binary Search Tree
Kth Smallest Element in a BST
Delete Node in a BST
Flatten BST to sorted list
Preorder to Postorder
Count BST nodes that lie in a given range
Populate Inorder Successor for all Nodes
Convert Normal BST to Balanced BST
Merge two BSTs
Given n appointments, find all conflicting appointments
Replace every element
Construct BST from given preorder traversal
Find median of BST in O(n) time and O(1) space
Largest BST in a Binary Tree

Choose k array elements such that difference of maximum and minimum is minimized
Heap Sort
Top K Frequent Elements
k largest elements in an array
Next Greater Element
K’th Smallest/Largest Element in Unsorted Array
Find the maximum repeating number in O(n) time and O(1) extra space
K-th smallest element after removing some integers from natural numbers
Find k closest elements to a given value
K’th largest element in a stream
Connect Ropes
Cuckoo Hashing
Itinerary from a List of Tickets
Largest Subarray with 0 Sum
Count distinct elements in every window of size k
Group Shifted Strings
Merge K Sorted lists
Find Median from Data Stream
Sliding Window Maximum
Find the smallest positive number
Find Surpasser Count of each element in array
Tournament Tree and Binary Heap
Check for palindrome
Length of the largest subarray with contiguous elements
Palindrome Substring Queries
Subarray distinct elements
Find the recurring function
K maximum sum combinations from two arrays

BFS
DFS
Flood Fill Algorithm
Number of Triangles
Detect cycle in a graph
Detect cycle in an undirected graph
Rat in a Maze Problem
Steps by Knight
Clone graph
Number of Operations to Make Network Connected
Dijkstra’s shortest path algorithm
Topological Sort
Oliver and the Game
Minimum time taken by each job to be completed given by a Directed Acyclic Graph
Find whether it is possible to finish all tasks or not from given dependencies
Find the number of islands
Prim's Algo
Negative Weighted Cycle
Floyd Warshall
Graph Coloring
Snakes and Ladders
Kosaraju's Theorem
Journey to moon
Vertex Cover
M Coloring Problem
Cheapest Flights Within K Stops
Find if there is a path of more than k length from a source
Bellman Ford
Bipartitie Graph
Word-Ladder
Allen Dictionary
Kruskals MST
Total number spanning trees graph
Travelling Salesman
Find longest path directed acyclic graph
Two Clique Problem
Minimise the cash flow
Chinese postman
Water Jug
Water Jug 2

Construct a trie from scratch


Print unique rows in a given boolean matrix
Word Break Problem | (Trie solution)
Given a sequence of words, print all anagrams together
Find shortest unique prefix for every word in a given list
Implement a Phone Directory

Knapsack with Duplicate Items


BBT counter
Reach a given score
Maximum difference of zeros and ones in binary string
Climbing Stairs
Permutation Coefficient
Longest Repeating Subsequence
Pairs with specific difference
Longest subsequence-1
Coin Change
LIS
Longest Common Subsequence
Word Break
Combination Sum IV
House Robber
Houe Robber 2
Decode Ways
Unique Paths
Jumps Game
Knapsack Problem
nCr
Catalan Number
Edit Distance
Subset Sum
Gold mine
Assembly Line Scheduling
Maximize The Cut Segments
Maximum sum increasing subsequence
Count all subsequences having product less than K
Maximum sum increasing subsequence
Egg dropping puzzle
Max length chain
Largest Square in Matrix
Maximum Path Sum
Minimum Number of Jumps
Minimum removals from array to make max – min <= K
Longest Common Substring
Partition Equal Subset Sum
Longest Palindromic Subsequnce
Count Palindromic Subsequences
Longest Palindromic Substring
Longest Alternating Sequence
Weighted Job Scheduling
Coin Game
Coin Game Winner
Optimal Strategy for a game
Word Wrap
Mobile numeric keypad
Maximum Length of Pair Chain
Matrix Chain Multiplication
Maximum profit by buying and selling a share at most twice
Optimal BST
Largest Submatrix with sum 0
Largest area rectangular sub-matrix with equal number of 1’s and 0’s

Count set bits in an integer


Find the two non-repeating elements in an array of repeating elements
Program to find whether a no is power of two
Find position of the only set bit
Count number of bits to be flipped to convert A to B
Count total set bits in all numbers from 1 to n
Copy set bits in a range
Calculate square of a number without using *, / and pow()
Divide two integers without using multiplication, division and mod operator
Power Set

Range Sum Query - Immutable


Range Minimum Query
Range Sum Query - Mutable
Create Sorted Array through Instructions
Count of Range Sum
Count of Smaller Numbers After Self
DSA by Shradha Didi & Aman Bhaiya
Meet us on Youtube (Apna College)

5 Questions each D

Companies
ABCO Accolite Amazon Cisco Hike Microsoft Snapdeal VMWare Google Adobe
Infosys Moonfrog Labs
Microsoft + Facebook Interview Qs
Amazon Interview Qs
Amazon Interview Qs
Microsoft Google Adobe Amazon D-E-Shaw Flipkart Hike Intuit MakeMyTrip Paytm
Uber + Goldman Sachs + Adobe Interview Qs
Amazon D-E-Shaw Directi Flipkart Goldman Sachs Intuit MakeMyTrip Microsoft Ola Cabs Oracl
Amazon Interview Qs
Amazon Microsoft Walmart Adobe
Samsung Interview Qs
Microsoft + Facebook Interview Qs
Amazon D-E-Shaw Microsoft Morgan Stanley OYO Rooms Google
Adobe Amazon Microsoft Morgan Stanley Samsung Snapdeal Times Internet
Microsoft + Google + Apple Interview Qs
Adobe Amazon Microsoft Morgan Stanley Samsung Snapdeal Times Internet
Flipkart + Dunzo Interview Qs
Infosys + Amazon + Flipkart Interview Qs
ABCO Accolite Amazon Cisco Hike Microsoft Snapdeal VMWare Google Adobe
Google Interview Qs
Amazon
Barclays Interview Qs
Amazon
Snapdeal Microsoft
Amazon
Microsoft

Amazon Cisco D-E-Shaw Facebook FactSet Morgan Stanley Paytm Zoho


Nagarro Media.net Directi Google Adobe Flipkart
Google Interview Qs
Samsung + Adobe
Adobe + Grofers + Dunzo Interview Qs
Adobe
Ola + Amdocs IQ
Morgan Stanley + Amazon IQ
Amazon Google
Samsung + Adobe + Amazon Interview Qs
Microsoft + Google + Samsung + Visa IQ
Microsoft IQ
Adobe + Goldman Sachs + Uber
Myntra Interview Qs
Microsoft + Amazon IQ
Microsoft + Amazon + Ola IQ
Flipkart + Swiggy IQ
Microsoft
Directi
Amazon Google MakeMyTrip Streamoid Technologies Microsoft Media.net Atlassian Flipkart
Amdocs
Microsoft

Amazon
Amazon Microsoft
Flipkart + Apple + Societe Generale IQ
Microsoft Paytm Samsung Adobe
Google + Ola + Goldman Sachs IQ
Microsoft + Uber + Apple + Amazon IQ
Google
MAQ Software Microsoft VMWare
MAQ VMWare
Amazon Microsoft

Samsung
Samsung+ Morgan Stanley+ Snapdeal + EPAM Systems
MAQ Software Microsoft VMWare
TCS Amazon
TCS
Amazon Visa
Amazon+ Google
Amazon SAP Labs
Amazon FactSet Oxigen Wallet OYO Rooms Paytm Walmart Yahoo Adobe Flipkart
Amdocs Brocade Goldman Sachs Juniper Networks Linkedin Microsoft Quikr Snapdeal Synops
Adobe Amazon BankBazaar Flipkart Microsoft Myntra MakeMyTrip
Amazon D-E-Shaw Flipkart Paytm Qualcomm Zoho
Amazon+ Microsoft
Accolite Amazon D-E-Shaw Intuit Morgan Stanley Opera Microsoft Flipkart
Amazon
Amazon
Adobe Amazon Google Microsoft OYO Rooms
Amazon Samsung Microsoft Google
Amazon + Google
Paytm Adobe
Adobe
Google Infosys Codenation Amazon Microsoft
Amazon + Google

Microsoft Amazon
Adobe Amazon Microsoft
Microsoft
Microsoft
Accolite Amazon Amdocs D-E-Shaw MAQ Software Twitter Visa Microsoft
Amazon Directi Flipkart MakeMyTrip MAQ Software Microsoft Ola Cabs Oracle PayPal Zoho
Amazon + Adobe + Accolite + Traveloka
Amazon
IBM
Amazon + Adobe + Accolite + Traveloka
Uber

Facebook Amazon Microsoft


Facebook Amazon Microsoft
Amazon
Amazon
Google
Amazon + Adobe + Accolite + Traveloka
Goldman Sachs
Meta
Flipkart

Sprinklr
Accolite Amazon D-E-Shaw Hike Lybrate Mahindra Comviva MakeMyTrip MAQ Software OYO R
Accolite Amazon Belzabar Brocade FactSet Flipkart MakeMyTrip Microsoft OATS Systems Ora
Amazon Goldman Sachs Kritikal Solutions Microsoft Samsung Visa
Amazon Intuit
Microsoft Amazon MakeMyTrip
Amazon
Accolite Adobe Amazon Citicorp Epic Systems FactSet Hike MAQ Software Monotype Solution
Amazon Microsoft OYO Rooms Intuit
Accolite Amazon D-E-Shaw Hike Lybrate Mahindra Comviva MakeMyTrip MAQ Software OYO R
Amazon
Google
Micorsoft
Walmart
Amazon
Walmart
GeekyAnts
Ola Uber
Morgan Stanley
Microsoft+ Ola+ eBay
Accolite Adobe Amazon MAQ Software Microsoft Paytm Veritas
Paytm
Accolite Amazon Flipkart MakeMyTrip Microsoft Morgan Stanley Qualcomm Snapdeal
24*7 Innovation Labs Amazon Drishti-Soft Flipkart Goldman Sachs Microsoft Paytm Payu Qua
Triology
Amazon Goldman Sachs

24*7 Innovation Labs Microsoft Samsung Snapdeal


Amazon + Google + Facebook
Facebook
Amazon + Morgain Stanley
Microsoft +Atlassian
Microsoft + Amdocs
MaQ Software
Amazon + Samsung + Paytm + Vmware inc
Amazon Google Microsoft Visa Goldman Sachs
Google Microsoft
Flipkart Oracle OYO Rooms Snapdeal Walmart Yatra.com Microsoft Google
Visa
Amazon
Amazon Goldman Sachs IBM Intuit Kuliza Yahoo Microsoft
Microsoft Flipkart
Google + Visa + Apple
Visa
Flipkar + Facebook
Facebook
Codenation
Codenation Flipkart
Flipkart
Google + Visa + Apple
Microsoft Flipkart
Amazon Microsoft Flipkart
Microsoft + Uber + Alibaba
Uber

Facebook Morgan Stanley Flipkart


Accolite Amazon Morgan Stanley Oracle Paytm Samsung Snapdeal Synopsys Visa Microsoft G
Google
Amazon
Flipkart Amazon

Microsoft Amazon Flipkart


Microsoft + Acolite

Microsoft
Amazon Microsoft
MAQ Software OYO Rooms
Maccafe
Google
Amazon
Flipkart
Samsung
Amazon Microsoft

oney from each other


Maccafe

Amazon Cadence India CouponDunia D-E-Shaw FactSet FreeCharge MakeMyTrip


Amazon + Microsoft + flipkart + Adobe
Amazon + Microsoft + Facebook
Amazon Hike
Accolite Adobe Amazon Cisco D-E-Shaw Flipkart
Microsoft + Adobe + Cisco Networking Academy
Amdocs
Amazon Cisco FactSet Hike Snapdeal Walmart Microsoft Flipkart
Accolite Adobe Amazon Belzabar EBay Goldman Sachs Microsoft Morgan Stanley Myntra Ola
Amazon
Amazon Walmart Microsoft
Amazon FactSet Microsoft Samsung Walmart
Amazon Microsoft
Amazon Microsoft Flipkart
Accolite Amazon Microsoft
Amazon Cadence India CouponDunia D-E-Shaw FactSet FreeCharge MakeMyTrip
Amazon Microsoft OYO Rooms
Microsoft + Adobe + Expedia Group
DE Shaw India
Amazon Microsoft
Accolite Amazon FactSet Hike Kritikal Solutions
Microsoft Morgan Stanley OYO Rooms Payu Samsung Snapdeal Flipkart
Adobe Amazon
Google
Microsoft Amazon
Accolite Amazon American Express Cisco Expedia Flipkart MakeMyTrip Microsoft OYO Room
Amazon Linkedin MakeMyTrip Ola Cabs Qualcomm Samsung
Ola
Josh Technology Group
Samsung + Facebook
Flipkart InMobi Linkedin MAQ Software Microsoft Paytm Quikr Yahoo
Accolite Amazon Goldman Sachs Microsoft Morgan Stanley Salesforce Snapdeal
Accolite Amazon Goldman Sachs

Accolite Amazon Flipkart MAQ Software Microsoft Samsung Synopsys


Accolite Amazon Microsoft Paytm Samsung
Microsoft
Google + Adobe + Goladman Sachs + Direct
Walmart
HSBC
Accolite Amazon Samsung SAP Labs Microsoft
OYO Rooms Qualcomm Samsung Snapdeal VMWare Walmart Wooker Amazon Facebook
Accolite Amazon Google
Adobe Barclays
Microsoft
Amazon Linkedin Flipkart
D-E-Shaw Google
Sap labs
Paytm
DE Shaw India
Samsung
Samsung
Adobe Morgan Stanley Microsoft
Amazon
Amazon D-E-Shaw Samsung Microsoft Flipkart

m is minimized
Adobe
Amazon Microsoft
Amazon Microsoft Walmart Adobe
Amazon + Microsoft + Flipkart + Adobe
ABCO Accolite Amazon Cisco Hike Microsoft Snapdeal VMWare Google Adobe
Accolite Amazon
ABCO Accolite Amazon Cisco Hike Microsoft Snapdeal VMWare Google Adobe
Amazon OYO Rooms
Amazon Cisco Hike OYO Rooms Walmart Microsoft Flipkart
Amazoon + Oyo + Goldman Sachs
Amaxon
Microsoft + Ola + eBay
Amazon MakeMyTrip Microsoft
Accolite Amazon Microsoft
Oracle
Microsoft + Ola + eBay
Adobe Amazon Apple Belzabar D-E-Shaw Facebook Flipkart Google Intuit Microsoft Morgan St
Amazon Directi Flipkart Microsoft Google
Accolite Amazon Samsung Snapdeal
Amazon Morgan Stanley Ola Cabs SAP Labs
Amazon Ola Cabs Samsung Synopsys Walmart Microsoft
Amazon Cisco D-E-Shaw Facebook FactSet Morgan Stanley Paytm Zoho
Amazon Intuit Microsoft
Amazon Morgan Stanley Ola Cabs SAP Labs
Microsoft + Ola + eBay
MAQ Software
Amazon

Samsung + Delhivery + SAP Labs


Samsung + Intuit + Goldman Sachs
Google + Adobe + Apple
IBM
Lenksart
Samsung
Sharechat + Directi
Samsung
Google + MAQ Software + Apple + Facebook
Samsung
Amazon
Amazon + Google + Flipkart + Oyo + Fipkart + Samsung
Sharechat + Directi
Amazon
Directi + Sharechat
Razorpay
Visa
Amazon
Google + Uber
Morgan Stanley
Goldman Sachs +Makemytrip
Paytm
Lenksart + Payload
Intuit
Uber
Uber + Paypal
Cisco + Intuit
Sharechat + Directi
Microsoft Flipkart
Microsoft
Samsung
Amazon Cisco Samsung
Amazon Cisco Samsung Microsoft Flipkart
Google + Microsoft + Opera
Google
Microsoft
Intuit + Uber
Intuit
Intuit + Uber
MakeMyTrip MAQ Software

Accolite Amazon D-E-Shaw FactSet Microsoft


Amazon Zoho
Amazon Google Hike IBM MAQ Software Microsoft Walmart Zoho
Amazon D-E-Shaw Goldman Sachs Morgan Stanley Snapdeal Microsoft
Microsoft Google
Amazon + Microsoft + Snapdeal

Amazon
Microsoft
Samsung
Ola
Intuit
Amazon
Google + Amazon
Ola
Amazon
Microsoft+ Samsung + Barclays + Apple + Adobe
Amazon + Google + Facebook + Fidelity International
Siemens + Amazon + Google
Amazon + Google + Microsoft + Walmart + Apple + IBM
Adobe Amazon Microsoft
Apple + Uber
Arrays Dynamic Programming
Adobe + Uber
Google + Microsoft
Facebook Amazon Microsoft Google
Amazon Directi Flipkart GreyOrange Microsoft Mobicip Morgan Stanley Oracle Payu Snapdeal
Google
Amazon + Google
Google + Goldman Sachs + Citrix
Amazon + Google
Samsung
Goldman Sachs
Amazon OYO Rooms Microsoft
Amazon Morgan Stanley Microsoft
Goldman Sachs
Amazon Morgan Stanley Microsoft
Amazon D-E-Shaw Goldman Sachs Google Hike MakeMyTrip MAQ Software Myntra Nearbuy O
Amazon Microsoft
Amazon Samsung
Amazon + Microsoft + Oyo + Directi
Adobe Amazon Housing.com Moonfrog Labs Walmart Microsoft Google Flipkart
Amazon
Webarch Club
Amazon + Accolite + Traveloca + Adobe
Amazon Google
Myntra
Amazon + Microsoft + Samsung + Visa
Ola
Intuit
Salesforce
Ola
Google + IBM
Microsoft
Amazon Microsoft
Amazon Microsoft
Walmart + Flipkart
Accolite Amazon Microsoft
Google
Amazon MakeMyTrip Microsoft
Amazon Directi Intuit MakeMyTrip Microsoft Samsung Google Flipkart

Adobe Apple
Accolite Amazon FactSet Google MakeMyTrip Microsoft Qualcomm Samsung
Adobe
Microsoft
Maq Software
Microsoft
Facebook
Amazon
Microsoft
Google + Adobe + Paytm

Google Interview Qs
Alibaba
Samsung + Accolite
Walmart
Codenation Google
How to solve this sheet?

Remarks

use Kadane's Algorithm

net Google

use auxiliary arrays

use 2 pointer approach


use Stacks (if possible)

use Dynaming Programming

Read about DFS


are Walmart Adobe

are Walmart Adobe

Important
Important
Important
Important

Important
Approach
used inertion sort to sort the array and the first postion of the array will be the minimium a

https://leetcode.com/problems/maximum-subarray/discuss/3666304/Beats-100-oror-C%2B%2B-oror

You might also like