Samsung Interview Questions, Process, and Tips

Q1. Explain last project
Ans. 
Developed a mobile app for tracking fitness goals and progress
• Designed and implemented the user interface using React Native

• Integrated with a backend server to store and retrieve user data

• Implemented features such as goal setting, progress tracking, and social sharing

• Conducted extensive testing and bug fixing to ensure app stability
Answered by AI
Add your answer
Q2. I explained project in detail
Add your answer

Q1. Tell me some thing about your self after that my qualifications
Ans. My name is danish hussain i am from kashmir my qualification that time was 10+2
Answered Anonymously
Add your answer
Q2. If i recruit you what is your thought and what you do for sales
Ans. First i do my job properly and b on time in my outlet and achieve product knowledge and improve my motivation skills
Answered Anonymously
Add your answer

Round duration - 180 minutes
Round difficulty - Easy

This was Online Coding round on Samsung Software. There were 50 test cases and all test cases should be passed to get selected.

Round duration - 30 minutes
Round difficulty - Easy

This was also Face to Face coding Interview totally based on Data Structures and Algorithms.

Q1. The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.
Ans. 
The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence with increasing order.
• Use dynamic programming to solve the LIS problem efficiently.

• Maintain an array to store the length of the LIS ending at each element.

• Iterate through the array and update the LIS length based on previous elements.

• Example: For input [10, 22, 9, 33, 21, 50, 41, 60, 80], the LIS is [10
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This Face to Face Interview was Based on coding and projects.

Q1. Implement the Depth First Search (DFS) algorithm for a graph.
Ans. 
DFS is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
• Start at a node and explore as far as possible along each branch before backtracking

• Use a stack to keep track of nodes to visit

• Mark visited nodes to avoid revisiting them

• Recursive implementation is common
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

HR round was mainly based on questions about myself and my knowledge about the company.