Round 1: (Machine Coding)
Implement a Task Planner System. Sprint, story, task, epic, sub story etc. Basic functionalities like create new sprint, delete sprint. change assignee.
Change task status etc. Code should be modular and extensible.
Round 2: (DSA)
1) Given a binary tree. We need to find the maximum sum path between any node to any other node present in the tree.
2) A river is there. There are N villages in each side of the river numbered randomly from 1 to N. First side of the river has all the men and other side has white walkers and trapped wildlings.
Wildings trapped in other side need to come to first side asap. For this to happen we need to build bridges between different villages. Condition is that a bridge can be
build between two villages having the same number (1 to N). Ex. we can build bridge from village 1 on one side of the river to village 1 on other side of the river. Other condition being no two
bridges can cross each other. We need to maximize the number of bridges so that all the wildlings can travel asap to first side and be safe from
white walkers. (This is other way of asking maximum common sub sequence.)
3) Given a binary tree. Find out the sub binary tree which is a Binary Search Tree and also has maximum sum of nodes among all the other BST’s inside that tree.
Round 3: (Design)
HLD and LLD
Major focus on data modeling and API design. High level discussion on system design and components to be used.
Round 4: (Hiring Manager)
Through discussion on my projects. Current architecture of my product. How much scalable is it.
My role in it. Behavioral questions asked. What is the most challenging project you have worked on till now. Strengths, weakness. How do u handle disagreement with manager etc.
One technical question asked : Given a book my show kind of system. You have 10k seats to be booked. You have 1k requests coming simultaneously. How do you handle the requests ?
Concurrency has to be taken care along with efficiency. We can not hold up any customer request for long.
I got the offer after 3 weeks.
- Flipkart Interview | Set 3
- Flipkart Interview | Set 2 (For SDE 1)
- Flipkart Interview | Set 4 (For SDE-1)
- Flipkart Interview | Set 6
- Flipkart Interview | Set 1 (For SDE 2)
- Flipkart Interview | Set 7 (For SDE II)
- Flipkart Interview | Set 8 (For SDE 1)
- Flipkart Interview | Set 13
- Flipkart Interview | Set 11
- Flipkart Interview | Set 16
- Flipkart Interview | Set 15 (For SDE-II)
- Flipkart Interview | Set 9 (On-Campus)
- Flipkart Interview | Set 12 (On-Campus)
- Flipkart Interview | Set 10 (On-Campus For SDE-1)
- Flipkart On Campus Interview
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.