Grokking the Coding Interview: Patterns for Coding Questions
Ask Author
Back to course home

0% completed

Vote For New Content
Short Recursion

Ahmad Khatib

Dec 21, 2024

class Solution: def find(self, num): def isHappy(num, seen): s = sum(map(lambda n: int(n)**2, num)) if s == 1: return True if s in seen: return False seen.add(s) return isHappy(str(s), seen) return isHappy(str(num), set())

0

0

Comments
Comments

On this page