Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Accolite Digital Interview Experience for SDE (On-Campus)

  • Difficulty Level : Medium
  • Last Updated : 21 Sep, 2021

Accolite conducted their virtual hiring process for our campus during the last week of August. The recruitment process comprises 5 different rounds out of which the first two screening tests are conducted on Accolite’s own platform. The On-Campus hiring process is very much similar to the Accolite Hiring challenge(Off-Campus) which they conduct every year.

Round 1: Online 30 MCQ’s in 30 Minutes

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

  • This particular round was of 30 minutes and it is conducted on Accolite’s own platform Eduthrill. The questions were of easy-medium level difficulty. The questions were from the CS Core fundamentals like OS/CN/DBMS/DSA and one or two from the aptitude. Around 150 students qualified the Round 1 and were shortlisted for the coding round.

Round 2: Online Coding 1 Problem in 1 Hour



This round had one coding question that is expected to be solved in an hour. It was conducted on Accolite’s own coding platform called Codelyzer. The problem statement given is as follows :

  • Jack and Jill were going through a jungle to the city. They encountered a monster who told them they will only be allowed to escape when they solve a puzzle for him. They didn’t have a choice so they agreed.
  • He states the problem like : I have n buckets having 0 fruits in each bucket initially. I will give you n numbers denoting fruits required at nth position But you need to keep two simple rules:
  • Either you can increment fruit count by 1 in each bucket i.e. Incremental Operation
  • Or you can double the fruits in each bucket i.e. Doubling operation.

Example:
Input :- [2, 3]
Output :- 4
Explanation :- The array can be reduced by the following operations and it is
considered to the minimal, the operations are as follows
Increment fruit in 1st bucket – [1, 0]
Increment fruit in 2nd bucket – [1, 1]
Double the entire fruits – [2, 2]
Increment the fruit in 2nd bucket – [2, 3]
The output is the no of operations required i.e. 4

  • https://www.geeksforgeeks.org/count-minimum-steps-get-given-desired-array/
  • The coding part was okay, but the catch here is that the platform doesn’t provide us with any test cases we need to write up our own test cases in the test case folder. Any confusion while writing the unit test cases can make you lose lots of time. So you have to be meticulous during this process.
  • My advice for the coding round is to better visit the questions that were asked during the previous hiring challenges as there is a high chance of getting previously asked coding problems.

Almost 50 students qualified the Round 2 and were shortlisted for the technical Interviews.

Round 3: Online Technical Interview 1

Time: 40 Minutes

One good thing about Accolite is that the interviewers are very friendly. She started the interview by introducing herself. She gave a brief outline of the interview process.

  • She began the interview with few theory questions on Operating Systems and DBMS.
  • What is Virtual Memory, need for VM?
  • Types of OS
  • Distinguish between Process and Program
  • Synchronization techniques
  • Paging and segmentation
  • Normalization and Denormalization
  • Differences between SQL and NoSQL (As I mentioned MongoDB in my resume).
  • These are some of the theory questions she asked and the discussion went on for about 20 minutes. Next, she asked me to share my screen and gave me a coding question.
  • Given an unsorted array and a target value, you are required to find the subarray with the given target sum
  • This was a basic array question, initally I gave here the brute force technique of generating all the subarrays and checking the subarray with the sum equal to the target sum
  • Then I told her i can further optimize the logic through sliding window technique and explained her my logic by taking a sample test case. Then she asked me to write the code for the same.
  • Then she asked me tell where this code fails. I told her the fact that sliding window doesn’t handle negative elements. Then i gave a logic using Hashmap.
  • https://www.geeksforgeeks.org/find-subarray-with-given-sum/
  • Then she asked me the most standard and popular question
  • Reverse a LinkedList
  • https://www.geeksforgeeks.org/reverse-a-linked-list/
  • Then interview ended by the discussion of the time and space complexities of my approaches.

Round 4: Online Technical Interview 2

Time: 1 Hour 15 Minutes

  • This was the longest and slightly challenging round compared to the others. The interviewer started with a brief introduction of himself and asked me to do the same. Then he asked me to provide some insights on the projects I have done, Then he started asking me about my Full-stack project.
  • This was an in-depth discussion, he focused completely on the tech stack, how I learned them, and what are some of the alternatives, advantages, disadvantages of the tech stack I have used. Then he asked me to explain the workflow of the project, then he asked me for the details about the database schema and all. He asked me few concepts of networking as my project involved the usage of socket programming.
  • The same in-depth discussion was continued on my machine learning project as well. The discussion went on for about 40 minutes after which I was asked to write few SQL queries based on joins. He asked me some of the types of queries. He asked few basic questions on Transaction Management and Concurrency control in RDBMS and NoSQL Databases, some basic questions on Normalization were also asked.
  • After all the technical discussion, he asked me to share my screen and write code for the following problem statement.
  • Given an array comprising of even and odd numbers, you are required to segregate the even and odd numbers.
  • Initially, I gave him the brute force approach but he wasn’t satisfied with it and I took some time and told him the two-pointer approach and he got satisfied with it and I was asked to write the code for the same.
  • Then he gave me a scenario-based problem, the problem goes as follows There is a cable operator there are few customers around various cities, and his task is to connect all the cities (that he has customers) with the cable TV station in such a way that the cost incurred on the cable wire is minimum.
  • I took some time and gave him the idea of the Minimum Spanning Tree (MST). Where the graph can be converted to a network of edges with an overall minimum cost. I was asked to write the code (just the function). He was satisfied with my approach. Then he asked me whether I have any questions, and the interview concluded.

Round 5: Online HR Round

Time: 35 Minutes

  • The interview began with my self-introduction. The interview comprised of very standard template-based HR questions.
  • She asked me what I know about Accolite. In the end, she gave me the details regarding the CTC offered and few insights on the internship that is being offered.
  • My advice is to do some good research on the company before this round and try to communicate confidently.

Verdict: Selected




My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!