https://github.com/lucas-erkana/codingchallenge_determine_if_a_cell_is_reachable_at_a_given_time

You are given four integers sx, sy, fx, fy, and a non-negative integer t.
https://github.com/lucas-erkana/codingchallenge_determine_if_a_cell_is_reachable_at_a_given_time

Last synced: 5 days ago
JSON representation

You are given four integers sx, sy, fx, fy, and a non-negative integer t.

• Host: GitHub
• URL: https://github.com/lucas-erkana/codingchallenge_determine_if_a_cell_is_reachable_at_a_given_time
• Owner: Lucas-Erkana
• Created: 2023-11-08T06:20:16.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2023-11-13T06:19:35.000Z (about 1 year ago)
• Last Synced: 2024-10-12T09:49:13.237Z (about 1 month ago)
• Language: JavaScript
• Size: 15.6 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Determine if a Cell Is Reachable at a Given Time

## Problem Description

You are given four integers `sx`, `sy`, `fx`, `fy`, and a non-negative integer `t`.

In an infinite 2D grid, you start at the cell `(sx, sy)`. Each second, you must move to any of its adjacent cells.

Return `true` if you can reach cell `(fx, fy)` after exactly `t` seconds, or `false` otherwise.

A cell's adjacent cells are the 8 cells around it that share at least one corner with it. You can visit the same cell several times.

[Detailed Explanation](https://docs.google.com/document/d/1cJBYW8p4WtzAwdN4-J160W9qU9pAMgfSjkxK60vzPWg/edit?usp=sharing)

## Example 1:

![example1](https://github.com/Lucas-Erkana/CodingChallenge_Determine_if_a_Cell_Is_Reachable_at_a_Given_Time/assets/41428579/b20097cf-5389-4278-bcfa-87796952d0e3)

**Input:**

```

sx = 2, sy = 4, fx = 7, fy = 7, t = 6

```

**Output:**

```

true

```

**Explanation:**

Starting at cell (2, 4), we can reach cell (7, 7) in exactly 6 seconds by moving through the adjacent cells.

## Example 2:

![example2](https://github.com/Lucas-Erkana/CodingChallenge_Determine_if_a_Cell_Is_Reachable_at_a_Given_Time/assets/41428579/f644ad4e-611d-4489-a45a-b3318840f714)

**Input:**

```

sx = 3, sy = 1, fx = 7, fy = 3, t = 3

```

**Output:**

```

false

```

**Explanation:**

Starting at cell (3, 1), it takes at least 4 seconds to reach cell (7, 3) by moving through the adjacent cells. Hence, we cannot reach cell (7, 3) within the third second.

---

## Constraints

- `1 <= sx, sy, fx, fy <= 10^9`

- `0 <= t <= 10^9`

---