• Sign Up
    Time to claim your honor
  • Training
  • Practice
    Complete challenging Kata to earn honor and ranks. Re-train to hone technique
  • Freestyle Sparring
    Take turns remixing and refactoring others code through Kumite
  • Community
  • Leaderboards
    Achieve honor and move up the global leaderboards
  • Chat
    Join our Discord server and chat with your fellow code warriors
  • Discussions
    View our Github Discussions board to discuss general Codewars topics
  • About
  • Docs
    Learn about all of the different aspects of Codewars
  • Blog
    Read the latest news from Codewars and the community
  • Log In
  • Sign Up
tommal Avatar
Name:Unknown
Clan:Unknown
Member Since:Jul 2019
Last Seen:Nov 2023
Profiles:
Following:1
Followers:1
Allies:1
View Profile Badges
  • Stats
  • Kata
  • Collections
  • Kumite
  • Social
  • Discourse
  • Conversations (2)
  • Replies
  • Authored
  • Needs Resolution
  • Custom User Avatar
    • tommal
    • created a question for "Help the general decode secret enemy messages." kata
    • 2 years ago

    I figured how the encryption works, got the dictionary and the formula but I have problems with long strings as my solution includes calculating 2^(positionInMessage)... which of course eventually leads to too big numbers. Is there a math trick to optimize that?

  • Custom User Avatar
    • tommal
    • commented on "Number of Proper Fractions with Denominator d" cpp solution
    • 2 years ago

    I would love to know the process behind this. Both binary and Euclidean were to slow for this kata. I'm really curious where this solution comes from mathematically.

  • © 2025 Codewars
  • About
  • API
  • Blog
  • Privacy
  • Terms
  • Code of Conduct
  • Contact

Confirm

  • Cancel
  • Confirm

Collect: undefined

Loading collection data...