Fab.com Interview Questions – Set 1

Company : fab.com, Pune

3 Tech rounds + 1HR

Technical interview:

Questions will be based on Data strutures and algorithms.

Round 1: (Telephonic Interview)

Q1. Counting sort algorithm?
Q2. Find two numbers whose sum is closet to zero in an array?
Q3. Find the no of set bits in a number.
Q4. Reverse a string word by word?

Round 2: (F2F)

Q1. In array find elements that are duplicate, remove them optimize it?
Q2. There are n array, each has k elements sorted. Merge those arrays in sigle array and should be sorted in efficient manner?
Q3. Find the middle node of link list?
Q4. Qucik sort and Merge Sort complexities?
Q.5 Find the occurrence of first 1 in an array and the array contains only 0s and 1s in sorted manner.

Round 3: (F2F)

Q1. A lot of disscussion on my current projects and role. Discussion went for around 20 minutes on this.
Q2. Implement hash map?
Q3. Find largest sub array of equal of 0′s and 1′s in an binary array?

Thanks Abhishek Kushwaha for sharing your experience. If you would like to contribute, mail us your interview experience at [email protected] or write it here: Google Form . We will like to publish it on CrazyforCode and help other job seekers.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

Post Navigation