J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 5 jours. J'ai passé un entretien chez PlaySimple Games (Mohali, Punjab) en févr. 2026
Entretien
The interview process at PlaySimple Games is typically structured into multiple stages designed to assess both technical ability and problem-solving skills. It usually begins with an online assessment that includes a mix of aptitude-based multiple-choice questions and a few coding problems focused on data structures and algorithms such as arrays, strings, dynamic programming, and basic graph concepts. Candidates who clear this round are invited to two or sometimes three technical interview rounds, where they are asked to solve coding problems, explain their approach, and optimize their solutions while discussing time and space complexity. These rounds may also include questions on logical reasoning and, occasionally, basic system design or discussions about past projects, where interviewers evaluate how deeply the candidate understands their own work.
Expérience positive
Entretien difficile
Candidature
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez PlaySimple Games (Bengaluru) en févr. 2026
Entretien
On-campus placement drive.
1 OA round (15 MCQ, 3 DSA questions - 1 medium on strings, 1 medium on 2D array and 1 2D-DP med-hard).
3 technical interviews and 1 HR round.
Questions d'entretien [3]
Question 1
Two players A and B are playing a game optimally, in which A always starts.
The game - initially a positive integer is given to them, and they can either decrement or increment the number by 1 in each move.
The rule - A will win if the number is divisible by 3.
B will win if A takes 10+ moves, and hasn't won yet.
Note - even if the given number is already divisible by 3 A has to make a move. So both player must make a move in their turn, and the number can not be decremented further if number has become 0.
A magical box doubles the number of balls inside it, each day.
Given a positive integer (non-zero) x. Find the minimum number of balls to add in the box to get to 'x' balls. Initially, the box is empty.
Example 1 : x = 8.
Day 1 - add 1 ball to the box.
Day 2 - it becomes 2
Day 3 - it becomes 4
Day 4 - it becomes 8.
Thus, answer is 1 ball.
Similarly for x = 9, answer is 2 as we would add one more ball on 4th day to get 9.
Find a peak element in an array of integers.
A peak element is defined as a number whose both adjacent numbers are strictly lesser than the number.
For index 0 and n-1, i.e., 1st and last element, the left and right adjacent elements respectively, can be assumed as smaller than them everytime.
Example 1 - [1,2,3,3,3,4,1]
Answer - 4
Example 2 - [3,2,3,3,1]
Answer - 3 at index 0.
Follow Up - Solve it in log(N) complexity.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez PlaySimple Games (Bangalore Rural) en mai 2025
Entretien
First Round is MCQ of Aptitude, Computer Science, System Design and after that a coding round Coding round, if first round is clear then there are a total of three rounds of interviews along with HR Round.
Questions d'entretien [1]
Question 1
They asked the Dynamic Programming questions and also Graph related questions.