Amazon Interview Experience

Written Test:

1. 20 Technical Question Similar to GATE only. Preparation from GEEKSFORGEEKS will be helpful.
2. Two Coding problem. You have to write 2 programs. Language can be c/c++/java. Programming structure will be available in the editor. Need not to take input or print the output. Everything is already written in the editor. You have just write the logic in the //write your code segment.

Total duration of written exam is 90min.
Interview Questions:
There were two rounds of interview. Both are technical only.
Round 1:
Questions asked mainly from Data Structure and Algorithms. Few questions from os. For all question you have to write the code. It was must for both the interview.

1. Write a code to inverse a link list in a block. Ex: input:1->2->3->4->5->6->7->8->9->N Output:3->2->1->6->5->4->9->8->7->N(for block size 3).
2. Write a code to build a binary tree from a given tree binary were in each level you have to swap the left child and right child.(It is not a problem to form the mirror of a tree.)
3. Write a code to find loop in a link list. If loop is there remove it.
4. A sorted array is given. Write a code to search for two numbers whose sum is equal to a given no N.
5. Two sorted arrays are given. 2nd array size is enough to store the all elements of array1 and array2. Write a code to merge array1 and array2 and create a sorted array without taking any extra array.
6. A number is given. Write a code to replace a particular digit in that number with another digit. Ex: input: 568456955, output: 968496999(replacing 5 with 9).
7. What is thrashing?

Round 2:

1. Two link lists are merged after some point. Write a code to find that node.
2. One unsorted array is given. You have to replace a number which is more than that number and position wise nearer in right side. If such number is not available no need to replace.             Ex: input: 29763485 output: 99884885

Note:

All problems can be solved using brute force method. Try to solve the problem with less complexity. For all problems they will tell you to find the bugs in your code. If it is there you have to fix it. You have to write test cases for all codes. You also have to analysis the complexity of your code.

Source: Dipanjan Roy(M.Tech(I.T))

IBM ISL Interview Experience

Written Test:
General:
18 questions from series. 18 questions from aptitudes. For each question there is a time of 135sec. You have to answer that question within given time slot. You can’t jump you have to go serially.
All are very simple questions.
Technical:
30 Questions to be answered in 40 minutes.
Questions mainly included

• Predict C program output (about 15 questions) 
• Few questions from C++, OOP concept.
• Few question from Operation systems, networking, and databases.
• One question on design pattern.

Note:
(GATE preparation is enough to answer all the questions, simple and straight question not tricky.)
Interview Question:
Round 1:

• Asked for my subject of interest. (Didn’t asked any question from there.)
• What is the best problem you have ever solved?
• Spiral programming code.
• UNIX syntax.
• ACID properties.
• SQL.
• Critical section problem.

Round 2:

• 2D matrix is given. Write a code to find the element 0 and replace the corresponding row and column with 0s.
• Design a table which will keep track of trains and the platforms in such a way that it can answer 
1. The number of train visit between two given stations.
2.  For a given train no what are stations it will stop?
3. You have to consider the junction also.
4. Data anomaly should not present.
5. For a station what are the train no which will stop and which will not stop in that station.

Note:
The number of interview and toughness of interview you will face depends on the marks you will get in the written exam. If you are in top 3 you have a great chance to crack the interview. The live coding may appear for you if you are not in top 3. So your fate in interview is written in your written exam.

Source: Dipanjan Roy(M.Tech(I.T.))

Gnana Analytics Interview Experience

Written Test:

Contains 10 question of programs Click Here. Duration is 6hrs.

Interview questions:

        Single round around 2 to 3 Hrs.

1. Hash Sets
2. Java Exception handling try/finally/final/Static
3. Abstract classes
4. Abstract classes versus interfaces
5. Override abstract method of a abstract class
6. Java over riding and overloading
7. Run-time and compile time binding
8. Pyrhon program to find duplicate elements of a array in order of n
9. Heap sort
10. Quicksort implementation
11. Inner, outer right outer joins
12. Hash function
13. Big data concepts
14. Sql vs big data(Why Big data)
15. K-means clustering
16. Deletions of double linked lists
17. Comparator in Java
18. Compareto function of Comparator class
19. Hash code of strings
20. Sql query
21. Second max salary
22. Nested Sql queries
23. Circular Linked List advantage
24. Program to Sort a Linked List
25. Unix Commands
26. Who will do Feature subset selection in datasets(important attributes).
27. Shell program to count the number of lines of document
28. Virtualization, OpenStack concepts
29. ArrayList vs Arrays
30. Array vs Linked List
31. Priority Queues
32. Binary search Trees traversal
33. Private addressing
34. Proxy vs reverse proxy
35. Load balancer vs reverse proxy
36. Classless addressing
37. Special ip addresses
38. Tcp layer/Ip layer description
39. Java util packages
40. Free operator
41. Data mining concepts
42. Semaphore and Critical section
43. Threads,array of threads,thread life cycle

Source: Anvesh Kumar S(M.Tech(IT))