Samsung Internship Interview Experience (On-Campus for SRI, Bengaluru)

First Round: Online Coding Round

It was quite simple. I got three coding questions. hosted by cocubes.com

1) An array contains both positive and negative numbers in random order. Rearrange the array elements so that all negative numbers appear       before all positive numbers. https://www.geeksforgeeks.org/move-negative-numbers-beginning-positive-end-constant-extra-space/

2) Given a Binary Tree where each node has positive and negative values. Convert this to a tree where each node contains the sum of the left and right sub trees in the original tree. The values of leaf nodes are changed to 0.https://www.geeksforgeeks.org/convert-a-given-tree-to-sum-tree/

3) Given a binary tree. Find its maximum depth – minimum depth.

15 members selected from this round.



Interview Round: Technical  Round – 1

He asked about the projects I mentioned in resume.

He asked some easy questions like reversal of linked list without extra space etc.. Also the following questions

1) Given an array in which all numbers except two are repeated once. (i.e. we have 2n+2 numbers and n numbers are occurring twice and remaining two have occurred once). Find those two numbers in the most efficient way. https://www.geeksforgeeks.org/find-two-non-repeating-elements-in-an-array-of-repeating-elements/

2)Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter. https://www.geeksforgeeks.org/coin-change-dp-7/

Technical Round – 2

It lasted like 50 mins. The interviewer is super-friendly. She asked me to tell about myself first. She asked questions regarding all the skills I mentioned in the resume like DSA, machine learning( basics), OOPS, DBMS and some math. Just simple revision of OOPS concepts and DBMS helps you to clear this round. She asked me to write few mysql queries. Regarding Data structures, She asked about the standard graph algorithms with their time complexities and a question about string-search( KMP)   

That’s it. There was no HR round. 

Finally,  6 students were selected for SRIB internship and fortunately, I was one among them 🙂


Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.