Samsung Research Interview Questions, Process, and Tips

Usual one of the samsung sw advanced quenstions

Q1. Easy string reversal coding then questions about OOP
Add your answer
Q2. Memory taken by pointers and stuff
Ans. 
Pointers in programming languages store memory addresses of variables or objects.
• Pointers take up memory to store the memory address they point to

• Pointers can be used to access and manipulate data indirectly

• Example: int* ptr = # // ptr stores the memory address of num
Answered by AI
Add your answer

Q1. How will you approach a problem?
Ans. 
I will approach a problem by breaking it down into smaller parts and analyzing each part individually.
• Identify the problem and its scope

• Gather all relevant information and data

• Break down the problem into smaller parts

• Analyze each part individually

• Develop a plan of action

• Implement the plan and monitor progress

• Make adjustments as necessary
Answered by AI
Add your answer
Q2. What you didn't which others did not do?
Add your answer

There was a coding round on cocubes. Followed by SWC exam of 3 hours containing question related to bfs,dfs dp

Q1. Median of running streams
Ans. 
The median of running streams is the middle value when all values are arranged in ascending order.
• To find the median of running streams, first arrange all the values in ascending order.

• If the number of values is odd, the median is the middle value.

• If the number of values is even, the median is the average of the two middle values.

• For example, if the running stream values are 5, 8, 12, 15, 20, the median is 12.

• If the ru...read more
Answered by AI
Add your answer
Q2. Find no of islands
Ans. 
To find the number of islands, we can use depth-first search (DFS) or breadth-first search (BFS) algorithms.
• Use DFS or BFS to traverse the grid and mark visited islands

• Count the number of times DFS or BFS is called to find the number of islands

• Consider diagonal connections if applicable

• Example: [['1', '1', '0', '0', '0'], ['1', '1', '0', '0', '0'], ['0', '0', '1', '0', '0'], ['0', '0', '0', '1', '1']]
Answered by AI
Add your answer

Q1. Questions related to project
Add your answer

It was 1 coding question with 10 test cases. They asked a question based on binary search. I got 3 hrs to clear that test. I went in as a campus fresher. For lateral joinees, it is a much more difficult question that you have to clear in 4hrs.

Q1. What's the best way to find majority element in an array?
Ans. 
The best way to find the majority element in an array is by using the Boyer-Moore Voting Algorithm.
• Initialize a candidate variable and a count variable.

• Iterate through the array and for each element:

• - If the count is 0, set the current element as the candidate.

• - If the current element is the same as the candidate, increment the count.

• - Otherwise, decrement the count.

• After the iteration, the candidate will be the ...read more
Answered by AI
Add your answer
Q2. Reverse a linked list in K groups.
Ans. 
Reverse a linked list in K groups
• Iterate through the linked list in groups of size K

• Reverse each group of nodes using a temporary pointer

• Connect the reversed groups to form the final reversed linked list
Answered by AI
Add your answer