Upload Button Icon Add office photos

Samsung Research

Compare button icon Compare button icon Compare

Filter interviews by

Samsung Research Interview Questions and Answers

Updated 30 Jun 2025
Popular Designations

75 Interview questions

A Software Engineer Intern was asked 1mo ago
Q. Explain binary search and the process of deriving its time complexity.
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...

View all Software Engineer Intern interview questions
A Software Engineer Intern was asked 1mo ago
Q. Describe an algorithm to find the maximum value up to which an API call does not return an error, using a binary search approach.
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 ra...

View all Software Engineer Intern interview questions
A Software Engineer Intern was asked 1mo ago
Q. Given a sorted array that is rotated at some unknown pivot, and a target value, find the index of the target value in the array. If the target value is not found, return -1. You should solve this problem wi...
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 searc...

View all Software Engineer Intern interview questions
An Engineer was asked 6mo ago
Q. What is the time complexity of your solution?
Ans. 

The time complexity of a solution refers to the amount of time it takes for an algorithm to run based on the input size.

  • Time complexity is typically expressed using Big O notation, which describes the worst-case scenario for how the runtime grows with respect to the input size.

  • Common time complexities include O(1) for constant time, O(log n) for logarithmic time, O(n) for linear time, O(n^2) for quadratic time, an...

View all Engineer interview questions

What people are saying about Samsung Research

View All
a senior test engineer
2w
Need your suggestion for a career move
Hi, I'm a software test engineer with around 6.5 years of experience. To be honest in this day and age I'm currently confused and stuck with how to move up in career. In order to get batter packages i understand there might not be much scope in testing especially in mobile testing field. So here I am, asking for your guidance. Please do suggest me on what i should do? Current skills I have: Python, Mobile testing, Selenium, Java, Intermediate DSA Willing to learnšŸ™
Got a question about Samsung Research?
Ask anonymously on communities.
An Engineer was asked 6mo ago
Q. An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image. You are also given three integers sr, sc, and color. You should perform a flood fill on the ...
Ans. 

Flood fill is an algorithm used to determine connected regions in a grid, commonly used in graphics applications.

  • Flood fill can be implemented using Depth-First Search (DFS) or Breadth-First Search (BFS).

  • Example: In a 2D grid, starting from a pixel, flood fill changes the color of connected pixels.

  • Recursive approach: Use a function that calls itself for adjacent pixels.

  • Iterative approach: Use a stack or queue to e...

View all Engineer interview questions
A RND Engineer was asked 6mo ago
Q. Given an array of integers, find the minimum number of steps to reach the end of the array.
Ans. 

Calculate the minimum steps to reach the end of an array using jumps based on values at each index.

  • Use a greedy approach to track the maximum reachable index at each step.

  • Initialize variables: steps (to count jumps), maxReach (to track the farthest index), and currentEnd (to mark the end of the current jump).

  • Iterate through the array, updating maxReach and incrementing steps when reaching currentEnd.

  • Example: For a...

View all RND Engineer interview questions
A Lead Engineer was asked 7mo ago
Q. Design a parking lot system.
Ans. 

Design a parking lot system to manage vehicle parking efficiently and effectively.

  • Define the types of vehicles (cars, bikes, trucks) and their parking requirements.

  • Implement a reservation system for users to book parking spots in advance.

  • Incorporate sensors to detect available spots and provide real-time updates.

  • Design a payment system for hourly, daily, or monthly parking fees.

  • Consider scalability for future expa...

View all Lead Engineer interview questions
Are these interview questions helpful?
A Firmware Engineer was asked 7mo ago
Q. How do volatile keywords in C work?
Ans. 

Volatile keyword in C is used to indicate that a variable may be changed unexpectedly by external factors.

  • Volatile keyword tells the compiler not to optimize the variable because it can be changed by external factors.

  • Commonly used for memory-mapped hardware registers or variables accessed by multiple threads.

  • Example: volatile int *ptr = (int *)0x1234; // pointer to a memory-mapped hardware register

View all Firmware Engineer interview questions
A Senior Engineer was asked 8mo ago
Q. Implement a linked list.
Ans. 

A linked list is a data structure where each element points to the next element in the sequence.

  • Create a Node class with data and a reference to the next Node

  • Initialize a LinkedList class with a head Node

  • Implement methods to add, remove, search, and traverse the linked list

View all Senior Engineer interview questions
A Research Intern was asked 8mo ago
Q. Provide a brief overview of your thesis.
Ans. 

My thesis explores the impact of social media on mental health among adolescents, highlighting both positive and negative effects.

  • Investigated the correlation between social media usage and anxiety levels in teenagers.

  • Conducted surveys with over 500 adolescents to gather data on their social media habits.

  • Analyzed case studies showing how social media can foster community support but also lead to cyberbullying.

  • Exam...

View all Research Intern interview questions

Samsung Research Interview Experiences

140 interviews found

Intern Interview Questions & Answers

user image Anonymous

posted on 20 Oct 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Oct 2023.Ā There were 3 interview rounds.

Round 1 - Coding TestĀ 

3 questions medium leetcode

Round 2 - TechnicalĀ 

(3 Questions)

  • Q1. Dfs write whole pseudo code.
  • Ans. 

    Depth First Search (DFS) pseudo code

    • Initialize a stack to keep track of nodes to visit

    • Start with the initial node and push it onto the stack

    • While the stack is not empty, pop a node from the stack and visit its neighbors

    • Push unvisited neighbors onto the stack

    • Repeat until all nodes are visited

  • Answered by AI
  • Q2. Bfs write whole pseudo code.
  • Ans. 

    BFS (Breadth First Search) algorithm pseudo code

    • Start by enqueueing the starting node

    • While the queue is not empty, dequeue a node and process it

    • Enqueue all adjacent nodes that have not been visited yet

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q3. Find the middle of the linked list.
  • Ans. 

    To find the middle of a linked list, use the slow and fast pointer technique.

    • Initialize two pointers, slow and fast, both pointing to the head of the linked list.

    • Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.

    • The position of the slow pointer at this point will be the middle of the linked list.

  • Answered by AI
Round 3 - HRĀ 

(1 Question)

  • Q1. Cv grilling some questions on projects.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding TestĀ 

Questions related to Tree and stack

Round 2 - Coding TestĀ 

Questions related to Binary search

Round 3 - TechnicalĀ 

(2 Questions)

  • Q1. Java concepts
  • Q2. Graph coding ques
Round 4 - HRĀ 

(1 Question)

  • Q1. Salary discssion

R&D Engineer Interview Questions & Answers

user image Aditya Patil

posted on 26 Dec 2024

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding TestĀ 

Held on samsung's platform, it is standard

Round 2 - TechnicalĀ 

(2 Questions)

  • Q1. Project based questions
  • Q2. Virtual Destructor

Interview Preparation Tips

Topics to prepare for Samsung Research R&D Engineer interview:
  • DSA
  • OOPS
  • OS

RND Engineer Interview Questions & Answers

user image Saurabh Prabhat

posted on 22 Dec 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding TestĀ 

One question on graph theory is given for a duration of three hours.

Round 2 - Pen paper testĀ 

(1 Question)

  • Q1. Find minimum no of steps to reach end of array
  • Ans. 

    Calculate the minimum steps to reach the end of an array using jumps based on values at each index.

    • Use a greedy approach to track the maximum reachable index at each step.

    • Initialize variables: steps (to count jumps), maxReach (to track the farthest index), and currentEnd (to mark the end of the current jump).

    • Iterate through the array, updating maxReach and incrementing steps when reaching currentEnd.

    • Example: For array ...

  • Answered by AI
Round 3 - TechnicalĀ 

(1 Question)

  • Q1. Based on project
Round 4 - HRĀ 

(1 Question)

  • Q1. Hr questions based on resume , family

RND Engineer Interview Questions & Answers

user image Anonymous

posted on 13 Nov 2024

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Oct 2024.Ā There were 3 interview rounds.

Round 1 - Coding TestĀ 

We were given a DSA question to solve it in 3 hr and have to complete every test case to proceed

Round 2 - Coding TestĀ 

Again a DSA question on paper. We need to intuitively give an answer and answer algorithm cpz it's RND

Round 3 - TechnicalĀ 

(1 Question)

  • Q1. Advance Data structures questions
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding TestĀ 

One coding question from dynamic programming

Round 2 - TechnicalĀ 

(2 Questions)

  • Q1. Segment tree maximum/minimum
  • Ans. 

    Segment trees efficiently handle range queries for maximum or minimum values in an array.

    • Segment trees are binary trees used for storing intervals or segments.

    • They allow querying the maximum or minimum value in a range in O(log n) time.

    • Building a segment tree takes O(n) time.

    • Example: For array [1, 3, 2, 7, 9, 11], the segment tree can quickly find max/min in any subarray.

    • Updates to the array can also be done in O(log n...

  • Answered by AI
  • Q2. Binary lifting ancestors problem
  • Ans. 

    Binary lifting ancestors problem involves finding the k-th ancestor of a node in a binary tree efficiently.

    • Binary lifting is a technique used to find ancestors in a binary tree.

    • It involves precomputing the ancestors of each node using dynamic programming.

    • The k-th ancestor of a node can be found by repeatedly jumping up the tree in powers of 2.

    • Example: Given a binary tree with nodes 1, 2, 3, 4, 5, 6, 7, the 2nd ancestor...

  • Answered by AI
Round 3 - HRĀ 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. Why we hire you?

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Jun 2024, where I was asked the following questions.

  • Q1. Mobile testing , difference between manual and automation testing
  • Q2. Reasonable questions
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Walk-in and was interviewed in Oct 2024.Ā There was 1 interview round.

Round 1 - HRĀ 

(2 Questions)

  • Q1. Why you want to join company
  • Q2. Puzzle question

Interview Preparation Tips

Interview preparation tips for other job seekers - solve previous year question of sri delhi 6 month intern and practice some puzzle. focus on topics like tree, graph,dfs,bfs,shortest path , linked list more.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Jul 2024.Ā There were 3 interview rounds.

Round 1 - Coding TestĀ 

1 question 50 test cases brute force will also work

Round 2 - TechnicalĀ 

(2 Questions)

  • Q1. Object oriented Programming
  • Q2. Data structure and algorithm BFS DFS
Round 3 - HRĀ 

(2 Questions)

  • Q1. Simple question like introduce about yourself?
  • Q2. Why you want to join ?

Interview Preparation Tips

Interview preparation tips for other job seekers - core focus should be BFS DFS
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
-

I applied via Job Portal and was interviewed in Jul 2024.Ā There were 2 interview rounds.

Round 1 - TechnicalĀ 

(2 Questions)

  • Q1. Can you tell me about yourself?
  • Ans. 

    I am a Senior Engineer with 10+ years of experience in designing and implementing complex systems.

    • 10+ years of experience in engineering

    • Specialize in designing and implementing complex systems

    • Strong problem-solving skills

    • Experience with various programming languages such as Java, Python, and C++

  • Answered by AI
  • Q2. Tell me about project
  • Ans. 

    Designed and implemented a cloud-based data analytics platform for real-time monitoring of industrial equipment performance.

    • Led a team of 5 engineers in developing the platform from scratch

    • Utilized AWS services such as Lambda, S3, and DynamoDB for data storage and processing

    • Implemented machine learning algorithms for predictive maintenance

    • Integrated with existing industrial IoT devices for data collection

    • Achieved 20% r...

  • Answered by AI
Round 2 - HRĀ 

(1 Question)

  • Q1. Salary negotiations

Interview Preparation Tips

Interview preparation tips for other job seekers - be prepared for tough questions
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Jun 2024.Ā There was 1 interview round.

Round 1 - TechnicalĀ 

(2 Questions)

  • Q1. Write monitor for APB protocol
  • Ans. 

    A monitor for APB protocol is a verification component that checks for protocol compliance in APB transactions.

    • Monitor should check for valid address, data, and control signals in APB transactions

    • It should detect and report any protocol violations or errors

    • Monitor should be able to track the state of the APB bus and ensure proper communication between master and slave devices

  • Answered by AI
  • Q2. Design FSM - halway with 2 detectors, accuire amout of pepole in room - only one person can pass halway each time.
  • Ans. 

    Design a finite state machine to count the number of people passing through a hallway with 2 detectors, allowing only one person at a time.

    • Create states for each detector and the hallway

    • Transition between states based on detector inputs

    • Use counters to keep track of the number of people passing through

    • Implement logic to prevent multiple people from passing simultaneously

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Samsung Research Verification Engineer interview:
  • FSMS
  • UVM

Skills evaluated in this interview

Samsung Research Interview FAQs

How many rounds are there in Samsung Research interview?
Samsung Research interview process usually has 2-3 rounds. The most common rounds in the Samsung Research interview process are Technical, Coding Test and HR.
How to prepare for Samsung Research interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Samsung Research. The most common topics and skills that interviewers at Samsung Research expect are Investment Banking, Software Configuration Management, Market Analysis, Product Strategy and Strategy Development.
What are the top questions asked in Samsung Research interview?

Some of the top questions asked at the Samsung Research interview -

  1. There were a lot of questions on Operating Systems like on Deadlock, Partitionn...read more
  2. What's the best way to find majority element in an arr...read more
  3. You are given a thread and you are unlocked in a room.Measure the height of the...read more
How long is the Samsung Research interview process?

The duration of Samsung Research interview process can vary, but typically it takes about less than 2 weeks to complete.

Tell us how to improve this page.

Overall Interview Experience Rating

4.2/5

based on 107 interview experiences

Difficulty level

Easy 14%
Moderate 81%
Hard 4%

Duration

Less than 2 weeks 81%
2-4 weeks 10%
4-6 weeks 3%
6-8 weeks 4%
More than 8 weeks 1%
View more

Interview Questions from Similar Companies

OPPO Interview Questions
4.0
 • 228 Interviews
LG Electronics Interview Questions
3.9
 • 225 Interviews
vivo Interview Questions
4.1
 • 207 Interviews
Blue Star Interview Questions
4.1
 • 177 Interviews
Daikin Interview Questions
4.1
 • 169 Interviews
Philips Interview Questions
3.8
 • 167 Interviews
HP India Interview Questions
4.0
 • 150 Interviews
Voltas Interview Questions
4.0
 • 148 Interviews
Haier Appliances India Interview Questions
4.0
 • 139 Interviews
Bajaj Electricals Interview Questions
4.0
 • 131 Interviews
View all

Samsung Research Reviews and Ratings

based on 1.1k reviews

3.2/5

Rating in categories

2.8

Skill development

3.5

Work-life balance

3.1

Salary

3.4

Job security

3.0

Company culture

2.6

Promotions

2.8

Work satisfaction

Explore 1.1k Reviews and Ratings
Camera Device Driver Specialist

Bangalore / Bengaluru

4-9 Yrs

Not Disclosed

Linux Kernel Technologist

Bangalore / Bengaluru

4-9 Yrs

Not Disclosed

Financial Planning Analyst

Bangalore / Bengaluru

5-7 Yrs

₹ 20-22.5 LPA

Explore more jobs
Software Engineer
1.7k salaries
unlock blur

₹7.6 L/yr - ₹22 L/yr

Lead Engineer
633 salaries
unlock blur

₹10 L/yr - ₹43.5 L/yr

Senior Software Engineer
596 salaries
unlock blur

₹8.5 L/yr - ₹32.5 L/yr

Chief Engineer
397 salaries
unlock blur

₹15 L/yr - ₹62 L/yr

Engineer
330 salaries
unlock blur

₹6.5 L/yr - ₹25 L/yr

Explore more salaries
Compare Samsung Research with

vivo

4.1
Compare

OPPO

4.0
Compare

LG Electronics

3.9
Compare

Bajaj Electricals

4.0
Compare
write
Share an Interview