Unthinkable Solutions interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Unthinkable Solutions
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
Unthinkable Solution visited our campus on 6th October for the role of Junior Associate-IT. It consists of a total of 4 rounds. First coding round and other three are interviews( 2 technical + 1 HR ). Online coding was on the 6th of October
Application story
Unthinkable Solution visited our campus on 6th October for the role of Junior Associate-IT. It consists of a total of 4 rounds. First coding round and other three are interviews( 2 technical + 1 HR ). Online coding was on the 6th of October
Why selected/rejected for the role?
I rejected because my technical interview happened very good lable questions and I did not cleared technical interview
Preparation
Duration: 3
Topics: Data Structures, Pointers, OOPS, DBMS, JAVA
Tip
Tip

Tip 1 : Be confident 
Tip 2 : Be clear
Tip 3 : Good communication

Application process
Where: Campus
Eligibility: 7.5 CGPA
Resume Tip
Resume tip

Tip 1 : Clear and truth resume
Tip 2 : Full fill criteria

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date6 Oct 2022
Coding problem2

This round is a objective based and one programming question round

1. Balanced parentheses

Moderate
10m average time
90% success
0/80
Asked in companies
IntuitPayPalInfo Edge India (Naukri.com)

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

I solved 2 questions fully and there is a wrong test case given for 3rd question, so they consider only 2 questions for evaluation. Out of 500 students, they selected 27, and they shortlisted 30 students for the 2nd online coding test

Try solving now

2. MegaPrime Numbers

Easy
15m average time
90% success
0/40
Asked in companies
Daffodil SoftwareUnthinkable SolutionsNagarro Software

Given two integers ‘Left’ and ‘Right’. Your task is to find the total count of ‘megaprime’ numbers from the range ‘Left’ to ‘Right’. A ‘megaprime’ number is a prime number and its individual digits are also prime.

For example, ‘53’ is a ‘megaprime’ number because ‘53’ is a prime number and its individual digits,‘3’ and ‘5’, are also prime. ‘13’ is not a ‘megaprime’ number because out of its individual digits (1, 3), ‘1’ is not prime.

Note :

1.’Left’ and ‘Right’ both are inclusive in the range ‘Left’ to ‘Right’.

Example :

‘Left’ = ‘23’  and ‘Right’ = ‘37’

binary_heap

All prime numbers from ‘23’ to ‘37’ are 23, 29, 31, 37

23 is ‘megaprime’ number because ‘2’ and ‘3’ both are prime
29 is not ‘megaprime’ number because ‘9’ is not a prime
31 is not a ‘megaprime’ number because ‘1’ is not a prime number
37 is ‘megaprime’ number because ‘3’ and ‘7’ both are prime numbers
Hence there are two ‘megaprime’ numbers 23, 37 out of 23, 29, 31, 37.
Problem approach

I solved 2 questions fully and there is a wrong test case given for 3rd question, so they consider only 2 questions for evaluation. Out of 500 students, they selected 27, and they shortlisted 30 students for the 2nd online coding test

Try solving now
02
Round
Easy
Video Call
Duration45 minutes
Interview date7 Oct 2022
Coding problem1

This round lasted for about 45mins. The first and very obvious question was to INTRODUCE YOURSELF! Then He gives me some instructions that don’t use any inbuilt function and explain before write.

1. Missing Number

Moderate
30m average time
70% success
0/80
Asked in companies
Sterlite Technologies LimitedSamsungGeeksforGeeks

You are given an array/list ‘BINARYNUMS’ that consists of ‘N’ distinct strings which represent all integers from 0 to N in binary representation except one integer. This integer between 0 to ‘N’ whose binary representation is not present in list ‘BINARYNUMS’ is called ‘Missing Integer’.

Your task is to find the binary representation of that ‘Missing Integer’. You should return a string that represents this ‘Missing Integer’ in binary without leading zeros.

Note

1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.

Example:

Consider N = 5 and the list ‘binaryNums’=  [“0”, “01”, “010”, “100”, “101”].  This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.
Problem approach

Find the missing number from the sorted array consisting of number from 1 to N. (Simple One) I explained to him an iterative solution that we have to compare every value with the last value (Starting from index 1) if the difference is exact 1 then move further otherwise we got our missing number. He is not happy with the approach. He told me to give another solution. Then I explained the new solution that we have to find the sum of all the array elements and subtract it from the sum of 1 to N i.e N*(N+1)/2

Try solving now

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
company logo
SDE - Intern
4 rounds | 4 problems
Interviewed by Unthinkable Solutions
3626 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 9 problems
Interviewed by Unthinkable Solutions
837 views
0 comments
0 upvotes
company logo
Associate Developer
5 rounds | 8 problems
Interviewed by Unthinkable Solutions
825 views
0 comments
0 upvotes
company logo
Associate Technology
2 rounds | 3 problems
Interviewed by Unthinkable Solutions
627 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
3699 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
2658 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
2330 views
0 comments
0 upvotes