Do all the things like ++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatarSign Up
@fuck2code so how do you understand this like conceptually/English. i cant understand the explanation in the Solution. You have 2 Sorted lists and somehow you can use binary search to find the mid.
Usually i think, how would i do this manually. And the solution is merge them both.
And then I realize i only need to check the middle values so I only have to merge until i reach half the total length.
But the other question i had was like at Google, Apple, tech companies, is this what the source code looks like... and the documentation?
This looks cool. Ill have a look later :)
If I need this kind of math I use the wrong approach, language or I'm doing something wrong in general.
There was once something we call KISS. I feel like as soon as there is an interview or a math teacher around we completely forget this.
Artificial complexity I would call it. Problems designed to be completely stupid complex (which isn't a bad thing) without any consideration if the problem has a real-life use even (which is a bad thing)
@daintycode yes my biggest complaint is that you'll never this on the job units you're an algo designer and well I have no interest in being one...