Samsung R&D Research Noida conducted their Online Assessment in NIT PATNA on 15 September 2025.
Only CSE and ECE students whose cgpa more than 8.0 were allowed.
There were 3-4 people guarding the Examination and no mobile phones,smart watches,electronics things were allowed.
The Test was conducted on a Special software that was asked to download by the officials , That application will automatically detect any remote access or other external application for conducting valid examination
There was only a single question that has 50 test cases and we have to pass all the test cases. Time allotted was 3 hours.
The question was of competitive programming and not of DSA ,like it belongs to codeforces type and not of leetcode type
I will say the question is not very difficult, it is doable , it is almost 1300-1400 rated codeforces questions of topics mainly BFS,DFS,Implementation, DP, Graph, Shortest Path and all advanced concepts.
So if you are real specialist or pupil then you can do that question easily.
Almost 40 people were selected after the OA. But Samsung does not take interview of that much of people so they conducted an extra pen paper round to eliminated candidate. That pen-paper round does not happen every time or on every campus; if only 10–15 students had qualified for the exam, they would not have held the pen-paper round. Almost 10 people were selected after pen-paper round.
That 10 candidates had an interview and guess what no any core subjects were asked. They just give you a DSA or CP problem and you have to solve and understand the concepts and pseudo code to the interviewers. They have also asked some of the design question like design LRU,LFU and other easy things . They had finally selected 5 candidates and all the candidated were real talented and deserving no any luck matters in this process . I would say if you are real Specialist(1400) or Expert(1600) on codeforces then chances of you selection will be pretty High.
I can recall the question of pen-paper round that is i am sharing with you all;
Given a string s . You have to find how may substrings of s are in the form of 2^x.
Like how many substring of s is in the form of power of 2.
1<=s.length<=2*1e5
0<=x<=100