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. Longest Increasing Subsequence Problem Statement Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is grea ...read more
  • Q3. Move All Negative Numbers To Beginning Rearrange a given array 'ARR' with 'N' integers so that all negative numbers appear before all positive numbers. Follow Up: Can yo ...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 was interviewed 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. Game Theory
    • It is clear that if the number of stones is ‘1’ then ‘Ale’ wins the game. If ‘2’ then also ‘Ale’ wins the match, and if ‘3’ then ‘Bob’ wins the game.
    • So we can observe that, if anyone has a chance to choose a stone from ‘3’ number of stones then another opponent will the game. If ‘Ale’ choosing the stones from ‘3’ number stone then ‘Bob’ will win and vice versa.
    • If the number of stones is ‘4’ then ‘Ale’ will w...
  • Answered Anonymously
  • 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. Sorting

    A simple solution would be to store all the node values to the list/array by traversing the whole Binary Tree and the problem now is that given a list of non-negative integers, arrange them such that they form the largest number. To solve this problem, sort the array in descending order, but sorting the list/array does not work here.

     

    The idea is to use any of the comparison-based sorting algorithms.

     

    1. We...
  • Answered Anonymously
  • 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. Brute Force

    The brute force approach to find all the bridges in a given graph is to check for every edge if it is a bridge or not, by first not considering current edge is not in given graph and then checking if the vertices that it was connecting are still connected or not, using DFS(DepthFirst Search). Given below is an algorithm that will find all bridges in a graph.

     

    Algorithm :

    1. Initialise a visited array with fa...
  • Answered Anonymously
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. Brute Force Approach

    The main idea is to do the sum of digits until it becomes less than 10.

     

    Algorithm:

    • Add a condition if N is less than 10 then return N.
    • Do the sum of all digits.
    • Make a recursive call and pass the sum of digits as N.
    • Return the answer which you get from a recursive call.
    Space Complexity: O(1)Explanation:

    O(1).

     

    We are using constant space to solve this.

    Time Complexity: OtherExplanation:

    O(log10(...

  • Answered Anonymously
  • 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. Brute Force - Recursive
    • Write a recursive solution for adding the sum of the squares of the first ‘N’ natural numbers.
    • The base case would be the sum of the first natural number, which is 1.
    • Sum up the squares of each number from 1 to ‘N’.
    • Finally, return this sum.
    Space Complexity: O(1)Explanation:

    O(N), where ‘N’ is the given number.

    Considering the recursive stack space.

    Time Complexity: O(1)Explanation:

    O(N), where ‘N’ is...

  • Answered Anonymously
  • 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. Recursive Solution - 1
    • If the left subtree exists, recursively convert the left subtree to Doubly Linked List.
    • If the right subtree exists, recursively convert the right subtree to Doubly Linked List.
    • When in the left subtree, find the inorder predecessor of the root, make this as the previous of the root and its next as the root.
    • Similarly, when in the right subtree, find the inorder successor of the root, make this as th...
  • Answered Anonymously

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 CommVault
Q2. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q3. Find K Closest Elements Given a sorted array 'A' of length 'N', a ... read more
asked in Groww
Q4. Minimum and Maximum Candy Cost Problem Ram is in Ninjaland, visit ... read more
Q5. Nth Element Of Modified Fibonacci Series Given two integers X and ... read more

I was interviewed 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. Brute Force
    • The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
    • We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
    • Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...
  • Answered Anonymously
  • 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. Using Stack
    • Using stack, we can perform the reverse inorder traversal on the BST iteratively.
    • Firstly, initialize the temporary variable ‘node’ with the root node, and maintain a variable ‘sum’ with an initial value of 0.
    • Loop through until the stack is empty or the node becomes null.
    • Now iteratively traverse to the rightmost node of the tree and while traversing push each node onto the stack.
    • Now pop an element from the st...
  • Answered Anonymously
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 was interviewed 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...
  • 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...

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

 (39)

 Embedded Software Developer

 (1)

 Frontend Developer Intern

 (1)

 SDE Intern

 (1)

 Intern

 (9)

 Developer

 (1)

 Software Engineer

 (53)

 Summer Intern

 (2)

I was interviewed 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...

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

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

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

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

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

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

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

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

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

  • Q6. What can you tell me about virtual memory and cache implementation?
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...
  • 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...

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

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

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 was interviewed 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. Approach 1
    • This method ensures that every new element entered in the queue ‘q1’ is always at the front.
    • Hence, during pop operation, we just dequeue from ‘q1’.
    • For this, we need another queue ‘q2., which is used to keep every new element to the front of ‘q1’.
    • During push operation :
      • Enqueue new element ‘x’ to queue ‘q2’.
      • One by one, dequeue everything from ‘q1’ and enqueue to ‘q2’.
      • Swap the names of ‘q1’ and ‘q2’.
    • During pop o...
  • Answered Anonymously
  • 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. 

    I provided both recursive and iterative solution

     

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

    Was not able to provide the optimized solution using stack. The interviewer gave hints but I was not able to provide optimized solution.

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

    He only asked for explanation that how would I implement Tries.

     

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

    I was able to provide the optimized solution which requires O(1) space.

  • Answered Anonymously

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

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

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

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

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

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

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

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

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 10 salaries
₹4 L/yr - ₹17 L/yr
46% 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
Sales Executive
1.1k salaries
unlock blur

₹1 L/yr - ₹6.9 L/yr

Assistant Manager
1.1k salaries
unlock blur

₹5.5 L/yr - ₹19.3 L/yr

Software Engineer
867 salaries
unlock blur

₹6.6 L/yr - ₹25 L/yr

Manager
534 salaries
unlock blur

₹10 L/yr - ₹33 L/yr

Senior Engineer
478 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