Samsung Interview Experience for SDE

Samsung(Chennai) takes interviews for SDE Fresher SEA Ecom Team.

Round 1(1.5 hrs): Merge sort code

Puzzle:

• Of 6 look alike balls, 3 are heavy and the other three are light. How many weighings on a beam balance are necessary to identify the heavy balls?
• SQL: vehicle(id,name,reg_no,service_no), customer(id,vehicle_id), service_status(vehicle_id, is_serviced,due_date). Some query combining the three tables
• Arrays vs Linked list – pros and cons
• Name some Http methods
• Post vs Put – difference & use case

Round 2(1.5hrs):

• Count number of contiguous lesser elements to the left for each element in the given array. (Brute force, optimized).

  Eg:

  for {4,2,7,5,1,6}, 
  output: {0,0,2,0,0,2}

• Line graph pattern print for given array.

  Eg:

  For {4,2,3,1,5}

  Output:

                  |
  
  |                |
  
  |        |       |
  
  |    |   |       |
  
  |    |   |   |   |
  
  4  2  3  1  5

  (Modify to work for 2 digit numbers as well without making any mess)

• Favorite theory subject?
• Indexing
• Foreign key
• Deadlock
• Normalization,use? NF- 1,2,3
• SQL: student(id,name,marks,dep_id), department(id,name) – Write query to print for each department,the name of the department along with the student name(s) who got first mark in that department

Round 3(50mins)

• Explain your FYP. Contribution and implementation details.
• Reverse word by word in a string sentence without any predefined functions. Eg: this is a string, Output: siht si a gnirts
• Count inversions in an array (optimize n^2 to nlogn). Eg: {1,3,6,25,10,24,8,30,32,41,45}. Output: 5
• Hint for optimization: merge sort
• Vertical order traversal of Binary tree