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

SDE - 1

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

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: DS algo , recursion , oops, dbms , SQL , DP
Tip
Tip

Tip 1 : Practice Ds algo questions daily
Tip 2 : Add practical based questions

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

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date21 Aug 2020
Coding problem3

There were 2 sections :- 
1st section consists of Mcqs related to DBMS , DS algo , aptitude
2nd question :- coding round

1. Find Diameter of a Binary Tree

Easy
10m average time
90% success
0/40
Asked in companies
AdobePhonePeAmazon

You are given a Binary Tree.


Return the length of the diameter of the tree.


Note :
The diameter of a binary tree is the length of the longest path between any two end nodes in a tree.

The number of edges between two nodes represents the length of the path between them.
Example :
Input: Consider the given binary tree:

Example

Output: 6

Explanation:
Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6.


Problem approach

Diameter of a tree can be calculated by only using the height function, because the diameter of a tree is nothing but maximum value of (left_height + right_height + 1) for each node. So we need to calculate this value (left_height + right_height + 1) for each node and update the result. Time complexity – O(n)

Try solving now

2. Number Of Pairs With Given Sum

Moderate
39m average time
60% success
0/80
Asked in companies
Goldman SachsAmazonSamsung

You have been given an integer array/list(arr) and a number 'Sum'. Find and return the total number of pairs in the array/list which when added, results equal to the 'Sum'.

Note:
Given array/list can contain duplicate elements.

(arr[i],arr[j]) and (arr[j],arr[i]) are considered same.
Problem approach

A simple solution is to traverse each element and check if there’s another number in the array which can be added to it to give sum.

Try solving now

3. Common Elements

Moderate
35m average time
70% success
0/80
Asked in companies
SAP LabsWalmartFlipkart limited

Given two 1-dimensional arrays containing strings of lowercase alphabets, print the elements that are common in both the arrays i.e. the strings that are present in both the arrays.

Note:
An element of one array can be mapped only to one element of the array. For example :

Array 1 = {“ab”, “dc”, “ab”, “ab”}
Array 2 = {“dc”, “ab”, “ab”} 

The common elements for the above example will be “dc”, “ab”, and “ab”. 
Problem approach

A simple solution is to first find intersection of two arrays and store the intersection in a temporary array, then find the intersection of third array and temporary array. 
Time complexity of this solution is O(n1 + n2 + n3) where n1, n2 and n3 are sizes of ar1[], ar2[] and ar3[] respectively

Try solving now
02
Round
Medium
Video Call
Duration45 minutes
Interview date26 Aug 2020
Coding problem7

This was the technical round. The interviewer was calm and gentle. He starts with my introduction and then ask about my projects. Then he gave me 2 coding questions to solve

1. Check Permutation

Easy
0/40
Asked in companies
SAP LabsMicrosoftPropTiger

For a given two strings, 'str1' and 'str2', check whether they are a permutation of each other or not.

Permutations of each other
Two strings are said to be a permutation of each other when either of the string's characters can be rearranged so that it becomes identical to the other one.

Example: 
str1= "sinrtg" 
str2 = "string"

The character of the first string(str1) can be rearranged to form str2 and hence we can say that the given strings are a permutation of each other.
Problem approach

This method assumes that the set of possible characters in both strings is small. In the following implementation, it is assumed that the characters are stored using 8 bit and there can be 256 possible characters. 

Create count arrays of size 256 for both strings. Initialize all values in count arrays as 0.
Iterate through every character of both strings and increment the count of character in the corresponding count arrays.
Compare count arrays. If both count arrays are same, then return true.

Try solving now

2. House Robber

Moderate
26m average time
0/80
Asked in companies
PayPalExpedia GroupGoldman Sachs

A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.

Problem approach

Given an array, the solution is to find the maximum sum subsequence where no two selected elements are adjacent. So the approach to the problem is a recursive solution. 

So there are two cases:

If an element is selected then the next element cannot be selected.
if an element is not selected then the next element can be selected.

Try solving now

3. Operating System Question

What is thread in OS?

4. Operating System Question

What is a process? What are the different states of a process?

5. DBMS Question

What are joins?

6. Project Based Question

Give brief about your projects.

7. Android based Question

what is Activity lifecycle in Android Development.

03
Round
Easy
HR Round
Duration30 minutes
Interview date29 Aug 2020
Coding problem1

1. Basic HR questions

Give your introduction. what are your projects

How do you rate your coding skills.

what do you know about our company.? Tell me about your strengths and weaknesses .

Which subject you liked most and unlike most.

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
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Unthinkable Solutions
1442 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 6 problems
Interviewed by Unthinkable Solutions
2170 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Unthinkable Solutions
881 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Unthinkable Solutions
1153 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
6365 views
3 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
2198 views
0 comments
0 upvotes