Samsung Full Stack Developer Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

It was a 65 minute , 2 coding questions round .
The environment was good , 
The exam was at 12 noon

Q1. 
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...read more
Ans. 
Find the Lowest Common Ancestor of two nodes in a binary tree.
• Traverse the binary tree to find the paths from the root to nodes X and Y.

• Compare the paths to find the last common node, which is the Lowest Common Ancestor.

• Implement a recursive function to find the LCA efficiently.

• Handle edge cases such as when X or Y is the root node or when X or Y is not present in the tree.
Answered by AI
Add your answer
Q2. 
Topological Sort Problem Statement
Given a Directed Acyclic Graph (DAG) consisting of V vertices and E edges, your task is to find any topological sorting of this DAG. You need to return an array of size ...read more
Ans. 
Topological sort of a Directed Acyclic Graph (DAG) is finding an ordering of vertices where for every directed edge u -> v, u comes before v.
• Use Depth First Search (DFS) to find the topological ordering of vertices in a DAG.

• Start by visiting a vertex and recursively visit its neighbors, adding the vertex to the result after visiting all neighbors.

• Maintain a visited array to keep track of visited vertices and a stack...read more
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

The round was based more upon the OS , DBMS , Networking and Computer Architecture and web based.
Is the tag and tag same? Define Image Map?

Q1. Can you write code for a singleton class?
Ans. 
Yes, a singleton class is a class that can only have one instance created.
• Ensure the constructor is private to prevent external instantiation.

• Provide a static method to access the single instance.

• Use a static variable to hold the single instance.

• Example: class Singleton { private static Singleton instance = new Singleton(); private Singleton(){} public static Singleton getInstance() { return instance; }}
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

The round included topics of DSA , OS , OOPS , CN and dbms and a lot about my internship experience.
What are the different data types present in javascript? What are some common clauses used with SELECT query in SQL? What is Cursor? How to use a Cursor?

Q1. 
Build Max Heap Problem Statement
Given an integer array with N elements, the task is to transform this array into a max binary heap structure.
Explanation:
A max-heap is a complete binary tree where eac...read more
Ans. 
The task is to transform an integer array into a max binary heap structure.
• Create a max heap from the given array by rearranging elements

• Ensure each internal node has a value greater than or equal to its children

• Check if the transformed array represents a max-heap and output 1 if true, 0 if false
Answered by AI
Add your answer

Round duration - 180 Minutes
Round difficulty - Medium

It is a coding round that contains only 1 coding problem, and the timing for this test is 10 A.M. to 1 A.M. The test is on full-screen mode. You can choose Java or Cpp as a language to code the particular problem. The problem contains 50 test cases and you have only 10 chances to submit your code. The interviewer was very friendly.

Q1. 
Minimum Time in Wormhole Network
Determine the minimum time required to travel from a starting point to a destination point in a two-dimensional coordinate system, considering both direct movement and the...read more
Ans. 
Calculate minimum time to travel from source to destination using direct movement and wormholes.
• Calculate the time to move directly from source to destination using |dx - sx| + |dy - sy| formula.

• Check if using any wormhole reduces the total travel time.

• Consider all possible combinations of direct movement and wormhole usage to find the minimum time.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

In this round lot of questions from the topics core java, java backend, react, and node js. The timing of this round is 10 A.M. to 11:30 A.M. The interviewer was very friendly.