Samsung Research Interview Questions, Process, and Tips

3 questions medium leetcode

Q1. Dfs write whole pseudo code.
Ans. 
Depth First Search (DFS) pseudo code
• Initialize a stack to keep track of nodes to visit

• Start with the initial node and push it onto the stack

• While the stack is not empty, pop a node from the stack and visit its neighbors

• Push unvisited neighbors onto the stack

• Repeat until all nodes are visited
Answered by AI
Add your answer
Q2. Bfs write whole pseudo code.
Ans. 
BFS (Breadth First Search) algorithm pseudo code
• Start by enqueueing the starting node

• While the queue is not empty, dequeue a node and process it

• Enqueue all adjacent nodes that have not been visited yet

• Repeat until all nodes have been visited
Answered by AI
Add your answer
Q3. Find the middle of the linked list.
Ans. 
To find the middle of a linked list, use the slow and fast pointer technique.
• Initialize two pointers, slow and fast, both pointing to the head of the linked list.

• Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.

• The position of the slow pointer at this point will be the middle of the linked list.
Answered by AI
Add your answer

Q1. Cv grilling some questions on projects.
Add your answer

3 Questions
Easy to medium level
Topics :- Arrays, priority queue, trees, linked Lists, Dp

Q1. 45-50 minutes One medium DSA problem, discussion on projects and Resume
Add your answer
Q2. Kadane's Algorithm and brute force also
Add your answer

Q1. 45 minutes Implementation of Stacks and Queues using Linked Lists, discussion on some concepts of Operating system like multi threading, mutex and locks
Add your answer

Q1. General behavioural questions like strengths, weeknes, how do you handle stressful situations etc.
Add your answer

Q1. What do you explain this job
Add your answer
Q2. How much explain your salary
Add your answer
Q3. What can you help this job
Add your answer
Q4. Why do you want this job
Add your answer
Q5. What are you expedition this job
Add your answer
Q6. How did you impressing disorder in your future
Add your answer
Q7. What is your resume joining this job
Add your answer

3 hours test
1 DSA question to solve

Q1. Given binary tree is binary search or not
Ans. 
A binary tree is considered a binary search tree if the left subtree of a node contains only nodes with keys less than the node's key and the right subtree contains only nodes with keys greater than the node's key.
• Check if the left child of a node is less than the node's key and the right child is greater than the node's key

• Recursively check all nodes in the tree to ensure they follow the binary search tree property

• Ino...read more
Answered by AI
Add your answer
Q2. Monkey and steps dp question
Add your answer

Coding round with medium complexity

Q1. Implementation of linkedlist
Ans. 
A linked list is a data structure where each element points to the next element in the sequence.
• Create a Node class with data and a reference to the next Node

• Initialize a LinkedList class with a head Node

• Implement methods to add, remove, search, and traverse the linked list
Answered by AI
Add your answer
Q2. Sorting algoritgms
Add your answer

Q1. General expectations
Add your answer
Q2. Role clarity discussion
Add your answer

Coding test had medium-hard leetcode questions

Q1. Mostly resume based questions were asked. Since they were research based, I got shortlisted in first round itself
Add your answer
Q2. Resumebased reinforcement learning
Add your answer