SDE - 2

console.log("begins");

setTimeout(() => {
 console.log("setTimeout 1");
 Promise.resolve().then(() => {
   console.log("promise 1");
 });
}, 0);

new Promise(function (resolve, reject) {
 console.log("promise 2");
 setTimeout(function () {
   console.log("setTimeout 2");
   resolve("resolve 1");
 }, 0);
}).then((res) => {
 console.log("dot then 1");
 setTimeout(() => {
   console.log(res);
 }, 0);
});

The function had to listen to an object’s property (increment) and store the result of a provided function. On listener.call(), it should print the stored outputs.

let obj = {
 count: 1,
 increment: function () {
   return this.count++;
 },
 decrement: function () {
   return this.count++;
 },
};

let listner = listenTo(obj, "increment");

obj.increment(); // 2
obj.increment(); // 3
obj.increment(); // 4
console.log(listner().call); // [2, 3, 4];

Difference between Promise.all() and Promise.allSettled() with theory and examples.

Implement Promise.all() from Scratch.

// Problem 1: What is the output of the below program?
var fruits = ["apples", "bananas", "cucumbers", "dragonfruit"];

for (var i = 0; i < fruits.length; i++) {
 var time = 1000 - 100 * i;

 setTimeout(function () {
   console.log(i);
 }, time);
}

var fruits = ["apples", "bananas", "cucumbers", "dragonfruit"];

for (let i = 0; i < fruits.length; i++) {
 var time = 1000 - 100 * i;

 setTimeout(function () {
   console.log(fruits[i]);
 }, time);
}

You are given a binary search tree of integers with N nodes. You are also given references to two nodes 'P' and 'Q' from this BST.

Your task is to find the lowest common ancestor(LCA) of these two given nodes.

The lowest common ancestor for two nodes P and Q is defined as the lowest node that has both P and Q as descendants (where we allow a node to be a descendant of itself)

A binary search tree (BST) is a binary tree data structure which has the following properties.

• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.

For example:

'P' = 1, 'Q' = 3
tree = 2 1 4 -1 -1 3 -1 -1 -1,

The BST corresponding will be- 

Here, we can clearly see that LCA of node 1 and node 3 is 2.