Round one:
1.Whether a Binary tree is BST or not . Write code for it taking O(1) space complexity .
2.Reverse a linked list. Iterative and recursive both.
3.Given an arrray with n elements give a pair of numbers such that sum will be equal to a number K.

Question

Round one:
1.Whether a Binary tree is BST or not . Write code for it taking O(1) space complexity .
2.Reverse a linked list. Iterative and recursive both.
3.Given an arrray with n elements give a pair of numbers such that sum will be equal to a number K.

Anonymous · Accepted Answer

For first one, I said to do Inorder traversal and check whether it is sorted or not.
One thing, read geeksforgeeks very carefully.

VMware

VMware Interview Question

Interview Answer

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches