Search for a command to run...
https://leetcode.com/problems/find-all-people-with-secret/description/?envType=daily-question&envId=2024-02-24 /** * @param {number} n * @param {number[][]} meetings * @param {number} firstPerson * @return {number[]} */ function findAllPeople(n,...
https://leetcode.com/problems/greatest-common-divisor-traversal/description/?envType=daily-question&envId=2024-02-25 var canTraverseAllPairs = function (nums) { let n = nums.length, map = new Map(), uf = new UnionFind(n); for (let i = 0; i <...
https://leetcode.com/problems/same-tree/description/?envType=daily-question&envId=2024-02-27 var isSameTree = function(p, q) { return JSON.stringify(q) === JSON.stringify(p) };
https://leetcode.com/problems/diameter-of-binary-tree/description/?envType=daily-question&envId=2024-02-27 var diameterOfBinaryTree = function(root) { let res = 0 function DFS(node) { if (! node) return 0 let left = DFS(nod...
https://leetcode.com/problems/cheapest-flights-within-k-stops/description/?envType=daily-question&envId=2024-02-23 var findCheapestPrice = function(n, flights, src, dst, K) { const adjacencyList = new Map(); for(let [start, end, cost] of fli...
https://leetcode.com/problems/find-the-town-judge/description/?envType=daily-question&envId=2024-02-22 /** * @param {number} n * @param {number[][]} trust * @return {number} */ var findJudge = function (n, trust) { const trusted = new Array(...
https://leetcode.com/problems/missing-number/description/?envType=daily-question&envId=2024-02-21 /** * @param {number[]} nums * @return {number} */ var missingNumber = function(nums) { let len = nums.length nums = nums.sort((a,b) => a ...
https://leetcode.com/problems/bitwise-and-of-numbers-range/description/?envType=daily-question&envId=2024-02-21 /** * @param {number} left * @param {number} right * @return {number} */ var rangeBitwiseAnd = function(left, right) { let shifts ...
https://leetcode.com/problems/power-of-two/description/?envType=daily-question&envId=2024-02-19 /** * @param {number} n * @return {boolean} */ var isPowerOfTwo = function(n) { return n > 0 && (n & n - 1) == 0 }; To check if a number is a powe...