Sure thing, let’s dig into your code and prune it like a fern. What’s the biggest knot you’re trying to untangle right now?

Absolutely, let’s take a look. Recursion can turn into an endless loop if the base case never truly satisfies or if the function keeps feeding the same values back into itself. First, check that every recursive call is moving the data toward a termination condition—usually a smaller or simpler input. If you’re duplicating rows, it might be because the same state is being processed more than once. A good trick is to keep a hash set of “seen” states or add a counter that stops the recursion after a reasonable depth. Once we add those guards, the function should converge instead of twining around the same stone. Do you want me to walk through your code line by line?

Sure, send the snippet that’s looping and I’ll take a quick look.

The loop is happening because the function keeps recursing on the same list over and over. The key you add to `seen` is just the keys of the dict (`tuple(row)`), not a unique identifier for the whole node, so when a node appears again with the same keys but different data it slips through. Also you’re calling `find_duplicates` on every `row['children']` even when that list is empty or `None`. A quick fix is to: 1. Use a unique key – e.g., `id(row)` or a hash of the row’s content – instead of just the dict keys. 2. Check that `children` is a non‑empty list before recursing. 3. Stop the recursion if the list is empty. Here’s a sketch: ``` def find_duplicates(rows, seen=None): if seen is None: seen = set() for row in rows: key = id(row) # or a proper hash if key in seen: continue seen.add(key) children = row.get('children') if children: find_duplicates(children, seen) ``` That should stop the infinite unwinding. Let me know if that clears it up.

Glad the fix planted the right root! If anything else grows weird, just drop a line and we’ll prune it together.