Daily challenge for 2026-06-21
537. Count Odd Degree Nodes
You are given a list of undirected edges representing a graph, where each edge is an array of two nodes [u, v]. Return the total number of nodes that have an odd degree (an odd number of connected edges).
Example:Input: edges = [[0,1], [1,2], [2,3]]Output: 2
Explanation: Nodes 0 and 3 have a degree of 1, while nodes 1 and 2 have a degree of 2.
Run this challenge interactively in Python or JavaScript when the app loads.