YOE: 2.5 years
Microsoft
Round 1(OA)
-
Modification of question longest-nice-substring (Find shortest substring)
-
String Manipulation
Round 2
-
Customize sorting of the list of string
-
Divide weight between two trucks such that both trucks should have minimum weight difference(Dp problem)
Round 3
-
The minimum number of platforms required to schedule trains.
-
Modification of the first question
Round 4
-
Print all valid strings with the given number of brackets (Backtracking)
-
Low-level design of Traffic light management system
Round 5
-
Project discussion
-
HLD of distributed logging system, also LLD for some part.
-
Some behavioral question
Result : Given Interview for SDE2 selected as L60(SDE1)
Oracle OCI | IC2 → Selected
Round 1(Tech screening)
-
Implementation based question
-
Map-based question
Loop 1(Ds/Algo)
- Implement top 5 suggestions (like google search suggestions)
Loop 2
-
Java-based problem
-
one puzzle
Loop 3(HLD)
-
Design of e-commerce website like Amazon
-
Behavioral question
Managerial Round
-
Sort array of number by frequency of occurrence than by number itself
-
LinkedList based problem
-
Project discussion
-
Behavioral question
BT
- Only behavioral question
Result : Selected(IC2)
Flipkart
Round 1(Machine Coding)
Round 2(Ds/Algo)
-
Alien-dictionary
-
Handshakes
Round 3(LLD)
- Health tracking application
Round 4(Managerial Round)
-
Project discussion
-
Behavioral problem
Result : Selected
VMware | Full stack developer → Selected
Round 1
Craft problem (Assignment)
Round 2
-
Discussion of assignment
-
Two ds problem
Round 3
1.Project discussion in detail and lots of cross question
- One ds problem
Round 4(Managerial Round)
- Situation based problem
Round 5(Senior Managerial Round)
- HLD of Google search result
- Behavioral questions
Result : Selected
Salesforce | MTS → Selected
Round 1(Code pair)
-
HashMap based Ds problem
-
Two pointer-based array problem
Round 2(Code Pair)
- Bfs problem
- Tree based problem
Round 3
-
Project discussion
-
Team fitness question
Amazon
Round 1(OA)
-
One was two pointer-based problem
-
Dp problem
Round 2(DS/ALGO)
-
Graph problem
-
Dp problem
3.LP
Round 3(LLD)
-
Design Bookmyshow
-
LP
Round 4(HLD)
-
Design Netflix
-
LP
Round 5(BR)
-
LLD problem
-
DSA problem(dfs based)
Result : Given Interview for SDE2 selected as SDE1


