Took your phone code and properly formatted, and you are right, it works. Now the challenge is to do it with recursion. Here is your code formatted so all can more easily visualize (with an example at the end)
def allSames(l):
Value= True
for i in l:
if l.count(i) < 2:
Value = False
return Value
print(allSames('1112233344'))
Output:
True
Now for recursion - your solution is more elegant than the recursive one will be. Forget that l.count(i) is available. In its place write code that includes a call back to the original function (that call back makes it recursive).
Or, another idea - do a count on the first digit. If 2+, remove all copies of that digit and call the function on the resulting string (this is the recursion part). Return if either out of digits or if any digit has a count of 1.