1. Recursive and non recursive way to flatten a nested array. 2. Write program to deep copy an array containing strings, numbers, arrays, and object. 3. Write program to find common elements between 3 arrays. Modify the function such that space complexity is reduced.
Before each step, they'll send the interview outline and the questions that they're going to ask.
Was given a function q(func) which accepts another function as input. Each time this function is called, it will execute the pass in function after 3 seconds. So, if it is called 3 times, q(func); q(func); q(func); the func passed inside will only get called after 3 seconds and the second one will get called only after the first one completes and so on.
One element's css is defined with id selector, now override it using class selector (with out using important)
create SpringCleaning System with two piles. 1. keep 2. throwaway and methods to add, remove, display all items in piles.
Implement a generic function to reduce a tree (should work with any function callback)
They asked me for the solution to an algorithmic toy problem.
Var/Let/Const. Promises/Async programming, Maps and Sets. Implement JSON.stringify, solve circular dependency. Implement countdown timer. Implement given layout in html/css.
2. Develop a form with checkboxes and that will output certain conditional messages depending on which checkboxes where checked.
Basic JavaScript, Print object Css question
Viewing 71 - 80 interview questions