Samsung interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Samsung
2 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Journey
My journey started when my friends told me to participate in the hackathons, and we had to do a project using some of the coding languages, leading me to think and learn.
Application story
I received that opportunity off-campus. I had been rejected after a technical interview. The technical interviewer asked dynamic programming-related questions in the coding round, which were medium-hard.
Why selected/rejected for the role?
The Technical Interviewer asked Dynamic Programming questions, but I needed help solving those questions.
Preparation
Duration: 2 Months
Topics: Data Structures & Algorithms, Operating System, Object-Oriented Programming System, DBMS, CN
Tip 1: Prepare DSA well, and I recommend Coding Ninjas for interview preparation.
Tip 2: Be confident and relaxed during the interview.
Tip 3: Revise your projects, including how they work and their functionalities.
Application process
Where: Linkedin
Eligibility: 7 CGPA
Tip 1: Make your resume short; try to keep it to one page only and mention all the skills in which you are confident.
Tip 2: Do not include false information on your resume.
Interview rounds
01
Round
Medium
Online Coding Test
Duration180 Minutes
Interview date25 Jul 2022
Coding problem1
There was only one Coding Question, that was highly proctored and Advanced Level Question.
1. Reverse Edges
Moderate
20m average time
80% success
0/80
Asked in companies
You are given a directed graph of ‘N’ nodes and ‘M’ edges. Also, you have two nodes ‘A’ and ‘B’. Your task is to make at least one valid path from ‘A’ to ‘B’ by doing the below operations a minimum number of times.
Choose two nodes ‘X’ and ‘Y’, such that there exists an edge from ‘X’ to ‘Y’.
Delete edge ‘X’ to ‘Y’.
Add edge ‘Y’ to ‘X’.
You need to print the minimum operations that you have done.
02
Round
Medium
Video Call
Duration50 Minutes
Interview date4 Aug 2022
Coding problem1
Technical Interviewer asked Dynamic Programming related questions, Project related questions.
1. Longest Increasing Subsequence
Moderate
30m average time
65% success
0/80
Asked in companies
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.
Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.
For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 4 problems
Interviewed by Samsung
Selected 
2937 views
0 comments
0 upvotes
Software Engineer
2 rounds | 3 problems
Interviewed by Samsung
Selected 1378 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Samsung
Selected 2173 views
1 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Samsung
Selected 2279 views
1 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7977 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 10148 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4448 views
1 comments
0 upvotes