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?
// // Write a function that takes a string and returns its length without using built in properties (such as .length or .size()). //
First question: for a random-ordered bucket of numbers 1 through 3000 with one number missing, how would you detect which number is missing?
Check if a string is a pallindrome Find the longest distance between any two nodes in a binary tree.
Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.
Merge 2 sorted arrays A and B Result should end up in B, which has available space for all items Utilize the space in B, not using temporary arrays Result in sorted array in B A { 2, 5, 8, 12, 15} B { 3, 5, 7, 9, , , , , , }
sort an array N consists of four numbers, each number can be repeated k times, where k < n. Example: sort 1111144422223 to 1111122223444. Try to be as efficient as you can, not just O(n^2)
You have two intersecting linked lists. Describe a function that returns a pointer to the node where they intersect.
Viewing 261 - 270 interview questions