Samsung R&D Delhi

1. 1

   Coding test

   Single-problem coding test
   180 min1 questionshardeliminatory

   Section	Qs	Min	Topics
   Coding	1	180	recursion and backtracking, graphs, dynamic programming, grid DP with a one-time power-up

   recursion · backtracking · graphs · DP

   No MCQs or aptitude. Only candidates passing all test cases were shortlisted for interviews. Problems follow a public Samsung practice problem set.

2. 2

   Technical interview

   45 minoffline

   OA problem recall · XOR tricks · missing number · BFS vs DFS · binary search preconditions · stock profit with single and multiple trades · OOP pillars · vtable · abstract classes · inheritance · project · shortest path with limited special edges

   Duration 30 min (one account) to 1 h (the other); mode offline in one account, unstated in the other. Pseudocode requested for most questions.

3. 3

   HR interview

   35 min

   introduction · family background · strengths and weaknesses · incomplete project handover · why hire you · hobbies · teamwork · company knowledge · explain work non-technically

   Length about 30-40 min. Mostly non-technical.

Advice from candidates

29 pieces of advice, in their own words. Names removed.

• A day before the coding round, they will ask you to install it, so make sure to install it well before the time.

  test · 2024-25

• Try to solve the medium and the hard questions it will come handy during the OA.

  test · 2024-25

• I followed Strivers SDE sheet as it covers a lot of patterns and a variety of questions.

  preparation · 2024-25

• To practice you can give leetcode and codeforces contest.

  preparation · 2024-25

Loading the other 25…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

• Codinggrid BFS with restricted turning direction, minimise direction changes
• Codingmulti-state DP, hard level
• Codingshortest path in grid with collection constraint
• Technicaltwo-agent grid shortest time with mutual proximity constraint
• Technicalbinary search on huge index range to find a changed interval
• Technicalgreedy problem, explain then implement
• Codinggrid traversal upward with score changes and a single area-clearing item
• Codingimplementation-heavy recursion, graph or DP
• Technicalexplain your OA solution again
• Technicalfind the unique element where others repeat
• Technicalmax profit from stock prices, multiple and single transactions
• Technicalshortest path crossing special edges at most three times
• Codingdecide two-colourability of a graph and output one colour class
• Technicalpseudocode for Dijkstra then third-shortest-path variant
• Technicalminimum turns on a number line with teleport cells
• Technicalplace queens: brute force then optimise