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

SDE - 1

Samsung
upvote
share-icon
4 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4.5 months
Topics: data structures, oops, algorithms, dbms, sql, computer networks
Tip
Tip

Tip 1 : practice previous questions
Tip 2 : attend mock interviews
Tip 3 : make your resume with intresting projects

Application process
Where: Other
Eligibility: no criteria
Resume Tip
Resume tip

Tip 1 : make it short and attractive
Tip 2 : mention only your top 2 or 3 projects

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date16 Oct 2020
Coding problem2

1. Circle of Words

Ninja
63m average time
25% success
0/200
Asked in companies
SamsungCiscoUrban Company (UrbanClap)

You are given an array/list of words, your task is to check whether the individual words can be rearranged to form a circle.

Two words, ‘X’ and ‘Y’, can be put together in a circle if the last character of ‘X’ is the same as the first character of ‘Y’ or vice versa.

For Example:
For the array [ “TUNA”, “TIGER”, “RABBIT”, “RAT”, “ANTEATER” ],

A possible circle can be:

Try solving now

2. Doctor Ninja's House

Hard
50m average time
50% success
0/120
Asked in companies
SamsungWunderman Thompson Commerce

There are ‘N’ cities and ‘M’ paths connecting them. Doctor Ninja wants to purchase a house in a city ‘X’ such that she can reach any city from the city ‘X’.

Your task is to help Ninja to find her a house ‘X’, if you are given with ‘N’ cities and ‘M’ paths.

There can be more than one house ‘X’ possible. You need to output the house ‘X’ with minimum value. If you are unable to find any such house ‘X’, then return -1.

A mother vertex in a graph G = (V, E) is a vertex v such that all other vertices in G can be reached by a path from v.

Example:
Consider the following Graph: 

Vertices reachable from vertex 0:
0 -> 1 -> 3 -> 2 -> 4 -> 5 -> 7 -> 6

Vertices reachable from vertex 1:
1 -> 3 -> 2 -> 4 -> 5 -> 7 -> 6

Vertices reachable from vertex 2:
2 -> 1 -> 3 -> 4 -> 5 -> 7 -> 6

Vertices reachable from vertex 3:
3 -> 2 -> 1 -> 4 -> 5 -> 7 -> 6

Vertices reachable from vertex 4:
4 -> 5 -> 7 -> 6

Vertices reachable from vertex 5:
5 -> 7 -> 6 -> 4

Vertices reachable from vertex 6:
6 -> 4 -> 5 -> 7

Vertices reachable from vertex 7:
7 -> 6 -> 4 -> 5

Clearly, there is only one vertex “ 0 ” in the graph, from which all other vertices are reachable. Hence, vertex “ 0 ” is the mother vertex of the above graph.

There can be more than one mother vertices in a graph.

For Example, in the above graph, vertices 0, 1 and 2 are mother vertices.

Try solving now
02
Round
Easy
Online Coding Test
Duration90 Minutes
Interview date31 Oct 2020
Coding problem1

1. Reach the destination

Easy
15m average time
85% success
0/40
Asked in companies
HCL TechnologiesSamsungAmerican Express

Given a source point (sx, sy) and a destination point (dx, dy), the task is to check if it is possible to reach the destination point using the following valid moves:

(a, b) -> (a + b, b)
(a, b) -> (a, a + b)

Your task is to find if it is possible to reach the destination point using only the desired moves or not.

For example:
For the coordinates, source point = (1, 1) and destination point = (3, 5)
The output will be true as the destination point can be reached using the following sequence of moves:
(1, 1) -> (1, 2) -> (3, 2) -> (3, 5)
Try solving now
03
Round
Easy
Online Coding Test
Duration70 Minutes
Interview date13 Nov 2020
Coding problem2

1. Count Subarrays with Given XOR

Moderate
15m average time
85% success
0/80
Asked in companies
UberArcesiumHCL Technologies

Given an array of integers ‘ARR’ and an integer ‘X’, you are supposed to find the number of subarrays of 'ARR' which have bitwise XOR of the elements equal to 'X'.

Note:
An array ‘B’ is a subarray of an array ‘A’ if ‘B’ that can be obtained by deletion of, several elements(possibly none) from the start of ‘A’ and several elements(possibly none) from the end of ‘A’. 
Try solving now

2. Technical Questions

Virtualisation 
Scaling 
Explaining projects

04
Round
Medium
Video Call
Duration120 Minutes
Interview date26 Dec 2020
Coding problem1

1. Diameter Of Binary Tree

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

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.


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 keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
4 rounds | 6 problems
Interviewed by Samsung
1400 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Samsung
831 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Samsung
1797 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Samsung
200 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
107832 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52129 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32261 views
6 comments
0 upvotes