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

SDE - Intern

Samsung
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2.5 months
Topics: Recursion, Dynamic programming, OOPS, Sysytem Design, Trees
Tip
Tip

Tip 1 : Do at least 3 major web dev project
Tip 2 : Practice from Code Studio

Application process
Where: Campus
Eligibility: above 8 cgpa, CS/IT branches allowed
Resume Tip
Resume tip

Tip 1 : Resume should not be more than 1 page
Tip 2 : Be precise and honest

Interview rounds

01
Round
Medium
Video Call
Duration45 minutes
Interview date10 Nov 2020
Coding problem2

This round was scheduled in the evening hours and all the participants were required to fill a form which was shared 15 minutes prior to the start of the online coding round. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.

1. Triplets with Given Sum

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

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Try solving now

2. BST to greater tree

Moderate
25m average time
65% success
0/80
Asked in companies
AmazonSamsungOracle

Given a binary tree with 'N' number of nodes, convert it to a Greater Tree such that data of every node of the original BST is changed to the original node’s data plus the sum of all node’s data greater than or equal to the original data of the node in the BST.

A binary search tree (BST) is a binary tree data structure that has the following properties.

• The left subtree of a node contains only nodes with data less than the node’s data.

• The right subtree of a node contains only nodes with data greater than the node’s data.

• Both the left and right subtrees must also be binary search trees.
Example:

Example

Answer:

Because only 5 is greater than 4 in the above BST, node 4 will be updated to 9 (4 + 5 = 9).

Nodes 3, 4, and 5 are greater than 2, hence node 2 will be modified to 14 (2 + 3 + 4 + 5 = 14). 

Node with data 5 will remain the same because there is no node in the BST with data greater than 5.

Nodes 2,3, 4, and 5 are greater than 1, hence node 1 will be modified to 15 (1 + 2 + 3 + 4 + 5 = 15).   

Nodes 4 and 5 are greater than 3, hence node 3 will be modified to 12 (3 + 4 + 5 = 12). 
Try solving now
02
Round
Medium
Assignment
Duration30 minutes
Interview date10 Dec 2020
Coding problem1

1. Assignment

Was given a assignment to be completed within 7 days.

I completed the assignment within 4 days and all the implementations were optimal and server was also robust on majority of test cases.

Problem approach

Tip 1 : API handling is important
Tip 2 : Our server side code tells a lot about how do we approach a problem and find out a solution to it so try to write less redundant code and follow proper coding practices.

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 - Intern
3 rounds | 4 problems
Interviewed by Samsung
1043 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
707 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 8 problems
Interviewed by Samsung
845 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 5 problems
Interviewed by Samsung
1431 views
1 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13918 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
13230 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
9229 views
2 comments
0 upvotes