Upload Button Icon Add office photos

Samsung

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Samsung Software Developer Interview Questions, Process, and Tips

Updated 19 Dec 2024

Top Samsung Software Developer Interview Questions and Answers

  • Q1. Minimum Time in Wormhole Network Determine the minimum time required to travel from a starting point to a destination point in a two-dimensional coordinate system, consi ...read more
  • Q2. Bursting Balloons Problem Given an array ARR of size N , where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows fr ...read more
  • Q3. Trapping Rain Water Problem Statement 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 i ...read more
View all 81 questions

Samsung Software Developer Interview Experiences

36 interviews found

Interview Questionnaire 

10 Questions

  • Q1. You are given a string and a number.Count the no of ‘-’ characters in the string and return 1 if the count is equal to the number given or else return 0
  • Ans. 

    Count the number of '-' characters in a string and return 1 if it matches the given number, else return 0.

    • Use a loop to iterate through each character in the string and count the number of '-' characters.

    • Compare the count with the given number and return 1 if they match, else return 0.

    • Handle edge cases such as empty string or negative number input.

  • Answered by AI
  • Q2. Write the functions to create a stack and to delete a node from the stack
  • Ans. 

    Functions to create and delete nodes in a stack

    • To create a stack, initialize a top pointer to null

    • To push a node, create a new node and set its next to the current top, then set top to the new node

    • To pop a node, set top to its next and return the popped node

    • To delete the stack, pop all nodes until top is null

  • Answered by AI
  • Q3. Write the code for producer-consumer problem using mutex
  • Ans. 

    Code for producer-consumer problem using mutex

    • Create a shared buffer with a fixed size

    • Create a mutex to control access to the buffer

    • Create a semaphore to keep track of the number of items in the buffer

    • Create a producer thread that adds items to the buffer

    • Create a consumer thread that removes items from the buffer

    • Use mutex to lock the buffer while adding or removing items

    • Use semaphore to signal when the buffer is full o

  • Answered by AI
  • Q4. Differences between Mutex and Semaphore. Why do we need Mutex if we have Semaphores
  • Ans. 

    Mutex and Semaphore are synchronization primitives used in multi-threaded environments.

    • Mutex is used to provide mutual exclusion to a shared resource, allowing only one thread to access it at a time.

    • Semaphore is used to control access to a shared resource, allowing multiple threads to access it at a time.

    • Mutex is binary, meaning it has only two states - locked and unlocked, while Semaphore can have multiple states.

    • Mute...

  • Answered by AI
  • Q5. Explain the concept of virtual addressing and the allocation of virtual addresses during the execution of program
  • Ans. 

    Virtual addressing is a memory management technique that allows a process to use a range of memory addresses independent of physical memory.

    • Virtual addresses are mapped to physical addresses by the memory management unit (MMU)

    • Virtual addresses are allocated to a process during its execution

    • Virtual addressing allows for efficient use of physical memory by allowing multiple processes to share the same physical memory

    • Exam...

  • Answered by AI
  • Q6. What is deadlock? how to prevent deadlock?
  • Ans. 

    Deadlock is a situation where two or more processes are unable to proceed because they are waiting for each other to release resources.

    • Prevent deadlock by using a proper resource allocation strategy

    • Avoid holding onto resources for too long

    • Use timeouts to release resources if they are not being used

    • Implement a deadlock detection and recovery mechanism

    • Avoid circular wait by imposing a total ordering of all resource types

  • Answered by AI
  • Q7. Write a program to find the duplicate in the array(only one duplicate is present in the array)?
  • Ans. 

    Program to find the only duplicate in an array

    • Create a hash set to store elements as they are encountered

    • If an element is already in the hash set, it is a duplicate

    • Return the duplicate element

  • Answered by AI
  • Q8. Consider we have large amount of physical memory.Do we still need virtual memory? What is the use of paging in that situation
  • Ans. 

    Virtual memory is still needed even with large physical memory. Paging helps manage memory efficiently.

    • Virtual memory allows for larger programs to run than physical memory can handle

    • Paging helps manage memory efficiently by swapping out unused pages to disk

    • Virtual memory also allows for memory protection and sharing between processes

    • Examples of programs that require virtual memory include video editing software and la

  • Answered by AI
  • Q9. How do you find the middle of the linked list?
  • Ans. 

    To find the middle of a linked list, use two pointers - one moving at twice the speed of the other.

    • Initialize two pointers - slow and fast

    • Move the slow pointer one step at a time and the fast pointer two steps at a time

    • When the fast pointer reaches the end of the list, the slow pointer will be at the middle

  • Answered by AI
  • Q10. Time complexity of building a heap using linked list and arrays
  • Ans. 

    Time complexity of building a heap using linked list and arrays

    • Building a heap using linked list takes O(nlogn) time complexity

    • Building a heap using arrays takes O(n) time complexity

    • Linked list implementation is slower than array implementation

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: The questions are easy to crack provided you understand the questions well.
Total Questions: 1

Round: Technical Interview
Experience: They stressed mostly on the OS during my interview mainly on Semaphores,mutex,monitors,Deadlocks,virtual memory concepts,virtual addressing concepts,paging and segmentation etc. One question for sure on Binary trees,linked lists,stacks or queues.

Skill Tips: Operating systems is very important.
Skills: Algorithms, Operating Systems, Database Management, Computer Networks
College Name: NA

Skills evaluated in this interview

Software Developer Interview Questions & Answers

user image Priyadharshini AP

posted on 19 Dec 2024

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

I applied via Naukri.com and was interviewed in Nov 2024. There was 1 interview round.

Round 1 - Technical 

(3 Questions)

  • Q1. Array based coding test
  • Q2. Second largest salary in DBMS
  • Ans. 

    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

  • Answered by AI
  • Q3. Sum of elements close to target
  • Ans. 

    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.

  • Answered by AI

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Basic DSA Question on Recursion , DFS, BFS

Round 2 - One-on-one 

(2 Questions)

  • Q1. Insert a node in a N - array tree
  • Ans. 

    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

  • Answered by AI
  • Q2. Some GFG puzzle and explanation

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
-

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

Round 1 - Coding Test 

The coding from DSA topics

Samsung interview questions for designations

 Software Developer Intern

 (12)

 Embedded Software Developer

 (1)

 Developer

 (1)

 Software Engineer

 (49)

 Java Developer

 (1)

 UI Developer

 (1)

 IOS Developer

 (1)

 Senior Software Engineer

 (9)

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Selected Selected

I applied via Campus Placement

Round 1 - Coding Test 

1. Online test in campus (1 question, 3hrs - 2018)/
2. Group discussion
3. In person campus interview

Get interview-ready with Top Samsung Interview Questions

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

I applied via campus placement at Indian Institute of Technology (IIT), Kanpur and was interviewed in Nov 2023. There were 3 interview rounds.

Round 1 - Coding Test 

3 hr test 1 question

Round 2 - Technical 

(1 Question)

  • Q1. Leetcode medium and projects
Round 3 - HR 

(1 Question)

  • Q1. General hr question
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed before Oct 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Two leetcode problems

Round 2 - HR 

(2 Questions)

  • Q1. Tell about yourself
  • Ans. 

    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

  • Answered by AI
  • Q2. Where do you see yourself in 5years
  • Ans. 

    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

  • Answered by AI
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
Not Selected

I applied via Referral and was interviewed in Mar 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

The aptitude test is about your basic knowledge in software developing.

Round 2 - One-on-one 

(1 Question)

  • Q1. What are the basic role of JAVA in the development of software?
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - You should make your base strong and your knowledge about software should be up to date.

Skills evaluated in this interview

I was interviewed in Apr 2022.

Round 1 - Video Call 

(2 Questions)

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.

  • Q1. 

    Next Greater Number Problem Statement

    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...

  • Ans. Greedy Implementation
    • First of all, we shall consider some base cases before moving on to the actual solution.
      • If all the digits are sorted in ascending order, then just swap the last two digits, and return them, since it will give us the next greater number.
      • If all the digits are sorted in descending order, then return -1, since we will not have any greater number than the given number which may contain the same set of d...
  • Answered Anonymously
  • Q2. 

    Check if Two Trees are Mirror

    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.

    ...

  • Ans. Recursive Approach

    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:

    1. Their root node’s data must be the sam...
  • Answered Anonymously

Interview Preparation Tips

Eligibility criterianaSamsung interview preparation:Topics to prepare for the interview - Data Structures, Competitive Programming, Databases, Java, Spring , Hibernate, Jenkins, AWSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Trapping Rain Water Problem Statement

    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...

  • Ans. 

    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...

  • Answered Anonymously
  • Q2. 

    Shortest Path in a Binary Matrix Problem Statement

    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...

  • Ans. 

    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...

  • Answered Anonymously
  • Q3. 

    Count Leaf Nodes in a Binary Tree

    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...

  • Ans. 

    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

  • Answered Anonymously
Round 2 - Video Call 

(4 Questions)

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++.

  • Q1. 

    Find The Repeating And Missing Number Problem Statement

    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...

  • Ans. 

    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...

  • Answered Anonymously
  • Q2. 

    Count Pairs with Given Sum

    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'.

    Input:

    The first line c...
  • Ans. 

    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...

  • Answered Anonymously
  • Q3. What is the difference between a structure and a union, and what are the pros and cons of both?
  • Ans. 

    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...

  • Answered Anonymously
  • Q4. How does C++ support polymorphism?
  • Ans. 

    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

  • Answered Anonymously
Round 3 - Video Call 

(5 Questions)

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.

  • Q1. 

    Spiral Order Traversal of a Binary Tree

    Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.

    Input:

    The input consists of a single line containing elem...
  • Ans. 

    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...

  • Answered Anonymously
  • Q2. 

    Stack using Two Queues Problem Statement

    Develop a Stack Data Structure to store integer values using two Queues internally.

    Your stack implementation should provide these public functions:

    Explanation:

    ...
  • Ans. 

    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 ...

  • Answered Anonymously
  • Q3. 

    Convert a Binary Tree to its Sum Tree

    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.

    ...
  • Ans. 

    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...

  • Answered Anonymously
  • Q4. What is meant by multitasking and multithreading in operating systems?
  • Ans. 

    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...

  • Answered Anonymously
  • Q5. What is Android?
  • Ans. 

    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).

  • Answered Anonymously

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jul 2021.

Round 1 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Triplets with Given Sum Problem

    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.

    Explanation:

    A t...

  • Ans. 

    Approach : 

    1) Sort the array in ascending order.

    2) Now since we want triplets such that x + y + z = ‘K’, we have x+ y = ‘K’ - z and now we can fix z as arr[i]. So we want to find the sum of two numbers x and y as ‘K’ - arr[i] in the array.

    3) We will use two pointers, one will start from i+1, and the other will start from the end of the array.

    4) Let the two pointers be ‘FRONT’ and ‘BACK’, where ‘FRONT’ = i + 1 and ...

  • Answered Anonymously
  • Q2. 

    Minimum Operation Needed to Convert to the Given String

    You are given two strings str1 and str2. Determine the minimum number of operations required to transform str1 into str2.

    Explanation:

    An operatio...

  • Ans. 

    Approach : I solved this problem using 2-pointer technique. 

    1) Initialize the first pointer to the start of str1 and the second pointer to the start of the str2.

    2) Now increase the first pointer till the character pointed by the first pointer in str1 matches the character at the second pointer in str2. And the number of character which did not match should be placed at the end of str1. Therefore increase our answe...

  • Answered Anonymously
  • Q3. 

    Power of Two Problem Statement

    Determine whether a given integer N is a power of two. Return true if it is, otherwise return false.

    Explanation

    An integer 'N' is considered a power of two if it can be e...

  • Ans. 

    Approach : If a number N is power of 2 then bitwise & of N and N-1 will be zero. We can say N is a power of 2 or not based on the value of N&(N-1). The expression N&(N-1) will not work when N is 0.
    So,handle that case separately.

    TC : O(1)
    SC : O(1)

  • Answered Anonymously
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Merge K Sorted Arrays Problem Statement

    Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.

    Inpu...

  • Ans. 

    Approach 1 (Brute Force) : 

    Create an output array and and one by one copy all arrays to it. Finally, sort the output array using. This approach takes O(N Logn N) time where N is count of all elements.

    Approach 2 (Using Min-Heap) :

    1. Create an output array. 
    2. Create a min heap of size k and insert 1st element in all the arrays into the heap 
    3. Repeat following steps while priority queue is not empty. ...

  • Answered Anonymously
  • Q2. 

    Spiral Order Traversal of a Binary Tree

    Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.

    Input:

    The input consists of a single line containing elem...
  • Ans. 

    Approach 1 (Using Level Order Traversal) : 

    Steps : 
    1) Initialize an array ‘spiral’ to store the result.
    2) Initialize a variable ‘direction’ to keep track of traversing direction with 1(denoting left to right)
    3) Find the height of the given tree and store it in a variable ‘height’.
    4) Run a loop - level : 1 to height, to traverse through every level.
    4.1) Find level order traversal in the current direction.and s...

  • Answered Anonymously
  • Q3. What is the difference between a structure and a union, and what are the pros and cons of each?
  • Ans. 

    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...

  • Answered Anonymously
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to Trees and Graphs and some questions revolving around types of Operating Systems their pros and cons.

  • Q1. 

    Binary Tree Diameter Problem Statement

    You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

    The diameter of a binary tree is the length of the longest path betwe...

  • Ans. 

    Approach 1 :

    Steps : 

    1) If the ‘root’ node is NULL, return 0. The diameter of an empty tree is 0.
    2) Recur for the left subtree and store the diameter of the left subtree in a variable ‘leftDiameter’, i.e. 
    ‘leftDiameter’ = getDiameter(left child of the root node)
    3) Similarly, recur for the right subtree and store the diameter of the right subtree in a variable 
    ‘rightDiameter’ i.e. ‘rightDiameter’ = getDiam...

  • Answered Anonymously
  • Q2. 

    Shortest Path in a Binary Matrix Problem Statement

    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...

  • Ans. 

    Approach : I solved this problem using BFS.

    Breadth-First-Search considers all the paths starting from the source and moves ahead one unit in all those paths at the same time. This makes sure that the first time when the destination is visited, it is the path with the shortest length.

    Steps : 

    1) Create an empty queue and enqueue source cell and mark it as visited
    2) Declare a ‘STEPS’ variable, to keep track of the le...

  • Answered Anonymously

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPASamsung interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Samsung Interview FAQs

How many rounds are there in Samsung Software Developer interview?
Samsung interview process usually has 2 rounds. The most common rounds in the Samsung interview process are Coding Test, Technical and Resume Shortlist.
How to prepare for Samsung Software Developer 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. The most common topics and skills that interviewers at Samsung expect are Analytical skills, C++, Debugging, Log Analysis and Networking.
What are the top questions asked in Samsung Software Developer interview?

Some of the top questions asked at the Samsung Software Developer interview -

  1. Consider we have large amount of physical memory.Do we still need virtual memor...read more
  2. You are given a string and a number.Count the no of ‘-’ characters in the s...read more
  3. Differences between Mutex and Semaphore. Why do we need Mutex if we have Semaph...read more

Tell us how to improve this page.

Samsung Software Developer Interview Process

based on 10 interviews

5 Interview rounds

  • Coding Test Round
  • HR Round
  • Aptitude Test Round - 1
  • Aptitude Test Round - 2
  • Personal Interview1 Round
View more
Samsung Software Developer Salary
based on 225 salaries
₹7 L/yr - ₹25 L/yr
99% more than the average Software Developer Salary in India
View more details

Samsung Software Developer Reviews and Ratings

based on 34 reviews

3.7/5

Rating in categories

3.1

Skill development

3.8

Work-life balance

3.0

Salary

3.6

Job security

3.4

Company culture

2.8

Promotions

3.1

Work satisfaction

Explore 34 Reviews and Ratings
Sales Executive
1.1k salaries
unlock blur

₹1 L/yr - ₹6.5 L/yr

Assistant Manager
1.1k salaries
unlock blur

₹5.5 L/yr - ₹19.3 L/yr

Software Engineer
876 salaries
unlock blur

₹6.5 L/yr - ₹25 L/yr

Manager
524 salaries
unlock blur

₹10.1 L/yr - ₹33.1 L/yr

Senior Engineer
481 salaries
unlock blur

₹4.3 L/yr - ₹18 L/yr

Explore more salaries
Compare Samsung with

Apple

4.3
Compare

LG Electronics

4.0
Compare

Sony

4.2
Compare

Xiaomi

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview