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 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 values 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
Q2. 
Maximum Sum Path in a Binary Tree
Your task is to determine the maximum possible sum of a simple path between any two nodes (possibly the same) in a given binary tree of 'N' nodes with integer values.
Ex...read more
Ans. 
Find the maximum sum of a simple path between any two nodes in a binary tree.
• Use a recursive approach to traverse the binary tree and calculate the maximum sum path.

• Keep track of the maximum sum path found so far while traversing the tree.

• Consider all possible paths between any two nodes in the tree to find the maximum sum.
Answered by AI
Add your answer
Q3. 
Gold Mine Problem Statement
You are provided with a gold mine, represented as a 2-dimensional matrix of size N x M with N rows and M columns. Each cell in this matrix contains a positive integer represent...read more
Ans. 
The task is to determine the maximum amount of gold a miner can collect by moving in allowed directions in a 2D gold mine matrix.
• Create a function that takes the gold mine matrix and dimensions as input

• Implement a dynamic programming approach to find the maximum amount of gold that can be collected

• Consider the constraints and optimize the solution for efficiency

• Traverse the matrix from left to right, calculating the ma...read more
Answered by AI
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 Problem Statement
Given a string str of size N, your task is to recursively remove consecutive duplicates from this string.
Input:
T (number of test cases)
N (length of the ...read more
Ans. 
Recursively remove consecutive duplicates from a given string.
• Iterate through the string and remove consecutive duplicates using recursion.

• Keep track of the current character and compare it with the next character.

• If they are the same, remove the next character and continue recursively until no consecutive duplicates are left.
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
Add your answer
Q3. 
Trie Data Structure Implementation
Design and implement a Trie (prefix tree) to perform the following operations:
• insert(word): Add a string "word" to the Trie.
• search(word): Verify if the string "w...read more
Ans. 
Implement a Trie data structure to insert, search, and determine if a string starts with a given prefix.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert() to add words by traversing the Trie.

• Implement search() to check if a word exists by traversing the Trie.

• Implement startsWith() to check if any word starts with a given prefix.

• Use lowercase English letters a-z for words.

• Handle queries
Answered by AI
Add your answer
Q4. What is a process in an operating system?
Ans. 
A process in an operating system is an instance of a program that is being executed.
• A process is a unit of execution within an operating system.

• Each process has its own memory space, resources, and state.

• Processes can communicate with each other through inter-process communication.

• Examples of processes include web browsers, word processors, and media players.
Answered by AI
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 Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Recursively move in all directions (up, down, left, right) until reaching the destination.

• Return the list of valid paths sorted in alphabetical order.
Answered by AI
Add your answer
Q2. Can you describe the four pillars of Object-Oriented Programming (OOP)?
Ans. 
The four pillars of OOP are encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Inheritance: Allowing a new class to inherit properties and behaviors from an existing class.

• Polymorphism: The ability for objects of different classes to respond to the same message in different ways.

• Abstraction: Hiding the complex implementation det...read more
Answered by AI
Add your answer