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 Intern Interview Questions, Process, and Tips

Updated 28 Nov 2024

Top Samsung Software Developer Intern Interview Questions and Answers

  • Q1. Remove Consecutive Duplicates Problem Statement For a given string str , remove all the consecutive duplicate characters. Example: Input: Input String: "aaaa" Output: Ex ...read more
  • Q2. 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 childr ...read more
  • Q3. Game of Stones Problem Statement 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. Rul ...read more
View all 46 questions

Samsung Software Developer Intern Interview Experiences

12 interviews found

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

Easy Binary search and tree questions were asked

Round 2 - Technical 

(2 Questions)

  • Q1. Binary search on rotated array
  • Ans. 

    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

  • Answered by AI
  • Q2. ACID in dbms was asked
  • Ans. 

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

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in Nov 2021.

Round 1 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Game of Stones Problem Statement

    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.

    Rules of the Game:

    1. On each turn, ...

  • Ans. 

    Determine the winner of a game where two players take stones alternately, with specific rules.

    • Implement a recursive function to simulate the game, considering the rules provided.

    • Check if the current player can take any stones, if not, the other player wins.

    • Return 'Ale' if 'Ale' will win the game, otherwise return 'Bob'.

  • Answered by AI
  • Q2. 

    Largest Number in Binary Tree

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

  • Ans. 

    Find the largest number that can be formed by concatenating all node values in a Binary Tree.

    • Traverse the Binary Tree in a way that ensures the largest values are concatenated first.

    • Use a custom comparator function to sort the node values in descending order before concatenating.

    • Handle null nodes by skipping them during concatenation.

    • Convert integer node values to strings for concatenation.

    • Implement a recursive functio...

  • Answered by AI
  • Q3. 

    Bridge in Graph Problem Statement

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

  • Ans. 

    Find all the bridges in an undirected graph by identifying edges that, when removed, increase the number of connected components.

    • Use Tarjan's algorithm to find bridges in the graph.

    • A bridge is an edge that, when removed, increases the number of connected components.

    • Identify bridges by performing DFS traversal and keeping track of low and discovery times.

    • Return the count of bridges and the vertices defining each bridge

  • Answered by AI
Round 2 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Sum of Digits Problem Statement

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

  • Ans. 

    Given an integer 'N', find the final single-digit value by summing its digits iteratively.

    • Iteratively sum the digits of the given integer until the result is a single-digit number

    • Output the final single-digit integer for each test case

    • Handle multiple test cases efficiently

  • Answered by AI
  • Q2. 

    Sum of Squares of First N Natural Numbers Problem Statement

    You are tasked with finding the sum of squares of the first N natural numbers for given test cases.

    Input:

    The first line contains an integer ...
  • Ans. 

    Calculate the sum of squares of the first N natural numbers for given test cases.

    • Iterate through each test case and calculate the sum of squares using the formula: N*(N+1)*(2N+1)/6

    • Output the result for each test case on a new line

    • Handle constraints efficiently to avoid timeouts

  • Answered by AI
  • Q3. 

    Binary Tree to Doubly Linked List

    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.

    Input:

    The fi...
  • Ans. 

    Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.

    • Perform Inorder Traversal of the Binary Tree to get the nodes in order.

    • Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.

    • Return the head of the Doubly Linked List as the output.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaCircuital Branches(CSE, ECE,EE) having CGPA more than 7Samsung interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Objected Oriented Programming, DBMS, SQL, Operating SystemTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I appeared for an interview in Dec 2020.

Round 1 - Video Call 

(2 Questions)

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.

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

    Identify all distinct triplets within an array that sum up to a specified number.

    • Iterate through all possible triplets using three nested loops.

    • Check if the sum of the triplet equals the target sum.

    • Print the triplet if found, else print -1.

  • Answered by AI
  • Q2. 

    BST to Greater Tree Conversion

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

  • Ans. 

    Convert a given BST into a Greater Tree by updating each node's data to the sum of original data and all greater nodes' data.

    • Traverse the BST in reverse inorder (right, root, left) to update each node's data with the sum of all greater nodes' data.

    • Keep track of the running sum of nodes visited so far to update the current node's data.

    • Modify the BST in place without using any extra data structures.

    • Example: Input BST: 4 ...

  • Answered by AI
Round 2 - Assignment 

Round duration - 30 minutes
Round difficulty - Medium

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in HyderabadEligibility criteriaabove 8 cgpa, CS/IT branches allowedSamsung interview preparation:Topics to prepare for the interview - Recursion, Dynamic programming, OOPS, Sysytem Design, TreesTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do atleast 3 major web dev project
Tip 2 : Practice from interview bit

Application resume tips for other job seekers

Tip 1 : Resume should not be more than 1 page
Tip 2 : Be precise and honest

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Nov 2020.

Round 1 - Video Call 

(2 Questions)

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.

  • Q1. 

    Delete a Node from a Linked List

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

    Input:

    The first line co...
  • Ans. 

    Implement a function to delete a node from a linked list at a specified position.

    • Traverse the linked list to find the node at the specified position.

    • Update the pointers of the previous and next nodes to skip the node to be deleted.

    • Handle cases where the position is at the beginning or end of the linked list.

    • Ensure to free the memory of the deleted node to avoid memory leaks.

  • Answered by AI
  • Q2. 

    Rotate Matrix by 90 Degrees Problem Statement

    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.

    Inpu...

  • Ans. 

    Rotate a square matrix by 90 degrees in an anti-clockwise direction using constant extra space.

    • Iterate through each layer of the matrix from outer to inner layers

    • Swap elements in groups of 4 to rotate the matrix

    • Handle odd-sized matrices separately by adjusting the center element if needed

  • Answered by AI
Round 2 - HR 

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.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from J.C. Bose University of Science and Technology, YMCA. I applied for the job as SDE - Intern in NoidaEligibility criteriaCGPA of 8 and aboveSamsung interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming, Operating System, DBMS, OOPS, Computer Networking, SQL, BacktrackingTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

Samsung interview questions for designations

 Software Developer

 (36)

 Embedded Software Developer

 (1)

 Frontend Developer Intern

 (1)

 SDE Intern

 (1)

 Intern

 (8)

 Developer

 (1)

 Software Engineer

 (49)

 Senior Software

 (1)

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(2 Questions)

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.

  • Q1. 

    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. 

    Count the number of leaf nodes in a binary tree where each node has at most two children.

    • Traverse the binary tree and count nodes with both children as NULL.

    • Use recursion to check each node in the tree.

    • Leaf nodes have no child nodes.

    • Example: For input 20 10 35 5 15 30 42 -1 13 -1 -1 -1 -1 -1 -1 -1, output should be 4.

  • Answered by AI
  • Q2. 

    0-1 Knapsack Problem Statement

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

  • Ans. 

    The 0-1 Knapsack Problem involves maximizing profit by selecting items with known weights and values within a given weight capacity.

    • Understand the problem: Given items with weights and values, determine the maximum profit the thief can achieve within the knapsack's weight capacity.

    • Dynamic Programming: Use dynamic programming to solve the problem efficiently by considering the weight constraints and maximizing the total...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

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.

  • Q1. 

    Longest Increasing Subsequence Problem Statement

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

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to keep track of the longest increasing subsequence ending at each element.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the ar...

  • Answered by AI
  • Q2. 

    Merge Two Sorted Linked Lists Problem Statement

    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.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the nodes of the two lists and link them accordingly

    • Move the pointer to the next node in the merged list

    • Handle cases where one list is empty or both lists are empty

    • Time complexity: O(n), Space complexity: O(1)

  • Answered by AI
Round 3 - HR 

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.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Motilal Nehru National Institute of Technology, Allahabad. Eligibility criteriaAbove 8 CGPASamsung interview preparation:Topics to prepare for the interview - C++, Data Structures and Algorithms, Operating Systems, Database Management SystemTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Samsung Interview Questions

I appeared for an interview in Sep 2020.

Round 1 - Coding Test 

(3 Questions)

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.

  • Q1. 

    Ceil Value from BST Problem Statement

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

  • Ans. 

    The problem involves finding the ceil value of a key in a Binary Search Tree (BST).

    • Traverse the BST to find the closest integer greater than or equal to the given key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Handle cases where the key is equal to a node value or falls between two nodes.

    • Implement a recursive or iterative solution to efficiently find the ceil value.

  • Answered by AI
  • Q2. 

    Remove BST Keys Outside Given Range

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

  • Ans. 

    Remove BST keys outside given range while maintaining validity of BST.

    • Traverse the BST in inorder fashion and remove nodes outside the specified range.

    • Recursively call the function on left and right subtrees.

    • Adjust the pointers of parent nodes accordingly after removing nodes.

    • Ensure the BST remains valid after modifications.

    • Return the inorder traversal of the adjusted BST.

  • Answered by AI
  • Q3. 

    Minimum Insertions to Make a String Palindrome

    Determine the minimal number of characters needed to insert into a given string STR to transform it into a palindrome.

    Example:

    Input:
    STR = "abcaa"
    Outp...
  • Ans. 

    The task is to find the minimum number of characters needed to insert into a given string to make it a palindrome.

    • Use dynamic programming to find the longest palindromic subsequence of the given string.

    • Subtract the length of the longest palindromic subsequence from the length of the original string to get the minimum insertions required.

    • Handle edge cases like an empty string or a string that is already a palindrome.

    • Exa...

  • Answered by AI
Round 2 - Video Call 

(6 Questions)

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.

  • Q1. 

    Merge Sort Linked List Problem Statement

    You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.

    Explanation:

    Merge Sort is a divide and conq...

  • Ans. 

    Implement merge sort algorithm to sort a singly linked list of integers.

    • Divide the linked list into two halves using slow and fast pointer technique.

    • Recursively sort the two halves.

    • Merge the sorted halves using a merge function.

    • Handle base cases like empty list or single node list.

    • Ensure the termination of the linked list with -1 at the end.

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes.

    • Use three pointers to keep track of the current, previous, and next nodes.

    • Update the links between nodes to reverse the list.

    • Return the head of the reversed linked list.

  • Answered by AI
  • Q3. 

    Implementing a Priority Queue Using Heap

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

  • Ans. 

    Implement a priority queue using a heap data structure with push, pop, getMaxElement, and isEmpty functions.

    • Implement push function to insert element into the queue

    • Implement pop function to remove the largest element from the queue

    • Implement getMaxElement function to return the largest element

    • Implement isEmpty function to check if the queue is empty

  • Answered by AI
  • Q4. 

    AVL Tree Insertion Task

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

  • Ans. 

    Implement a function to create an AVL tree from scratch by inserting given values and return the root of the tree.

    • Create a Node class with data, left, and right pointers for the AVL tree nodes.

    • Implement rotation functions (left rotation, right rotation) to maintain AVL tree balance.

    • Update the height and balance factor of nodes after each insertion to ensure AVL tree properties are maintained.

  • Answered by AI
  • Q5. 

    Longest Palindromic Substring Problem Statement

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

  • Ans. 

    Given a string, find the longest palindromic substring, prioritizing the one with the smallest start index.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found, updating it as needed

    • Return the longest palindromic substring with the smallest start index

  • Answered by AI
  • Q6. What can you tell me about virtual memory and cache implementation?
  • Ans. 

    Virtual memory allows the operating system to use a combination of RAM and disk space to simulate more memory than is physically available. Cache implementation involves storing frequently accessed data in a smaller, faster memory for quicker access.

    • Virtual memory allows programs to use more memory than physically available by swapping data between RAM and disk.

    • Cache implementation involves storing frequently accessed ...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

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.

  • Q1. 

    Remove Consecutive Duplicates Problem Statement

    For a given string str, remove all the consecutive duplicate characters.

    Example:

    Input:
    Input String: "aaaa"
    Output:
    Expected Output: "a"
    Input:
    Inp...
  • Ans. 

    Remove consecutive duplicate characters from a given string.

    • Iterate through the string and compare each character with the previous one.

    • If the current character is different from the previous one, add it to the result string.

    • Return the result string as the output.

  • Answered by AI
  • Q2. 

    Maximum Subsequence Sum Without Three Consecutive Elements

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

  • Ans. 

    Find the maximum subsequence sum from an array without selecting three consecutive elements.

    • Use dynamic programming to keep track of the maximum sum without selecting three consecutive elements.

    • At each index, consider the maximum sum with the current element included or excluded.

    • Handle edge cases where the array length is less than 3 separately.

    • Example: For input [1, 2, 3, 4], the maximum sum is 9 (1 + 3 + 4).

  • Answered by AI
  • Q3. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is encountered.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maxi

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaAbove 7.5 CGPASamsung interview preparation:Topics to prepare for the interview - DBMS, OS, OOPS, Dynamic Programming, Trie DS, Graphs, Standard AlgorithmsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Oct 2020.

Round 1 - Coding Test 

(2 Questions)

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

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during the reversal process.

  • Answered by AI
  • Q2. 

    Minimum Jumps Problem Statement

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

  • Ans. 

    Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.

    • Use Breadth First Search (BFS) to find the minimum number of jumps needed.

    • Keep track of the visited shops to avoid revisiting them.

    • If a shop has an Arr value of 0, it is impossible to reach the last shop.

    • Return -1 if the last shop cannot be reached.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from NATIONAL INSTITUTE OF TECHONOLGY, Hamirpur. I applied for the job as SDE - Intern in DelhiEligibility criteria7 CGPASamsung interview preparation:Topics to prepare for the interview - Graph, Tree, Array, LinkedList , Dynamic ProgrammingTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Revise properly
Tip 2 : Strong DS algo
Tip 3 : try all the standard question of each topic

Application resume tips for other job seekers

Tip 1 : One page
Tip 2 : 2-3 projects
Tip 3 : Mention your achivemnts
Tip 4 : mention your cgpa

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Oct 2020.

Round 1 - Face to Face 

(5 Questions)

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.

  • Q1. 

    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. 

    Implement a stack using two queues to store integer values with specified functions.

    • Use two queues to simulate stack operations efficiently.

    • Maintain one queue for storing elements and another for temporary storage during push operation.

    • Ensure to handle edge cases like empty stack and maximum size limit.

    • Example: Push operation involves transferring elements from one queue to another before adding the new element.

  • Answered by AI
  • Q2. 

    Remove Duplicates from String Problem Statement

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

  • Ans. 

    Remove duplicate occurrences of characters in a given string.

    • Use a hash set to keep track of characters seen so far.

    • Iterate through the string and add non-duplicate characters to a new string.

    • Return the new string as the result.

  • Answered by AI
  • Q3. 

    Palindrome Linked List Problem Statement

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

  • Ans. 

    Check if a given singly linked list is a palindrome or not.

    • Use two pointers approach to find the middle of the linked list

    • Reverse the second half of the linked list

    • Compare the first half with the reversed second half to determine if it's a palindrome

  • Answered by AI
  • Q4. 

    Word Search Problem Statement

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

  • Ans. 

    Count the number of occurrences of a given word in a two-dimensional grid of characters.

    • Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.

    • Use backtracking to explore all possible paths while matching the characters of the word.

    • Keep track of visited cells to avoid revisiting the same cell in the same path.

    • Return the count of occurrences of th

  • Answered by AI
  • Q5. 

    Merge Sort Problem Statement

    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.

    Explanation:

    The Merge Sort...

  • Ans. 

    Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

    • Divide the input array into two halves recursively until each array has only one element.

    • Merge the sorted halves to produce a completely sorted array.

    • Time complexity of Merge Sort is O(n log n).

    • Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - Intern in NoidaEligibility criteria8 CGPASamsung interview preparation:Topics to prepare for the interview - Resume, C++, Data Structures and Algorithms, Projects, OOPS, Operating System, Database management system, System DesignTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

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.

  • Q1. 

    Maximum Number from Linked List Problem Statement

    Given a linked list where each node contains a single digit, your task is to construct the largest possible number using these digits.

    Objective:

    Print ...

  • Ans. 

    Given a linked list of single digits, construct the largest number possible.

    • Traverse the linked list to extract the digits

    • Sort the digits in descending order

    • Concatenate the sorted digits to form the maximum number

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The coding problems were medium and it was held online on Cocubes at 4:00 PM

  • Q1. 

    Maximum Sum Path from Leaf to Root

    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.

    Example:

    All the possibl...

  • Ans. 

    Find the path from a leaf node to the root node with the maximum sum in a binary tree.

    • Traverse the binary tree from leaf to root while keeping track of the sum of each path.

    • Compare the sums of all paths and return the path with the maximum sum.

    • Use recursion to traverse the tree efficiently.

    • Consider negative values in the tree when calculating the sum of paths.

  • Answered by AI
  • Q2. 

    Bipartite Graph Check

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

  • Ans. 

    Check if a given graph is bipartite by dividing its vertices into two disjoint sets.

    • Create two sets 'U' and 'V' to divide the vertices

    • Check if every edge connects vertices from different sets

    • Use graph traversal algorithms like BFS or DFS to determine bipartiteness

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Netaji Subhas University Of Technology. I applied for the job as SDE - Intern in BangaloreEligibility criteriaAbove 8 CGPASamsung interview preparation:Topics to prepare for the interview - Dynamic Programming, Greedy Techniques, Data Structures, OOPs, DBMS, Graph TheoryTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare OS, DBMS and OOPs also
Tip 2 : Do Competitive Coding Contest from CodeForces.
Tip 3 : Do leetcode 2 months before interviews.

Application resume tips for other job seekers

Tip 1 : Have some good coding profiles on various platforms
Tip 2 : Mention some projects or past experience relevant to your stream

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

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.

  • Q1. 

    Find Shortest Path in a Tree

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

    Explanation:

    A tree is a ...

  • Ans. 

    Find the shortest path between two nodes in a tree.

    • Use Breadth First Search (BFS) algorithm to find the shortest path in a tree.

    • Start BFS from one of the nodes and keep track of the parent of each node to reconstruct the path.

    • Once both nodes are reached, backtrack from both nodes to the root to find the common ancestor and then reconstruct the path.

    • Consider implementing a function to find the LCA (Lowest Common Ancesto...

  • Answered by AI
  • Q2. 

    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. 

    Count the number of leaf nodes in a binary tree.

    • Traverse the binary tree and count nodes with both children as NULL.

    • Use recursion to check each node in the tree.

    • Leaf nodes have no children, so their left and right children should be NULL.

    • Keep track of the count of leaf nodes as you traverse the tree.

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

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.

  • Q1. 

    Shortest Path in a Binary Maze Problem Statement

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

  • Ans. 

    Find the length of the shortest path in a binary maze from a given source to destination.

    • Use Breadth First Search (BFS) algorithm to find the shortest path in the binary maze.

    • Create a queue to store the cells to be visited and keep track of visited cells to avoid revisiting them.

    • Check for valid moves in all four directions and update the distance to reach each cell.

    • Return the length of the shortest path if it exists, e...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

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.

  • Q1. 

    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. 

    Check if a given integer is a power of two or not.

    • Check if the given integer is positive.

    • Use bitwise operations to determine if it is a power of two.

    • Return true if it is a power of two, false otherwise.

  • Answered by AI
  • Q2. 

    Reverse the String Problem Statement

    You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.

    Example:

    Input:
    STR = "abcde"
    Output:
    "e...
  • Ans. 

    Reverse a given string containing alphabets, numbers, and special characters.

    • Iterate through the string from the end to the beginning and append each character to a new string.

    • Use built-in functions like reverse() or slicing to reverse the string.

    • Handle special characters and numbers while reversing the string.

    • Ensure to consider the constraints on the input size and number of test cases.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Netaji Subhas University Of Technology. Eligibility criteria7+ CGPASamsung interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Object-Oriented Programming, Operating Systems, Competitive Programming, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Samsung Interview FAQs

How many rounds are there in Samsung Software Developer Intern interview?
Samsung interview process usually has 2 rounds. The most common rounds in the Samsung interview process are Coding Test and Technical.
What are the top questions asked in Samsung Software Developer Intern interview?

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

  1. Binary search on rotated ar...read more
  2. ACID in dbms was as...read more

Tell us how to improve this page.

Samsung Software Developer Intern Interview Process

based on 1 interview

2 Interview rounds

  • Coding Test Round - 1
  • Coding Test Round - 2
View more
Samsung Software Developer Intern Salary
based on 9 salaries
₹3.7 L/yr - ₹15 L/yr
37% more than the average Software Developer Intern Salary in India
View more details

Samsung Software Developer Intern Reviews and Ratings

based on 3 reviews

4.6/5

Rating in categories

4.2

Skill development

4.9

Work-life balance

4.5

Salary

4.7

Job security

4.6

Company culture

4.4

Promotions

4.4

Work satisfaction

Explore 3 Reviews and Ratings
Assistant Manager
1.1k salaries
unlock blur

₹5.5 L/yr - ₹19.8 L/yr

Sales Executive
1.1k salaries
unlock blur

₹1 L/yr - ₹6.5 L/yr

Software Engineer
880 salaries
unlock blur

₹6.2 L/yr - ₹25 L/yr

Manager
529 salaries
unlock blur

₹10 L/yr - ₹33.5 L/yr

Senior Engineer
474 salaries
unlock blur

₹4.3 L/yr - ₹18 L/yr

Explore more salaries
Compare Samsung with

Apple

4.3
Compare

Vivo

4.1
Compare

OPPO

4.0
Compare

Dell

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