1)Given an number N and an array of size N-1 containing N-1 numbers between 1 to N. Find the number(between 1 to N), that is not present in the given array. let N = 5; let Arr = [1, 2, 4, 5] sum=n*(n+1)/2 for(let i=0;i<arr.length;i++){ sum-=arr[i] } console.log(sum) 2)Input: pattern = "abba", s = "dog cat cat dog " Output: true function wordPattern(pattern, s) { const words = s.split(' '); if (pattern.length !== words.length) { return false; } const charToWord = new Map(); for (let i = 0; i < pattern.length; i++) { const char = pattern[i]; const word = words[i]; if (charToWord.has(char)) { if (charToWord.get(char) !== word) { ...
This website contains interview questions for JavaScript, Nodejs, Html, Css, Datastructure, Mongodb, Angular, Aws and much more intresting articles on different technologies.