Given a list of numbers and a rand(0,1) function, which returns a random integer between 0 and 1. Provide an algorithm to randomly sort the given list, based on the output of the rand() function, which should be called once for every number on the list. Code the solution in any language of your choice.
He asked the best way to store boolean values on memory. I said an array but he wanted more, so in the end I said BinaryVector class. He asked why a binary vector is a better option but I couldn't answer that. I told him that I don't know the internal implementation.
How would you implemented a priority queue that allows one to get minimum and maximum from the same data structure?
OOPS, String, Multi-threading, collections DBMS - Joins, Keys, Views, Stored procedures
Design a data structure/algorithm to keep track of instruments, stock exchanges, and trades which supports an addInstrument, addTrade and getAllTradesBetweenTimes(time1, time2) operation.
Write code to see if a string is a sub string of another?
2. Swap the two values (int A=5 and int B=3), w/o using a 3rd attribute(so you cant use the 3rd attribute to store the value as a temporary storage).
What is the difference between a FlipFlop and a latch?
puzzle two wires of diff dimensions have been given. both of them gets completely combusted in 1 hour. you are in a pitch dark room with such two wires and a box of matches. you have to come out of the room in 45 minutes. [you cannot count seconds in your mind or else you cannot visually determine the halfway of the wires given neither do you have anything else other than a box of matches and those 2 wires]
You have chess board. How many squares are there in it totally?
Viewing 1721 - 1730 interview questions