feat(content): hidden test cases
This commit is contained in:
@@ -8,6 +8,28 @@ categories:
|
||||
patterns:
|
||||
- greedy
|
||||
|
||||
function_signature: "def is_reachable(target_x: int, target_y: int) -> bool:"
|
||||
|
||||
test_cases:
|
||||
visible:
|
||||
- input: { target_x: 6, target_y: 9 }
|
||||
expected: false
|
||||
- input: { target_x: 4, target_y: 7 }
|
||||
expected: true
|
||||
hidden:
|
||||
- input: { target_x: 1, target_y: 1 }
|
||||
expected: true
|
||||
- input: { target_x: 2, target_y: 2 }
|
||||
expected: true
|
||||
- input: { target_x: 1, target_y: 2 }
|
||||
expected: true
|
||||
- input: { target_x: 3, target_y: 3 }
|
||||
expected: false
|
||||
- input: { target_x: 8, target_y: 16 }
|
||||
expected: true
|
||||
- input: { target_x: 5, target_y: 10 }
|
||||
expected: false
|
||||
|
||||
description: |
|
||||
There exists an infinitely large grid. You are currently at point `(1, 1)`, and you need to reach the point `(targetX, targetY)` using a finite number of steps.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user