Accolite Interview Experience | Set 12 (On-Campus) Improve Improve Like Article Like Save Share Report Accolite visited our campus. There was a Pre-Placement talk before Round 1. Round 1 MCQ (20 Qus)- 30 Mins 72 people selected in 640 students. Round 2 – Paper Coding Print shortest path to print a string on screen Find zeroes to be flipped so that number of consecutive 1’s is maximized Serialize and Deserialize a Binary Tree 21 people selected Round 3 – Technical Interview The size of array is 101 and the range of number is 0-99 . Only one number comes 2 times find that number. Given an array A[] and a number x, check for pair in A[] with sum as Delete the nodes in the BST whose range in between Round 4 – Technical Interview Find Diagonal Sum of Binary Tree. Inorder Traversal (Recursive, using stack, Morris Traversal). Basics questions of Java (Collection, Thread, Polymorphism, static, final, finalize(), finally). Round 5 – Technical Interview Print leaf to root of a given leaf node value from given array where 0th index of array represents the root node and index represents the child node and the value represents at that index is the parent node. Minimize the redundancy of the data so which DS will u prefer. Database questions(Join, Normalization, Transaction, E-R diagram). People got FTE 2 people got Internship Related Practice ProblemsMissing ranges of numbers All Practice Problems for Accolite ! Last Updated : 28 Jun, 2021 Like Article Save Article Previous Amazon Interview Experience | Set 342 (Off-Campus for SDE-1) Next VMware Interview Experience | Set 5 (On-Campus for IT Application Developer) Share your thoughts in the comments Add Your Comment Please Login to comment...