You have 25 horses, and you want to know which are the top 3 fastest, but you don't have a stopwatch. You can race the horses, but the track is only big enough to fit 5 horses at a time. How do you find the first, second and third fastest horses using the least amount of races possible?
decide whether the enter should be accepted or not for a passcode, one number missing is permitted, can be missed several times, 18687 is the passcode, then 167 is accepted, the rest should be right and in right sequence.
given a matrix, you can move right or down only and cost of each move is 1. Find an optimal way to reach to right-bottom from top-left of the matrix.
given 2 unsigned ints a and b, return 1 unsigned int = a/b, rounded to nearest int without float operation
Implement memcpy.
They asked me to do a recursive function of a powerset (Ex. powerset(a,b,c) = ((),(a),(b),(c),(a,b),(a,c),(b,c))
Some questions on graph theory and then I was asked to write a function to check if a graph was bipartite.
How can one implement a queue with only a stack implementation?
Implement the functions for a stack and function getMinimum() all with O(1) complexity.
Problem Statement : 18 Ralway Stations from Tamil Nadu are given. A passenger need ticket. Upto the 5 stations journey, fare is 10 Rs. After the 5 stations, for every 5 stations, 5 Rs extra will be charged. For the full stretch journey i.e. From 1st to the last station, fare is 20 Rs. Input 1 : StationFrom - Guindy, StationTo - Kadambakkam Output 1 : Print ticket. i.e. StationFrom : Guindy, StationTo : Kadambakkam, Total Stops : 3, Total Fare : 10 Input 2 : StationFrom - Guindy , StationTo - Chennai Fort Output 2 : Print ticket. i.e. StationFrom : Guindy, StationTo : Chennai Fort, Total Stops : 8, Total Fare :15 Code should follow design principles, patterns. Test Driven Development would be preferable, not mandatory though.
Viewing 1201 - 1210 interview questions