Skip to content
Related Articles

Related Articles

Accolite Digital Pvt Ltd. Interview Experience | Off-Campus 2022

View Discussion
Improve Article
Save Article
  • Difficulty Level : Hard
  • Last Updated : 09 Jun, 2021

Accolite Digital- SDE1 for Batch of 2022. But I am from 2021, I applied thinking they might allow and luckily they did.

Round 0(Aptitude): 

Accolite Digital Hiring Challenge 13.0 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: http://codeforces.com/problemset/problem/919/d.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 webd. He asked me open the compiler and execute it.

  1. Design a triangle using HTML and CSS(Can’t add triangle from font awesome you should implement it with logic). https://www.geeksforgeeks.org/how-to-create-shapes-using-css/
  2. 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).
  3. 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

  1. Reversing a linked list both iterative and recursive(O(n) time and O(1) space). https://www.geeksforgeeks.org/reverse-a-linked-list/
  2. Level Order traversal of a tree. (https://www.geeksforgeeks.org/level-order-tree-traversal/)
  3. Convert a Binary Tree into its Mirror Tree. (https://www.geeksforgeeks.org/write-an-efficient-c-function-to-convert-a-tree-into-its-mirror-tree/)
  4. Dijkstra’s shortest path algorithm. (https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/)

Round 3(Technical Interview 2):

  1. Tell me about yourself.
  2. Questions on my internship experience and some follow-up questions on the database and integration.
  3. 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).
  4. Question on system design parking lot considering your college premises and some follow-up questions considering different scenarios.
  5. 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). https://www.geeksforgeeks.org/find-the-minimum-distance-between-two-numbers/
  6. Some theory questions on os(Scheduling, Process, Round Robin scheduling priority Scheduling,), Cn(TCP model and aloha protocol), and DSA(Implement stack using queue).
  7. Maximum sum submatrix (https://www.geeksforgeeks.org/maximum-sum-submatrix/)

Round 4(HR Interview):

  1. Tell me about yourself.
  2. Why Accolite Digital.
  3. Most Challenging thing in your internship.
  4. Tell me about your projects.

Verdict: Selected

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!