tech 1: he gave me some series 1,11,21,1211.....(1.1 read 1 time,1 read 2times...) and if nth number was given he asked me to write an algorithm to find out n+1th nummber.,asked ten boxes 10 pebbles puzzle.. and some technical questions on data structures and java tech 2:it was more like a analytical roound asked puzzles tech3:insertion into a circular linked list after 2nd largest num,some basic java concepts
third technical interview tell me about yourself currently working project what subjects are you good at os-swapping,thrashing,semaphores,paging,scheduling algorithms dbms-given tables,some queries on that,normalization and its forms with examples,primary key,super key,composite primary key,joins c-difference between call by value and call by reference java-interface,inheritance,super keyword,final keyword,extends ,implements keywords,exceptional handling data structures-queues,stacks,linked list,binary trees given an array from 1-100,find the missing number inserting a node in the middle of linked list given a array of repeated numbers,print the numbers in such a way that numbers are printed in increasing order of their frequencies and print the numbers in increasing order if frequencies are same and codes from data structures
There were some puzzles and aptitude questions, and based on linked list.
Logical puzzle to find out minimum number of times to weigh to find out a defective capsule on a weighing scale.
technical questions (OOP, C#)
-paranthesis validation -count number of palindromic words in a paragraph -excel sheet problem(1-A,2-B,.......27-AA,.......52-AZ....so on) -kth node from any given node in a tree -quicksort -whether a tree is BST or not.
Write a coding to find missing number and repeated number from a given 100 consequent numbers with inspace complexity.
To find whether given 2D array is symmetrical or not
Firstly he asked my interests - technical or non-technical or intermediatory whatever Two coding questions. 1. to find the 5 pairs in an array which give sum near to zero 2. something like optimizing number of bags of 2 different weights given some condition,this i remember vaguely.
Find kth highest element in an array without sorting and complexity should be O(n)
Viewing 9781 - 9790 interview questions