Available question text
On an infinite grid with 8-directional (king) moves, decide if you can reach (fx,fy) from (sx,sy) in exactly t steps. The minimum required steps is the Chebyshev distance d = max(|fx-sx|,|fy-sy|), so it's reachable iff t >= d (with the single exception that start==finish and t==1 is impossible).
Related questions
Continue with questions that share topics or the same question type.
- Design an algorithm to get the load on the server in past 5 mins given the time stamps of requests.
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
- Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane, return the k closest points to the origin (0, 0). Discuss expected vs. worst-case time complexity.
Coding
- Largest Time for Given Digits
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2849. Determine if a Cell Is Reachable at a Given Time
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source