← Paytm questions

Knight tour min moves, minimum heap implementation, reverse stack

Filed under Paytm

1) Find the minimum number of moves for a knight to reach a target position on a chessboard. 2) Explain and implement a Min Heap with time complexities. 3) Reverse a stack using recursion and explain…

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 Paytm questions

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