Eli B (fullmooninu)

Last solved
7 months, 3 weeks
Member for
1 year, 7 months
Country
Angola
Time zone
Europe: London
Language
Python

Me:

  • Bioinformatics
  • Experimental Evolution
  • Devops
  • Juggling
revComp = reverse . map (\n -> case n of 'A' -> 'T'; 'T' -> 'A'; 'C' -> 'G'; 'G' -> 'C')
revComp = lambda s: ''.join({'A': 'T', 'T': 'A', 'C': 'G', 'G': 'C'}[n] for n in reversed(s))

Ed CB on computer [namegrep.com]2

Level
26
Solved
73
Total
0.26

Level progress

64
128

Badges

Achievements