Print nodes at a specific level (BFS)?

Short answer: void PrintNodesAtLevel(Dictionary<int, List<int>> graph, int start, int targetLevel) {

Example code

var visited = new HashSet<int>();
var queue = new Queue<(int node, int level)>(); Follow on: queue.Enqueue((start, 0)); visited.Add(start); while (queue.Count > 0) { var (node, level) = queue.Dequeue();
if (level == targetLevel) { Console.WriteLine(node); }
if (level > targetLevel) break;
foreach (var neighbor in graph[node]) {
if (!visited.Contains(neighbor)) { visited.Add(neighbor); queue.Enqueue((neighbor, level + 1)); }
}
}
} Explanation: BFS traversal with level tracking; print nodes at the requested level.

Real-world example (ShopNest)

In coding rounds, state complexity aloud, write a clear ShopNest-flavored example (orders, carts), then handle edge cases (empty list, null, overflow).

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.