Unthinkable Solutions Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Easy

The round was basically based on the DSA easy level questions. Platform was good enough to code easily

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
• Iterate through the array and find the maximum height on the left and right side of each bar.

• Calculate the amount of water that can be trapped on each bar by subtracting its height from the minimum of the maximum heights on both sides.

• Sum up the amount of water trapped on each bar to get the total amount of rainwater
Answered by AI
Add your answer
Q2. 
Reverse String Word Wise Problem Statement
Your task is to reverse the given string word-wise. This means the last word in the string should appear first, the second last word should appear second, and so...read more
Ans. 
The given string needs to be reversed word wise, keeping the individual words intact.
• Split the string into an array of words using a space as the delimiter.

• Reverse the array of words.

• Join the reversed array of words using a space as the separator to form the final reversed string.
Answered by AI
View 1 more answer

Round duration - 20 minutes
Round difficulty - Easy

It is base on OOPS and Data structures.

Q1. 
Problem: Sort an Array of 0s, 1s, and 2s
Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
Input:
The input sta...read more
Ans. 
The task is to sort an array of 0s, 1s, and 2s in increasing order.
• Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.

• Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.

• While mid <= high, perform the following checks: if arr[mid] == 0, swap arr[low] and arr[mi
Answered by AI
Add your answer
Q2. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Ans. 
The task is to find the second largest element in an array of integers.
• Iterate through the array and keep track of the largest and second largest elements.

• Initialize the largest and second largest variables with the first two elements of the array.

• Compare each element with the largest and second largest variables and update them accordingly.

• Return the second largest element at the end.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

One Coding question and projects was discussed

Q1. 
Sort Array by Reversing a Subarray
You are given an array of 'N' distinct integers, 'ARR'. Determine if it is possible to sort this array by selecting a continuous subarray and reversing it. Return 'true'...read more
Ans. 
The question asks whether it is possible to sort an array by choosing a continuous subarray and reversing it.
• Check if the array is already sorted. If yes, return true.

• Find the first and last elements of the subarray that needs to be reversed.

• Check if the subarray is in non-decreasing order. If yes, return true.

• Check if the elements after the subarray are in non-increasing order. If yes, return true.

• Otherwise, return fa
Answered by AI
Add your answer
Q2. 
Find Duplicate in Array Problem Statement
You are provided with an array of integers 'ARR' consisting of 'N' elements. Each integer is within the range [1, N-1], and the array contains exactly one duplica...read more
Ans. 
The task is to find the duplicate element in an array of integers.
• Iterate through the array and keep track of the frequency of each element using a hash map.

• Return the element with a frequency greater than 1.

• Alternatively, sort the array and check for adjacent elements with the same value.
Answered by AI
Add your answer

Coding questions of arrays and stack

Q1. Introduction, why this org and other usual questions.
Add your answer

3 coding question
1. Easy and 2 medium
You can easily solve 2

Q1. 2 coding questions Climbing stairs and print repeating elements
Add your answer

Problem-solving, data structures and logical ability on HackerEarth which lasts for 1.5-2 hours

Q1. Star pattern in C language
Ans. 
Star pattern is a common programming exercise to print a pattern of stars in a specific shape.
• Use nested loops to print the desired number of rows and columns.

• Use if-else statements to determine when to print a star or a space.

• Experiment with different loop conditions and print statements to create different patterns.
Answered by AI
Add your answer
Q2. Linked list and arrays manipulation
Add your answer
Q3. Analytical thinking to solve a problem
Add your answer

Q1. About your project done in college
Add your answer
Q2. Any professional or freelancing experience
Ans. 
Yes, I have professional experience as a Junior Associate in a law firm.
• Worked as a Junior Associate at XYZ Law Firm for 2 years

• Assisted senior attorneys in legal research, drafting legal documents, and preparing for trials

• Managed client communication and maintained case files

• Participated in client meetings and court hearings

• Developed strong analytical and problem-solving skills
Answered by AI
Add your answer

Q1. General questions by HR like hobbies, background, likes, expectations
Add your answer

Data Structure And Logical Questions

Q1. No Idea totally depends on the interviewer
Add your answer

Q1. About 20 min totally depends on communication skills
Add your answer