From c4027ed5b85c56e7ae9b7baadfbec99fe90c86ce Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Sun, 20 Oct 2024 13:48:42 -0400 Subject: [PATCH] Create README - LeetHub --- 0055-jump-game/README.md | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 0055-jump-game/README.md diff --git a/0055-jump-game/README.md b/0055-jump-game/README.md new file mode 100644 index 0000000..900dfed --- /dev/null +++ b/0055-jump-game/README.md @@ -0,0 +1,28 @@ +

55. Jump Game

Medium

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.

+ +

Return true if you can reach the last index, or false otherwise.

+ +

 

+

Example 1:

+ +
+Input: nums = [2,3,1,1,4]
+Output: true
+Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
+
+ +

Example 2:

+ +
+Input: nums = [3,2,1,0,4]
+Output: false
+Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
+
+ +

 

+

Constraints:

+ +