JS.EventLoop
https://developer.mozilla.org/en-US/docs/Web/JavaScript/EventLoop
JS.Promise.AsyncAwaitChain
Пантелеев Станиславlet doSmth = () => { return new Promise((resolve, reject) => { if (Math.random() > 0.5) { resolve(‘doSmth success’); } else { reject(‘doSmth Fail’); }
Js.Promise.AsyncAwait
Пантелеев СтаниславSugar for promises
let doSmth = () => { return new Promise((resolve, reject) => { if (Math.random() > 0.5) { resolve(‘doSmth success’); } else {
Js. Chain of promises
Пантелеев Станиславlet doSmth = () => { return new Promise((resolve, reject) => { if (Math.random() > 0.5) { resolve(‘doSmth success’); } else { reject(‘doSmthFail’); } })
Algo.Leetcode.111. Minimum Depth of Binary Tree
Пантелеев СтаниславTask
Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node
Algo. Leetcode. 104. Maximum Depth of Binary Tree
Пантелеев СтаниславDecision
/** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNode left; * public TreeNode
Algo. Leetcode. 100. Same Tree
Пантелеев СтаниславGiven the roots of two binary trees p and q, write a function to check if they are the same or not.
Two binary trees are considered
Js.InterviewTasks.CalcNumbersInFunctions
Пантелеев Станислав//one(plus(two()))
//two(plus(one()))
const one = (x) => { return x ? 1+ x : 1; } const plus = (x) => { return x; }
SQL.Group by
Пантелеев СтаниславGood explanation from stackoverflow
Group By X means put all those with the same value for X in the one group.
Group By X, Y means put all those