Given n positions (1 to n) and k frogs, where each frog i visits all multiples of i (i, 2i, 3i...), identify which positions are never visited by any frog.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.