Quikr interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Quikr
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 5 months
Topics: Data Structures, Algorithms, OOPS, OS, DBMS.
Tip 1 : Work on Competitive Programming skills. That is one thing most companies look out for during hiring. Solve at least 100
questions from every topic.
Tip 2 : You should have at least 2 good projects on your resume. Only write the things that you are completely sure of.
Tip 3 : Work on CS fundamentals as well like -OOPS, OS, and DBMS. There will be MCQ questions from this in the coding round as well as in the 1:1 round
Application process
Where: Referral
Eligibility: No
Tip 1 : Need at least 2 good projects on the resume. Write a short 2-3 lines summary of the project and the tech stack
used.
Tip 2 : Resume should be 1 page only. Try to keep the Resume short with useful information only.
Tip 3 : Your Resume should clearly mention the skillset you have. Companies sometimes filter out Resume based on
skillset only
Interview rounds
01
Round
Easy
Face to Face
Duration60 minutes
Interview date21 Jun 2021
Coding problem2
It was on zoom from 5 PM.
1. Trapping Rain Water
Moderate
15m average time
80% success
0/80
Asked in companies
You have been given a long type array/list 'arr’ of size 'n’.
It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.
Print the total amount of rainwater that can be trapped in these elevations.
Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:
Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach
take leftMax and rightMax arrays. Now iterate the map and do
ans += min(leftmax[i], rightmax[i]) - arr[i];
2. Cycle Detection in a Singly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.
A cycle occurs when a node's next points back to a previous node in the list.
Example:
In the given linked list, there is a cycle, hence we return true.
Problem approach
It can be solved by a slow pointer and fast pointer approach
02
Round
Easy
Face to Face
Duration70 minutes
Interview date25 Jun 2021
Coding problem1
1. System Design Question
Design BookMyShow.
Problem approach
Tip 1 : Practice HLD and LLD on some commonly asked designs
Tip 2 : You should know about basics like Caching, CAP Theorem
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 4 problems
Interviewed by Quikr
Selected 
742 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Quikr
Rejected
653 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Quikr
Rejected
781 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Quikr
Selected 777 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57825 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes