Filter interviews by
I applied via Hackerearth contest and was interviewed in Oct 2021. There was 1 interview round.
Reverse a linked list
Iterate through the linked list and change the direction of the pointers
Use three pointers to keep track of the current, previous, and next nodes
Make sure to update the head and tail pointers accordingly
Swap 2 numbers without using a third variable
Use the XOR operation to swap the numbers
Assign the first number to the second number using XOR
Assign the second number to the first number using XOR
Height of a binary tree is the maximum number of edges from the root node to any leaf node.
The height of an empty tree is 0.
The height of a tree with only one node is 1.
The height of a tree can be calculated recursively by finding the height of its left and right subtrees and adding 1 to the maximum of the two heights.
The time complexity of finding the height of a binary tree is O(n), where n is the number of nodes in
Sum queries on a 2D matrix
Iterate through each query and calculate the sum of elements in the given range
Use prefix sum technique to optimize the solution
Preprocess the matrix to store the sum of elements in each row and column for faster calculation
Questions related to Tree and stack
Questions related to Binary search
I applied via Campus Placement
Held on samsung's platform, it is standard
One question on graph theory is given for a duration of three hours.
Samsung Research interview questions for popular designations
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
We were given a DSA question to solve it in 3 hr and have to complete every test case to proceed
Again a DSA question on paper. We need to intuitively give an answer and answer algorithm cpz it's RND
Get interview-ready with Top Samsung Research Interview Questions
One coding question from dynamic programming
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
I applied via Walk-in and was interviewed in Oct 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed in Jul 2024. There were 3 interview rounds.
1 question 50 test cases brute force will also work
I am passionate about software development and believe this company offers exciting opportunities for growth and innovation.
Exciting opportunities for growth and innovation
Passionate about software development
Believe in the company's mission and values
I applied via Job Portal and was interviewed in Jul 2024. There were 2 interview rounds.
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++
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...
I applied via Referral and was interviewed in Jun 2024. There was 1 interview round.
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
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
Top trending discussions
Some of the top questions asked at the Samsung Research interview -
The duration of Samsung Research interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 100 interviews
Interview experience
based on 1k reviews
Rating in categories
Software Engineer
1.6k
salaries
| ₹7.3 L/yr - ₹22 L/yr |
Lead Engineer
625
salaries
| ₹10 L/yr - ₹38 L/yr |
Senior Software Engineer
533
salaries
| ₹7.9 L/yr - ₹31.5 L/yr |
Chief Engineer
389
salaries
| ₹14.1 L/yr - ₹60 L/yr |
Engineer
324
salaries
| ₹6.8 L/yr - ₹25 L/yr |
Vivo
OPPO
HARMAN
Bajaj Electricals