Unthinkable Solutions interview experience Real time questions & tips from candidates to crack your interview
Junior Associate Technology
Unthinkable Solutions
4 rounds | 6 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, DBMS, OOPS Core Concepts, Algorithms, System Design
Tip 1 : Do regular practice on online platforms as in the first round you have to write the code for 2 programs in a given time (In my case it was 40 min)
Tip 2 : In the second round they will ask about some algorithms (like binary search, selection sort, ...etc) & some DBMS-based questions (joins, types of indexing)
Tip 3 : In third, they will ask a to write a code for hard level program & some OOPS-based questions (like encapsulation, and inheritance) & also they will check your confidence level.
Application process
Where: Referral
Eligibility: 60% Aggregate
Tip 1 : Single Page resume is good.
Tip 2 : Short & well explained your skills.
Tip 3 : Hobbies should be positive (they can ask about your hobbies in the final HR round ..so be you be true)
Interview rounds
01
Round
Medium
Online Coding Interview
Duration40 minutes
Interview date30 May 2019
Coding problem2
2 Programs of Basic difficulty level were asked in this round.
1. Remove Duplicates
Easy
0/40
Asked in companies
Given a string S, remove consecutive duplicates from it recursively.
Problem approach
Step 1 : Input the size of an array from the user and store into the size variable.
Step 2 : Use for loop to read the elements of an array and store in arr[i] variable.
Step 3 : To get the duplicate elements from an array we need to use two for loops. Where the first loop start from 0 to size. And the structure of the loop is: for (i = 0; i < size; i++).
Another loop selects each element of the array and compare with the corresponding element to get the duplicate elements. And the structure of the inner loop is: for (j = i + 1; j < size; j++) and the code to find the subsequent same element is: if (arr[i] == arr[j]).
Step 4 : If any duplicate element is encountered, delete the duplicate element from an array and the size of array is decrement by 1 such that, size = size - 1.
Step 5 : After that, print the unique elements of an array
2. Balanced parentheses
Moderate
10m average time
90% success
0/80
Asked in companies
Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.
Note :
Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.
2. Open brackets must be closed in the correct order.
For Example :
()()()() is a valid parentheses.
)()()( is not a valid parentheses.
Problem approach
Step 1 : Declare a character stack S.
Step 2 : Now traverse the expression string exp.
If the current character is a starting bracket (‘(‘ or ‘{‘ or ‘[‘) then push it to stack.
If the current character is a closing bracket (‘)’ or ‘}’ or ‘]’) then pop from stack and if the popped character is the matching starting bracket then fine else brackets are not balanced.
Step 3 : After complete traversal, if there is some starting bracket left in stack then “not balanced”
02
Round
Medium
Face to Face
Duration30 minutes
Interview date31 May 2019
Coding problem2
This round was started just after announcing the result of the first round. HR announced my name in front of all attendees candidates. I went to the interview confluence/ interview room and in just 2 min interviewer entered the room.
Now, this round started with the introduction.
The interviewer asked me some questions which are related to binary search. then move to DBMS with table join problem.
I have given the answer to all questions. Now the interviewer gives me a hint that he is moving my profile with All the best give the best in the further round! :)
1. Search an Element in an Array
Easy
15m average time
80% success
0/40
Asked in companies
You have given a sorted array 'A' of 'N' integers.
Now, you are given 'Q' queries, and each query consists of a single integer 'X'. Your task is to check whether 'X' is present in array 'A' or not for each query. If 'X' exists in array 'A', you need to print 1 else print 0.
Note :
The given array is sorted in non-decreasing order.
Problem approach
Step 1 : Begin with the mid element of the whole array as a search key.
Step 2 : If the value of the search key is equal to the item then return an index of the search key.
Or if the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half.
Step 3 : Otherwise, narrow it to the upper half.
Step 4 : Repeatedly check from the second point until the value is found or the interval is empty.
2. DBMS
Inner Join, Outer Join in Table A & Table B
Problem approach
Tip 1 : Do practice the SQL queries & try to understand the basic problems.
03
Round
Hard
Face to Face
Duration40 minutes
Interview date31 May 2019
Coding problem1
It was a managerial round. The manager comes into the interview room & now questions started after the introduction.
He was trying to check my data structure level & asked the question on the tree & give me a coding question & gives me 15 min time to complete this program which was a pattern-based question.
1. Triangle Star Pattern
Easy
0/40
Asked in companies
Print the following pattern for the given N number of rows.
Pattern for N = 4
*
**
***
****
Note : There are no spaces between the stars (*).
Problem approach
Step 1 : Find how many times outer loop needs to be run for rows.
Step 2 : Find how many times inner loop needs to be run for columns
Step 3 : Create logic in which * needs to be print. (need to find the combination in which astrick need to be display)
04
Round
Hard
HR Round
Duration30 minutes
Interview date31 May 2019
Coding problem1
Approximately, 4 hours took to come at this round. Now I was feeling that how much CTC I will get as my all rounds were good.
But the main twist was left. This round was very circuitous and HR asked me some clever questions in which I was stuck.
So I was thinking that don't know whether I will get the offer or not. but finally...I got the offer.
1. Basic HR Questions
- Tell me about yourself.
- Tell me about your today routine.
- Why do you want to work for Unthinkable Solutions?
- What are your greatest strengths and weaknesses?
- Why should we hire you?
- What are your salary expectations?
- What if we do not give you the chance to work as per your interest (Gives another framework/ language in which you have to work)?
Problem approach
Tip 1 : Be true be you
Tip 2 : In all answers, first think about giving priority to the company benefits then reply.
Tip 3 : Be Positive and confident.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which SQL clause is used to specify the conditions in a query?
Choose another skill to practice
Similar interview experiences
Junior Associate Technology
4 rounds | 11 problems
Interviewed by Unthinkable Solutions
Selected 
1398 views
0 comments
0 upvotes
Associate Developer
5 rounds | 8 problems
Interviewed by Unthinkable Solutions
Selected 825 views
0 comments
0 upvotes
Junior Associate Technology
2 rounds | 4 problems
Interviewed by Unthinkable Solutions
Rejected
705 views
0 comments
0 upvotes
Associate Technology
2 rounds | 3 problems
Interviewed by Unthinkable Solutions
Rejected
627 views
0 comments
0 upvotes
Companies with similar interview experiences
Junior Associate Technology
2 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 1394 views
0 comments
0 upvotes
Junior Associate Technology
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 1031 views
0 comments
0 upvotes
Junior Associate Technology
2 rounds | 2 problems
Interviewed by CIS - Cyber Infrastructure
Selected 867 views
0 comments
0 upvotes