OA - Easy DP question (Fibanocci), Easy string-based question and JS MCQs Round 1 - Basic JS questions like hoisting, call, apply, bind, debounce, throttling, output questions, implementaion of a polyfill for array reduce, etc., Round 2 - Questions based on Promises and one coding question related to implementation of Promise queue. Round 3 and 4 - Questions based on problem-solving 1) longest substring without repeating characters (LC medium) 2) Given 2 strings, recursively remove all the occurence of string2 in string1, and return the result 3) Given a nested array, and an integer, return an object in which, key is the level of the nested array, and value is the frequency of the given integer in each level Eg :- array = [1, [1,2,3], [1,2,3]] integer = 1 Output -> {0: 1, 1: 2} Also had a few theoretical questions like event bubbling, event delegation, deep and shallow copy of objects, `this` in JavaScript etc.,
