---
title: "Karleb (@Karleb) | Hashnode"
description: "I am an enthusiastic web developer. Read the latest articles by Karleb on Hashnode."
url: "https://hashnode.com/@Karleb"
---

@Karleb

# Karleb

@Karleb · Nigeria · Joined March 2021

I am an enthusiastic web developer

### [#2092. Find All People With Secret](https://karleb.hashnode.dev/2092-find-all-people-with-secret?utm_source=hashnode&utm_medium=feed)

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,...

2 min read · [karleb.hashnode.dev](https://karleb.hashnode.dev/2092-find-all-people-with-secret?utm_source=hashnode&utm_medium=feed)

[Feb 27, 2024](https://hashnode.com/posts/2092-find-all-people-with-secret/65de0fa3154a670eea19879c)

### [#2709. Greatest Common Divisor Traversal](https://karleb.hashnode.dev/2709-greatest-common-divisor-traversal?utm_source=hashnode&utm_medium=feed)

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 <...

1 min read · [karleb.hashnode.dev](https://karleb.hashnode.dev/2709-greatest-common-divisor-traversal?utm_source=hashnode&utm_medium=feed)

[Feb 27, 2024](https://hashnode.com/posts/2709-greatest-common-divisor-traversal/65de0e2773bbf2d116269b2f)

### [#100. Same Tree](https://karleb.hashnode.dev/100-same-tree?utm_source=hashnode&utm_medium=feed)

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) };

1 min read · [karleb.hashnode.dev](https://karleb.hashnode.dev/100-same-tree?utm_source=hashnode&utm_medium=feed)

[Feb 27, 2024](https://hashnode.com/posts/100-same-tree/65ddbc407fe72f1fabaf4595)

### [#543. Diameter of Binary Tree](https://karleb.hashnode.dev/543-diameter-of-binary-tree?utm_source=hashnode&utm_medium=feed)

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...

1 min read · [karleb.hashnode.dev](https://karleb.hashnode.dev/543-diameter-of-binary-tree?utm_source=hashnode&utm_medium=feed)

[Feb 27, 2024](https://hashnode.com/posts/543-diameter-of-binary-tree/65ddbaddd3d0f1b934287977)

### [#787. Cheapest Flights Within K Stops](https://karleb.hashnode.dev/787-cheapest-flights-within-k-stops?utm_source=hashnode&utm_medium=feed)

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...

1 min read · [karleb.hashnode.dev](https://karleb.hashnode.dev/787-cheapest-flights-within-k-stops?utm_source=hashnode&utm_medium=feed)

[Feb 23, 2024](https://hashnode.com/posts/787-cheapest-flights-within-k-stops/65d8d22df276944eecda1dc2)
