Flipkart Interview Experience | On-Campus Internship

Flipkart recently visited our Campus for hiring Interns for Summer 2020. The following was the entire process.

Round 1: Online Coding (90 min – 3 Questions)

  1. Given an array of N elements, choose 2 elements and add a + b to result, as well as insert a + b – 1 back to array repeat the same for N – 1 times. Find the minimum value of the result. (Use Min – Priority Queue)
  2. Was based on the application of Binary Search
  3. Given an array of numbers and their positions in a new array. Insert the numbers from left to right one by one and print the final array. If the position of two numbers is same, put the most recent number at that position and shift the entire array after that position by 1. (Linked List Implementation of array was required)

Students who were able to do 1.5 questions were selected for the next round. 16 students out of 90 were selected for the next round.

Round 2: Technical Round 1 (20 – 25 min)

  1. Snake and Ladder Problem
  2. Find all the paths starting from the root in a binary tree with the sum of nodes equal to K.

6 students were selected for the next round.

Round 3: Technical Round 2 (50 min)

  1. Find the minimum number of operations required in the Tower of Hanoi Problem to shift N discs. (Answer: 2^N –  1)
  2. In Tower of Hanoi, we can only move those discs from rod A to C or vice – versa which has a width greater than the width of the disc at the top of rod B. Find the minimum number of operation required to shift N discs. ( I was not able to find an optimal answer for it).

Finally, 2 students were selected by Flipkart for Internship.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.