You iterate n times again with reduce to insert it into an object literal, how does it make logn?? it seems it is O(n) -- O(n)+O(n)+O(n)

May you explain why it is O(nlogn), not very experienced about big o notation

im new to regex
Therefore, I didn't understand how this code works; it is positive lookahead, but how it functions and why is there .*{x}
may you help me your highness

I could not do it , you mean just 1 loop by saying O(n) right.

so that's why it's 1074 instead of 1064 huh

i thought memoized function would handle that ,but nah dictionary has a limit.

I'm struggling with this for 5 hours in Python and I give up, I don't get why it doesn't work with huge strings?!

after this conversation I decided to attempt https://www.codewars.com/kata/5ae64f28d2ee274164000118 ,but unfortunately it works,yet it times out. Any clue that u may want to give me if you have done that?

woh did uoy etirw ti neht ?

my guy

this is beyond my understanding sir