Round 1:
1. Tell me about the technologies you have worked.
2. Tell me about your project.
3. Data Structure questions ..
A. Input Array = {4, 8, 2, 15, 7, 3, 11, 19, 6, 13} Find X=22;
Find the no of pairs index which sums up to X
For example output : (0, 3, 5) index
B. Find the Diameter of Tree
C. Design Your own Cache.
Round 2:NA
Round 3: NA
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 :
19 Jul, 2019
Like Article
Save Article