Accolite Interview Experience

I applied for AHC 11.0 Tech Fresher Hiring on the Eduthrill website which is an off-campus drive for Accolite. There were a total of 4 Rounds.

Round 1: This was a gaming round where we had to play a minimum of 20 games of around 5 minutes each. The games were nothing but questions with timers. You had to answer the question in the given time. To qualify for the next round, we had to have a 60% accuracy playing a minimum of 20 games. The questions were based on DSA, OS, CN, SQL, aptitude, and logic

Round 2: Round 2 was a coding round which was held on Accolite’s Codelyzer Platform. The question was of medium difficulty and 60 minutes were given to solve it. I was able to solve the problem for all the test cases.

Note: It is not mandatory to pass all test cases. There were some candidates who were selected for the next round even if all test cases were not passed

Round 3: Round 3 was a skype interview. The interviewer started with the “Tell me about yourself” question. Then he asked me some questions based on my projects and resume. He then came up with a unique rapid-fire round where the questions were based on DSA and I had to answer in just one sentence. Then he asked me to write a code.

Problem: Given a binary number check if the number is divisible b 5 or not?

I converted the binary into an integer and solved the problem, but he asked me to try it without converting.

Round 4: At the start, the interviewer asked me to explain my favourite project, and we had a discussion on that project for a while. Later we moved on to coding questions, I was asked a total of 4 questions.

1. Sort an array of 0’s and 1’s.
2. Sorting using the concept of reversing a subarray of an array.
3. Find the minimum of a stack in 0(1) time. (Special Stack).
4. Find if a ring exists in an array of strings.

I was able to give solutions to all the problems.

Verdict: Selected

Suggestions:

• Talk and interact with the interviewer while solving the questions.
• Ask for hints and clear every doubt you have,