1. You have n doors in a row that are all initially closed. You make n passes by the doors starting with the first door every time. The first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6. third pass you toggle 3rd, 6th, 9th door. What state are the doors in after the last pass? which doors are open ?
Svp Human Resources Interview Questions
354,835 svp human resources interview questions shared by candidates
Debugging + System design: We wrote a simple (single-threaded) web crawler. Given a starting URL, it visits every reachable page. For each page, it determines the URLs of every static asset (images, javascript, stylesheets) on that page. The crawler returns a list with an entry for each crawled page and a listing of URLs for the assets found in that page.
Given a list of integers A and an integer k, return the number of unique pairs of integers in A that sum to k. For example, if A=[1 2 5 5 10 8 2] and k=10, the answer is 2, arrived as 5+5 or 2+8. There were 15 tests for this question, with at least the last two timing out, given that the implementation was not as efficient as possible.
You are the project lead on a plan to roll out a new product in China. What factors would you need to consider and what questions would you need to ask in evaluating the potential for success or failure?
Vehicle legs had how many wheels .? What's ur name What are ur hobbies How old are you Which song do you like What's your favourite dish What is reassessment What is environment pollution
what was most innovative technical work you have done
Asked to write a method were it's passed an array of numbers and a single number. I needed to return true if there was two numbers in the array that if added totaled the single number. I was then asked to rewrite it to make it run faster.
Make recipe APIs for HelloFresh
Give an algorithm to find the kth largest element in an unsorted vector of integers.
It was easy... consist of puzzles & case studies.
Viewing 151 - 160 interview questions