Samsung Research Software Developer Interview Questions, Process, and Tips

3 questions in 1 hour . Platform - Cocubes . Whoever solved all three questions were shortlisted.

Q1. 2 dimensional grid Question (Graph)
Add your answer
Q2. Puzzle and OOPS concepts
Add your answer
Q3. Sorting algorithms
Add your answer
Q4. Computer Networks
Add your answer
Q5. Resume based on questions
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

Have to attempt 2 programming questions within 2:30 hours. Can take any time over the weekend. Relatively easy problems. Questions were long, but the solution code was small.

Q1. The Skyline Problem
You are given 'N' rectangular buildings in a 2-dimensional city. Your task is to compute the skyline of these buildings, eliminating hidden lines return the skyline formed by th...read more
Ans. Brute Force
The idea here is to first, sort the critical POINTS with respect to their coordinate and height pairs. Make a pair of 'X1' and take a negative of the height for the building so that 'X1' pairs are sorted before 'X2' pairs. Create a dictionary keeping the heights as keys and as soon as a left edge of a building is encountered, we add that building to the dictionary with its height as the key. When we encounte...read more
Answered by CodingNinjas
View 1 more answer
Q2. MergeSort Linked List
For a given Singly Linked List of integers, sort the list using the 'Merge Sort' algorithm.
Input format :
The first and the only line of input contains the elements of the...read more
Ans. Merge Sort Linked List
1. The idea is to take a recursive approach by calling the sort function on the left half and right half of the list.
2. In order to do so, get the middle node and split the list into two halves. We can use a two-pointer technique to get the middle node by running a slow and a fast pointer.
   1. The idea here is to move both the slow and fast pointer simultaneously until fast reaches the end of the list.
   2. Here, ...read more
Answered by CodingNinjas
Add your answer

Round duration - 240 Minutes
Round difficulty - Medium

Had to solve 1 programming question in 4 hours. It was in the morning on a weekend. The environment was not so good. It was a small institute and got very crowded. The platform was also buggy. but the question was not difficult. Was able to solve it in just 1 hour and leave.

Q1. Batch Photography
Alex has bought a new machine that does photocopies of photos in batches of minimum size ‘K’. Alex has ‘N’ photos, whose resolution is given in an integer array ‘photos’. The machine has ...read more
Ans. Two Pointers
The first thing is that we can show that it is always beneficial to sort the array and then divide the array into subarrays. Then if we fix the error, we can use dynamic programming to divide the array into subarrays. 

 
Algorithm: 
Let us define a function ‘check’, which when passed a parameter ‘error’, returns whether the array can be divided such that its maximum error is less or equal to ‘er...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 30 Minutes
Round difficulty - Easy

It was in the afternoon. The interviewer basically asked me what technologies I have worked on. Checked my knowledge of those technologies with simple questions. Told me what I'll be working on if I get selected.

Q1. Sort 0 1 2
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Note :
Try to solve the problem in 'Single Sca...read more
Ans. Sorting
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
• Sort the Array and just return.
Space Complexity: O(1)Explanation:
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:
O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Answered by CodingNinjas
View 2 more answers

Round duration - 90 Minutes
Round difficulty - Hard

It was also in the afternoon. The interviewer was the member of the team I'll be working on if I get selected. He asked me some basic questions about related technologies.
Gave me 2-3 DS & Algo problems and asked me to solve them.

Q1. Print array Sum
Given an array of length N, you need to find and print the sum of all elements of the array.
Input Format :
Line 1 : An Integer N i.e. size of array
Line 2 : N integers which are elements...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q2. Ninja And Alien
An alien spaceship arrived at our planet Earth. An alien dropped his dictionary of words on the way back to his planet. Ninja found that dictionary and now wants to create the order of the ...read more
Ans. Using topological ordering
The idea behind this approach is to create a graph of the words of the dictionary and then apply the topological ordering of the graph. 
 
A topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge u v from vertex u to vertex v, u comes before v in the ordering.
 
The approach is to take two words from the array of words and the...read more
Answered by CodingNinjas
Add your answer