Samsung Research Intern 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

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