Interview 1:
1.Detect cycle in linkedlist.
2.reverse string without affect special characters eg. ab!e#$r&t will be tr!e#$b&a.
3. 2,4,5,6,12,8,4 maximum element in an array which is first increasing and then decreasing (output should be 12).
4.ArrayList vs LinkedList
5.set vs map
6.Final, finally,finalize()
7.comparable vs comparator
8.& more Collection related questions
Interview 2:
1.About my project.
2.Boundary Traversal of binary tree with alternate nodes.
3.Implementation of Stack PUSH() and POP() by using enque() and deque() methods only.

Question

Interview 1:
1.Detect cycle in linkedlist.
2.reverse string without affect special characters eg.  ab!e#$r&t  will be tr!e#$b&a.
3. 2,4,5,6,12,8,4 maximum element in an array which is first increasing and then decreasing (output should be 12).
4.ArrayList vs LinkedList
5.set vs map
6.Final, finally,finalize()
7.comparable vs comparator
8.& more Collection related questions
Interview 2:
1.About my project.
2.Boundary Traversal of binary tree with alternate nodes.
3.Implementation of Stack PUSH() and POP() by using enque() and deque() methods only.

Coviam

Coviam Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches