Round 1(MCQ Questions): The first round comprised of 60 MCQ questions including aptitude, logical, data interpretation.
Test Duration: 1:15 hour
Platform: CLSA
Suggestions:
- https://www.careerride.com/
- https://www.pariksha.co/students/index/
Round 2(Coding Round):
- Given string S consists of only (a-z,?). Replace ‘?’ with any small letter alphabet such that no two consecutive characters are the same.
Ex 1: S = "ab??ac";
Output : abzbac.
Ex 2: S = "?????";
Output : zabcd.
- https://www.geeksforgeeks.org/find-the-largest-perfect-subtree-in-a-given-binary-tree/
- Given an integer array A and integer M, find the length of largest subset such that distance between any two elements of subset divisible by M.
Ex 1: A = { 1,2,3,5,6,8,11}, M = 3;
Output: 4
Subset = {2,5,8,11}
|2-5| = 3, |2-8| = 6 , |2-11| = 9, |5-8| =3 , |5-11| = 6, |8-11| = 3
Suggestions: Practice on GfG, participate in various contests
Round 3(Technical Interview):
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
23 Nov, 2021
Like Article
Save Article