KKarlebinkarleb.hashnode.dev路Feb 27, 2024 路 2 min read#2092. Find All People With Secrethttps://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,...00
KKarlebinkarleb.hashnode.dev路Feb 27, 2024 路 1 min read#2709. Greatest Common Divisor Traversalhttps://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 <...00
KKarlebinkarleb.hashnode.dev路Feb 27, 2024 路 1 min read#100. Same Treehttps://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) };00
KKarlebinkarleb.hashnode.dev路Feb 27, 2024 路 1 min read#543. Diameter of Binary Treehttps://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...00
KKarlebinkarleb.hashnode.dev路Feb 23, 2024 路 1 min read#787. Cheapest Flights Within K Stopshttps://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...00