Samsung
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Naukri.com and was interviewed in Nov 2024. There was 1 interview round.
The second largest salary in a database management system (DBMS) can be found by using the ORDER BY and LIMIT clauses in a SQL query.
Use the ORDER BY clause to sort the salaries in descending order
Use the LIMIT clause to retrieve the second row in the sorted result set
Example: SELECT salary FROM employees ORDER BY salary DESC LIMIT 1,1
Calculate the sum of elements in an array that are closest to a given target value.
Iterate through the array and calculate the absolute difference between each element and the target value.
Keep track of the element with the smallest difference and update the sum accordingly.
Return the sum of elements closest to the target value.
Basic DSA Question on Recursion , DFS, BFS
Insert a node in a N-array tree
Traverse the tree to find the parent node where the new node will be inserted
Add the new node as a child of the parent node
Update the parent node's child array to include the new node
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
The coding from DSA topics
I applied via Campus Placement
1. Online test in campus (1 question, 3hrs - 2018)/
2. Group discussion
3. In person campus interview
Samsung interview questions for designations
I applied via campus placement at Indian Institute of Technology (IIT), Kanpur and was interviewed in Nov 2023. There were 3 interview rounds.
3 hr test 1 question
Get interview-ready with Top Samsung Interview Questions
I applied via Naukri.com and was interviewed before Oct 2023. There were 2 interview rounds.
Two leetcode problems
I am a passionate software developer with experience in Java, Python, and web development.
Graduated with a degree in Computer Science
Worked on multiple projects using Java and Python
Familiar with web development technologies like HTML, CSS, and JavaScript
Strong problem-solving skills and ability to work in a team
In 5 years, I see myself as a senior software developer leading a team on innovative projects.
Continuing to enhance my technical skills and knowledge through ongoing learning and certifications
Taking on more leadership responsibilities and mentoring junior developers
Contributing to the success and growth of the company through my expertise and dedication
I applied via Referral and was interviewed in Mar 2023. There were 2 interview rounds.
The aptitude test is about your basic knowledge in software developing.
JAVA is a versatile programming language used for developing various software applications.
JAVA is platform-independent and can run on any operating system
It is object-oriented and supports multithreading
JAVA is widely used for developing web applications, mobile applications, and enterprise software
It provides a vast library of pre-built classes and APIs for developers to use
JAVA is also used for developing games, sci
I was interviewed in Apr 2022.
Round duration - 90 Minutes
Round difficulty - Easy
It was conducted on the cubes platform. We were given 2 coding questions to solve in 90 minutes.
I solved both the problems within 25 min and checked for different test cases manually for more than 15 mins. There were only two test cases were visible and the rest are hidden. Even After submission, they didn’t show us whether all test cases pass not. So, before submission doesn’t forget to check for corner cases manually. One needs to pass all test cases as low as time possible.
Given a string S
which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...
Given two arbitrary binary trees consisting of 'N' and 'M' number of nodes respectively, your task is to check whether the two trees are mirror images of each other or not.
Traverse the tree T in preorder fashion and treat every node of the given tree T as the root, treat it as a subtree and compare the corresponding subtree with the given subtree S for equality. For checking the equality, we can compare all the nodes of the two subtrees.
For two trees ‘S’ and ‘T’ to be mirror images, the following three conditions must be true:
Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts
Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand
I was interviewed in Aug 2021.
Round duration - 120 Minutes
Round difficulty - Medium
This was an online coding round where we had 3 questions to solve under 120 minutes. The questions were of medium to hard difficulty level.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Approach :
1) Create two lists or arrays, say, ‘leftMax’ and ‘rightMax’.
2) At every index in the ‘leftMax’ array store the information of the ‘leftMaxHeight’ for every elevation in the map.
3) Similarly, at every index in the ‘rightMax’ array store the information of the ‘rightMaxHeight' for every elevation in the map.
4) Iterate over the elevation map and find the units of water that can be stored at this location by get...
Given a binary matrix of size N * M
where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...
Approach (Using BFS) :
1) Create an empty queue and enqueue source cell and mark it as visited
2) Declare a ‘STEPS’ variable, to keep track of the length of the path so far
3) Loop in level order till the queue is not empty
3.1) Fetch the front cell from the queue
3.2) If the fetched cell is the destination cell, return ‘STEPS’
3.3) Else for each of the 4 adjacent cells of the current cell, we enqueue each valid cell into th...
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...
Approach :
1) Given a tree node ROOT, initialise a queue of nodes NODEQUEUE and COUNT by 0.
2) Push ROOT into NODEQUEUE.
3) While NODEQUEUE is not empty do:
3.1) Initialize node TEMP as NODEQUEUE.peek().
3.2) If TEMP.left is not NULL, push TEMP.left to NODEQUEUE.
3.3) If TEMP.right is not NULL, push TEMP.right to NODEQUEUE.
3.4) If TEMP.right and TEMP.left are both NULL, increase COUNT by 1.
4) Return COUNT
TC : O(N), whe
Round duration - 60 Minutes
Round difficulty - Medium
In this round I was first asked 2 questions related to DSA where I was expected to first explain my approach to the interviewer along with proper complexity analysis and then code the implementation in any of my preferred IDE. This was followed by some questions related to OOPS and C++.
You are provided with an array nums
which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...
Approach 1 :
1) We use a count array to store the frequency.
2) We initialize the count array to zero for all the numbers.
3) Now, iterate through the array and increment the corresponding frequency count of the numbers.
4) Now, we iterate through the count (frequency) array.
5) The number with a frequency equal to zero is the missing number while the number with a frequency equal to two
is the repeating number.
TC : O(N), wh...
Given an integer array/list arr
and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
The first line c...
Approach :
1) Create a hashmap/dictionary which will store the count of occurrences of each element and initially it will be empty.
2) Run a loop from i=0 to N-1 and for each i’th element its value is arr[i] and we need to find the number which is equal to Sum - arr[i]. So check if sum-arr[i] is present in the hashmap/dictionary. If it is present, the answer will be increased by the count of occurrence of sum-arr[i...
Answer :
Structure : Structure is a user-defined data type in C programming language that combines logically related data
items of different data types together.
All the structure elements are stored at contiguous memory locations. Structure type variable can store more than
one data item of varying data types under one name.
Union : Union is a user-defined data type, just like a structure. Union combines objects of differe...
C++ is an Object-oriented programming language and it supports Polymorphism as well:
Compile Time Polymorphism: C++ supports compile-time polymorphism with the help of features like templates, function overloading, and default arguments.
Runtime Polymorphism: C++ supports Runtime polymorphism with the help of features like virtual functions. Virtual functions take the shape of the functions based on the type of object in
Round duration - 60 Minutes
Round difficulty - Medium
This round had 3 questions from DSA which I had to code under 60 minutes and then the interviewer asked some questions from Operating Systems and Android as I did a project in Mobile App Development.
Given a binary tree with N
nodes, your task is to output the Spiral Order traversal of the binary tree.
The input consists of a single line containing elem...
Approach :
1) We will maintain two stacks, one for each direction i.e. leftToRight and rightToleft.
2) We will do a level order traversal of the given binary tree and push nodes of each level onto one of the stack according to the current direction of traversal.
3) After we’ve pushed all nodes of a level onto one stack, we’ll start popping those nodes. While popping the nodes we will push their children (if any) ont...
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Approach : A stack can be implemented using two queues. Let stack to be implemented be ‘s’ and queues used to implement be ‘q1’ and ‘q2’. Stack ‘s’ can be implemented in two ways :
Method 1 (push - O(1) , pop - O(n) ) :
1) push(s, x) operation :
i) Enqueue x to q1 (assuming size of q1 is unlimited).
2) pop(s) operation :
i) One by one dequeue everything except the last element from q1 and enqueue to q2.
ii) Dequeue the last ...
Given a binary tree of integers, convert it to a sum tree where each node is replaced by the sum of the values of its left and right subtrees. Set leaf nodes to zero.
...Approach :
1) Traverse a given binary tree.
2) While traversing the given binary tree, store the old value of the current node, recursively call for left and right subtrees.
3) Now change the value of the current node as the sum of the values returned by the recursive calls of left and right subtrees.
4) Finally, return the sum of the new value and value (which is the sum of values in the subtree rooted with this nod...
Answer :
Multitasking : It refers to the process in which a CPU happens to execute multiple tasks at any given time. CPU
switching occurs very often when multitasking between various tasks. This way, the users get to collaborate with
every program together at the same time. Since it involves rapid CPU switching, it requires some time. It is because
switching from one user to another might need some resources. The processes...
Android is an open-sourced operating system that is used on mobile devices, such as mobiles and tablets. The Android application executes within its own process and its own instance of Dalvik Virtual Machine(DVM) or Android RunTime(ART).
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Top trending discussions
Some of the top questions asked at the Samsung Software Developer interview -
based on 10 interviews
5 Interview rounds
based on 34 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
528
salaries
| ₹10 L/yr - ₹33 L/yr |
Senior Engineer
478
salaries
| ₹4.3 L/yr - ₹18 L/yr |
Apple
LG Electronics
Sony
Xiaomi