Samsung Software Developer Interview Questions, Process, and Tips

Round duration - 180 minutes
Round difficulty - Medium

In this round, you have to do a coding question on Samsung Coding Platform, which was installed earlier on our lab's system by the company guys. There is only a single question and time limit is of 3 hrs. There are 50 test cases, and you have to pass all the test cases in order to get selected for next round. Also you cannot use any inbuilt library and you have to implement everything from scratch (like stack, queue, hashmap, etc). You can test your code on sample test cases multiple times but the submission limit in only 5, to test the hidden test cases.
Note : Even passing 49 test cases will lead to rejection.

Round duration - 30 minutes
Round difficulty - Medium

There were two questions based on data structures and algorithms and some discussion on the Projects mentioned in resume (Major Project based on Arduino - It's programming and its functionality) .

Q1. 
Rain Water Trapping Problem Statement
Given an array/list ARR of size N, representing an elevation map where each element ARR[i] denotes the elevation of the i-th bar. Your task is to calculate and print ...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
• Use two-pointer approach to keep track of left and right boundaries.

• Calculate the trapped water by finding the minimum of maximum heights on left and right sides for each bar.

• Sum up the trapped water for all bars to get the total amount of rainwater trapped.
Answered by AI
Add your answer
Q2. 
Implement a Stack using Queues
Create a Stack data structure designed specifically to store integer data using two queues.
Explanation:
You need to implement a stack using two internal queues. You can u...read more
Ans. 
Implement a Stack using Queues to store integer data with push, pop, top, size, and isEmpty functions.
• Use two queues to simulate a stack, with one queue acting as the main stack and the other for temporary storage.

• For push operation, enqueue the new element to the temporary queue, then dequeue all elements from the main queue to the temporary queue, and finally swap the queues.

• For pop operation, dequeue the top element...read more
Answered by AI
Add your answer
Q3. 
Implement a Stack Using Two Queues
You are tasked with implementing a Stack data structure specifically designed to store integer data using two Queues. Utilize the inbuilt Queue for this purpose.
Functio...read more
Ans. 
Implement a Stack data structure using two Queues for integer data.
• Use two Queues to simulate the Stack behavior.

• Push elements by enqueueing them in one Queue.

• Pop elements by dequeueing all elements from the first Queue to the second Queue, except the last one.

• Top element can be retrieved by dequeuing all elements from the first Queue to the second Queue and then dequeuing the last element.

• Size can be obtained by retur...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

There were two coding questions and I had to write the code on paper. 
After that there was a discussion on OOPS concepts like polymorphism and Inheritance.
The interviewer also discussed about padding concept in structures (Indirectly via an example).

Q1. 
Maximum Gold Collection from Gold Mine
Imagine a gold mine represented by a 2D matrix with dimensions 'N' by 'M', where 'N' is the number of rows and 'M' is the number of columns. Each cell in this matrix...read more
Ans. 
Find the maximum amount of gold a miner can collect from a gold mine by moving right, up diagonally, or down diagonally.
• Use dynamic programming to keep track of the maximum gold collected at each cell.

• At each cell, consider the maximum gold collected from the cell above, below, and to the left.

• Add the current cell's gold value to the maximum gold collected from the adjacent cells to determine the maximum gold at the cu...read more
Answered by AI
Add your answer
Q2. 
Rod Cutting Problem Statement
Given a rod of length 'N' units, you can cut the rod into different sizes, each with a specific cost associated. The task is to determine the maximum obtainable cost by cutti...read more
Ans. 
Given a rod of length 'N' with associated costs, find the maximum obtainable cost by cutting the rod optimally.
• Implement dynamic programming approach to solve the rod cutting problem efficiently.

• Consider all possible ways of cutting the rod and choose the one that maximizes the total cost.

• Keep track of subproblems to avoid redundant calculations.

• Example: For rod length 4 with costs [2, 5, 7, 8], the maximum cost would
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Interviewer was friendly. He asked why Samsung, are you comfortable relocating to Bangalore. Also asked about my experience in previous rounds.