Clarivate Software Developer Interview Questions and Answers

Best wishes to you know that you have to come to the day da

Hi sir I have sent the best for first year and all the best for your reference

Round duration - 30 Minutes
Round difficulty - Easy

The questions ranged from prime number concepts to one question on linked list.

Q1. 
Prime Time Again Problem Statement
You are given two integers DAY_HOURS and PARTS. Consider a day with DAY_HOURS hours, which can be divided into PARTS equal parts. Your task is to determine the total ins...read more
Ans. 
Given DAY_HOURS and PARTS, find total instances of equivalent prime groups in a day divided into equal parts.
• Divide the day into equal parts and check for prime groups at the same position in different parts.

• Each prime group consists of prime numbers occurring at the same position in different parts.

• Return the total number of equivalent prime groups found.

• Ensure DAY_HOURS is divisible by PARTS and each hour in a prime
Answered by AI
Add your answer
Q2. 
Add Two Numbers Represented as Linked Lists
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...read more
Ans. 
Add two numbers represented as linked lists in reverse order and return the sum as a linked list.
• Traverse both linked lists simultaneously, adding corresponding digits and carrying over if necessary.

• Handle cases where one list is longer than the other by considering carry over.

• Create a new linked list to store the sum digits in reverse order.

• Return the head of the new linked list as the result.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Exam was in the morning in 2nd shift. It was a difficult .

Q1. 
Sum of Even & Odd Digits
You need to determine the sum of even digits and odd digits separately from a given integer.
Input:
The first line of input is an integer T representing the number of test c...read more
Ans. 
Implement a function to find the sum of even and odd digits separately in a given integer.
• Iterate through each digit of the integer and check if it is even or odd.

• Keep track of the sum of even and odd digits separately.

• Return the sums of even and odd digits for each test case.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Hard

It was in the morning and there were approx 500 candidates for interview. Interviewers were very nice and cooperative.

Q1. What SQL questions do you have related to joins?
Ans. 
SQL questions related to joins
• Types of joins in SQL (inner join, left join, right join, full outer join)

• Difference between inner join and outer join

• Common join conditions (using ON vs WHERE)

• Handling NULL values in joins

• Performance considerations when using joins
Answered by AI
Add your answer

Round duration - 10 minutes
Round difficulty - Medium

It was in the morning and interviewer was very nice and polite.

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

Q1. 
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...read more
Ans. 
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
• Use DFS to traverse the graph and detect back edges indicating a cycle.

• Maintain a visited array to keep track of visited nodes during traversal.

• If a node is visited again during traversal and it is not the parent node, then a cycle exists.

• Return true if a cycle is detected, false otherwise.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

• Handle cases where the number is a palindrome or has all digits as '9'.

• Consider both odd and even length numbers when finding the next palindrome.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in a top-down manner

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes in a bottom-up manner

• Handle cases where duplicates occur in the boundary nodes

• Implement the function without printing as printing is already managed
Answered by AI
Add your answer