Unthinkable Solutions Software Developer Interview Questions, Process, and Tips

3 coding questions of array string and stack

Three questions of coding and compiler was not so good and time was 1 hour

Q1. DSA question and of medium level
Add your answer

1 to 2 coding rounds, depending on your score that covers basic DSA questions

Q1. 2-3 technical round, that covers basic to advanced questions of your preferred language Includes SQL questions
Add your answer

It was good to atted the interview.

It was easy it will ask you questions in java basically.

In the group discussion they will ask some Hr type questions.

In this round they will give you the assignment to complete it.

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