Clarivate interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Clarivate
3 rounds | 6 Coding
problems
Selected Interview preparation journey
Journey
I was from a coding background until I joined a tier-3 college, i.e., SJBIT, Bangalore, in the ISE branch. Till 2nd year, I was just aware of the basics of the C language, but my friends who were in the ranked colleges motivated me to start coding, and finally, I started coding in 3rd year(COVID-19 period). I solved approximately 400 questions until the start of 4th year on coding platforms. I got rejected by 3-4 companies because they asked questions about CS subjects like OS, CN, and DBMS. I studied OS and DBMS and started to try again. My first offer was from Zensar Technologies, then Evertz Microsystems, Mindtree, and Persistent Systems. Clarivate came in the mid-end of 4th year and had more promising offers than others. I got selected for Clarivate and finally joined it.
P.S.- I tried Samsung and Mentor Graphics(Siemens EDA) for the SDE-1 role and got rejected in the 5th and 4th rounds, respectively(the latest round for both).
Application story
It was on campus. I directly wrote the Online assessment part. I got a call for further interview rounds, which were conducted very soon, just after a few days.
Why selected/rejected for the role?
I got selected because my interviewer found that I have good analytical skills and can implement my coding skills to solve real-time problems.
Preparation
Duration: 12 months
Topics: C++, Data Structures, Pointers, OOPS, Algorithms, Dynamic Programming, OS, DBMS, CN(Basic)
Tip 1: Practice at least 400 Questions on Data Structures & Algorithms(if FAANG is your dream)
Tip 2: Add two projects to your resume(Can be basic also but don't pick someone else's project else you will get stuck
while answering questions.
Tip 3: Prepare CS subjects like OS, CN, and DBMS(out of OS and CN, one can be basic, and the other one should be thorough)
Tip 4: Prepare for advanced data structures Like Graphs, Trees, Trie
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1: Add two projects that should be live hosted. (Free web hosting platforms like Heroku)
Tip 2: Add the number of coding questions you completed with your platform profile link.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 mins
Interview date21 Feb 2022
Coding problem2
It was an online MCQ + coding round with 5 MCQ questions and 2 Coding questions. The test window was available for a day; I could write any time during that window. One question was from bit manipulation, and another was from sorting.
1. Count Set Bits
Hard
15m average time
85% success
0/120
Asked in companies
You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.
Since the count of ‘1’ can be huge, you are required to return it modulo 1e9+7.
Note:
Do not print anything, just return the number of set bits in the binary representation of all integers between 1 and ‘N’.
Problem approach
My first approach was to count all ones by summing up the zeroth bit, do the '&' operation with one, and do the right shift by 1.
My optimized approach was to use a while loop until n exists and do n &= n - 1. This operation turns off the rightmost set bit (1) in n and does a right shift by 1.
2. Squares of a Sorted Array
Easy
15m average time
85% success
0/40
Asked in companies
You are given an array/list ‘ARR’ of ‘N’ integers. You have to generate an array/list containing squares of each number in ‘ARR’, sorted in increasing order.
For example :
Input:
‘ARR’ = [-6,-3, 2, 1, 5]
If we take a square of each element then the array/list will become [36, 9, 4, 1, 25].
Then the sorted array/list will be [1, 4, 9, 25, 36].
Output :
[1, 4, 9, 25, 36].
Problem approach
I was able to solve it in one try only in O(1).
02
Round
Medium
Video Call
Duration70 mins
Interview date23 Feb 2022
Coding problem3
There were two interviewers. It was a coding + problem-solving round.
1. All Prime Numbers less than or equal to N
Moderate
10m average time
90% success
0/80
Asked in companies
You are given a positive integer 'N'. Your task is to return all the prime numbers less than or equal to the 'N'.
Note:
1) A prime number is a number that has only two factors: 1 and the number itself.
2) 1 is not a prime number.
Problem approach
Tip 1: Don't use the optimized approach directly, even if the question is easy.
Tip 2: Try to communicate and speak while thinking the logic.
2. Puzzle
There are 25 horses, among which you need to find the fastest three horses. You can race among at most 5 to find out their relative speed. You need help finding out the horse's actual speed in a race. Could you determine the minimum number of races required for the top 3 horses?
Problem approach
Tip 1: group the horses into groups of 5 and race each group on the race course. This gives us five races.
Tip 2: Now keep a competition between the winners of those five groups.
3. Puzzle
There are two poles of equal height, 15 meters. One cable with a length of 16 meters is hanging between those two poles. If the height from the cable's center to the earth is 7 meters, what is the distance between the two poles?
Problem approach
Tip 1: If you bring the two poles closer to each other the center of the cable is much lower than its
initial position, and if we bring the two poles very close to each other such that the distance between
them is 0 meters. Then, we see that the cable is precisely divided into two halves.
Tip 2: If the height from the center of the cable to the earth is 7 meters, then the distance between those two
poles are 0 meters.
03
Round
Easy
HR Round
Duration20 mins
Interview date25 Feb 2022
Coding problem1
She asked for basic information about me.
1. Basic HR Question
She asked basic questions like where you see yourself in the next five years.
Problem approach
Tip 1: Google these things. Prepare for the answer of short-term goals and long-term goals.
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
Associate Software Engineer
2 rounds | 2 problems
Interviewed by Clarivate
Selected 
2683 views
1 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 8518 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 2581 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 2672 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
Selected 2347 views
0 comments
0 upvotes
Associate Software Engineer
4 rounds | 9 problems
Interviewed by NCR Corporation
Selected 1475 views
0 comments
0 upvotes