_{[0323 - Number of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](cpp%2F0323-number-of-connected-components-in-an-undirected-graph.cpp)</div>} | _{<div align='center'>[✔️](csharp%2F0323-number-of-connected-components-in-an-undirected-graph.cs)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](go%2F0323-number-of-connected-components-in-an-undirected-graph.go)</div>} | _{<div align='center'>[✔️](java%2F0323-number-of-connected-components-in-an-undirected-graph.java)</div>} | _{<div align='center'>[✔️](javascript%2F0323-number-of-connected-components-in-an-undirected-graph.js)</div>} | _{<div align='center'>[✔️](kotlin%2F0323-number-of-connected-components-in-an-undirected-graph.kt)</div>} | _{<div align='center'>[✔️](python%2F0323-number-of-connected-components-in-an-undirected-graph.py)</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>❌</div>} | _{<div align='center'>[✔️](swift%2F0323-number-of-connected-components-in-an-undirected-graph.swift)</div>} | _{<div align='center'>❌</div>}

_{[0261 - Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](cpp%2F0261-graph-valid-tree.cpp)</div>} | _{<divalign='center'>[✔️](csharp%2F0261-graph-valid-tree.cs)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0261-graph-valid-tree.java)</div>} | _{<divalign='center'>[✔️](javascript%2F0261-graph-valid-tree.js)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](python%2F0261-graph-valid-tree.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](swift%2F0261-graph-valid-tree.swift)</div>} | _{<divalign='center'>[✔️](typescript%2F0261-graph-valid-tree.ts)</div>}

_{[0721 - Accounts Merge](https://leetcode.com/problems/accounts-merge/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F0721-accounts-merge.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F0721-accounts-merge.kt)</div>} | _{<divalign='center'>[✔️](python%2F0721-accounts-merge.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[2359 - Find Closest Node to Given Two Nodes](https://leetcode.com/problems/find-closest-node-to-given-two-nodes/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[2359 - Find Closest Node to Given Two Nodes](https://leetcode.com/problems/find-closest-node-to-given-two-nodes/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F2359-find-closest-node-to-given-two-nodes.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1091 - Shortest Path in a Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](java%2F1091-shortest-path-in-binary-matrix.java)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F1091-shortest-path-in-binary-matrix.kt)</div>} | _{<divalign='center'>[✔️](python%2F1091-shortest-path-in-binary-matrix.py)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1162 - As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F1162-as-far-from-land-as-possible.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}

_{[1129 - Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors/)} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>[✔️](kotlin%2F1129-shortest-path-with-alternating-colors.kt)</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>} | _{<divalign='center'>❌</div>}