Hi There, \nI have been LeetCoding consistenly and started solving DP problems since last week. \nI can come up with a recursive solution relatively  easily,\nbut when I try to convert it into **Iterative** Algorithm, my brain just gets freezed.\nAnd also analysing time-space complexity for recursive algorithms also seems pretty hard.\n\nNeed Help!\nAny advice, resources are appreciated \u270C\uFE0F.\n\n\nThis is my approach of **Frog Game** using Top-Down Memoization\n```\nclass Solution:\n    def canCross(self, stones: List[int]) -> bool:\n        \n        s = set(stones)\n        \n        last = stones[-1]\n           \n\t\t#         TOP DOWN RECURSIVE\n        d = {}\n        \n        def dfs(pos, k):\n            if pos == 0:\n                return dfs(1, 1)\n            if pos not in s:\n                return False\n            \n            if (pos, k) in d:\n                return d[(pos, k)]\n            \n            if pos == last:\n                return True\n            \n            out = False\n            for nxt in range(k - 1, k + 2):\n                if pos + nxt <= pos:\n                    continue\n                out = out or dfs(pos + nxt, nxt)\n            d[(pos, k)] = out\n            return out\n        return dfs(0, 1)\n```

Hi There, \nI have been LeetCoding consistenly and started solving DP problems since last week. \nI can come up with a recursive solution relatively  easily,\nb