is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
A simple solution for this problem is to store and generate 5 random indices from 0 - length of the array. Store these 5 indices, keep advancing the iterator, if you find that the iter position is equal to one of the indices, add that to the result. I present my solution below:
- prudent_programmer March 18, 2018import random def sample5Elements(nums, sampleSize=5): randomIndices = set() # Construct a set with random 5 indices while len(randomIndices) != sampleSize: randomIndex = random.randint(0, len(nums) - 1) if randomIndex not in randomIndices: randomIndices.add(randomIndex) counter = 0 res = [] # Obtain an iterator for the array nums_it = iter(nums) while counter < len(nums): elem = next(nums_it) if counter in randomIndices: res.append(elem) counter += 1 return res nums = list(range(1, 21)) # Generate nums from 1 - 20 print('Random 5 elements:', sample5Elements(nums)) # Output:- Random 5 elements: [1, 2, 6, 9, 11]