You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
How hard would it be to implement a method to get all valid follow-up tokens to an incomplete sequence? For example, let's say a valid string is alternating letters and numbers. If I provided the string "a", then the valid follow-up tokens would be {1,2,3,4,5,6,7,8,9,0}. Would this even be possible?
The text was updated successfully, but these errors were encountered:
How hard would it be to implement a method to get all valid follow-up tokens to an incomplete sequence? For example, let's say a valid string is alternating letters and numbers. If I provided the string "a", then the valid follow-up tokens would be
{1,2,3,4,5,6,7,8,9,0}
. Would this even be possible?The text was updated successfully, but these errors were encountered: