• 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
Quark Fox Avatar
Name:Thanveer Jitu
Clan:Unknown
Skills:python
Member Since:Nov 2022
Last Seen:Jan 2024
Profiles:
    Following:0
    Followers:8
    Allies:0
    View Profile Badges
    • Stats
    • Kata
    • Collections
    • Kumite
    • Social
    • Discourse
    • Conversations (437)
    • Replies
    • Authored
    • Needs Resolution
    • Custom User Avatar
      • treant_coder
      • commented on "Does my number look big in this?" python solution
      • 26 days ago

      #TIL about the divmod operator, thank you!

    • Custom User Avatar
      • fenix0499
      • commented on "Tic-Tac-Toe Checker" python solution
      • 2 months ago

      I realy like this solution, is so much clean

    • Custom User Avatar
      • pucio8
      • commented on "Tip Calculator" python solution
      • 4 months ago

      The same thinking :D

    • Custom User Avatar
      • jimiya
      • commented on "Tic-Tac-Toe Checker" python solution
      • 8 months ago

      i had thought about this

    • Custom User Avatar
      • AbdallahSiyabi
      • commented on " Baby shark lyrics generator" kata
      • 8 months ago

      Alhamdulillah :)

    • Custom User Avatar
      • dfhwze
      • commented on "Express number as sum of four squares" kata
      • 9 months ago

      This is a well known problem in Math, I suggest you read literature about it. It's a math heavy task.

    • Custom User Avatar
      • danik00111
      • commented on "Sum of Pairs" kata
      • 10 months ago

      @jesimielpogi018 you need an O(n) solution, one that, when given a 100-element array, will do 100 iterations, and not 10000 (O(n^2)). So you can't bruteforce with nested for-loops.

    • Custom User Avatar
      • goldenratio161
      • commented on "Range Extraction" kata
      • 16 months ago

      fr, however take a look at this: https://www.codewars.com/kata/58db9545facc51e3db00000a

    • Custom User Avatar
      • OilSquid10
      • commented on "Range Extraction" kata
      • 16 months ago

      They hate yo ass for some reason

    • Custom User Avatar
      • medAmineRg
      • commented on "Combination Lock" kata
      • 2 years ago

      thanks i get it now

    • Custom User Avatar
      • PG1
      • commented on "Array Array Array" kata
      • 2 years ago

      No probs :)

    • Custom User Avatar
      • Quark Fox
      • commented on "Scaling Squared Strings" python solution
      • 2 years ago

      Thanks!!

    • Custom User Avatar
      • p3yif102
      • commented on "Scaling Squared Strings" python solution
      • 2 years ago

      nice solution . it reads like machine language .

    • Custom User Avatar
      • goldenratio161
      • commented on "Van Eck's Sequence" kata
      • 2 years ago

      First of all, I apologise for being late, but thank you.

      If a function is memoized, from my understanding, it will help in its next call, because the previous results from the previous call has no reason to be deleted.

      take a function fibonacci(n):

      def fibonacci(n):
        if n < 2:
          return n
        return fibonacci(n-2) + fibonacci(n-1)
        
      
      fibonacci(3) -> fibonacci(1) + fibonacci(2)
                   -> 1 + fibonacci(0) + fibonacci(1)
                   -> 1 + 0 + 1
                   -> 2
                   
                   
      With memoization
      
      MEMO = {0:0, 1:1}
      def fibonacci(n):
        if n in MEMO:
          return MEMO[n]
        MEMO[n] = ans = fibonacci(n-2) + fibonacci(n-1)
        return ans
      
      
      Now call fibonacci(3):
      
      MEMO[3] = fibonacci(1) + fibonacci(2) = 2
                     v              v
                MEMO[1] = 1    MEMO[2] = MEMO[1] + MEMO[0] = 1
      
      
      MEMO dictionary is updated each call, now it is
      {0:0, 1:1, 2:1, 3:2}
      
      
      Now call fibonacci(4):
      
      MEMO[4] = fibonacci(2) + fibonacci(3) = 3
                    v               v
                    1               2
                    |_______ _______|
                            V
        saved in MEMO from last call, saving time by not re-calculating the results
      
      updated MEMO dictionary:
      {0:0, 1:1, 2:1, 3:2, 4:3}
      
      Now call fibonacci(5):
      
      MEMO[5] = fibonacci(3) + fibonacci(4) = 5
                    v               v
                    2               3
                    
      Now, can you see why it works?
      

      Hope this helps!

    • Custom User Avatar
      • joederek
      • commented on "Combination Lock" kata
      • 2 years ago

      In my world the clock turns in the opposite diretion.

    • Loading more items...
    • © 2025 Codewars
    • About
    • API
    • Blog
    • Privacy
    • Terms
    • Code of Conduct
    • Contact

    Confirm

    • Cancel
    • Confirm

    Collect: undefined

    Loading collection data...