ROUND 1:



1. Asked about work, wat datastructures and algos used.

2. Given a LL of numbers like 1->2->3->4 convert it into a number = 1234. Write code. Write test cases. Solve those cases.

3. Implement malloc? Wat is sbrk? Design ur malloc system.. minimize fragmentation (both internal and external). What is segmentation and paging and use them.



ROUND 2:



1. Check if two strings are anagram or not. Write test cases. Optimize code.

2. Count number of words in a string? write test cases.

3. Given a chess board and a position, design a system that will give the next safe move of the piece in that position. Write code. (the piece can be anything).



ROUND 3:



1. What is stack, Queue? Implement dynamic stack with arrays. Write ur own realloc func. Dont miss any edge case.

2. Given 2 pages p1 and p2, whether p2 can be made using the words in p1. write code, cover edge cases.

3. Given an infinte array, calculate minimum in each window of size x. optimize.

4. Write code for finding minimum element present in a stack. optimize, minimize number of comparisons, push, pop.



ROUND 4:

1. Basic HR ques.

2. Write code for displaying all the elements in an array with difference x. Minimize number of comparisons. Write tight code as well as most optimized 1 only.

3. Some stress interview ques

HAVE YOUR SAY...