1) (2,1,5,4,6) in the given array print the next largest number in that array for every element. 2->4 , 1->2, 5->6, 4->5 , 6-> 2)i/p: Hello!! @geeks for a given string input the alphabets only printed in reverse order but the special characters to be in the same index o/p:skeeg!! @olleh
Questions was moderate in Aptitude and basic questions in Technical
Given scenario for logical thinking
OOPs concepts & Good understanding of DS will be tested. And ability to make the code better from the first cut.
Basic pattern printing programs and some sorting questions. Final programming round they were asked to solve one program within 3 hours.
Pattern programs and string manipulation programs in round 2
Describing my past research, understanding theirs, and so on.
Some questions on my Resume and CS fundamentals. Then there were 2 DSA questions with many modifications as progressed. Q1: Balanced parentheses. Q2: Infix to postfix conversion Then 2 DBMS queries were asked. Round 2: Q1: Cycle Detection and removal in Linked List Q2: 2 arrays - in time and out time of customers are given, you have to tell the max number of customers present at any time. Q3: A valid BST is made invalid by swapping 2 nodes. You have to make it valid again. A follow up on the same if more than 1 pair of nodes are swapped.
Have you worked on any RTOS?
Self introduction, Tell about yourself
Viewing 401 - 410 interview questions