Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Unthinkable Solutions interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

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

Interview preparation journey

expand-icon
Preparation
Duration: 7 months
Topics: Aptitude, SQL, Data structure, Dynamic Programming, Recursion, C++, Logical reasoning
Tip
Tip

Tip 1 : Read interview experience before interview
Tip 2 : Think loud about each coding question.

Application process
Where: Campus
Eligibility: No backlog
Resume Tip
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : No spelling mistake
Tip 3 : Resume should be in proper format

Interview rounds

01
Round
Easy
Online Coding Test
Duration90 minutes
Interview date2 Nov 2020
Coding problem1

The 1st round was online coding + MCQ round. It had 3 sections in total to be solved in 95 mins.
Next comes the technical interview. 
The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.

1. KthLargestNumber

Moderate
30m average time
65% success
0/80
Asked in companies
Wells FargoGoldman SachsPhone Pe

You will be given a stream of numbers, and you need to find the 'kth' largest number in the stream at any given time.


View more
Try solving now
02
Round
Easy
Face to Face
Duration30 minutes
Interview date11 Nov 2020
Coding problem3

The technical interview lasted for about 45 minutes. It started with a basic introduction. Then, she framed some questions from my resume and projects which I have mentioned. Questions were mainly from Data structure, OS, DBMS, SQL. She told me to rate my data structure skill on a scale of 1 to 5.

1. Technical Questions

What is a semaphore?
What is race condition?
Describe all the joins in SQL with a Venn diagram.
 

2. Search In BST

Easy
15m average time
85% success
0/40
Asked in companies
LinkedInAckoErnst & Young (EY)

There is a Binary Search Tree (BST) consisting of ‘N’ nodes. Each node of this BST has some integer data.


View more
Try solving now

3. Remove Duplicates

Easy
15m average time
80% success
0/40
Asked in companies
GoogleCIS - Cyber InfrastructureTata Consultancy Services (TCS)

Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and ...

View more
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What is the result of 4 % 2?

Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Unthinkable Solutions
776 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 6 problems
Interviewed by Unthinkable Solutions
1588 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Unthinkable Solutions
503 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Unthinkable Solutions
449 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
5553 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
4783 views
3 comments
0 upvotes