You have a function f(p) that returns an array of linked pages e.g f(homepage) = {page1, page2, page3}. Or f(page1) = {page4, page5}. If there is no linked pages function will return null. And we say one site is a good site if we can get to any page of that site in a less than 6 clicks. The task was to write a function that will check is it a good site or not using f(p).
On the interview I had to code an example with PHP and as they were watch me develop.
If I have a jar with 1000 coins and one is double headed and I pick one coin randomly and flip 10 heads what is the probability it is the double headed coin?
Q. my_list = [[35, 66, 31], ["python", 13, "is"], [15, "fun", 14]] OUTPUT REQUIRED: To print the string from the list as : python is fun
1. about 2. javascript typescript babel es5 es6 3. test driven development, unit-testing, continuous integration 4. react-redux, modern JS frameworks, JS closures 5. function sum(){/*add code here*/};console.log (sum(3)(5)(7)(3)()); // 18
if you have a linked list ordered like : n1-n2-n3-n4-n5-n6-n7-NULL. how to sort it to be at the order : n2-n1-n4-n3-n6-n5-n7-NULL
Give me 5 different ways of finding the median (middle element) of a linked list. For the sake of simplicity, assume the list has odd number of ints. Also mention the runtime for each. Follow up: What's the fastest way you could find the median? What is the runtime? Oh.. and yes, code your answer(s) in any language of your preference.
Given a point to an array of 12 bits in a graphics buffer where each 4 bits represented red green and blue respectively, flip the color of the array to blue.
Very very hard, they ask you to do a poker project for 8 hours and give no feedback after and ask you to leave
The Codility challenge had 3 problems: 1 - A SQL query, 2 - A development problem, equivalent to a medium difficulty in Leetcode and 3 - Finding a bug in a function.
Viewing 251 - 260 interview questions