We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
#2017
#Experienced-1Year
#SoftwareDevelopmentEngineer
Round 1 (Group Fly)
Find the minimum distance between two numbers.
Find Diagonal sum in a binary tree.
Round 2 (f2f)
Projects
Level order traversal of a tree.
Find the best time to buy and sell stock.
Round 3 (f2f)
Find path between two nodes of a binary tree.
Divide a set into subsets such that the difference of subset sums is minimum.
Round 4 (f2f Design)
Load Balancing, Sharding, Replication Discussion
Round 5 (f2f Org India Head)
Load Balancing, Sharding, Replication, Caching, Queuing Discussion
Behavioral Questions