Unthinkable Solutions Interview Questions, Process, and Tips

Coding test with easy to medium difficulty level problem.

Easy to medium level coding problems

Q1. Asked me to introduce myself
Add your answer
Q2. OOPS concepts like pillars of oops, what is diamond problem asked me to write a program to show run time polymorphism
Add your answer
Q3. Coding question - Pattern based questions
Add your answer
Q4. DBMS, OS concepts , etc
Add your answer
Q5. Questions based on projects
Add your answer
Q6. Behavioral questions
Add your answer

Q1. General behavioural questions
Add your answer
Q2. Situation based questions
Add your answer
Q3. Lots of cross questioning
Add your answer

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. Brute Force
• The brute force approach for this problem is very trivial.
• We can always maintain an array that will hold the integers, sort the array in non-increasing order and return the element present at the kth index(1-based indexing).
• The array should be such that it can add elements efficiently, for example, vectors in C++, lists in python, etc. Whenever we receive a query of type 1, we add the element in the array an...read more
Answered Anonymously
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. Recursive Approach
Approach: If the root node has data smaller than ‘X’. then by properties of BST, ‘X’ cannot be in its left subtree, so we recursively check for the right subtree. 
If the root node has data larger than ‘X’. then by properties of BST, ‘X’ cannot be in its right subtree, so we recursively check for the left subtree.
If the root node has data equal to ‘X’, then we return “True”. 
 
The steps a...read more
Answered Anonymously
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. Brute Force
We will traverse the whole array and check if that element previously occurred or not.
 
The steps are as follows:
• We initialize a vector ‘ans’ to store the final non-duplicate elements.
• We will iterate over all the elements of the array, i.e., i = 0 to i = N - 1:
  • We will iterate over all the elements of the array excluding present element, i.e., j = 0 to j = N - 1:
    • If we get such positions such that arr[i] e...read more
Answered Anonymously
Add your answer