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

SDE - 1

Samsung
upvote
share-icon
2 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 Months
Topics: Data Structures, Competitive Programming, Databases, Java, Spring , Hibernate, Jenkins, AWS
Tip
Tip

Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts

Application process
Where: Other
Eligibility: na
Resume Tip
Resume tip

Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand

Interview rounds

01
Round
Easy
Video Call
Duration90 Minutes
Interview date18 Mar 2022
Coding problem2

It was conducted on the cubes platform. We were given 2 coding questions to solve in 90 minutes.

I solved both the problems within 25 min and checked for different test cases manually for more than 15 mins. There were only two test cases were visible and the rest are hidden. Even After submission, they didn’t show us whether all test cases pass not. So, before submission doesn’t forget to check for corner cases manually. One needs to pass all test cases as low as time possible.

1. Next Greater Number

Moderate
15m average time
90% success
0/80
Asked in companies
Morgan StanleySamsungArcesium

You are given a string S which represents a number. You have to find the smallest number strictly greater than the given number which contains the same set of digits as of the original number i.e the frequency of each digit from 0 to 9 should be exactly the same as in the original number.

For example:
If the given string is 56789, then the next greater number is 56798. Note that although 56790 is also greater than the given number it contains 1 '0' which is not in the original number and also it does not contain the digit '8'.

Note:

The given string is non-empty.

If the answer does not exist, then return -1.

The given number does not contain any leading zeros.
Try solving now

2. Check if two trees are Mirror

Easy
15m average time
85% success
0/40
Asked in companies
SAP LabsLinkedInGoldman Sachs

You are given two arbitrary binary trees consisting of N and M number of nodes respectively, your task is to check whether the two trees are mirror of each other or not.

Two trees are said to be mirror of each other, if

1. Roots of both the given trees are same.
2. Left subtree of the root of the first tree is the mirror of the right subtree of the root of the second tree.
3. Right subtree of the root of the first tree is the mirror of the left subtree of the root of the second tree.

For example,both the given trees are mirror image of each other: example

Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date21 Apr 2022
Coding problem0

We had to schedule the same google to meet link for 90 days and shared the link with Samsung.

Introduce yourself.
The data structures you know.
Tell about PreOrder, InOrder, PostOrder traversal of a tree.
How will you implement a queue using an array (Circular Queue Concept).
Tell about BFS, DFS.
Basic OOPs.
They didn’t ask me any coding questions in this round but other candidates were drilled by the coding questions.

Here's your problem of the day

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 6 problems
Interviewed by Samsung
1863 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Samsung
1180 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Samsung
2182 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Samsung
400 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes