Flipkart Interview Experience 1

Hi, I am Abhishek Garg. I got placed at flipkart. Here is my interview experience.

Flipkart Interview Experience:

Coding Round

First round was coding round which had two questions on interviewstreet and lasted for 1.5 hrs. Here are the questions:

  1. We are required to transport a package using trucks. We are given package size and trucksize (every truck has equal capacity). The package can be repeatedly broken into half i.e 6 cn be broker into 3-3 and 3 can be boker into 1-2. We were required to code a program which could tell the minimum amount of trucks required for given packagesize and trucksize.
  2. We are given 4 type of infinite coins. We are given value of each time. We were required to tell whether we can pay someone using these coins.

Machine Round

After coding round 50 students out of approximately 300 were selected. Then we had a 2 hr  machine coding round. In this round, a question on binary tree was given. We were required to code a lot of functionality, like finding least common ancestor etc. Following was the criteria of judging:

  1. Compilation of code
  2. Number of test cases that it passed
  3. Algorithm/Logic
  4. Code readability

I felt that the code for the problem was lengthy but was simple. Many panicked after reading the question and functionality that we were required to implement. So for this round I would advise you to code on sites like codechef, codeforces so that you can code your logic well. Also I think practicing from DSA lab questions would help a lot. Main part is to get your code to compile, as they graded only those codes which compiled. Second thing is that it might not be necessary that your code passes all test cases because if your code compiles, passes most of the test cases and if the logic is good, then you can get into the next round. I am stating this because as far as I know, only mine and Shashank Parekh’s code passed all test cases but other 13 people who got selected had their code compiled properly and were able to pass most of the test cases, and most importantly had good logic regarding problems.

Technical PI

In this round one SDE from flipkart conducted the PI. He asked two questions:

  1. Zig Zag traversal of tree
  2. Data Structure for job scheduling. The jobs had only start time and arrival time. I was able to provide a O(logn) and he seemed happy with it.

HR PI

6 people were selected for this round. An Engineering Manager took our interview. The questions were aimed at testing your personality. The questions were like why flipkart?, state one of thing you have done that you are proud of. Also, in the conversation I mentioned that I liked Digital Image Processing, so he asked me algo to segregate a particular shape. In the end 4 people were selected for the role of SDE.

I felt that process was quite easy as compared to amazon but still coding round and machine coding round tested your ability to code fast. Also, the difficulty level of the questions that were asked in technical PI was random, so if you are good at coding then only you can be sure of making it to flipkart!

Advertisements

Amazon Interview Experience 2

Hi All,

I am Himank Agrawal of batch 2015.Here is my interview experience.

Round 1: (MCQ’s and 2 coding questions)

An online test was conducted consisting of 20 MCQ’s and 2 coding questions. MCQ’s consisted of data structures, OS and DBMS concepts. They were quite easy. 2 coding questions were:

  1. Given a linked list where every node represents a head of another linked list and contains two pointers of its type (all linked list are sorted). First, Pointer to next node in the main list and Second, Pointer to a linked list where this node is head.Write flatten function to flatten the lists into a single sorted linked list.
  2. Print vertical sum of all the axis in the given binary tree.

Round 2: (F2F Interview)

Given number N<10^7  and 0=<K<=9  (a digit).Find the total number of occurrences of K from 1 to N. Example N=11 and K=1 then ans=4. I was asked to write the code.I solved it in complexity of O(number of digits in N) using DP.

Round 3: (F2F Interview)

  1. Given a binary tree to be passed through a network. How to pass this tree in minimum space.It was an open ended question and he asked me for many solutions and finally asked me to write the code.
  2. Given two sorted list, find the Kth largest element from the combined sorted list.

Round 4: (F2F Interview)

  1. Given array of integers, find 1st non repeating element and write code.
  2. He asked me some Operating system question- what is difference between malloc and declaring an array, what is memory leak, garbage collection, main difference between C and C++ related to Memory allocation. There were some more, I am not able to recall all of them.
  3. Given N, find total number of Zeros at the end of N!. (of course with proof).
  4. Given a linked list with every node containing two pointers next and random. next points to next element and random points to any random element in linked list. Create a copy of this list. He asked me to write the code.

Round 5: (F2F Interview with manager)

  1. Discussion about only one of my projects. More than technicality of project he concentrated on my role in project, Teamwork, idea etc.
  2. OS concepts like difference between threads and process.
  3. Given that main memory is very cheap,what is need of virtual memory.
  4. Cryptography concepts like what is difference between hashing data and encrypting data. What are different types of encryption schemes.
  5. Given a binary tree and a SUM, print all the path from root whose sum = SUM.
  6. He asked me the same question-: Given a binary tree to be passed through a network. How to pass this tree in minimum space. So, he just asked me discuss the approach.
  7. Given a sorted array (elements may or may not repeat) and number Find the starting and ending index of X in array. if X is not present in array return -1,-1. He asked me to write code.

All F2F round took around 1 hr and 15 mins.

Finally after a long long wait of 7 hours I was hired along with my 3 colleagues 🙂

Amazon Interview Experience 1

Hi all,

I am Tarang. I was placed in Amazon. I have shared my interview experience below.

Generally the questions asked in the interviews of dream companies like Amazon, Google etc are entirely on algorithms and data structures. If you want to be placed in these companies you should be good at algorithms, data structures and implementing them in at least 1 programming language (C, C++, Java are preferable). All such interviews will involve either paper coding, whiteboard coding or coding on online collaboration tool. Practice algorithmic coding on various online judges like spoj, codechef, codeforces etc.

Some important do’s and don’ts of interview.

  1. Think out loud. Keep on communicating with your interviewer.
  2. If you have heard the question before, do tell the interviewer about the same. Be honest. Do not pretend to think.
  3. Optimize your solution as much as you can.
  4. Do not leave any edge cases while coding.
  5. Be specific and clear while stating your approach for the problem.

Interviewers were really cool. I had a coke with one interviewer too 😀 🙂

Presently I am doing my internship at Amazon Banglore and I love this place :D. Eager to see you guys in Amazon soon 😀

Here is my interview experience.

Round 1 (MCQ’s and 2 coding questions):

An online test was conducted consisting of 20 MCQ’s and 2 coding questions. MCQ’s consisted of data structures, OS and DBMS concepts. They were fairly straightforward.

2 coding questions were:

  1. Given a linked list where every node represents a linked list and contains two pointers of its type. First, Pointer to next node in the main list and Second Pointer to a linked list where this node is head.Write flatten function to flatten the lists into a single linked list (sorted).
  2. Print vertical sum of all the axis in the given binary tree.

Round 2: (F2F Interview)

  1. Given a string, print all the elements of its powerset. A lot of discussions on optimization (Threading).
  2. Given a mxn matrix consisting of only 0’s and 1’s. wherever you find 1, make all the elements of that row and column as 1. A lot of discussions on space optimization and was asked to do in-place.

Round 3: (F2F Interview)

  1. Given an array and an integer k, find the minimum for each and every contiguous subarray of size k. I told that I know the approach. I told that I will implement it using dequeue. So he asked me to implement dequeue class with push_back, push_front, pop_back, pop_front.
  2. Given a hierarchy of linux directory structures. You need to give user permissions to some of the directories. By giving a permission to certain directory (using command) will automatically give permissions to all the directories in its subtree. You need to give permissions to some of the directories using minumum number of commands. Find the minimum number of commands.
  3. Given a binary search tree. Find a pair with X+Y = S.

Round 4: (F2F Interview)

  1. Implement set data structure with insert, delete, get functionality.
  2. Given an array of integers, which is initially, increasing and then decreasing, find the position of a given element.

Round 5: (F2F Interview with manager)

  1. A lot of discussions about projects. My role in project. Failures in project. How did I resolve conflicts (if any) with my team mates?
  2. OS concepts like difference between threads and process, normalization.
  3. A robot is sitting at top left corner of the mxn matrix. It can move either right or down. You need to determine the total number of ways to reach the lower right corner of the matrix.