Is there a limit of depth of nested array in algorithm task Sorted Union? Should I consider array like [1, 3, 2], [1, ], [2, [4,[5,6,7]]] ?
It depends. a real solution that can come in handy later on is one that doesn’t care how deep it is. But failing that, look at the test cases and make it deep enough to solve the deepest one of those.
The real solution seems bit hard for me, hope I can figure it out.
Truth be told, my solution just solved the test cases as they were presented.