Skip to content
Related Articles

Related Articles

Improve Article

Samsung R&D Institute Interview Experience

  • Last Updated : 31 Oct, 2019

There were 3 rounds in total.

  1. Online coding round
  2. Technical round
  3. HR

Round 1 Online Coding round:
This was a 3 hours coding round in which we had to code 1 problem having 50 test cases. Only those students were selected for the next round who passed all the test cases.
Note: You can compile your code as many numbers of times as you want, but a maximum of 5 submissions were allowed to test on the given test cases.

Here is the question:

  • Mr. X has to deliver software to N customers. From the office, he is going to visit all the customers and then return to his office. Each location of the office and the customers is given in the form of integer coordinates (x, y) (-1<x<500, -1<y<500). The distance between two arbitrary locations (x1, y1) and (x2, y2) is computed by |x1-x2| + |y1-y2|, where |x| denotes the absolute value of x; for instance, |3|=|-3|=3. The locations of the office and the customers are all distinct. You should plan an optimal way to visit all the N customers and return to his office.

    You are given the locations of the office and the customers; the number of customers is in the range of 1 to 9. Write a program that, starting at the office, finds a (the) shortest path visiting all the customers and returning to his office. Your program only has to report the distance of a (the) shortest path.



    Constraints:
    1<N<9. Each location (x, y) is in a bounded grid, -1<x<500, -1<y<500, and x, y are integers.

    Input:
    You are given 50 test cases. Each test case consists of two lines; the first line has N, the number of the customers and the following line enumerates the locations of the office and the customers in sequence. Each location consists of the coordinates (x, y), which is represented by ‘x y’.

    Output:
    Output the 50 answers in 50 lines. Each line outputs the distance of a (the) shortest path. Each line looks like ‘#x answer’ where x is the index of a test case. ‘#x’ and ‘answer’ are separated by a space.

    Example:
    Input (100 lines in total). In the first test case, the locations of the office are (0, 0) and the locations of the customers are (70, 40), (30, 10), (10, 5), (90, 70), (50, 20).

    5 (Starting test case #1)
    0 0 70 40 30 10 10 5 90 70 50 20

    Output (50 lines in total)
    #1 320

    HINT: DFS, Backtracking

    Round 2 Technical Interview Round: The interviewer saw my resume.

    1. Write a function to swap two numbers
    2. Swap two numbers without using an extra variable
    3. Write merge sort function
    4. What is the Topological sort? How to implement it?
    5. Given an array of positive integers. How to answer range sum queries?
    6. What’s the time complexity of the Segment Tree?
    7. What is MVC? Draw its diagram.
    8. What is the design pattern?
    9. What is backtracking?
    10. Tell about the android life cycle.
    11. What is OpenCV?
    12. Discussion on my projects.

    Round 3 HR Interview:

    1. What are your areas of interest?
    2. Why Samsung?
    3. What is your expected salary?

    Overall, It was a nice experience 🙂

    Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, AmazonGoogle and Microsoft Test Serieses.

    My Personal Notes arrow_drop_up
  • Recommended Articles
    Page :