Samsung Interview Questions, Process, and Tips

Pretty easy exam. Just do a few leetcode problems and one can ace it easily.

Q1. Just will ask about ur previous experience and ur expectations here.
Add your answer

Q1. Technical details for HVAC
Add your answer
Q2. Design Softwrae using.
Ans. 
Design software using various tools and programming languages.
• Use programming languages such as Java, Python, C++, etc.

• Utilize software development tools like Eclipse, Visual Studio, etc.

• Incorporate design tools like Adobe Photoshop, Sketch, etc.

• Follow software development methodologies like Agile, Waterfall, etc.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Circle of Words Problem Statement
Given an array or list of words, determine whether the words can be rearranged to form a circle where the last character of one word matches the first character of the ne...read more
Ans. Directed Graph
We will build a directed graph and for each word, we will add an edge from the first character to the last character in the graph. Now we just have to check whether the graph contains an Eulerian cycle or not. If it contains an Eulerian cycle, then we can form a circle.
 
The conditions for the existence of an Eulerian cycle in a directed graph are:
1. Every node should have in - degree == out-degree.
2. All t...read more
Answered Anonymously
Add your answer
Q2. 
Doctor Ninja's House Problem Statement
In a network of 'N' cities with 'M' paths connecting them, Doctor Ninja aims to purchase a house in a city 'X' such that it is possible to reach every other city fro...read more
Ans. Naive Approach
A trivial approach will be to perform a DFS on all the vertices and find whether we can reach all the vertices of the graph from that vertex or not.
 
Algorithm :

1.  Implement the function 'addEdge', to store a path from vertex 'u' to vertex 'v'.
2.  Implement the function 'dfs'.
   1.  Mark the current node as visited.
   2.  Recur for all the vertices adjacent to ...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

Q1. 
Reach the Destination Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...read more
Ans. Brute force approach
The naive approach to solve this problem is to consider each and every possible move until we reach the destination.
 
This can be done using recursion. Below is the algorithm:
 
• Check for the bases:
  • If the source and destination coordinates are the same, return true.
  • Return false, if the x (or y) coordinate of source point is greater than the x (or y) coordinate of the destination point. As the...read more
Answered Anonymously
Add your answer

Round duration - 70 Minutes
Round difficulty - Easy

Q1. 
Count Subarrays with Given XOR Problem Statement
You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.
Example...read more
Ans. Brute Force
A simple method is to traverse through each subarray to find the total number of subarrays with the XOR of all elements present in the subarray equal to X.
 
To obtain the total number of rounds after each operation, we will maintain a variable ans, which stores the total number of subarrays. We will iterate the variable index from 0 to N - 1 and in each iteration, we will iterate pos from index to N - 1....read more
Answered Anonymously
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

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. Recursion
The basic idea of this approach is to break the problem into subproblems. 
Now, there are three possible cases:
 
1. The diameter of the tree is present in the left subtree.
2. The diameter of the tree is present in the right subtree.
3. The diameter of the tree passes through the root node.
 
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...read more
Answered Anonymously
Add your answer