Samsung Interview Questions, Process, and Tips

Q1. Percentages calculations on cash discount
Ans. 
Calculating cash discount percentages
• To calculate cash discount percentage, divide the discount amount by the original price and multiply by 100

• For example, if the original price is $100 and the cash discount is $10, the discount percentage would be (10/100) x 100 = 10%

• Cash discount percentages can be used to incentivize customers to pay early or in cash

• It is important to clearly communicate the terms and conditions of
Answered by AI
Add your answer
Q2. Qualities of a good sales man
Add your answer

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...read more
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
Add your answer
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...read more
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...read more
Answered by AI
Add your answer

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...read more
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...read more
Answered by AI
Add your answer
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.
...read more
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
Add your answer

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.

Am always ready for the test

We have to discuss about the sales of product with the group members