<pre class="shiki github-dark shaku"><code>/** * @param {HTMLElement} root * @param {HTMLElement} target * @return {HTMLElemnt | null} */function nextRightSibling(root, target) { if (!root || !target) return null; let queue = [root]; while (queue.length) { const nextNodes = []; for (let i = 0; i &lt; queue.length; i++) { const node = queue[i]; if (node === target) { return queue[i + 1] ?? null; } nextNodes.push(...node.children); } queue = nextNodes; } return null;}</code></pre>

My solution

Microsoft

Given a DOM tree and a target element, please return the next right sibling. [https://cdn.bfe.dev/bfe/img/I8ncH1ncdGaBXV3nwPH061w1MmdqNR9p_1169x546_15…