setTimeout(() => { alert("timeout") Promise.resolve().then(() => alert("promise4")); }); alert("start"); Promise.resolve().then(() => { alert("promise10"); Promise.resolve().then(() => alert("promise3")); setTimeout(() => { alert("1") Promise.resolve().then(() => alert("promise5")); }); }); Promise.resolve().then(() => alert("promise"));

const map = ['a', 'b', 'c'].map.bind([1, 2, 3]).bind([4,5,6]); map(el => console.log(el));

An array of links is given: ["url1", "url2", ...] and a limit of simultaneous queries, we need to implement a function, which polls the url and calls the callback with an array of responses ["url1_answer", "url2_answer"] so that no more than limit is executed at any time, i.e. we need to implement a bus with width equal to limit. Requirements: The order in the answer array must match the order in the reference array The function must memoize (not interrogate the same url twice). Errors should not be handled. Use fetch

How to center a div