Skip to content
dronacharya.ai

Samsung R&D

InternshipSoftware

Built from 2 candidate reports with 9 first-hand accounts, covering 2024-25, 2023.

Hiring process

Roles: R&D Intern, SWE Intern
  1. 1

    Coding test

    Paper-based single hard coding problem
    60 min1 questionsofflinehard

    stack simulation · sorting by position · collision handling

    Two other R&D accounts refer back to this account for the test.

  2. 2

    Technical interview

    Offline technical interviews, one or two rounds
    75 minofflinehard

    binary search on answer · running median with two heaps · prefix sums · stack from queues · dynamic programming · Tower of Hanoi · string deletion minimisation · Verilog project

    Solutions are explained verbally with pseudocode on paper. Length varies: one account 20-25 min total, others 1 to 1h15 across two rounds (about 40-50 then 20-25). Candidates may also be asked to explain or improve their test solution.

Advice from candidates

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

  • Striver SDE sheet is a good resource for interview rounds.

    preparation · 2023

  • Do give contests on Leetcode or Codeforces, as it will help you in the coding round.

    preparation · 2023

  • Solve the POTD on Leetcode or GFG, even if you are unable to solve it optimally, try to code the suboptimal one(can be brute force) it will help you in strengthening your implementation part.

    preparation · 2023

  • Do take a look at the concepts of OOPs as it comes in handy.

    preparation · 2023

Loading the other 25…

Question patterns reported

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

  • Technicalencrypt string so only receiver decrypts
  • Technicalpower-of-two check in constant time
  • Technicalcycle in directed graph
  • Technicaldesign lookup of present numbers via trie or hashing
  • Technicalundo operations on string via stack
  • Technicalmembership API over word database
  • Technicaltop-10 from stream, then with updates
  • TechnicalLCA of two tree nodes
  • Codingsimulate moving objects colliding along a line, report survivors
  • Codingtransition probabilities between graph nodes, answer queries for node pairs
  • Technicalminimise largest partition sum, binary search on answer
  • Technicalmedian of a growing data stream
  • Technicalfewest deletions to make a two-letter string sorted
  • Technicalburst balloons style interval DP
  • Technicaldivide using an API that returns floor quotient, to ten decimals
  • Technicalscheduling maximum meetings in one room
  • Technicalmiddle of a linked list with slow and fast pointers
  • Technicalproduct of all others in an array without division
  • Technicalcount requests in last ten minutes with constant-time updates