OS: Questions regarding file systems, distributed systems, Process and memory related questions. Coding: 1. swap the k th element from the head and the end of the linked list. e. g. In a linked list --> [1, 2, 3, 4, 5] if k == 2 then output will be [1, 4, 3, 2, 5] 2. convert a binary tree into binary search tree without disrupting the structure. e. g. 10 8 / \ / \ 2 8 ==> 4 10 / \ / \ 4 7 2 7
On the coding I had to design a simple system - OOP and design patterns skills mainly. For the advanced technical we discussed a lot of interesting topics like NoSQL dbs, continuous delivery, redundancy e.g.
What should be considered in REST design?
can't write the full question, being too long, but it all boils down to finding path in a tree and using it in another tree. merging, sorting etc, some practical js/css questions, some java inheritance overloading/overriding questions, most of the questions were js fundamentals..
swaping of two nodes and all Test Secanario.
All questions were pretty challenging- there is no single question I can hand-pick as the most difficult one.
Solving some very complex puzzles in limited time.
Data structure(Linklist)
Consider a system with limited memory, say 64K, that is given a continuous infinite stream of objects (each of size 16k) as input (so you cannot store the complete input), and the system can be queried at any point in time. Assuming the system has seen K objects when it is queried, it should return 1 object from the stream seen so far, such that the probability of each object being chosen is equal. Design such a system.
nothing as such.. here are few question.. phone interview is quite easy. question only on basic core java. F2F reverse the elements of array find if der are any duplicates in array with least possible time complexity petrol at each point (bunk) which is the best point to start problem. model all the requirements of a telephone (classes and its associations, methods ) singleton/factory design pattern. code to read excel sheet ... convert into java objects and some operations on it design and code your own application that reads xml which has test cases and tests the APIs to see if all the test cases work.. return the data
Viewing 3101 - 3110 interview questions