Saturday, July 11, 2026
HomeData Modelling & AIAccolite Interview Experience | Set 8

Accolite Interview Experience | Set 8

Round -1(written)
20 Online MCQ topics are c, Data Structure and Algorithms, Networks, DBMS,OS

Round 1(F2F) [1.5 hr]
Introduce yourself.
1) Sort array [0,1,1,1,1,0,0,1] do it inplace as well as in O(n) time. While sorting you are not allow to change the original ordering of same element.
2) Find the all pair whose sum in K in an array. eg [-1,2,5,3,2] k=4, O/p is {2,2},{-1,5}
3)Count ways to reach the n’th stair
4) Find the no of rectangles/square in a ChessBoard.
5)Search in a row wise and column wise sorted matrix
Round 2(F2F) [2.5 hr]
Discussion On Projects.
Design a code Parser which checks a c++ program is syntatically correct and memory footprints.(more focus on Loops parsing,conditional Statements, global variables, local Variables)

Round 3(F2F) [1hr]
Discussion On Projects.
Design a machine that generates the glossary of a book.(input is book content and output is word with a one line or two line summary that are extracted from book)

Round 4[HR] [15 min]
Tell me about Yourself
Projects
Family
Strengths and Weakness
Why Accolite.

If you like neveropen and would like to contribute, you can also write an article and mail your article to review-team@neveropen.co.uk. See your article appearing on the neveropen main page and help other Geeks.

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

RELATED ARTICLES

3 COMMENTS

Most Popular

Dominic
32519 POSTS0 COMMENTS
Milvus
131 POSTS0 COMMENTS
Nango Kala
6901 POSTS0 COMMENTS
Nicole Veronica
12017 POSTS0 COMMENTS
Nokonwaba Nkukhwana
12111 POSTS0 COMMENTS
Shaida Kate Naidoo
7021 POSTS0 COMMENTS
Ted Musemwa
7263 POSTS0 COMMENTS
Thapelo Manthata
6978 POSTS0 COMMENTS
Umr Jansen
6968 POSTS0 COMMENTS