## Recent Interview Questions

More Questions »- 0of 0 votes
1st Face to face

--------------------

Find if any string has repetitions or not.

Ababababab - true

Abcabcabcx - false

Abcdabce - false

Abaaabaaabaa - true

Virtual functions?

2nd facte to face

----------------------

Create a strategy for testing flipkart.com (any e-com site)

Suppose it is under development.

- I started with UI testing but he said that UI is developed in end

- What all positive scenarios to be tested? Negative scenarios to be tested?

- How you will ensure integration

What all type of testing should be done?

Explain observer design pattern.

Write a code in which the client registers some method on Registrar and the registrar calls that method in case some event happens.

- I created a hash table for events and function pointers but he was more worried about my testing knowledge.

- 0of 0 votes
You have an array of 0's and 1's. Determine a window [L,R], such that if you flip the bits in that window, you will have maximum number of 1's in your array, and then output this number of 1's.

For eg:

Input array: 1 0 0 1 0 0 1

Output: 6

Explanation:

If you choose a window [1,5], your array becomes,

1 1 1 0 1 1 1

which gives the total number of 1's now 6. So, your program should output the number 6, i.e. the maximum number of 1's after choosing a window.

- 0of 0 votes
Assume the numbers 1 through n are stored in a binary tree T. For the pre-

order, postorder and inorder traversals the output of a preorder

traversal of T with 5 nodes can be something like 2; 3; 1; 5; 4. We can think of

this output as the \preorder traversal signature" of the tree. Clearly, we can do

the same for both the postorder and inorder traversals.

a. Is the preorder traversal signature of a tree T unique? That is, are there

two trees storing the numbers 1 through n with the same preorder traversal

signature? How about the postorder traversal signature? the inorder traversal

signature? If your answer is yes to any of these questions, provide an expla-

nation.

- 0of 0 votes
Box stacking problem with boxes having k dimension, find max height of stack

- 0of 0 votes
Box stacking problem with variation of boxes having K DIMENSIONS , find the max height of stack of boxes