Samsung Interview Questions, Process, and Tips

Q1. What was your failure What is your next plan
Add your answer

Q1. What was best in your life
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled in the evening hours and all the participants were required to fill a form which was shared 15 minutes prior to the start of the online coding round. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.

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. 
Identify all distinct triplets within an array that sum up to a specified number.
• Iterate through all possible triplets using three nested loops.

• Check if the sum of the triplet equals the target sum.

• Print the triplet if found, else print -1.
Answered by AI
Add your answer
Q2. 
BST to Greater Tree Conversion
Convert a given binary search tree (BST) with 'N' nodes into a Greater Tree. In this transformation, each node's data is modified to the sum of the original node's data plus...read more
Ans. 
Convert a given BST into a Greater Tree by updating each node's data to the sum of original data and all greater nodes' data.
• Traverse the BST in reverse inorder (right, root, left) to update each node's data with the sum of all greater nodes' data.

• Keep track of the running sum of nodes visited so far to update the current node's data.

• Modify the BST in place without using any extra data structures.

• Example: Input BST: 4 ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Round duration - 60 minutes
Round difficulty - Easy

The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.

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 all possible triplets using three nested loops.

• Check if the sum of the triplet equals the target sum.

• Print the triplet if found, else print -1.
Answered by AI
Add your answer
Q2. 
Maximum Product Subarray Problem Statement
Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.
Explanation:
A subarray can be derived from th...read more
Ans. 
Find the maximum product of a contiguous subarray in an array of integers.
• Iterate through the array and keep track of the maximum and minimum product ending at each index.

• Update the maximum product by considering the current element, the maximum product ending at the previous index multiplied by the current element, and the minimum product ending at the previous index multiplied by the current element.

• Update the minimu...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The face to face round was held on Google Meet where initially Interviewer asked a DS/Algo problem and then Later Manager Joined and asked about our resume projects in detail.
The time was 10:00 AM

Q1. 
Maximum Sum Rectangle Problem
Given an M x N matrix of integers ARR, your task is to identify the rectangle within the matrix that has the greatest sum of its elements.
Input:
The first line of input co...read more
Ans. 
The task is to find the rectangle within a matrix that has the greatest sum of its elements.
• Iterate through all possible rectangles within the matrix

• Calculate the sum of each rectangle and keep track of the maximum sum

• Return the maximum sum obtained from any rectangle within the matrix
Answered by AI
Add your answer

Round duration - 180 minutes
Round difficulty - Easy

1) 1 coding question need to be solved in 3 hours.there will be 50 test cases, need to pass all the test cases to go to the next rounds.STL in c++ cannot be used, we need to code anything we use from scratch

2) Coding questions will mainly be based on dynamic programming, graphs and backtracking, so prepare those topics well.

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.

• Explore all possible directions ('U', 'D', 'L', 'R') from each cell.

• Return the list of valid paths sorted in alphabetical order.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The technical interview 1 has some questions based on basics of oops, Os and one/two coding questions.
Students who clear this round have to go for another technical round

Q1. 
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.

• Use three pointers - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.

• Update the head of the reversed linked list as the last node encountered during reversal.
Answered by AI
Add your answer
Q2. 
Delete a Given Node from Doubly Linked List
Ninja is learning about doubly linked lists and wants to remove a specified element from the list. Can you assist Ninja in doing this and returning the modified...read more
Ans. 
Remove a specified element from a doubly linked list and return the modified list.
• Traverse the doubly linked list to find the specified element to be removed.

• Update the pointers of the previous and next nodes to skip the node to be deleted.

• Handle edge cases like removing the head or tail of the linked list.

• Return the modified linked list after removing the specified element.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interview again began with my resume but it was very exhaustive. While my friends were asked about both resume and DSA concepts, my interview focused entirely on my resume. I had done a project on distributed computing and the interviewer asked me an application question on multi-threading and synchronisation. It was quite difficult because I was trying to explain my approach and I couldn’t make out if the interviewer was happy with my approach or not. Then he asked to design a contact database without the actual use of DBMS in java. Again I tried to explain my approach but it was tough. The interview ended after asing one or more coding questions.

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 nodes to the result list in the order they are visited.

• Handle null nodes appropriately to maintain the spiral order.

• Example: For input 1 2 3 -1 -1 4 5, the output should be 1 3 2 4 5.
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
• Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.

• Maintain two pointers, one moving at twice the speed of the other, if they meet at any point, there is a cycle.

• Check if the next pointer of any node points to a previously visited node to detect a cycle.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was about 30 minutes long interview. First, she asked introduction, after that she was very interested in my internship that I did in summer and about my interests. She asked few common questions on that.