• 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
Tankut Avatar
Name:Tankut Talu
Clan:Unknown
Member Since:Jun 2022
Last Seen:May 2024
Profiles:
    Following:3
    Followers:1
    Allies:1
    View Profile Badges
    Ad
    Educator, struggling to assess your students?
    Assess your classroom or bootcamp with the world leading assessment platform, Qualified.Request your demo today!
    • Stats
    • Kata
    • Collections
    • Kumite
    • Social
    • Discourse
    • Conversations (11)
    • Replies
    • Authored
    • Needs Resolution
    • Custom User Avatar
      • Rusca8
      • commented on "Basics 08: Find next higher number with same Bits (1's)" python solution
      • 15 months ago

      This comment is hidden because it contains spoiler information about the solution

    • Custom User Avatar
      • xavierguihot
      • commented on "Number , number ... wait LETTER !" python solution
      • 3 years ago

      I guess you're assuming requirements that don't exist then!

    • Custom User Avatar
      • Tankut
      • commented on "Number , number ... wait LETTER !" python solution
      • 3 years ago

      in the solution you assume that quantity of whitespace delimited numbers are not more than 27 which is len('+-/+-/+-/+-/+-/+-/+-'), so what if the quantity is more than 27 ?

    • Custom User Avatar
      • goldenratio161
      • commented on "Number , number ... wait LETTER !" python solution
      • 3 years ago

      I mean, I did this kata a few months ago, I've improved a lot since then.

    • Custom User Avatar
      • Tankut
      • commented on "Number , number ... wait LETTER !" python solution
      • 3 years ago

      Nice solution but function find_letter is invoked unnecessarly too much

    • Custom User Avatar
      • Tankut
      • commented on "Decode the Morse code " python solution
      • 3 years ago

      no need to check if word exists

    • Custom User Avatar
      • Tankut
      • commented on "Roman Numerals Decoder" python solution
      • 3 years ago

      Very clever

    • Custom User Avatar
      • Tankut
      • commented on "Basics 08: Find next higher number with same Bits (1's)" python solution
      • 3 years ago

      This comment is hidden because it contains spoiler information about the solution

    • Custom User Avatar
      • Tankut
      • commented on "Help the bookseller !" python solution
      • 3 years ago

      Thanks, very explanatory

    • Custom User Avatar
      • Tankut
      • commented on "Give me a Diamond" python solution
      • 3 years ago

      You could have written
      ''.join(' ' * ( abs(n // 2 - i)) + '*' * (n - 2 * abs(n // 2 - i)) + '\n' for i in range(n)) if n > 0 and n % 2 else None

      why have you chose variable t:= ?

    • Custom User Avatar
      • Tankut
      • commented on "Expressions Matter " python solution
      • 3 years ago

      :)))))

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

    Confirm

    • Cancel
    • Confirm

    Collect: undefined

    Loading collection data...