TOP 50 DSA

MUST DO QUESTIONS

PLACEMENT
PREPARATION
TOOL KIT

CANTILEVER LABS IS OFFICIAL TRAINING PARTNER OF

IIT BOMBAY | IIT MADRAS | IIT HYDERABAD | IIT INDORE |

BITS PILANI | BITS HYDERABAD | NIT ROURKELA | SYMBIOSIS |
JNTU HYDERABAD | SREENIDHI | MAHENDRA UNIVERSITY | GITAM
& many more
FREE HELPFUL
RESOURCES
If you are a student looking for further Aid in this field,
fill out the following form and our counsellor will
reach you.

Scan QR code to
access the
resources

OR

Click this link:

http://bit.ly/coun
s_form
INDEX
I DYNAMIC PROGRAMMING

II GRAPHS

III STRINGS

IV ARRAYS

V TREE

VI OTHERS
I

DYNAMIC
PROGRAMMING

& More
01

Coin Change | DP-7(Hard ) (topics :DP) (companies :

Amazon, OYO, Morgan Stanley, Samsung, Snapdeal,
Microsoft)

Longest Common Subsequence | DP-4(Medium) (topics :

DP) (Companies : Amazon, Citrix, MakeMyTrip,
Paytm,Microsoft)

GeeksforGeeks 0-1 Knapsack Problem | DP-10(Medium)

(topic: DP) (companies : Amazon, Flipkart, Oracle,
Snapdeal, Microsoft, Visa,Directi , Payu)

Max Array Sum (Medium) (Topics : DP)

C/C++ Program for Largest Sum Contiguous Subarray

(medium ) (Topics : Arrays, DP, Algorithms ) (Companies :
24*7 Innovation Labs, Accolite, Amazon, Citrix, DE Shaw ,
Flipkart, Microsoft , Morgan Stanley, OLA, Oracle, Payu,
Samsung, Snapdeal, Walmart, Google )

741. Cherry Pickup (Hard) (Topics : Array, DP, Matrix)

Max Array Sum (Medium) (Topics : DP)

II

GRAPHS
& More
02

Breadth-First Search or BFS for a Graph (Easy) (topic : BFS,

Graph) (Companies: Adobe, Amazon, Flipkart, Microsoft,
OLA, Samsung, SAP Labs)

Find the nearest clone (Medium) (Topics : Graph)

Depth First Search or DFS for a Graph(Easy) (topics : DFS,

Graph) (Companies : Accolite, Amazon, Intuit, Samsung)

Dijsktra's algorithm(Medium) (topics : Graph, Shortest

Path, Maths) (Companies : Accolite, Cisco, Morgan
Stanley, Samsung, Synopsys)

Strongly Connected Components(Hard) (Topics: DFS,

Graph) (Companies : Visa, Amazon, Microsoft)

Comparison between Adjacency List and Adjacency

Matrix representation of Graph(Easy) (Topics : Graph )

Connected Components in an undirected graph(Medium

) (Topics : Graph, Connected Components )
03

Find the nearest clone (Medium) (Topics : Graph)

Depth First Search or DFS for a Graph (Easy ) (topics : DFS,

Graph) (Companies : Accolite, Amazon, Intuit, Samsung)

Strongly Connected Components (Topics: DFS, Graph)

(Companies : Visa, Amazon, Microsoft)
III

STRINGS
& More
04

Hackerrank challenge “Counting Valleys”(Easy) (Topics :

Strings)

Find the maximum subarray XOR in a given array(Hard)

(topics : Bit Magic, Strings )
IV

ARRAYS
& More
05

C++ Program to Implement Adjacency List (Easy ) (Topics

: 2-D arrays)

C++ Functions - Pass By Reference (Easy) (Topics :

Functions, C++)

[GeeksforGeeks] Two Pointers Technique (Easy ) (Topics :

Two pointer )

Pointers in C and C++ | Set 1 (Introduction, Arithmetic and

Array) (Easy) (topics : Pointers, C++)
V

TREE
& More
06

Maximum Path Sum in a Binary Tree (Hard ) (Topics :

Trees)

Binary Tree Maximum Path Sum (Hard ) (Topics : Trees)

VI

OTHERS

& More
07

Check for Balanced Brackets in an expression (well-

formedness) using Stack (easy) (topics : Stacks, STL,
String) (companies : Adobe, Amazon, Flipkart, Oracle,
OYO, Snapdeal, Walmart, Microsoft, Google)

Basics of Binary Search (Easy ) (topics : Searching, Binary

Search) (companies : Paytm)

Merge Sort (Medium) (topics : Divide and conquer,

Sorting, Algorithms) (companies : Amazon, GS, Grofers,
Microsoft, Medlife, Oracle, Paytm, Snapdeal, Wipro)

Use Sieve of Eratosthenes (Medium) (Topics : Maths,

Sieve ) (companies : MAQ Software, SAP Labs, VM Ware )

Mark and toys (Easy ) (Topics : Greedy, Sorting )

Swap Nodes [Algo] (Medium ) (Topics : Searching)

Largest Rectangle (Medium)(Topics : Stacks and Queues )

08

Map in C++ Standard Template Library (STL) (Medium )

(Topics : Data Structures )

C/C++ Program for Trie | (Insert and Search)(Medium)

(Topics : Trie, Design Pattern) (Companies : Accolite,
Amazon, DE Shaw, Microsoft )