Frog Jump, is a LeetCode problem from dynamic-programming subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Frog Jump at LeetCode


can jump, and a dp array to keep max step that the position can take

Time Complexity: O(n^2), Space Complexity: O(n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu