Given an array of strings products and a string searchWord. We want to design a system that suggests at most three product names from products after each character of searchWord is typed. Suggested products should have common prefix with the searchWord. …

Normalize CSS approach or the CSS Reset Approach — As a rule, we want an HTML element to look the same way, independent of which browser is being used to view it. Unfortunately, this is not the case because of the way browsers run. CSS Resets A CSS resets aims to remove all built-in browser styling. …

This is a simple test of the interviewee’s experience and creativity in JavaScript DOM manipulation and CSS. There are many solutions, each offering opportunities for follow up questions. Set display: none or visibility: hidden. Remove the element from DOM Remove the innerText, or textContent, i.e. setting it to an empty…

Method 1, we can make use of es6-promise-pool to manage concurrent requests. uses generator function uses event listener addEventListener of PromisePool instance import PromisePool from 'es6-promise-pool'; // macs - Array of mac addresses useEffect(() => { const fetchData = () => { const results = []; …

Book a Session Dynamic Programming is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems and stores the results of subproblems to avoid computing the same results again. 1] Recursion function fib(n){ if (n <= 1) return n; return fib(n - 1) + fib(n …

Book a session 1] Using JSON.stringify,[does not work for nested objects] const k1 = { fruit: '🥝' }; const k2 = { fruit: '🥝' }; // Using JavaScript JSON.stringify(k1) === JSON.stringify(k2); // true 2] Using Object.entries, [does not work for nested objects] const k1 = { fruit: '🥝' }; const k2…

Kadane’s Algorithm can be viewed both as a greedy and DP. As we can see that we are keeping a running sum of integers and when it becomes less than 0, we reset it to 0 (Greedy Part). This is because continuing with a negative sum is way more worse…

Calculate the maximum sum of ‘k’ consecutive elements in the array. Input : arr[] = {1, 4, 2, 10, 23, 3, 1, 0, 20}, k = 4 Output : 39 We get maximum sum by adding subarray {4, 2, 10, 23} of size 4. Brute Force Approach — O(n*k) solution // Returns maximum sum in a…