median for a stream
Programador De Lengujae Interview Questions
711,584 programador de lengujae interview questions shared by candidates
Write a routine to determine if a linked list has a cycle.
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
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
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.
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).
The numbers 1-5 are inserted, in order, into a stack. Numbers are removed from the stack one-by-one and pushed into another array (numbers could be removed at any time, even before all the numbers have been added to the stack). What order of numbers in the array could NOT be produced by this scenario? Write code to determine if a sequence of numbers could have been produced by this scenario.
Reverse an integer. Looking for optimized solution and definitely no tostring type of solution
Given an array of items of three different colors red, green, blue. How would you sort the items in the array so that all the items with a certain color would be grouped together.
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
Viewing 1131 - 1140 interview questions