Hey ayaka14732,

Does your solution provide any benfit? As in:

• is your solution faster?

How does this work? Could you elaborate pls?
Doc only talkes about bitwise operation.

Thank you for the help. Sorry about the spoiler.

(manual notification, see above)

ps: spoiler flag, pls

Can't say i've ever done recursion inside list comprehension, inside a lambda function :S

please review c++ issue above ^

I translated from Haskell lol

dude...what have you done?...this is so lengthy😒😒

Fixed.

In Haskell the length of list is not always 10:

import Debug.Trace

points :: [String] -> Int
points x = trace (show x) undefined

Random tests:

uncaught exception: ErrorCall (Prelude.undefined
CallStack (from HasCallStack):
  error, called at libraries/base/GHC/Err.hs:79:14 in base:GHC.Err
  undefined, called at src/TotalPoints.hs:34:27 in main:TotalPoints) (after 1 test)
*** Failed! (after 1 test): 
Exception:
  Prelude.undefined
  CallStack (from HasCallStack):
    error, called at libraries/base/GHC/Err.hs:79:14 in base:GHC.Err
    undefined, called at src/TotalPoints.hs:34:27 in main:TotalPoints
[3,0]
[]

STDERR:

["1:0","2:0","3:0","4:0","2:1","3:1","4:1","3:2","4:2","4:3"]
[]

done