I am a full stack engineer, passionate about solving complex problems and collaborating with driven teams! I have 4+ years of experience working at small to mid sized startups.
Mainly web development for money. Everything else for fun :) Rust, WebAssembly, Flutter, ML, C64 Assembly, Raspberry, ... a lot of plans, much less free time to work on them.
My solution was the same.
When it comes to challenges I prefer algorithms that can be written in pseudocode and don't use many special (or language-specific) data types.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
coderbyte.com/results/philipgg:Fin...
I submitted a 0(2n-a) where a is the number of repetitive elements.
The idea is to use that the arrays are sorted so always increment from where we are.
if the elements are matching, save and then increment both counters.
Else increment the count of the array which has the lower number, to try to find the bigger one. (this is auto-switching between the two.)
Nice! Was waiting for someone to come up with this one!
My solution was the same.
When it comes to challenges I prefer algorithms that can be written in pseudocode and don't use many special (or language-specific) data types.