Samsung R&D Institute interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Samsung R&D Institute
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Journey
Samsung Research is the advanced R&D hub of Samsung’s Device Experience (DX) Division, preparing for the future of Samsung Electronics. The company visited our college for the Software Engineer profile. It conducted three rounds: a Coding Test, a Technical Interview, and an HR Interview. Around 300 students participated in the drive, and 4 students were selected.
Application story
It was an on-campus drive. The company came to our college for the profile of Software Engineer. It conducted three rounds, Coding Test, Technical Interview and HR Interview. Around 300 students participated in the drive, out of which 4 students got selected.
Why selected/rejected for the role?
I was rejected for this role after the Technical Test as the questions in the test were extremely hard level, which I was not able to answer. Thus, I got rejected for this role.
Preparation
Duration: 4 months
Topics: Java, Data Structures, Database, Operating System, Coding Questions
Tip
Tip

Tip 1 : Practice advance level coding questions.
Tip 2 : Prepare at least one programming language in detail.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Mention strong projects in resume.
Tip 2 : Write some certifications, if any in resume.

Interview rounds

01
Round
Hard
Online Coding Test
Duration180 minutes
Interview date20 Jul 2022
Coding problem2

The test was conducted on the Samsung own platform. It was three hours long test, which had four complex level coding questions.

1. Merge Sort Linked List

Moderate
10m average time
90% success
0/80
Asked in companies
AdobeSamsung R&D InstituteHCL Technologies

You are given a Singly Linked List of integers. Sort the Linked List using merge sort.

Merge Sort is a Divide and Conquer algorithm. It divides the input into two halves, calls itself for the two halves, and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, L, M, R) is a key process that assumes that arr[L..M] and arr[M + 1...R] are sorted and merges the two sorted subarrays into one.

Problem approach

Step 1 : Create a min-heap and push the first node from each linked list onto the heap.
Step 2 : Initialize a dummy node and a current pointer to it. This dummy node will serve as the starting point of the merged linked list.
Step 3 : While the heap is not empty, pop the smallest node from the heap, add it to the merged linked list, and move the current pointer forward.
Step 4 : If the popped node has a next node, push the next node onto the heap.
Step 5 : Continue this process until all nodes are merged into the final linked list.

Try solving now

2. Wildcard Pattern Matching

Hard
50m average time
30% success
0/120
Asked in companies
SalesforceFreshworksWalmart

Given a text and a wildcard pattern of size N and M respectively, implement a wildcard pattern matching algorithm that finds if the wildcard pattern is matched with the text. The matching should cover the entire text not partial text.

The wildcard pattern can include the characters ‘?’ and ‘*’

 ‘?’ – matches any single character 
 ‘*’ – Matches any sequence of characters(sequence can be of length 0 or more)
Problem approach

Step 1 : Initialize two pointers: s_ptr = 0, p_ptr = 0. Initialize two variables: s_star = -1, p_star = -1
Step 2 : Loop while s_ptr < length of s:
a) If p_ptr is within bounds and (s[s_ptr] == p[p_ptr] or p[p_ptr] == '?'), increment both s_ptr and p_ptr
b) Else if p_ptr is within bounds and p[p_ptr] == '*', store the current positions of s_ptr and p_ptr in s_star and p_star
Increment p_ptr
c) Else if p_star is not -1:
Increment s_star by 1
Update s_ptr to s_star
Update p_ptr to p_star
d) Else:
Return False
Step 3 : While p_ptr is within bounds and p[p_ptr] == '*', increment p_ptr
Step 4 : Return True if p_ptr has reached the end of p, else False

Try solving now
02
Round
Hard
Video Call
Duration60 minutes
Interview date28 Jul 2022
Coding problem4

This round was 1 hour long based on data structures, operating system and database. There were 2 interviewers who were expert in their domains and asked questions about that.

1. OS Questions

What do you mean by Realtime Operating System? (Learn)

What is thread in operating system? (Learn)

What is kernel? What are the functions of it? (Learn)

Problem approach

Tip 1: Study realtime operating system in detail
Tip 2: Answer confidently

2. Theory Questions

What is the difference between heap and stack memory in Java? (Learn)

What is the difference between final, finally and finalize keywords? (Learn)

What is the difference between shallow and deep copy? (Learn)

Problem approach

Tip 1 : Study heap and stack in detail
Tip 2 : Hear the question carefully

3. Diamond of numbers

Moderate
15m average time
80% success
0/80
Asked in company
Samsung R&D Institute

Students at Ninja School were bored with their daily routine and wanted to try something new. So, they thought about observing patterns. While observing the patterns, they found a very interesting pattern which they wished to explore. Your task is to help the students to visualize the pattern for any given ‘N’.

Given an integer ‘N’ you need to return the corresponding pattern for it.

For example, pattern for N = 15 will be :
          1 
         123 
        12345 
       1234567 
      123456789 
     12345678912 
    1234567891234 
   123456789123456 
    1234567891234 
     12345678912 
      123456789 
       1234567 
        12345 
         123 
          1 
Problem approach

Step 1 : Create an interface I
Step 2 : Create a class A extending interface I.
Step 3 : Create a class B extending interface I.
Step 4 : Create a class C extending class A and B as follows:

class C extends A, B { 
public void bar() {
super.foo();
}
}

Try solving now

4. DBMS

What is data integrity in SQL? (Learn)

What is the difference between delete, truncate and drop commands in SQL? (Learn)

Problem approach

Tip 1 : Study SQL and DBMS in detail
Tip 2 : Answer confidently

03
Round
Easy
HR Round
Duration20 minutes
Interview date10 Aug 2022
Coding problem1

This was an HR interview on 20 minutes. It had the basic HR questions.

1. Basic HR Questions

Give your introduction in brief?

Explain the project which you worked in a team?

What do you know about this company? Why do you want to join it?

What do you think is better - being perfect and delivering late or being good and delivering on time?

Do you have any other offers in hand?

Problem approach

Tip 1 : Prepare your 2-3 minutes introduction.
Tip 2 : Answer confidently.

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
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Samsung R&D Institute
0 views
0 comments
0 upvotes
company logo
Software Engineer
5 rounds | 8 problems
Interviewed by Samsung R&D Institute
1224 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Samsung R&D Institute
1092 views
0 comments
0 upvotes
company logo
Software Engineer
4 rounds | 5 problems
Interviewed by Samsung R&D Institute
1175 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7977 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
10148 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4448 views
1 comments
0 upvotes