There is a linked list of numbers of length N. N is very large and you don’t know N. You have to write a
function that will return k random numbers from the list. Numbers should be completely random.
is a comprehensive book walking you through every aspect of getting a job at a top tech company, while focuses on software engineering interviews.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
Initialize one list of size k to contain random numbers.
- Anonymous on December 12, 2010 Edit | Flag ReplyTraverse list N in linear order. Take first k numbers in random list. After k numbers, for each number you need to remove one number randomly from random number list, till the end of all N elements.
Every new number coming in random number list should be given more weight. Otherwise any number inserted before will have high probability of getting removed than number inserted later.