My Interview Experience...!

Amazon Interview Experience

Phone Interview:
1. Linked list is a Palindrome or not ( Recursive approach)
2. Print out the pairs of numbers having the same sum.
3. Binary Search  Tree has +ve and -ve values. change the +ve to -ve values and retain the BST structure.

Next an Onsite interview in Hyderabad...
In each round.. some discussion about the work done and the projects done.. and tell about urself..etc etc :P

Round 1:
1. Connect all the leaf nodes of the Binary tree.. with right and left pointers in place..
2. Find the Maximum sum subarray.. Include all the edge cases and write an optimised code..

Round 2:
1. 2d array with 0's and 1's find a row with maximum number of one's and the complexity of that.. and write an optimized code
2. Convert a BST to DLL in a sorted way.. Head should point to least node..
Finding the inorder predecessor at each step and linking with it.

Round 3:
1. Kth largest element in BST. Write code and optimise it.
2.  Find the maximum substring with Unique characters.. Write code and optimise it.

Round 4:
1. given an array of size n, where n is the range... like if n = 5 the numbers can be (1, 5) or (100,105) or (110 to 115).. Find the duplicates in that array.. it can be repeated any number of times.
Optimised way to print the duplicates...
2. Opening brackets., Closing brackets.. Priorities... Check if correctly paranthesized. Optimised way..
3. How hashmap is implemented write a code for it.. hashcode.. effective hashcode... etc etc
4. Memory leak in java? Will it happen?  write a code..  if so to demonstrate it
5. New operator in java, stack heap, map.... etc etc discussion on design patterns, and OO.. concepts etc etc


Adobe Interview Experience:

Written Test:
1. Aptitude..  and Data Interpretaion and Analyzation
2. Java Paper :  j2ee concept questions, java concepts, implement a deep clone, implement a blocking Queue, some codes and ouptput, threads and synchronisation
3. DS:  binary tree some questions, middle of the LL, , binary tree has a path sum of K, print the LCA of binary Tree and binary search tree., Print ancestors of given node

Round1:
1. Projects and indepth questions in that..  about 30 mins
2. Implement a Hashmap, proper code,(write on the board)
3. how to protect part of the code..  and a talk on syncronization blocks, thread, thread safe datastructures,,.... etc etc


Round 2:
1. Projects and some questions in that..
2. Normalization and all Normal forms
3. Middle of linked list.. Optimised code without any bugs
4. Hashmap and hashcode and equals
5. Threads, deadlocks, sync, mutex, semaphores in java
6. String creation, string pool, string buffer, string builder


Flipkart Interview Experience....

Online Exam:
1. Find the maximum occurence of number - minimum occurence of number..
Given k.. remove k characters such that max - min = maximum..
2. something like coin denomination..
basketball = 0 if no goal
1 if insdie
2 if outside
combinations to get max score
3. Questions on all DS< Networks, OS.... and so on 20 MCQ's



Round 1:
1. diameter of the tree.
2. K reversal of linked list

Round 2:
1.  Given meeting times of n employees.. find a common meeting time of all the n employees so that they can meet..
2.Traversal of all the peripheral nodes.. like boundary of the tree...
3. Given 2 words.. how to find out the minimum steps/ steps to transform to other word...  [Dicctionary u can store in any way].. Graph.. BFS, DFS>... etc
4. Median of the infinate numbers..
5. Find the maximum in a given window of size k


Maas 360 by Fiberlink..

1. Online coding round:

in a phone like numpad ,,, print numbers that are in the same row or in the same column of that number.. size of the number = 6
in 2nd col.. it should include 0 also.. Number should not start with 0
for the other 2 cols.. dont include * and #.

recursion...!!

Round 1
Looong discussion on
Java COllections
Java Exvceptions

Round2:
Difference between C and Java..
OOP concept implementaitons in C how can they be implemented
Thread and multi threading in javaa
differnce between process and thread,.. multi threading better or multiprocessing with less time slicing.. CPU allocation etc is better..?

Round 3:
Checked, Unchecked exceptions.
Garbage collection... - Long discussion..
Stack and Heap.. memory allocation... etc
new operator
Strings v/s others

Round 4:
Puzzles
bridge puzzle, a hotel room with given room numner...
1st floor 10 rooms, 2nd floor 5 rooms.. and so on.. Find the which lift to take.. (right /left) based on the position of the room..
toasting.. 2 sides of bread minimum time..
Queue.. numbers will be adding at run time.. enque and deque operations... : At a particualr state find what is in the queue..

Round 5:
HR like.. y fiberlink..
wht projects..  what about cloud computing.. what about handheld device challenge in them..
J2EE java, jsp, servlets.. life cyle.... differences.. Beans in J2EE


Round 6:
Similar questions on Java, j2EE, etc etc