Hi, had this question for today\'s assesment. Kind of frustated, not being able to solve it. Please share your thoughts !\n\nGiven a string G consisting of digits from 0 to 9. However, your friend replaced all occurences of digit **\'5\'** by **\'33\'** and all occurences of digit **\'9\'** by **\'77\'** and changed it to a new string S. \n\nNow you have forgotten the original string G. However, you have the string S which was modified by your friend. Find the total number of possible values of G that could result in S. The answer could be possibly very large, so return answer modulo 1e9+7.\n\nConstraints : \nN => Length of String => 10^5\n\nExample:\n\nInput:\n333\nOutput:\n3\nExplanation:\n35, 53, 333\n\nInput:\n335\nOutput:\n2\nExplanation:\n55, 335\n\nInput:\n7733\nOutput:\n4\nExplanation:\n933, 775, 95, 7733\n

Hi, had this question for today\'s assesment. Kind of frustated, not being able to solve it. Please share your thoughts !\n\nGiven a string G consisting of digi