Samsung Software Developer Interview Questions, Process, and Tips for Freshers

Q1. Array based coding test
Add your answer
Q2. Second largest salary in DBMS
Ans. 
The second largest salary in a database management system (DBMS) can be found by using the ORDER BY and LIMIT clauses in a SQL query.
• Use the ORDER BY clause to sort the salaries in descending order

• Use the LIMIT clause to retrieve the second row in the sorted result set

• Example: SELECT salary FROM employees ORDER BY salary DESC LIMIT 1,1
Answered by AI
Add your answer
Q3. Sum of elements close to target
Ans. 
Calculate the sum of elements in an array that are closest to a given target value.
• Iterate through the array and calculate the absolute difference between each element and the target value.

• Keep track of the element with the smallest difference and update the sum accordingly.

• Return the sum of elements closest to the target value.
Answered by AI
Add your answer

The aptitude test is about your basic knowledge in software developing.

Q1. What are the basic role of JAVA in the development of software?
Ans. 
JAVA is a versatile programming language used for developing various software applications.
• JAVA is platform-independent and can run on any operating system

• It is object-oriented and supports multithreading

• JAVA is widely used for developing web applications, mobile applications, and enterprise software

• It provides a vast library of pre-built classes and APIs for developers to use

• JAVA is also used for developing games, sci
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

This was an online coding round where we had 3 questions to solve under 120 minutes. The questions were of medium to hard difficulty level.

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water above each bar to get the total trapped water for the entire array.
Answered by AI
Add your answer
Q2. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Ans. 
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
• Use Breadth First Search (BFS) algorithm to find the shortest path.

• Initialize a queue with the source cell and keep track of visited cells.

• Explore all 4 directions from each cell and update the path length accordingly.

• Return the shortest path length or -1 if no valid path exists.
Answered by AI
Add your answer
Q3. 
Count Leaf Nodes in a Binary Tree
Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...read more
Ans. 
Count the number of leaf nodes in a binary tree.
• Traverse the binary tree and count nodes with both children as NULL.

• Use recursion to traverse the tree efficiently.

• Handle base cases where the node is NULL or a leaf node.

• Keep track of the count of leaf nodes as you traverse the tree.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

In this round I was first asked 2 questions related to DSA where I was expected to first explain my approach to the interviewer along with proper complexity analysis and then code the implementation in any of my preferred IDE. This was followed by some questions related to OOPS and C++.

Q1. 
Find The Repeating And Missing Number Problem Statement
You are provided with an array nums which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...read more
Ans. 
Given an array of first N positive integers with one number repeating and one missing, find the repeating and missing numbers.
• Iterate through the array and keep track of the sum of elements and sum of squares to find the missing and repeating numbers.

• Use a set to identify the repeating number and calculate the missing number based on the sum of elements.

• Example: For nums = [1, 2, 3, 4, 4, 5], the repeating number is 4
Answered by AI
Add your answer
Q2. 
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line c...read more
Ans. 
Count the total number of unique pairs in an array whose elements sum up to a given value.
• Use a hashmap to store the frequency of each element in the array.

• Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

• Increment the count of pairs if the complement exists in the hashmap.

• Divide the count by 2 to avoid counting duplicates like (arr[i], arr[j]) and (arr[j], arr[i])
Answered by AI
Add your answer
Q3. What is the difference between a structure and a union, and what are the pros and cons of both?
Ans. 
Structure and union are both used to group different data types, but structure allocates memory for each member separately while union shares the same memory space for all members.
• Structure allocates memory for each member separately, while union shares the same memory space for all members.

• Structures are used when each member needs its own memory space and unions are used when only one member is accessed at a time.

• Str...read more
Answered by AI
Add your answer
Q4. How does C++ support polymorphism?
Ans. 
C++ supports polymorphism through virtual functions and inheritance.
• C++ supports polymorphism through virtual functions and inheritance

• Virtual functions allow a function to be overridden in a derived class

• Base class pointers can point to derived class objects, allowing for dynamic binding

• Example: class Animal { virtual void speak() { cout << 'Animal speaks'; } }; class Dog : public Animal { void speak() { cout &l...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 3 questions from DSA which I had to code under 60 minutes and then the interviewer asked some questions from Operating Systems and Android as I did a project in Mobile App Development.

Q1. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Ans. 
Implement a function to return the spiral order traversal of a binary tree.
• Traverse the binary tree level by level, alternating between left to right and right to left.

• Use a queue to keep track of nodes at each level.

• Append the values of nodes in each level to the result list in the desired order.
Answered by AI
Add your answer
Q2. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...read more
Ans. 
Implement a stack using two queues to store integer values with specified operations.
• Create a stack class with two queue data members.

• Implement push(data) by enqueuing the data into one of the queues.

• Implement pop() by dequeuing all elements from one queue to another until the last element is reached and return it.

• Implement top() by dequeuing all elements from one queue to another until the last element is reached, ret...read more
Answered by AI
Add your answer
Q3. 
Convert a Binary Tree to its Sum Tree
Given a binary tree of integers, convert it to a sum tree where each node is replaced by the sum of the values of its left and right subtrees. Set leaf nodes to zero.
...read more
Ans. 
Convert a binary tree to a sum tree by replacing each node with the sum of its left and right subtrees.
• Traverse the tree in postorder fashion.

• For each node, calculate the sum of its left and right subtrees and update the node value.

• Set leaf nodes to zero.

• Return the level order traversal of the modified tree.
Answered by AI
Add your answer
Q4. What is meant by multitasking and multithreading in operating systems?
Ans. 
Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.
• Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly.

• Multithreading enables a single process to execute multiple threads concurrently, sharing resources like memory and CPU.

• Multitasking...read more
Answered by AI
Add your answer
Q5. What is Android?
Ans. 
Android is a mobile operating system developed by Google, based on the Linux kernel and designed primarily for touchscreen devices.
• Developed by Google

• Based on Linux kernel

• Designed for touchscreen devices
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

This was an online coding round where we had 3 questions to solve under 120 minutes. The questions were of medium to hard difficulty level.

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
The task is to find all distinct triplets in an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Use a set to store unique triplets and check if the sum equals the target sum.

• Handle edge cases like duplicate elements and no valid triplets.

• Return the triplets found or '-1' if no valid triplet exists.
Answered by AI
Add your answer
Q2. 
Minimum Operation Needed to Convert to the Given String
You are given two strings str1 and str2. Determine the minimum number of operations required to transform str1 into str2.
Explanation:
An operatio...read more
Ans. 
Determine the minimum number of operations needed to transform one string into another by moving characters to the end.
• Iterate through each character in str1 and check if it matches the first character in str2.

• If a match is found, calculate the number of operations needed to move the characters to the end.

• Return the minimum number of operations needed for each test case, or -1 if transformation is not possible.
Answered by AI
Add your answer
Q3. 
Power of Two Problem Statement
Determine whether a given integer N is a power of two. Return true if it is, otherwise return false.
Explanation
An integer 'N' is considered a power of two if it can be e...read more
Ans. 
Check if a given integer is a power of two or not.
• Check if the given integer is greater than 0.

• Use bitwise operations to determine if the integer is a power of two.

• Return true if the integer is a power of two, otherwise return false.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Merge K Sorted Arrays Problem Statement
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
Inpu...read more
Ans. 
Merge K sorted arrays into a single sorted array.
• Iterate through all arrays and merge them into a single array.

• Use a priority queue to efficiently merge the arrays.

• Ensure the final array is sorted in ascending order.
Answered by AI
Add your answer
Q2. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Ans. 
Implement a function to return the spiral order traversal of a binary tree.
• Traverse the binary tree level by level, alternating between left to right and right to left.

• Use a queue to keep track of nodes at each level.

• Append the values of nodes in each level to the result list in the desired order.
Answered by AI
Add your answer
Q3. What is the difference between a structure and a union, and what are the pros and cons of each?
Ans. 
Structure and union are both used to group different data types, but structure allocates memory for each member separately while union shares the same memory location for all members.
• Structure allocates memory for each member separately, while union shares the same memory location for all members.

• Structures are used when each member needs its own memory space, while unions are used when only one member is accessed at a...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to Trees and Graphs and some questions revolving around types of Operating Systems their pros and cons.

Q1. 
Binary Tree Diameter Problem Statement
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...read more
Ans. 
Find the diameter of a binary tree, which is the longest path between any two end nodes.
• Traverse the tree to find the longest path between two nodes.

• Use recursion to calculate the diameter of the tree.

• Keep track of the maximum diameter found during traversal.

• Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1, the diameter is 6.
Answered by AI
Add your answer
Q2. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Ans. 
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
• Use Breadth First Search (BFS) algorithm to find the shortest path.

• Keep track of visited cells to avoid revisiting them.

• Update the path length as you traverse the matrix.

• Return -1 if no valid path exists.
Answered by AI
Add your answer