Jumping Kady (Intuit India)

Intuit interviews coding interview problem: Jumping Kady asks if a point on an m×n grid can reach a target using jumps of exactly X units (Euclidean) without leaving the grid. Given S(p,q) and R(u,v), determine if the destination is reachable and return the minimum number of jumps, or -1. A concise interview question for practice.