nq1ca7
No.366463
/g is dead so asking here, what to do when your code works in leetcode but is shit and unoptimized.
Do you do it again or just look at the best solution.
For example for the valid parentheses problem, I wrote this and yeah its bad but it works, but now the question is if I should move on or perfect this
NrI8Xx
No.366464
>>366463(OP)
Perfect this in interviews you have to waste time
share upoptimized solution then he will tell u share optimized solution and then you will act like u came up with optimized solution by thinking hard but reality is you solved that problem plenty of times before
NrI8Xx
No.366465
>>366463(OP)
just looked at the code seems alright optimized time complexity maybe just there machine ran your code slowly
NrI8Xx
No.366466
>>366465
their*
puWd6F
No.366467
>>366463(OP)
Your caste?
nq1ca7
No.366470
>>366465
I learned from gemini that uitl.Stack is shit and modern java has Deque which is apparently much faster, changing just that improved runtime quite a lot, then I have lots of if and else if statements, but there exists a reverse logic solution that is kinda like this, which is the absolue best case(except for one thing)
Not that I would have ever figured this out on my own.
And well the most memory efficient thing is to implement stack with a static character array yourself, using no standard library.
>>366467
Anil Kunjis
NrI8Xx
No.366472
>>366470
nice yaara
