Cleartax interview experience Real time questions & tips from candidates to crack your interview
SDE - 2
Cleartax
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 12 Months
Topics: Array, strings, trees, graph, dynamic programming, system design
Tip 1 : Be confident in whatever solution you pitched
Tip 2 : Make sure you know about the projects you have done in your past
Tip 3 : Be very good in DSA since they ask medium-hard questions
Application process
Where: Referral
Eligibility: NA
Tip 1 : Clearly mention all important tasks you did in your past company
Tip 2 : Mention only a few projects about which you are confident and can explain properly
Interview rounds
01
Round
Hard
Video Call
Duration80 Minutes
Interview date18 Apr 2022
Coding problem1
The round started with a basic introduction followed by a DSA question related to priority queues and two-pointer.
1. Smallest Range From K Sorted List
Moderate
15m average time
85% success
0/80
Asked in companies
You are given ‘K’ lists containing non-negative integers. Each list has a size ‘N’ and is sorted in non-decreasing order. You need to find the minimum length of a range such that at least one element of each list must be included in that range.
For example :
If we have 3 lists as [1, 10, 11], [2, 3, 20], [5, 6, 12] then the [1, 5] is the range that includes 1 from the first list, 2,3 from the second list, and 5 from the third list i.e, this range contains at least one element from each list.
Problem approach
Given we have to find the range for which we need min and max, I used a priority queue using which I can get the min element at a given point of time. Used a max variable to store the max value found so far.
The approach I used is to store 1 element from each array and keep popping the min element and pushing its next element which will give us the next possible range. For each range, we have to compare it with the min and max range we have found so far.
Keep processing the entire array until any 1 of the array is exhausted.
02
Round
Medium
Video Call
Duration60 Minutes
Interview date19 Apr 2022
Coding problem1
Resume discussion followed by a system design question to build a support application portal that can scale for millions of support requests in a short span of time.
1. System Design Question
Given an API which posts data on a third-party application, how would you scale this to avoid downtime and decrease API latency?
Problem approach
Tip 1 : Clarify the problem statement properly and do cross-questions on the requirement.
Tip 2 : Write functional and non-functional requirements beforehand so that you remember to cover those areas.
Tip 3 : Be well in system design concepts related to APIs, rate limiting, async programming, etc.
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
4 rounds | 8 problems
Interviewed by Amazon
Selected 
8518 views
0 comments
0 upvotes
Analytics Consultant
3 rounds | 10 problems
Interviewed by ZS
Selected 907 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3320 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2580 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
Selected 29570 views
8 comments
0 upvotes
SDE - 2
3 rounds | 4 problems
Interviewed by HashedIn
Selected 9584 views
0 comments
0 upvotes
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
Rejected
6677 views
1 comments
0 upvotes