Candidatei-me online. Fui entrevistado pela Everpure em jan. de 2022
Entrevista
The interview process involves a 30 mins call with a recruiter and two technical rounds (two 1 hour coding session for each round).
You code with the interview using CodePair. You have to write the whole code from scratch including function signature and some tests.
Perguntas de entrevista [2]
Pergunta 1
Optimize set class. Come up with pseudocode for various implementations for a set class that have a desired time complexity for each member function.
Candidatei-me online. Fui entrevistado pela Everpure em fev. de 2025
Entrevista
The first round was an automated online Coding Assessment -
It had 5 MCQs, then one coding question. The last question had then a code of binary search in different languages where we have to find the testcase which will not give the expected result. I was rejected after the assessment
Perguntas de entrevista [1]
Pergunta 1
Monitor locks to acquire and release. A stack and set based question
First round is an online assessment for 75 minutes
Format: 8 total questions ranging from multiple choice, sentence completion, and coding
Content: Concurrency, algorithms, data structures, general problem solving, math, and logic
Perguntas de entrevista [1]
Pergunta 1
Determine if there is a deadlock given order of starting and joining threads
Candidatei-me online. Fui entrevistado pela Everpure (California City, CA) em jul. de 2024
Entrevista
Rounds - attended 3 rounds
1- Technical Recruiter round -> Conversation over the phone with basic questions like - introduce yourself, what are your hobbies, collaboration related situation question and what are you looking forward to.
Round 2,3- Technical interview
Round 4,5- reverse technical interview
Round 6- Hiring manager
Round 7 - HR
Perguntas de entrevista [1]
Pergunta 1
questions were easy to solve 2d array question and classes-based callback function creation question. The follow-up questions were difficult. Optimal solution was answered but then the question was changed to cache topic and then I was asked how to optimize if we want to use cache.
The question was 2d array in form of balanced binary tree and the last row decides if the root will be 1/0. If both children are 1 only then parent is 1 otherwise 0. For this cache was used later and I was asked to optimize it. We agreed till log(n) time complexity but the interviewer wanted something else.
