Samsung Frontend Developer Intern Interview Questions, Process, and Tips

Round duration - 70 Minutes
Round difficulty - Medium

This online coding round, consisted of 3 DSA problems and we were supposed to solve them in 70 mins. 
Programming Languages allowed: C, C++, JAVA
Note: Python was not available.

Q1. Cousins of Given Node in Binary Tree
Given a binary tree of N nodes and a node of this tree, you need to return a list containing the values of the cousins of the given node in the given binary tree sorted...read more
Ans. Depth First Search
• Find the level of the given node of the binary tree. For this we will use a recursive approach, i.e. DFS. Keep in mind that the level of a parent is 1 less than its children.
• Store all the nodes at the same level of the given node i.e. we found in the previous step in array.
• Traverse array and remove those nodes which are siblings to the given node i.e. (parent of given node and node in array is the sam...read more
Answered Anonymously
Add your answer
Q2. Maximum Sum Path Of A Binary Tree.
You are given a binary tree having 'N' nodes. Each node of the tree has an integer value. Your task is to find the maximum possible sum of a simple path between a...read more
Ans. Recursive Solution
First of all, we need to observe that for any simple path in a Binary tree, there is one and only one node at the maximum height. So, the idea is to fix each node as the highest node in a path and then find the maximum sum path having the current node as the highest node. The final answer will be the maximum value among all the path sum values for each node. To find the maximum sum path for a particul...read more
Answered Anonymously
Add your answer
Q3. Gold mine problem
You have been given a gold mine represented by a 2-d matrix of size ('N' * 'M') 'N' rows and 'M' columns. Each field/cell in this mine contains a positive ...read more
Ans. Recursive Solution
• The miner can start from any row of the first column, hence we will be calling our recursive function from all the rows of column 1 as the starting block/cell.
• In the recursive function, a miner can move in three particular directions:
  • Upper right diagonal -> ('R' - 1,'C' + 1)
  • Straight right -> ('R','C')
  • Lower right diagonal -> ('R' + 1, ‘C’)
• Hence each function call will be representing/returning...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This was the first technical round and those who cleared the online coding assessment round were eligible for this round. This round consisted of questions from DSA, CS Fundamentals, my projects and questions related to frontend.
What are the various formatting tags in HTML? What is DOM? What is the significance of and tag in HTML?

Q1. Remove Consecutive Duplicates
You are given a string ‘str’ of size ‘N’. Your task is to remove consecutive duplicates from this string recursively.
For example:
If the input string is ‘str’ = ”aazbbby”,...read more
Ans. Recursion
The idea is here to use recursion as mentioned in the problem statement. For each character either it will be included in the answer or not, how to decide this at each point?
We will compare the last and 2nd last character of the string each time if they are equal we will remove the last and call recursion for the remaining string, if they both are not equal then we will append the last character into our final...read more
Answered Anonymously
Add your answer
Q2. Reverse Linked List
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then th...read more
Ans. Brute Force
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
 
Steps:
&...read more
Answered Anonymously
Add your answer
Q3. Implement Trie
Implement Trie Data Structure to support these operations:
insert(word) - To insert a string "word" in Trie
search(word) - To check if string "word" is present in Trie o...read more
Ans. Hashmap/Dictionary Approach
Firstly we have defined the node class of Trie having members:
• child  - storing the address of child nodes (hashmap of character number and address of Trie Node)
• isEnd - a bool variable for marking this node as an end of some word.
Then we have defined our Trie Class having members:
• root - The root node for whole Trie, every word starts from this node.
• insert(word) - To insert a string "word"...read more
Answered Anonymously
Add your answer
Q4. OS Question
What is a process in OS?
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This was the second technical round and those who cleared the previous interview round were eligible for this round. This round consisted of questions from DSA, CS Fundamentals majorly OOPS, and my projects. How can we club two or more rows or columns into a single row or column in an HTML table?

Q1. Rat In A Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered Anonymously
Add your answer
Q2. OOPS Question
Describe 4 pillars of OOPS.
Add your answer