← Zomato questions
CodingReported in a candidate post, Jul 2025

Codeforces problem 1593E, coded once without bugs

Filed under Zomato

Codeforces 1593E (Gardener and the Tree): given a tree with n vertices, perform k moves. In each move all current leaves (vertices of degree at most 1) are removed simultaneously. Output how many…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Zomato questions

Collected from public candidate posts and coding forums. Updated Nov 2026.