# Flipkart Interview | Set 13

Hi, I was interviewed at Flipkart few days back. I was contacted by one of their head hunters. The process was as follows :

- 2 Telephonic interview
- 1 Machine Coding Round
- 1 Problem Solving Round
- 1 Hiring Manager Round

Last 3 rounds were at their office.

**Telephonic-1 :**

He asked about my previous projects in detail and then asked one problem.

Find the next smallest palindrome give a number. He asked me to write the complete working code.

**Telephonic-2 :**

Started straight away with the problems.- Find the median of a stream of integers. I knew the solution and discussed the heap solution for it.
- Given an array of integers, find a triplet having sum equal to K.

Article Link: https://www.geeksforgeeks.org/find-a-triplet-that-sum-to-a-given-value/

Practice Link: https://practice.geeksforgeeks.org/problems/triplet-sum-in-array-1587115621/1 - Given an array a
_{1}, a_{2}, a_{3}…. ,a_{n}, b_{1}, b_{2}, b_{3}, ……b_{n}. Rearrange this array to a_{1}, b_{1}, a_{2}, b_{2}, ….a_{n}, b_{n}. This needs to be done inplace.

Article LInk: https://www.geeksforgeeks.org/shuffle-2n-integers-format-a1-b1-a2-b2-a3-b3-bn-without-using-extra-space/

Practice Link: https://practice.geeksforgeeks.org/problems/shuffle-integers2401/1

**Onsite Rounds (f2f)****Machine Coding Round :**

This was the most exciting round. Problem was to do 3 operations on very large numbers.- Subtraction
- Multiplication

**Problem Solving Round –**

In this round, he started with the discussion of Machine round problem. Then he asked me for a simple problem. Find the first occurrence of a digit(1-9) other than zero in a stream of integers in less than o(n). Given I can’t have the access to the memory location where the stream is written.He basically wanted to know how I think and how many approaches I can think of, and whether I can challenge him or not that it is not possible. and yes I did.

Article Link: https://www.geeksforgeeks.org/find-the-occurrences-of-y-in-the-range-of-x/Then he asked a stock span problem. Given stock prices in an array. Find the buying and selling time so that profit earned is maximum.

Article Link: https://www.geeksforgeeks.org/the-stock-span-problem/

Practice Link: https://practice.geeksforgeeks.org/problems/stock-span-problem-1587115621/1**Hiring Manager round –**

He asked me some behavioral questions.

Why do you want to join Flipkart? Then What would you do if something goes wrong on production, and you are unable to find the bug, etc?

Them he discussed the projects I had done in my previous company.

I would like to thank GeeksforGeek team for building such an awesome site and platform for interview preparation and helping out the geeks over there to grab good opportunities in the industry.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.