My O(n²) solution will beat your O(n) one
A common assumption in algorithm design is that lower time complexity always leads to better performance. However, that's not always the case. Take the classic Two Sum problem: given an array, find tw...
I'm a Senior Fullstack Developer who builds cool things with code.
I'm currently crafting epic things at Kake!
With over 8 years of experience, I help make the magic happen creating scalable and efficient solutions using React, Node, Go and a lot more.