Recently in the month of September 2021, we had Accolite Digital placement drive. So I thought I’ll write my experience hoping it’ll help many. Also kindly refer the “Tips” part in the end.
The process had 5 rounds:
- MCQs test
- Programming test
- Technical Interview 1
- Technical Interview 2
- HR interview
Round 1(MCQs Test): Platform: EduThrill
- Duration: 30 mins
- No. of Questions: 30
- Topics to focus on: Aptitude, CSE core subjects: OS, DBMS, OOPs, etc.
- Difficulty levels: Easy, Medium
Round 2(Programming Test): Platform: Codelyzer
- Duration: 60 minutes
- No. of Questions: 1
- Topics to focus on: All types of Algorithm approaches(Dynamic Programming, Greedy, etc), DSA
- Question asked: https://www.geeksforgeeks.org/count-minimum-steps-get-given-desired-array/amp/
Round 3(Technical Interview 1): Duration: 40-50 minutes
- Platform: Google Meet
- As usual, it started with Self-Introduction.
- Continued with discussion on projects, technologies used in the projects and justification why only those technologies have been used, etc.
- Later questions were focused on: DBMS, OOPs. OS
Coding questions asked were: (You need to share your screen, write the code in an IDE and run it)
- Reverse a given string.
- Print the character with highest frequency along with the frequency count in a given string.
- Print the given array of strings without comma.
Round 4(Technical Interview 2): Duration: 1 hour
- Platform: Google Meet
- Started with Self-Introduction.
- This round was a discussion on complete projects.
Note: It completely depends on the panel member. Because coding questions and questions from CSE core subjects can also be asked in Technical Interview 2
Round 5(HR Interview): Duration: 15-20 minutes
- Platform: Google Meet
- This round started of the Interviewer introduction followed by my introduction.
- I was asked about the problems faced in team projects both with team members as well as in the implementation part. And how I overcame them.
- Next question was: Hard work Vs Smart work, to talk about it and which one I would choose
- Lastly we discussed about the Package
Verdict: Selected
Tips:
- First prepare everything you’ve mentioned in your Resume and then move on to preparing on other topics.
- Keep your self-intro not too short and not too long. Be confident while giving self-intro. That’s the first impression.
- Ask permission to take a guess for questions you are not sure about.
- When coding questions asked, walk the interviewer through your code and thought process as you are coding.
- Ask questions about edge cases in case coding questions. Get clarified. It all lies in the communication.
- Practice a lot on DSA, if you don’t have enough time, refer to the questions mentioned below.
- Focus on SQL queries as well. Also implementation of overloading, overriding, etc., other OOPs concepts implementation.
- Also the no. of days the process happens depends on your college.
- Finally stay calm and confident.
Coding Questions for Reference: (Note: I have collected these questions from other Accolite interview experiences articles on GfG)
- https://www.geeksforgeeks.org/pairwise-swap-elements-of-a-given-linked-list/amp/
- https://www.geeksforgeeks.org/find-maximum-possible-stolen-value-houses/amp/
- https://www.geeksforgeeks.org/palindrome-pair-in-an-array-of-words-or-strings/amp/
- https://www.geeksforgeeks.org/remove-duplicates-from-a-given-string/amp/
- https://www.geeksforgeeks.org/covert-string-x-anagram-string-y-minimum-replacements/amp/
- https://www.geeksforgeeks.org/print-all-pairs-with-given-sum/amp/
- https://www.geeksforgeeks.org/move-zeroes-end-array/amp/
- https://www.geeksforgeeks.org/find-minimum-difference-pair/amp/
- https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/amp/
- https://www.geeksforgeeks.org/maximum-product-subarray/amp/
- https://www.geeksforgeeks.org/nth-node-from-the-end-of-a-linked-list/amp/
- https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/amp/
- https://www.geeksforgeeks.org/delete-a-linked-list-node-at-a-given-position/amp/
- https://www.geeksforgeeks.org/write-a-c-function-to-print-the-middle-of-the-linked-list/amp/
- https://www.geeksforgeeks.org/detect-and-remove-loop-in-a-linked-list/amp/
- https://www.geeksforgeeks.org/merge-sort-for-linked-list/amp/
- https://www.geeksforgeeks.org/level-order-tree-traversal/amp/
- https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/amp/
- https://www.geeksforgeeks.org/print-nodes-top-view-binary-tree/amp/
- https://www.geeksforgeeks.org/print-left-view-binary-tree/amp/
- https://www.geeksforgeeks.org/print-right-view-binary-tree-2/amp/
- https://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/amp/
- https://www.geeksforgeeks.org/sum-nodes-binary-tree/amp/
- Refer to some standard pattern printing questions as well.
Hope this helps. I am forever great full for GfG and everyone contributing to GfG. A couple of weeks back I was referring to Accolite interview experience articles, can’t believe I’m writing one today. You never know. All the very best to whoever is reading this. You got this!