And I have a cliche reply: No questions are dumb please!

Sounds like a good solution, but I cannot understand how BFS will get you the minimum cuts. Would be great if you can share a github link maybe?

Sometimes, for really large input, recursion does show a TLE because of the overhead of the extra stack space for the recursion. Maybe that’s what happened in this case. Need to see your code to know the root problem.