You are given 1000 containers of water with exactly one container containing poison. You can use pigs to test which container contains poison. The conditions are that: A pig drinking the poisoned water woudl die exactly after 1 hour and that a pig could be used for sampling multiple containers. Assume that the pig takes 0 time to drink water from any number of containers. What is the minimum number of pigs would you use to identify the poisoned container within 1 hour.
Print all permutations of a given string.
There are 199 elements in array. It has only one distinct value? How will find this distinct value? Also for solution please tell about O(n)?How can you make it more efficient?
Given a binary tree with only upwards (parent) node references, re-construct the tree adding in child references. You are given a list of leaf nodes (sorted in left to right order). Tricks include making sure to account for extremely unbalanced trees.
They also asked some behavioral questions.
Reverse a String eg: I am a boy ans : boy a am I
In Array find largest second number ?
Write algorithm to compute the intersection of two arrays. What is the time complexity of this algorithm (using the big O notation)?
Which sorting algorithm would be good for sorting small-sized integer arrays and why? What is the performance? What about for large-sized integer arrays?
Find the length of the longest palindrom in a given string
Viewing 1491 - 1500 interview questions