1) Write a javascript function to print an array slowly (e.g each element in intervals of 500 ms). Example of array : 1,5,6,’cool’,8. Once done then print “all done”.<\/p>\n
Method-1<\/strong><\/p>\n Disadvantage in Method-1 is that so many setTimeout will be in memory. In Method-2 the number of setTimeout in memory will be less.<\/p>\n Method-2<\/strong><\/p>\n Method-3 <\/strong><\/p>\n Method-4 <\/strong><\/p>\n Method-5. (Using IIFE – Immediately Invoked Function Expression) <\/p>\n 2) Given a string “San Francisco Hotel” and a array of strings (e.g. San Jose Culture of Art, Father Francisco and San Mateo”, “Yahoo”, “I love Hotel”) etc find out the best match. For example in above “Father Francisco and San Mateo is best match since it contains San and Francisco.<\/p>\n You can index all given individual strings. For example “San”, “Jose”, “Culture”, “Art”, etc\u00a0 mapping name to index of string where it appears.<\/p>\n San ==> array(0,1)<\/p>\n Jose ==> array (0)<\/p>\n Culture ==> array(0)<\/p>\n Art ==> array(0)<\/p>\n Father ==> array(1)<\/p>\n Francisco ==> array(1)<\/p>\n Mateo ==> array(1)<\/p>\n Hotel ==> array(3)<\/p>\n Then to search for an input string, You can get all the results for each word in the input string and combine the resultant set in a hash which contains which word occurs how many times.<\/p>\n For San Francisco Hotel you will need to show strings : 0,1,3 for sure. However to rank these strings you can use a hash which will show you which word appears more times.<\/p>\n result[1] ==> 2\u00a0 (string at index 1 contains 2 matching words)<\/p>\n result[0] ==> 1 (string at index 0 contains 1 matching word)<\/p>\n result[3] ==> 1\u00a0 (string at index 3 contains 1 matching word)<\/p>\n <\/p>\n 3) Given a sorted array return a random array.<\/p>\n 4) Given an array of N numbers return the max product of 3 numbers. Example if the array contains [4,2,7,5,3] then the max product possible is 4 * 7 * 5 = 140.<\/p>\n 5) In Javascript Using functional programming , given an array of numbers, return the sum of their squares.<\/p>\n 1) Write a javascript function to print an array slowly (e.g each element in intervals of 500 ms). Example of array : 1,5,6,’cool’,8. Once done then print “all done”. Method-1 var arr = [1,5,6,”cool”,8]; function foo(i) { console.log(“i:” + i + “:” + arr[i]); } function foo2() { console.log(“all done”); } for (i=1; i <=3 … Continue reading Ten-X Interview<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[15],"tags":[],"class_list":["post-708","post","type-post","status-publish","format-standard","hentry","category-interview-questions"],"_links":{"self":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts\/708","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=708"}],"version-history":[{"count":21,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts\/708\/revisions"}],"predecessor-version":[{"id":1075,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=\/wp\/v2\/posts\/708\/revisions\/1075"}],"wp:attachment":[{"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=708"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=708"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/www.tech.dimprash.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=708"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}var arr = [1,5,6,\"cool\",8];\r\n\r\nfunction foo(i) {\r\n console.log(\"i:\" + i + \":\" + arr[i]);\r\n\r\n}\r\n\r\nfunction foo2() {\r\n console.log(\"all done\");\r\n}\r\n\r\nfor (i=1; i <=3 ; i++) {\r\n setTimeout(foo, i*500, i);\r\n}\r\n\r\nsetTimeout(foo2, (i)*500);\r\n<\/pre>\nvar arr = [1,5,6,'cool', 8];\r\n\r\nfunction foo(i) {\r\nif (i < arr.length) {\r\nconsole.log(\"i:\" + i + \":\" + arr[i]);\r\nsetTimeout(foo, 500, i+1);\r\n} else {\r\nconsole.log(\"all done\");\r\n}\r\n}\r\n\r\nsetTimeout(foo, 500, 0);<\/pre>\nconst arr = [10, 12, 15, 21];\r\nfor (let i = 0; i < arr.length; i++) {\r\n \/\/ using the ES6 let syntax, it creates a new binding\r\n \/\/ every single time the function is called\r\n \/\/ read more here: http:\/\/exploringjs.com\/es6\/ch_variables.html#sec_let-const-loop-heads\r\n setTimeout(function() {\r\n console.log('The index of this number is: ' + i);\r\n }, 3000*i);\r\n\r\n<\/pre>\nfor (i = 0, max = 9; i < max ; i ++) {\r\n setTimeout(printFunc(i), 500*i);\r\n}\r\n\r\nfunction printFunc(i) {\r\n return function() {\r\n console.log(i);\r\n }\r\n}\r\n<\/pre>\n
\n<\/strong><\/p>\nvar arr = [1,5,6,\"cool\",8];\r\n\r\nfor (i=0; i < arr.length ; i++) {\r\n (function(i) {\r\n setTimeout(foo, i*1500, i);\r\n }(i))\r\n}\r\nfunction foo(i) {\r\n console.log(\"i:\" + i + \":\" + arr[i]);\r\n\r\n}\r\n\r\nfunction foo2() {\r\n console.log(\"all done\");\r\n}\r\n\r\n\r\nsetTimeout(foo2, (i)*1500);\r\n<\/pre>\nvar arr = [2,4,6,8];\r\n\r\nvar sum = arr.map(function(s) { return s*s;}).reduce(function(acc, val) {return acc + val;});\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"