Unthinkable Solutions interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Unthinkable Solutions
4 rounds | 9 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Medium Data Structures and Algorithms Question based on (Arrays, String, HashMap, Stack, Queue, Trees, etc), OOPS, Basic Dynamic Programming, Puzzles, System Design.
Tip 1 : Prepare basic, easy and medium DSA Questions.
Tip 2 : Know well about your project written on resume.(Do atleast one project in your comfortable programming language)
Application process
Where: Campus
Eligibility: 6.5
Tip 1 : Mention at least one project in your resume.
Tip 2 : Limit your resume to one or two page only.
Tip 3 : Mention about your accomplishment and work done in past related to the job description.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date13 Aug 2019
Coding problem2
1 Round(HackerEarth coding Round): It was a online Coding round with having 5 MCQ based questions on OOPS + 2 coding question based on Array and String (medium difficulty). I am not able to recall the questions exactly. It was time based round and has a limit of 60 minutes.
1. Sort An Array of 0s, 1s and 2s
Easy
10m average time
90% success
0/40
Asked in companies
You have been given an array/list 'arr' consisting of 'n' elements.
Each element in the array is either 0, 1 or 2.
Sort this array/list in increasing order.
Do not make a new array/list. Make changes in the given array/list.
Example :
Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]
Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]
Explanation: The array is sorted in increasing order.
2. Split String
Easy
0/40
Asked in companies
You are given a string ‘str’ of even length. Your task is to find out if we divide the ‘str’ from the middle, will both the substrings contain an equal number of vowels or not.
For Example:
You are given, ‘str’= ‘codingninjas’, when we split this string we get, ‘coding’ and ‘ninjas’ which both contain 2 vowels each. Hence the answer is ‘True’.
Problem approach
I have used regular expression for splitting the string.
02
Round
Medium
Face to Face
Duration45 minutes
Interview date13 Aug 2019
Coding problem3
2 Round(1st Technical ): It was a Face to Face technical round with a senior employee of Unthinkable Solutions and Interviewer asked me question on problem solving skills and a puzzle. Interviewer was very interactive and asked few questions on MySQL. This round goes for 30-45 minutes.
1. Puzzle
You have a birthday cake and have to cut it into 8 equal pieces by making 3 cuts only. How do you do it?
Problem approach
Tip 1 : Understand the question thoroughly and look for all possible answers, it could have. if you are sure with one solution that can solve this problem, tell that to the interviewer.
Tip 2 : Look for alternative solutions as well because a puzzle can have multiple correct answer.
2. Majority element
Easy
15m average time
85% success
0/40
Asked in companies
You have been given an array/list 'ARR' consisting of 'N' integers. Your task is to find the majority element in the array. If there is no majority element present, print -1.
Note:
A majority element is an element that occurs more than floor('N' / 2) times in the array.
3. DBMS
- What are Joins?
- What is the difference between a right join and left join?
- What is normalization in DBMS? Explain its different forms
Problem approach
Tip 1 : Brush up your DBMS concept
Tip 2 : Focus on your college lectures
03
Round
Medium
Face to Face
Duration60 minutes
Interview date13 Aug 2019
Coding problem3
3 Round (2nd Technical and Managerial Round): This round was again with a senior employee of Unthinkable solutions. He asked me questions on Trees and string. Also, questions on my project mentioned in my resume and this round goes for 30 minutes.
1. Compress the String
Moderate
32m average time
60% success
0/80
Asked in companies
Write a program to do basic string compression. For a character which is consecutively repeated more than once, replace consecutive duplicate occurrences with the count of repetitions.
Example:
If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".
The string is compressed only when the repeated character count is more than 1.
Note:
Consecutive count of every character in the input string is less than or equal to 9. You are not required to print anything. It has already been taken care of. Just implement the given function and return the compressed string.
Problem approach
I took a variable count initialized with 1, output_length with 0 and loop over the string from index 1 to n and checked if the previous string is same as current string then increased a count by 1 else, append the previous char and count into result string.
2. DBMS
- Explain, what is Indexing and its types?
- What are ACID property?
Problem approach
Tip 1 : Brush up your DBMS concept
Tip 2 : Focus on your college lectures
3. Compress the String
Moderate
20m average time
75% success
0/80
Asked in companies
Given a graph with 'V' vertices numbered from 0 to 'V' - 1 and 'E' edges. Determine if it is a tree or not?
Problem approach
If the Inorder traversal of given tree is sorted, then this tree is BST.
I found the Inorder traversal of BST and checked is it a sorted array or not.
04
Round
Easy
HR Round
Duration30 minutes
Interview date13 Aug 2019
Coding problem1
4 Round(HR Round): In this Round HR asked me basic question about myself. It was again a 30 minutes round.
1. Basic HR Questions
- Why do you want to join Unthinkable Solutions?
- Tell me Something about yourself
- Tell me about your weakness and strength
- Tell me the something about your family
Problem approach
Tip 1 : Answer with confidence.
Tip 2 : Be Polite while answering.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 6 problems
Interviewed by Unthinkable Solutions
Selected 
1442 views
0 comments
0 upvotes
SDE - 1
4 rounds | 6 problems
Interviewed by Unthinkable Solutions
Selected 2170 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Unthinkable Solutions
Selected 881 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Unthinkable Solutions
Selected 1153 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6365 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2197 views
0 comments
0 upvotes