C
de
S
pace
Explore
Log In
Explore
Sign Up
Log In
loganjohansson496
22.05.2026 11:15
1
Trie implementation
Work in progress
algo.py
def is_prime(n): if n < 2: return False for i in range(2, int(n**0.5)+1): if n % i == 0: return False return True print(is_prime(17))
Idle
Try It
Clear
Log in
to leave a comment
Are you sure you want to delete this post?
Delete
Cancel