Samsung's software OAs vary by team and hiring route. One recent campus account described a timed coding screen before technical interviews. A separate internship account described a coding task plus a logic question. Read your invitation for the current timing, language, and monitoring rules.

When to Expect the OA for Your Role

Applicants for early-career software roles typically receive the assessment after applying and before live technical interviews. One recent candidate for an internship described an assessment involving a breadth-first search with a follow-up and a different puzzle. One account from a software engineer described a single coding problem in a three-hour "supervised" setting. Candidates for mobile, embedded, or experienced-hire software roles may receive a different screen or move directly to an interview.

Does Your Online Assessment Matter?

The OA helps determine who advances. Correctness matters, and hidden tests can expose boundary or complexity problems. Samsung doesn't publish a company-wide passing score. Do not infer a cutoff from one platform score or role-specific experience.

Compiled List of Samsung OA Question Types

Common patterns include arrays, strings, trees, matrices, and dynamic programming.

1. Two Sum - hash-map lookup and duplicate checking.
2. Longest Substring Without Repeating Characters - sliding window with character indices.
3. Maximum Subarray - one-pass dynamic programming.
4. Lowest Common Ancestor of a Binary Tree — tree traversal and ancestor relationship state.
5. Number of Islands - traversing a grid and keeping track of visited positions.
6. Word Search — backtracking on a character grid.
7. Add Two Numbers II - arithmetic and carry propagation with linked lists.
8. Range Sum Query 2D - Immutable - matrix prefix sums.

Samsung Interview Questions

Recently asked in real interviews

These questions were asked recently in real Samsung interviews. Practice these and 4,000+ other questions from 1,000+ companies on Lodely.

Given an array, find the two sum.

algorithmscoding Easy

How would you implement a child-parent relation for finding the Least Common Ancestor (LCA) without using pointers?

algorithms Medium

Find the longest substring without repeating characters.

algorithmscoding Medium

Find the maximum subarray sum.

algorithmscoding Medium

What are your strengths and weaknesses?

behavioral Medium

Explore All Questions

Free to get started

How to Prepare and Pass the Samsung Online Assessment

Week 1: Practice arrays, sliding windows, trees, and grids. Week 2: Complete three timed sessions using the exact input and output format specified in your invitation. For single-problem sessions, leave time to test empty inputs, duplicate values, narrow grids, and maximum constraints. Pair these coding patterns with Samsung-specific technical and behavioral prompts on Lodely.

Samsung Interview Question Breakdown

Number of Islands

Type: Graph traversal on a grid. Prompt: Count the connected land regions in a binary matrix. The Trick: Mark each cell when you visit it. What It Tests: Managing state, handling boundaries, and maintaining linear time complexity.

Longest Substring Without Repeating Characters

Type: Sliding window. Prompt: Find the length of the longest contiguous span of unique characters. The Trick: Move the left boundary past the previous occurrence without scanning backward. What It Tests: The ability to handle index bookkeeping and prove that a bound is tight in one pass.

What Comes After the Online Assessment

Early-career candidates who perform well often move to a technical interview covering algorithms, projects, and role-specific fundamentals. Mobile interviews may cover Android concepts. Systems interviews may cover C++, operating systems, or embedded constraints. Carry your edge-case analysis from the OA into the live discussion.

Conclusion

Practice testing grid and string solutions, including edge cases, until the process is automatic for the format specified in your invitation. Use Samsung-specific practice to strengthen your timed sessions.