Samsung Software Developer Interview Questions, Process, and Tips for Experienced

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

It was Aon platform where you cannot use C++ STL. questions were on trees dp

Q1. Interview started with my intro and then interviewer asked to check whether linked list is a palindrome or not. and then asked to write bfs code and then some questions on strings and bit manipulation
Add your answer

Round duration - 180 minutes
Round difficulty - Easy

1) 1 coding question need to be solved in 3 hours.there will be 50 test cases, need to pass all the test cases to go to the next rounds.STL in c++ cannot be used, we need to code anything we use from scratch

2) Coding questions will mainly be based on dynamic programming, graphs and backtracking, so prepare those topics well.

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions ('U', 'D', 'L', 'R') from each cell.

• Return the list of valid paths sorted in alphabetical order.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The technical interview 1 has some questions based on basics of oops, Os and one/two coding questions.
Students who clear this round have to go for another technical round

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

• Use three pointers - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.

• Update the head of the reversed linked list as the last node encountered during reversal.
Answered by AI
Add your answer
Q2. 
Delete a Given Node from Doubly Linked List
Ninja is learning about doubly linked lists and wants to remove a specified element from the list. Can you assist Ninja in doing this and returning the modified...read more
Ans. 
Remove a specified element from a doubly linked list and return the modified list.
• Traverse the doubly linked list to find the specified element to be removed.

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

• Handle edge cases like removing the head or tail of the linked list.

• Return the modified linked list after removing the specified element.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interview again began with my resume but it was very exhaustive. While my friends were asked about both resume and DSA concepts, my interview focused entirely on my resume. I had done a project on distributed computing and the interviewer asked me an application question on multi-threading and synchronisation. It was quite difficult because I was trying to explain my approach and I couldn’t make out if the interviewer was happy with my approach or not. Then he asked to design a contact database without the actual use of DBMS in java. Again I tried to explain my approach but it was tough. The interview ended after asing one or more coding questions.

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...read more
Ans. 
Implement a function to return the spiral order traversal of a binary tree.
• Traverse the binary tree level by level, alternating between left to right and right to left.

• Use a queue to keep track of nodes at each level.

• Append nodes to the result list in the order they are visited.

• Handle null nodes appropriately to maintain the spiral order.

• Example: For input 1 2 3 -1 -1 4 5, the output should be 1 3 2 4 5.
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
• Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.

• Maintain two pointers, one moving at twice the speed of the other, if they meet at any point, there is a cycle.

• Check if the next pointer of any node points to a previously visited node to detect a cycle.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was about 30 minutes long interview. First, she asked introduction, after that she was very interested in my internship that I did in summer and about my interests. She asked few common questions on that.


 

Round duration - 180 Minutes
Round difficulty - Medium

Round was held in the morning at 10 am.

Q1. 
M - Coloring Problem Statement
Given an undirected graph with 'N' nodes in the form of an adjacency matrix and an integer 'M', determine if it is possible to color the vertices of the graph using at most ...read more
Ans. 
The problem involves determining if a given graph can be colored with at most 'M' colors without adjacent vertices sharing the same color.
• Create a function that takes the adjacency matrix, number of nodes 'N', and maximum number of colors 'M' as input.

• Implement a graph coloring algorithm such as backtracking or greedy coloring to check if the graph can be colored with at most 'M' colors.

• Check if adjacent vertices have ...read more
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

The round was held in the evening

Q1. 
Trie Data Structure Implementation
Design and implement a Trie (prefix tree) to perform the following operations:
• insert(word): Add a string "word" to the Trie.
• search(word): Verify if the string "w...read more
Ans. 
Implement a Trie data structure to insert, search, and check for prefixes in strings.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert, search, and startsWith methods in the Trie class.

• Use a Trie to efficiently store and search for strings based on prefixes.

• Example: insert 'apple', search 'apple' returns true, startsWith 'app' returns true, search 'app' returns false.
Answered by AI
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Was held in the morning around 9 am