Accolite Interview Experience for SDE

Off Campus 2021

·

2 min read

Accolite Interview Experience for SDE

Today we will share with you the interview experience of a candidate who applied at Accolite Digital for SDE-1 position.

Round 0(Aptitude):

Accolite Digital Hiring Challenge 13.0 was conducted on Eduthrill portal. Had to solve 20 quizzes while maintaining an accuracy of 60%. The question comprised of Aptitude, OS, COA, DBMS, Number theory, Data Structure, and Java. The majority of the questions were former GATE questions.

Round 1(Coding Challenge):

The coding question was: Accolite SDE-1, Round 1 . You can use any coding language of your choice (C/C++/Java/Python).

Round 2(Technical Interview 1):

I had some internship experience in Web Development, so he asked me some questions on Web development. He asked me to open the compiler and then execute the below instructions.

Design a triangle using HTML and CSS(Can’t add triangle from font, you should implement it with logic).

Add a background image throughout the whole screen and add text in the center and some follow-up questions to add text on all four corners simultaneously(top-left, top-right,bottom-left, bottom-right). And some theory questions oh Html and CSS(Selectors, Pseudo-Classes and pseudo-elements, Inline and Block-level elements, lists and tables, etc). Next, he started asking coding questions

Reversing a linked list both iterative and recursive(O(n) time and O(1) space). Level Order traversal of a tree. Convert a Binary Tree into its Mirror Tree. Dijkstra’s shortest path algorithm.

Round 3(Technical Interview 2):

Tell me about yourself. Questions on my internship experience and some follow-up questions on the database and integration. Questions on the linked list–>Detect a loop n a linked list and merge point of a linked list( he asked me to code it in an editor). Question on system design parking lot considering your college premises and some follow-up questions considering different scenarios. Given an unsorted array arr[] and two numbers x and y, find the minimum distance between x and y in arr[]. The array might also contain duplicates. You may assume that both x and y are different and present in arr[]. (asked me to execute it).

Some theory questions on OS(Scheduling, Process, Round Robin scheduling priority Scheduling,), Cn(TCP model and aloha protocol), and DSA(Implement stack using queue). Maximum sum submatrix

Round 4(HR Interview):

Tell me about yourself. Why Accolite Digital ? Most Challenging thing in your internship. Tell me about your projects. Verdict: Selected after HR Interview

Thanks for Reading

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies. Learn more at Placewit . Follow us on Instagram and Facebook for daily learning.