**AMCAT**

__Flipkart Interview Process and Interview Experience 1__

I was interviewed at Flipkart. Following was my interview experience.

Initially there was one telephonic screening round. then I was called at their bangalore office.

**Telephonic round:**

Given an unsorted array find an entry in array where arr[i]= i; modified it to if array is sorted.

find median of a long stream of numbers at any instant of time.

implement LRU cache. (DS used in it and explanation )

find median of a long stream of numbers at any instant of time.

implement LRU cache. (DS used in it and explanation )

**Round 1. Machine coding round**

Maintain an employee hierarchy with attributes

Print complete hierarchy of given employee.

find top 10 employees on the basis of salary ,at any instant of time .

Perform CRUD opérations on the hierarchy.

they measure you performance on following

Code should be running

time limit is 1:30 minutes.

Appropriate data structures used.

optimized and modular code.

Code should be running

time limit is 1:30 minutes.

Appropriate data structures used.

optimized and modular code.

**Round 2: Technical**

Optimize the code done in machine coding round

A lot of discussion on the approach i used. Various edge case discussions.

**Round 3. Technical**

print the top view and right view if tree.

create a mirror tree from the already existing tree inplace.

How many ways a 4*n wall be filled with 4*1 sheets so that the wall ends uniformly.

**Round 4: Hiring Manager Round**

A

lot of discussions on my previous work. asked me to draw the

architectural diagram of my latest project and explain thoroughly.

What is a columnar database. why we preferred redshift over mysql for data warehouse.

Why Flipkart.

what is you passion and aspiration

Where do you see yourself down the line in 2-3 years.

what kind of work motivates you.

what was the toughest project you ever received. problems faced in that. how you solved it.

Any questions if I had for him.

Basically Hiring manager wants to check if you are a good asset to his team and will fit in the company culture

__Flipkart Interview Process and Interview Experience 2__

I

was recently interviewed for SDE-II in Flipkart. A lot of emphasis was

on designing and geeksforgeeks has been a lot of help. These are my

interview questions:

was recently interviewed for SDE-II in Flipkart. A lot of emphasis was

on designing and geeksforgeeks has been a lot of help. These are my

interview questions:

**Round 1 : Machine Round (2-3 hours)**

Company hierarchy/bonus question.

Write down code in any language for a simple employee hierarchy which has 3 types of employees.

1. CEO

2. Manager

3. employee

Where an employee can have only 1 mgr, and a mgr has 1+ employees.

We

were asked to input employee details(name ,id, salary,rating etc) in

any order (employees might be input before his manager), create the

hierarchy and implement these functionality:

1. Print hierarchy given any employee/mgr/ceo (used an n-ary tree + hash table)

2.

Given a bonus and performance rating of each employee divide it to the

lowest level employees(in the hierarchy ) in the ratio of their rating.

i.e 100 divided among 2:3 is 40 and 60. and print the bonus of each (

simple recursive solution)

3. Top 10 employees with ratio of bonus:salary (used maxheap)

Had a discussion on the solution with various variants and edge/faulty cases.

**Round 2 : Problem Solving Round (1.5 hours)**

1.

A solution was required to make a fantasy league with some budget

allocated. Players will have some score/rating and the cost of player.

Maximum score was to be achieved with eleven players.

Had a lot of discussion on various approaches like backtracking, modified knapsack etc.

2.

A set of tasks is given of which some are dependent tasks. Solution was

required to enable parallel processing of the tasks. (Used topological

sort)

**Round 3 : Designing Round (1 – 1.5 hours)**

A

library for game 2048 was to be designed. The game can have

constraints/variations which shall be defined by the game designer. The

variations can be adding same numbers or adding Fibonacci numbers etc.

APIs were to be exposed to the game designer.

**Round 4 : Manager Round (45mins)**

A lot of behavioral questions. Discussion about the product and the work I do. Challenges faced etc.

__Flipkart Interview Process and Interview Experience 3__

Recently flipkart visited our campus for hiring interns as well as SDEs

Here is the interview process:

**Round 1 : Online coding test on Hackerrank**

2 questions were asked:

Duration 90 minutes

a.

Given an array and an integer b, traverse the array and if the element

in array is b , double b and continue traversal. In the end return value

of b.

Given an array and an integer b, traverse the array and if the element

in array is b , double b and continue traversal. In the end return value

of b.

Eg: I/p 2,3,4,10,8,1 B=2

O/p: 16

O/p: 16

Used ad-hoc approach . You just need to take care about the fact that ans can be long long.

b.

Given k,n,m. where k is no. of coconuts you initially have. n is some

no. such that if you have >=n coconuts, you become stressed otherwise

you are normal. m is the no. of shops.You go from 1st shop to m-th shop

without skipping any shop. At i-th shop, either you buy Si coconuts or

sell Si coconuts. If you are stressed then you must become normal at

next shop. If you have less than Si coconuts and you want to sell then

you must sell all the coconuts you have. The task is to calculate

maximum possible changes of your mood from stressed to normal or

vice-versa.

Given k,n,m. where k is no. of coconuts you initially have. n is some

no. such that if you have >=n coconuts, you become stressed otherwise

you are normal. m is the no. of shops.You go from 1st shop to m-th shop

without skipping any shop. At i-th shop, either you buy Si coconuts or

sell Si coconuts. If you are stressed then you must become normal at

next shop. If you have less than Si coconuts and you want to sell then

you must sell all the coconuts you have. The task is to calculate

maximum possible changes of your mood from stressed to normal or

vice-versa.

Used recursion with memoization.

Round 2: Technical Round f2f Duration 45 min

Round 2: Technical Round f2f Duration 45 min

2 questions:

a. Given a string reverse the sequence of vowels in each word of string

Ex: I/p I work for flipkart

O/p I work for flapkirt.

Ex: I/p I work for flipkart

O/p I work for flapkirt.

Fully functional code was expected along with time complexity.

b. Given co-ordinates of flipkart fulfillment center and n sellers find the nearest k sellers.

I

first suggested sorting. Then he asked me to think of any other

approach. Told him to use heaps. Discussed about its time complexity. He

said complexity to build heap is nlogn but i stuck to my answer that it

is n. He then told me he was just checking my confidence 😛

I

first suggested sorting. Then he asked me to think of any other

approach. Told him to use heaps. Discussed about its time complexity. He

said complexity to build heap is nlogn but i stuck to my answer that it

is n. He then told me he was just checking my confidence 😛

Interviewer was extremely polite and cordial.

I

did well in these two rounds so I was not asked to give another

technical round and was selected for direct interview with hiring

manager.

did well in these two rounds so I was not asked to give another

technical round and was selected for direct interview with hiring

manager.

Some of the round 2 questions were on topics like matrix dp, trees, linked list, etc.

Round 3: With hiring manager. Duration 1.5 hrs

Round 3: With hiring manager. Duration 1.5 hrs

One

of the best conversations I have ever had. Discussed about my projects,

college life, what i did at my internship , favorite subjects, worst

subject, what is interesting about flipkart, role model, etc.

of the best conversations I have ever had. Discussed about my projects,

college life, what i did at my internship , favorite subjects, worst

subject, what is interesting about flipkart, role model, etc.