Skip to main content
OptiResume
Check resume
All company patterns

Online assessment pattern, reported

Samsung R&D Institute India, Online Assessment pattern

Samsung R&D campus coding assessment (single problem, all test cases must pass)

180 min totalDifficulty: hard1 sections

Compiled from public sources, verify before you rely on it. Samsung R&D Institute India revises this test regularly. Source corroboration: Reasonably corroborated. Checked 2 Nov 2026 (OPR-RES-010) against 2025 candidate reports; Samsung publishes nothing and no 2027-batch report was found. Confirm the format with your placement cell.

Test structure

Reported

Coding assessment (one problem)

1 problem (reported by several 2025 candidates) questions
180 (reported) minutes
  • Graphs: BFS, DFS, shortest paths
  • Simulation and implementation
  • Backtracking and dynamic programming
  • Difficulty reports range from an easy DFS question to about Codeforces 1300-1400
  • Languages reported: C, C++, Java (from an older post; Python unconfirmed)

Reported, geeksforgeeks.org, geeksforgeeks.org, glassdoor.co.nz, geeksforgeeks.org, Reasonably corroborated

How the test works

Reported

Samsung publishes no campus test pattern; its India careers page only links to job search. Three 2025 candidate reports agree on the shape: a single problem in 3 hours on Samsung's own proctored platform (you install a proctoring application, and phones and smartwatches are not allowed), where all hidden test cases must pass to be shortlisted. You can run your code freely but submissions are limited (5 in one report). Standard-library restrictions are reported for some Samsung tests but are not confirmed for recent campus drives. Earlier drives (2020-22) used 2 or 3 problems in 70 to 90 minutes. One 2024-25 Noida drive was instead a 50-question MCQ screen in an hour; that is a single report. After the test come technical interviews (graphs, shortest paths, dynamic programming, design-style questions such as an LRU cache, and your project) and an HR round. Campus tests were reported in July to September 2025; no 2027-batch report had been found by 2 Nov 2026.

Reported, geeksforgeeks.org, geeksforgeeks.org, glassdoor.co.nz, geeksforgeeks.org, Reasonably corroborated

How the interviews go

Reported
  1. 1Technical 1
  2. 2Technical 2 (sometimes)
  3. 3HR

DSA depth (graphs, DP), explaining and defending the OA solution, cache design, resume; few core-subject questions at SRI-N 2025.

Based on several candidates' reports, checked 2 Nov 2026. Interviews vary by drive and interviewer.

Reported by, GfG Samsung Noida OA, GfG SRID intern+PPO

What to prep

  • Graph traversal on grids and adjacency lists: BFS, DFS, shortest paths
  • Simulation and backtracking problems where careful implementation matters more than a trick
  • Write and test against your own edge cases: one failed hidden case means rejection, so partial credit does not exist
  • Practise one long problem in 3 hours in C++ or Java with only limited submissions
  • Revise C++ concepts, LRU or LFU cache design and your project for the interviews

Cut-offs and eligibility (indicative)

Reported

The only cutoff reported is that every hidden test case must pass. Reports put that at 50 test cases in one drive and 10 in another. Of about 40 who passed at one NIT campus, about 10 reached interviews and 5 were selected. Samsung sets CGPA cutoffs per campus and publishes none: one Sept 2025 report gives a CGPA above 8.0 and CSE or ECE only at one campus, which is a single report, so do not treat it as a rule.

Reported, geeksforgeeks.org, geeksforgeeks.org, glassdoor.co.nz, geeksforgeeks.org, Reasonably corroborated