Samsung Research Interview Questions and Answers for Freshers

Basic aptitude and few core concepts like dsa, oops, java, ML

It was a 3 hr long coding test, where 1-2 question may be asked based on scenarios, question will be medium level, but should pass all the test cases,

Q1. Was asked about the Dijkstra Algorithm and a counter-question based on that, later discussed on the resume.
Add your answer
Q2. Write the code for the Dijkstra
Ans. 
Dijkstra's algorithm finds the shortest path in a graph from a starting node to all other nodes.
• Use a priority queue to keep track of the shortest distance to each node

• Initialize distances to all nodes as infinity except the starting node as 0

• Iterate through all nodes and update distances if a shorter path is found

• Repeat until all nodes are visited and shortest paths are calculated
Answered by AI
Add your answer
Q3. Dry run on a sample test.
Ans. 
Dry run on a sample test involves mentally executing the code to understand its flow and output.
• Understand the code logic and variables

• Step through each line of code

• Keep track of variable values at each step

• Predict the output based on the code execution
Answered by AI
Add your answer
Q4. Time complexity and optimization
Add your answer

Q1. About yourself, why Samsung? What is your background? Your experiences if any, about projects and some basic HR round questions.
Add your answer

3hr Coding round, 1 Graph Question

Q1. Tell about binary search and the process of deriving the time complexity for binary search.
Ans. 
Binary search is an efficient algorithm for finding an item in a sorted array by repeatedly dividing the search interval in half.
• Sorted Array Requirement: Binary search only works on arrays that are sorted in ascending or descending order.

• Divide and Conquer: The algorithm divides the array into halves, eliminating one half from consideration based on the comparison with the middle element.

• Time Complexity: The time comp...read more
Answered by AI
Add your answer
Q2. Search in a rotated sorted array
Ans. 
Searching in a rotated sorted array involves finding a target value efficiently using binary search techniques.
• Rotated Array: The array is sorted but then rotated at some pivot, e.g., [4, 5, 6, 7, 0, 1, 2] is rotated at 7.

• Binary Search: Use binary search to find the target, adjusting the search range based on the rotation point.

• Identify Rotation: Determine which half of the array is sorted to decide where to search nex...read more
Answered by AI
Add your answer
Q3. Find the maximum value upto which api does not give error, binary search based.
Ans. 
Use binary search to find the maximum value where an API call does not return an error, optimizing the search space efficiently.
• Define the search space: Start with a range, e.g., 0 to N, where N is a known upper limit for the API calls.

• Implement binary search: Check the middle value of the current range. If the API call succeeds, move to the upper half; if it fails, move to the lower half.

• Continue narrowing the range: ...read more
Answered by AI
Add your answer

There are 2 questions on hackerearth related to graph cut edge and cut vertices and similar one .

Q1. It just a technical round ask about oops and coding questions about projects that's all. 2 medium coding questions from leetcode.
Add your answer
Q2. From binary search about finding element in repeating element similar one i don't remember actual questions.
Add your answer

It was a very basic round

Leetcode medium level questions were asked.