Unthinkable Solutions Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Easy

The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 95 mins.
Next comes the technical interview. 
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.

Q1. 
Kth Largest Number Problem Statement
Design a data structure to process a stream of numbers and efficiently find the kth largest number at any given point in time.
Explanation:
You will receive a contin...read more
Ans. 
Design a data structure to efficiently find the kth largest number in a stream of numbers.
• Implement a data structure that can store incoming numbers and efficiently retrieve the kth largest number.

• Support addition of numbers and retrieval of the kth largest number.

• Use a priority queue or heap data structure to maintain the k largest numbers in the stream.

• Handle queries of adding numbers and retrieving the kth largest n...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.

Q1. 
Binary Search Tree Search Problem
Given a Binary Search Tree (BST) consisting of 'N' nodes, where each node contains some integer data, your task is to determine whether there is a node in the BST whose d...read more
Ans. 
Given a Binary Search Tree, determine if a node with a given integer exists.
• Traverse the BST in a way that compares the current node's data with the given integer 'X'.

• If the current node's data is equal to 'X', return True.

• If the current node's data is less than 'X', move to the right subtree; if greater, move to the left subtree.

• Repeat this process until a match is found or the end of the tree is reached.
Answered by AI
Add your answer
Q2. 
Remove Duplicates Problem Statement
You are given an array of integers. The task is to remove all duplicate elements and return the array while maintaining the order in which the elements were provided.
...read more
Ans. 
Remove duplicates from an array while maintaining order.
• Use a set to keep track of unique elements.

• Iterate through the array and add elements to the set if not already present.

• Convert the set back to an array to maintain order.
Answered by AI
Add your answer