SDE - 1
Samsung
1 rounds | 3 Coding problems
140 views
Interview preparation journey
Preparation
Duration: 1.5 month
Topics: Data Structures, Operating Systems, Computer Networks, OOPs, Intern Project
Tip

Tip 1 : Mainly focus on understanding the problem statement and the purpose of doing your project.
Tip 2 : DSA training will be given by Samsung to clear the online round. Solve all the model questions given.
Tip 3 : If you have good manager feedback, you just need to clear the coding round. You will not have any interviews.

Application process
Where: Campus
Eligibility: Existing Intern at Samsung
Resume tip

Tip 1: Only write things that you are confident about
Tip 2: Resume must be in a single page pdf format

Interview rounds
01
Round
Easy
Online Coding Test
Duration180 minutes
Interview date23 Jun 2022
Problems3
Partition Array for Maximum Sum

#### You ar...

view more
Problem approach

Use dynamic Programming. This is just a variation of the MCM problem and can be understood just by building a recursion tree as we generally do for MCM-type problems. It is a standard problem, just we need to identify the pattern.

Maximum In Sliding Windows Of Size K

#### Given an array/list of integers of length ‘N’,...

view more
Problem approach

The idea is to maintain a maxHeap of size k. A number is to be evicted from this heap if the k-sized window moves past it.
-> If that number to be evicted is at the top, immediately pop the heap.
-> if not, then maintain a toDelete heap which will evict the number as soon as it reaches top in both. Keep discarding numbers from both these heaps until the tops don't match.

Shortest Common Supersequence

#### Given two strings, ‘A’ and ‘B’. Return the shortest supersequence string ‘S’, containing both ‘A’ and ‘B’ as its subsequences. If there are multiple answers, return any of them.

view more
Problem approach

For every string s we pre-calculate the length of the longest possible overlap between s and any other strings.

Then for every possible subset A'of A, we could use the sum of the precalculated lengths as an upper bound to the total overlaps that can be obtained by combining all the strings in A'.

Using this upper bound, we could give up early on many branches.

Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
2508 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
1710 views
Software Developer
2 rounds | 4 problems
Interviewed by Samsung
0 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
48 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
56812 views