6 ms·
Not necessarily a backwards loop, it can be done just fine with a simple recursion too. If a candidate can't do either, well, this is a task explicitly to weed
by distances 11y ago
Not necessarily a backwards loop, it can be done just fine with a simple recursion too. If a candidate can't do either, well, this is a task explicitly to weed out those candidates.