Samsung Software Developer Intern Interview Questions, Process, and Tips

Round duration - 180 Minutes
Round difficulty - Medium

1 coding question, 3 hours to solve, 50 test cases.
Problem level - medium
Platform ide - okayish

Q1. 
Water Supply Optimization Problem
Given N houses in a village, determine the minimum cost to supply water to all houses either by building wells in the houses or by connecting them with pipes.
Explanatio...read more
Ans. 
Determine the minimum cost to supply water to all houses in a village by building wells or connecting them with pipes.
• Iterate through all possible connections and choose the minimum cost between building a well or connecting two houses with a pipe.

• Use a minimum spanning tree algorithm like Kruskal's or Prim's to find the optimal cost.

• Consider the cost of building wells and connecting pipes to minimize the total cost.

• Ex...read more
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Mixed round, Problem solving, cpp fundamentals, OOP, resume

Round duration - 60 Minutes
Round difficulty - Medium

The round consisted of 3 questions of medium difficulty to be completed in 60 minutes.

Q1. 
Minimum Insertions to Make a Palindrome
Given a string STR of length N composed of lowercase English letters, your task is to determine the minimum number of characters that need to be added to make the s...read more
Ans. 
Given a string, find the minimum number of characters needed to make it a palindrome.
• Iterate through the string from both ends and count the number of characters that need to be added to make it a palindrome.

• Use dynamic programming to optimize the solution by considering subproblems.

• Handle edge cases such as an already palindrome string or an empty string.

• Example: For input 'abb', the output should be 1 as adding 'a' m
Answered by AI
Add your answer
Q2. 
Cousins of a Given Node in a Binary Tree
Given a binary tree with 'N' nodes and a specific node in this tree, you need to determine and return a sorted list of the values of the node's cousins. The cousin...read more
Ans. 
Given a binary tree and a specific node, return a sorted list of the node's cousins.
• Traverse the binary tree to find the parent of the given node and its depth.

• Traverse the tree again to find nodes at the same depth but with different parents.

• Return the sorted list of cousin node values or -1 if no cousins exist.
Answered by AI
Add your answer
Q3. 
Move All Negative Numbers To Beginning
Rearrange a given array 'ARR' with 'N' integers so that all negative numbers appear before all positive numbers.
Follow Up:
Can you solve this in O(1) auxiliary sp...read more
Ans. 
Rearrange array with negative numbers at the beginning, order not important.
• Iterate through the array and swap negative numbers to the beginning using two pointers approach.

• Maintain one pointer for negative numbers and another for positive numbers.

• Time complexity: O(N), Space complexity: O(1).
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

One interviewer asked the same question to two of us.
Both of us could qualify if we solved it correctly.

Q1. 
Convert Binary Tree to Mirror Tree
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
Input:
An integer ‘T’ denoting the number o...read more
Ans. 
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
• Traverse the tree in postorder fashion and swap the left and right children of each node.

• Recursively call the function on the left and right subtrees.

• Modify the tree in place without creating a new tree.
Answered by AI
Add your answer