I applied through university. I interviewed at Quikr India (Hyderābād) in May 2019
Interview
The process was 4 rounds. 1st round is a pen and paper based coding then shortlisted candidates will have TR1 and after clearing TR1 there'll be TR2. If you clear TR2 your job is almost confirmed. In HR they just confirm whether you are willing to relocate
Interview questions [3]
Question 1
Collecting water i.e., find total amount of water on all the buildings of height array[i]
I applied through university. The process took 1 day. I interviewed at Quikr India (Amritsar) in Feb 2021
Interview
I have been asked a coding Question on Linked List.Then I was asked to explain forget password implementation of my project. Further few question on database were asked. overall it was a good experience.
Interview questions [1]
Question 1
Add two Numbers represented by Linked List through Recursion
I applied through an employee referral. I interviewed at Quikr India
Interview
Very poor experience. Interviewers are confused about the question to ask and the answer to look for. Also, they do not care about the solution you give it to them. All they need is a solution which they know and understand. Only god or person in luck can do that.
Interview questions [1]
Question 1
1. all possible sets of 3 numbers that sums up to a given value
2. How does browser handle timezone conversions ?
3. Check whether linked list is circular
I applied through university. The process took 1 day. I interviewed at Quikr India
Interview
There were a total of 4 rounds.
Round - 1: (written)
Asked to write down the code for two problems in your language of interest.
1. Addition of two numbers which are represented as linked lists.
2. It was a dynamic programming problem.
Round 2, 3: (Technical interview)
Asked some questions on Trees, Linked lists, DS.
The interviewer was looking for a solution which is optimized in space and time.
Round 4: (HR round)
Asked about my projects.
Interview questions [1]
Question 1
1. Sort an array containing 0,1,2 in a single iteration
2. Multiplication of two linked lists
3. Check if two linked lists merge or not
4. Collecting rainwater problem
5. BFS/DFS traversal and level of a node
6. Mirroring a binary tree
7. Find an element in a binary tree. (not bst)
8. Find the number of pairs in an array that add up to the sum k