Samsung SDS Software Developer Intern Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Counting Even and Odd Occurrences
You are provided with an array or list of integers named ARR of size N. The task is to determine two things:
1. How many elements appear an odd number of times?
2. How many...read more
Ans. 
Count the number of elements with odd and even occurrences in an array of integers.
• Iterate through the array and use a hashmap to store the count of each element.

• After counting, iterate through the hashmap to determine odd and even occurrences.

• Return the counts of elements with odd and even occurrences.
Answered by AI
Add your answer
Q2. 
Delete Nodes with Greater Values On Right
You are given a singly linked list where each node contains an integer value and a reference to the next node or NULL if it is the last node. The task is to remov...read more
Ans. 
Remove nodes in a singly linked list with a greater value on the right.
• Traverse the linked list and compare each node's value with the values of nodes to its right.

• If a node has a greater value on the right, remove it from the linked list.

• Update the references of the previous node to skip the removed node.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It is from 12 to 1:30 pm. Environment was very friendly and interviewer was very nice.

Q1. 
Nth Term of Geometric Progression Problem
Given the first term A, the common ratio R, and an integer N, your task is to find the Nth term of a geometric progression (GP) series.
Explanation:
The general...read more
Ans. 
Calculate the Nth term of a geometric progression series modulo 10^9 + 7.
• Use the formula A * R^(N-1) to find the Nth term of the GP series.

• Remember to calculate the result modulo 10^9 + 7.

• Handle multiple test cases efficiently to stay within the time limit.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Very friendly environment 

Q1. Project discussion
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order and return the Kth element.

• Handle multiple test cases efficiently.

• Ensure all elements in the array are distinct.
Answered by AI
Add your answer
Q2. Can you draw an E-R Diagram for Uber?
Ans. 
An E-R Diagram for Uber would include entities like User, Driver, Ride, Payment, and Location.
• Entities: User, Driver, Ride, Payment, Location

• Relationships: User requests Ride, Driver provides Ride, Payment for Ride

• Attributes: User ID, Driver ID, Ride ID, Payment ID, Location ID

• Example: User (1) requests Ride (A) from Location (X) to Location (Y) with Driver (Z) providing the Ride and Payment (123) made for the Ride.
Answered by AI
Add your answer
Q3. 
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...read more
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 nodes to the 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 edge cases such as when the tree is empty or has only one node.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Q1. 
Add Two Numbers Represented as Linked Lists
Given two linked lists representing two non-negative integers, where the digits are stored in reverse order (i.e., starting from the least significant digit to ...read more
Ans. 
Add two numbers represented as linked lists and return the sum as a linked list.
• Traverse both linked lists simultaneously while keeping track of carry from previous sum

• Create a new linked list to store the sum digits

• Handle cases where one list is longer than the other by adding remaining digits with carry

• Remember to handle the case where there is a carry after adding all digits
Answered by AI
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.