diff --git a/greedy_algorithms/jumpgame.cpp b/greedy_algorithms/jumpgame.cpp
index ab6917ba9..fb7ceb06f 100644
--- a/greedy_algorithms/jumpgame.cpp
+++ b/greedy_algorithms/jumpgame.cpp
@@ -2,7 +2,7 @@
  * @file
  * @brief Implementation of an algorithm to solve the jumping game problem
  * @details
- * This algorithm is a greedy algorithm.
+ * **Problem statement:** Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index.
  * This solution takes in input as a vector and output as a boolean to check if you can reach the last position.
  * We name the indices good and bad based on whether we can reach the destination if we start at that position.
  * We initialize the last index as lastPos.