Ather Energy

Role: Software Engineer (Online Assessment Question)

College: Not Specified

Interview Date: February 2022

Interview Type: Online Assessment

Result: Not Specified (This is only a question, not a full experience outcome)

Difficulty: Not Specified (Implied Medium-Hard by nature of question)

Rounds: 1 (Online Assessment snippet)

Topics Asked: Graph (2D Grid Traversal), Binary Search, Two Pointers

Experience:

This experience is a single online assessment question encountered for Ather. The question involves navigating a 2D grid.

• Coding Question: Minimum Moves in a 2D Grid: You are at (0,0) in a 2D grid and need to reach (x,y). In one move from (a,b) to (c,d), the condition |a-b| + |b-d| = K must be met, where K is a provided input. The task is to determine if it's possible to reach the final destination and, if so, find the minimum number of moves. Constraints: -10^5 <= x,y <= 10^5, 1 <= K <= 10^9.
• Example: Input K=5, X=1, Y=3. Output 2. Example path: (0,0) -> (-3,2) -> (1,3).

The question tags on LeetCode Discuss for this problem include Binary Search, Graph, and Two Pointers.