Samsung
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Easy Binary search and tree questions were asked
Binary search on rotated array involves finding a target element in a sorted array that has been rotated.
Find the pivot point where the array is rotated
Determine which half of the array the target element lies in
Perform binary search on the appropriate half of the array
ACID is a set of properties that guarantee database transactions are processed reliably.
ACID stands for Atomicity, Consistency, Isolation, Durability.
Atomicity ensures that all operations in a transaction are completed successfully or none at all.
Consistency ensures that the database remains in a consistent state before and after the transaction.
Isolation ensures that multiple transactions can be executed concurrently ...
I was interviewed in Nov 2021.
Round duration - 70 minutes
Round difficulty - Medium
It was held at 7:00 pm. STL functions were not allowed. But STL containers like queues were allowed. One question was easy-medium, one was medium and one was hard. Everyone got different sets of questions. Make sure you solve all the questions from Samsung online Test, as they tend to repeat. Only 2 sample test cases were visible and Other Test Cases were hidden.
Two players, 'Ale' and 'Bob', are playing a game with a pile of stones. Your task is to determine the winner if both play optimally.
1. On each turn, ...
You are provided with a Binary Tree consisting of 'N' nodes, where each node holds an integer value. Your task is to determine the largest possible number that can be formed ...
A simple solution would be to store all the node values to the list/array by traversing the whole Binary Tree and the problem now is that given a list of non-negative integers, arrange them such that they form the largest number. To solve this problem, sort the array in descending order, but sorting the list/array does not work here.
The idea is to use any of the comparison-based sorting algorithms.
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...
The brute force approach to find all the bridges in a given graph is to check for every edge if it is a bridge or not, by first not considering current edge is not in given graph and then checking if the vertices that it was connecting are still connected or not, using DFS(DepthFirst Search). Given below is an algorithm that will find all bridges in a graph.
Algorithm :
Round duration - 60 minutes
Round difficulty - Easy
The interviewer was very friendly. It started at 10:00 AM and lasted for 60 minutes. It was the only technical interview and NO HR interview was there. The video was kept on with screen sharing.
Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...
The main idea is to do the sum of digits until it becomes less than 10.
Algorithm:
O(1).
We are using constant space to solve this.
Time Complexity: OtherExplanation:O(log10(...
You are tasked with finding the sum of squares of the first N
natural numbers for given test cases.
The first line contains an integer ...
O(N), where ‘N’ is the given number.
Considering the recursive stack space.
Time Complexity: O(1)Explanation:O(N), where ‘N’ is...
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
The fi...
Tip 1 : Never mention anything in RESUME in which you're not confident
Tip 2 : For on-campus opportunities try to maintain a good CGPA. Try to maintain at least 7.5 CGPA
Tip 3 : While practicing questions please make sure you make notes if them, it will be mostly required if your interview is scheduled in 1-2 days.
Tip 4 : Never submit questions just for the sake of increasing the count on problems solved. Try to think of one problem from a different perspective.
Tip 5 : Please give timed contests it will be helpful in clearing ONLINE TESTS. Please note Interviews are easier than Online Tests and mostly standard questions are asked.
Tip 1 : Mention only those things you feel confident
Tip 2 : If you're DSA heavy mention ranking if any, the number of problems solved. And if you're development heavy include projects and 2-3 lines about each project.
I was interviewed in Dec 2020.
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.
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
.
A t...
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...
Round duration - 30 minutes
Round difficulty - Medium
Tip 1 : Do atleast 3 major web dev project
Tip 2 : Practice from interview bit
Tip 1 : Resume should not be more than 1 page
Tip 2 : Be precise and honest
I was interviewed in Nov 2020.
Round duration - 50 Minutes
Round difficulty - Medium
This was the only technical round held for shortlisted students. Students were divided in multiple batches and each batch was interviewed by a panel of one Technical and one HR interviewer. This round was scheduled on Samsung's internal video conferencing platform which was accessible through windows machine only. This round was based on data structures, algorithms and computer science subject's questions. My interview was scheduled at 2:00pm. Interviewers were very friendly and overall environment was positive.
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
The first line co...
Given a square matrix 'MATRIX' of non-negative integers, rotate the matrix by 90 degrees in an anti-clockwise direction using only constant extra space.
Round duration - 10 Minutes
Round difficulty - Easy
In this round, basic HR questions were asked. Questions were behavioural and very easy to answer. It happened via a telephonic call and lasted approximately 10 minutes.
Tip 1 : Practice a lot of programming problems. Participate in competitive programming contests.
Tip 2 : Make sure you have your computer science fundamentals very clear and maintain a decent CGPA.
Tip 3 : Do couple of real problem solving projects.
Tip 1 : Maintain a precise and self speaking one page resume.
Tip 2 : Avoid adding non-technical achievements (eg. 1st position in dancing, singing competition etc.)
Samsung interview questions for designations
I was interviewed in Oct 2020.
Round duration - 120 minutes
Round difficulty - Medium
The round had 2 coding problems to solve with varying difficulty. Each candidate had a different set of questions. The round was around 2 pm. The webcam was turned on to keep an eye on candidates.
Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...
You are tasked with determining the maximum profit a thief can earn. The thief is looting a store and can carry a maximum weight 'W' in his knapsack. There are 'N' items, ea...
Round duration - 60 minutes
Round difficulty - Medium
This was my first face to face interview and I was very nervous. It was at 10 am in the morning. However, my interviewer was very friendly and asked for my introduction in the beginning. He also gave me hints whenever I felt stuck.
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Round duration - 30 minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point and professional. The interview lasted for 30 minutes.
Tip 1 : Prepare Data structures properly. It is not important part of the process. Also, understand the famous algorithms for sorting and searching.
Tip 2 : Do around 5-6 questions in a day. Analyze as them properly. participating in Competitive Coding Contest at Leetcode helps a lot in increasing the speed.
Tip 3 : Prepare your resume well with mentioning only those skills which you are confident about.
Tip 1 : Have only those skills and projects which are related to your project.
Tip 2 : Don't fake anything on the resume. It really leaves a negative impression if the interviewer gets to know that it is faked.
Tip 3 : Try to have a crisp and short resume mentioning only necessary details.
Get interview-ready with Top Samsung Interview Questions
I was interviewed in Sep 2020.
Round duration - 70 minutes
Round difficulty - Medium
Online Coding Round held on CoCubes Platform
Duration: 70 mins Camera and Mic enabled
Tip: 1) CoCubes platform does allow to use in-built library functions. So one cannot use even in-built sort function.
2) Make sure you write the most optimal code in terms of time complexity.
Questions were put from a question bank so they were different to each candidate.
Shortlisting for next round was done based on time taken, code readability and hidden test cases clearance.
Around 6 students were selected for next round.
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...
Given a Binary Search Tree (BST) and a specified range [min, max], your task is to remove all keys from the BST that fall outside this range. The BST should remain vali...
Determine the minimal number of characters needed to insert into a given string STR
to transform it into a palindrome.
STR = "abcaa"
Round duration - 50 minutes
Round difficulty - Medium
Technical Interview held over Skype video call. Interviewer was friendly.
Timing: Around 11 am
I was asked to share my screen and code of any preferred editor.
You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.
Merge Sort is a divide and conq...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...
Create an AVL tree from scratch. You will be provided with ‘N’ values representing node values you need to insert into the AVL tree. After inserting all values, return the root of ...
You are provided with a string STR
of length N
. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...
Round duration - 32 minutes
Round difficulty - Hard
Technical Interview held over Skype video call. Round stared with "Tell me about yourself ?" question and then the interviewer reviewed my resume and asked some project related question. Then he moved to coding & OOPS related questions.
For coding problems I was asked to share my screen and code in my preferred editor. For each question optimized solution was expected by the interviewer.
For a given string str
, remove all the consecutive duplicate characters.
Input String: "aaaa"
Expected Output: "a"
Inp...
Given an array A
of length N
consisting of positive integers, your task is to determine the maximum subsequence sum where no three consecutive el...
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
Tip 1 : Do prepare OOPS, OS and DBMS
Tip 2 : Solve must do interview questions of GFG
Tip 3 : Participate in codeforces & leetcode contests
Tip 4 : Prepare for HR type questions
Tip 1 : Have at least two good projects
Tip 2 : Don't write false things on resume. Write what you know and feel confident about !!
Tip 3 : Mention your technical achievements
I was interviewed before Oct 2020.
Round duration - 120 Minutes
Round difficulty - Medium
Round 1 was of 2 hours duration. 1 hour for MCQs (60 MCQs) and 1 hour for coding questions(3 Coding Questions). MCQs were aptitude based (Verbal + Data Interpretation + Quantitative Aptitude).
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...
Tip 1 : Revise properly
Tip 2 : Strong DS algo
Tip 3 : try all the standard question of each topic
Tip 1 : One page
Tip 2 : 2-3 projects
Tip 3 : Mention your achivemnts
Tip 4 : mention your cgpa
I was interviewed in Oct 2020.
Round duration - 60 minutes
Round difficulty - Medium
This round was a face to face round held on Cisco webex.
This round was completely on DS-Algo and OOPS.
The level of the questions asked was from medium level to hard level.
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
You are provided a string STR
of length N
, consisting solely of lowercase English letters.
Your task is to remove all duplicate occurrences of characters i...
I provided both recursive and iterative solution
You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true
if it is a pali...
Was not able to provide the optimized solution using stack. The interviewer gave hints but I was not able to provide optimized solution.
Given a two-dimensional grid with 'N' rows and 'M' columns consisting of uppercase characters, and a string 'WORD', your task is to determine the number of times the word app...
He only asked for explanation that how would I implement Tries.
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
I was able to provide the optimized solution which requires O(1) space.
Tip 1 : Prepare your resume well.
Tip 2 : Deploy your projects so that the interviewer can view it. Also provide a hyperlink on your resume.
Tip 3 : Be thorough with Data Structures and Algorithms. Also prepare well topics such as OS,DBMS.
Tip 1 : Deploy your projects so that the interviewer can view it. Also provide a hyperlink on your resume
Tip 2 : It's not important to have fancy projects. Only mention those on which you're confident.
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
The round was taken on Cocubes platform with video enabled . The time I chose was 3:00 P.M.
Given a linked list where each node contains a single digit, your task is to construct the largest possible number using these digits.
Print ...
Round duration - 60 Minutes
Round difficulty - Medium
The coding problems were medium and it was held online on Cocubes at 4:00 PM
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
All the possibl...
Determine if a given graph is bipartite. A graph is considered bipartite if its vertices can be divided into two disjoint sets, 'U' and 'V', such that every edge connects a vertex in...
Tip 1 : Prepare OS, DBMS and OOPs also
Tip 2 : Do Competitive Coding Contest from CodeForces.
Tip 3 : Do leetcode 2 months before interviews.
Tip 1 : Have some good coding profiles on various platforms
Tip 2 : Mention some projects or past experience relevant to your stream
I was interviewed before Sep 2020.
Round duration - 180 minutes
Round difficulty - Easy
The round had 3 problems to solve. There were multiple sets and each candidate had a different set of problems to solve.
- Timing: Afternoon (2pm - 5 pm)
- Environment: In a college environment with invigilators present to avoid any bad practices.
Given a tree with 'N' nodes and 'N - 1' distinct edges, along with two nodes 'N1' and 'N2', find and print the shortest path between 'N1' and 'N2'.
A tree is a ...
Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...
Round duration - 60 minutes
Round difficulty - Medium
It was a pen and a paper round. We were required to solve a problem with pen and paper. Also, we were not allowed to use an inbuilt data structure and algorithm.
Given a maze represented as a binary rectangular matrix of size M*N, where each element can either be 0 or 1, determine the length of the shortest path fro...
Round duration - 20 minutes
Round difficulty - Easy
It was the first and only face to face interview. The round was majorly about Data structures and algorithms. Some people were also asked some standard puzzles.
Determine whether a given integer N
is a power of two. Return true
if it is, otherwise return false
.
An integer 'N' is considered a power of two if it can be e...
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Tip 1 : Competitive programming plays a major role when you are appearing for coding rounds as a fresher. In the coding rounds, you won't get direct problems copied from Geeksforgeeks or Leetcode. You would be required to use your logical thinking to go ahead in the process. This is where competitive programming helps.
Tip 2 : Coding rounds are all about Coding + Timing. Most people fail to excel due to the pressure of a timer ticking on your head. So, instead of just solving problems, try to participate in timed contests. This will help you be used to the pressure of the timer.
Tip 3 : Many big companies like Microsoft, Amazon, and even Google expect you to be good at standard problems. So, once you are done with coding round by your logical skills and competitive programming, you must be well versed with some standard problems in order to excel.
Tip 4 : Patience is the key to success. The internships and placements are a little luck-based. You may fail despite being an amazing programmer due to the pressure of situations. It's important to give yourself time, stay calm, and learn from your mistakes.
Tip 5 : Do at least 1 good project for internship and 2 good projects for placement interviews.
Tip 6 : Your practice is not defined by the number of problems you solve. It is defined by how you solve the problem. Memorizing 500 problems may not get you a job. But understanding the concept and DSA behind 200 problems may make you excel and help you get a job at Google.
Tip 1 : Make it short, crisp, and simple. It is always good to have a 1 pager resume.
Tip 2 : Resume must comprise of the following: Educational Qualifications, Technical skills, Projects, Work experience (if any), Achievements. Other than this, you may include some extra co-curricular achievements.
Tip 3 : Keep a balance in your resume. A resume having 6-7 projects and no DSA skills are not good. Similarly, a resume full of competitive programming achievements is not good. A resume must have both in a balanced way. 3-4 projects is more than sufficient.
Top trending discussions
based on 1 interview
2 Interview rounds
based on 3 reviews
Rating in categories
Sales Executive
1.1k
salaries
| ₹1 L/yr - ₹6.9 L/yr |
Assistant Manager
1.1k
salaries
| ₹5.5 L/yr - ₹19.3 L/yr |
Software Engineer
867
salaries
| ₹6.6 L/yr - ₹25 L/yr |
Manager
534
salaries
| ₹10 L/yr - ₹33 L/yr |
Senior Engineer
478
salaries
| ₹4.3 L/yr - ₹18 L/yr |
Apple
LG Electronics
Sony
Xiaomi