Playsimple Games

Role: Software Engineer

College: Not Specified

Interview Date: July 13, 2022

Interview Type: On-Campus (Placement Drive)

Result: Not Specified

Difficulty: Medium-Hard (Overall)

Rounds: 4 rounds

Topics Asked: Data Structures, Algorithms, Resume Projects, Technical Domains, Behavioral

Experience:

This interview experience for PlaySimple Games was part of a placement drive and involved 4 rounds: an online test, two technical interviews, and an HR interview. The entire process was completed in one day.

Round 1: Online Test (HackerEarth)
Duration: 60 minutes. Difficulty: Medium-Hard. This round consisted of objective questions (easy) and two coding questions (more difficult). The coding questions were based on multiple DSA concepts. One coding question was based on stacks, while the second was based on graphs and disjoint sets. Qualifying this assessment was considered the most difficult part of the entire process.

Round 2: Technical Interview 1
Duration: Approximately 45 minutes. Difficulty: Easy-Medium. This round involved 6 DSA-based problems. Two problems were to be explained and coded on paper, while the remaining four were explained verbally. Specific coding questions included "Spiral traversal of matrix" and "Vertical level traversal of binary tree". The interviewer also asked questions from the candidate's resume, including mentioned projects, technical domains, and preferences for working with technologies.

Round 3: Technical Interview 2
Duration: Approximately 45 minutes. Difficulty: Easy-Medium. The questions asked were about personal preferences and personality. The round required thorough thinking and decision-making. Questions included why the candidate wanted to join the company, what they were willing to build, what excited them, and what they would do if they received another placement offer with a better package.

Round 4: HR Interview
Duration: Approximately 20 minutes. Difficulty: Easy. The interviewers were comforting and introduced themselves before starting. Important topics questioned in the process were based on general data structures and algorithms, specifically mentioning tries and count/bucket sorting.