I've somehow managed to get 3rd place in the Div3, a new career high!!! If I had done F and G in the correct order, I would've saved 19 penalty, rip (although my rank wouldn't have improved).
Anyway, to celebrate, I've posted my screencast / explanations here. Hopefully people enjoy!
Congratulations! I hope one day I'll also be top 5 in div. 3 too.
me too
Wow, Congratulations!
Congrats Josh, your speed is just mindblowing!
Awesome. Congrats!
congrats!
congrats! just curious how did you solve F? I used a binary trie but a lot of my friends are telling me that sorting works.
It reduces to finding two elements with the minimum XOR. I also used a binary trie, but you can abuse the property that the two elements with the minimum XOR must be adjacent elements in the sorted array.
Yo, check out this dude Joshc He's like a coding genius, crushing it on Leetcode with a ranking in the top 0.01%! Can you believe he's solved a mind-blowing 1545 problems?!
And guess what? He's totally hooking people up on YouTube, showing them how to rock coding like a boss! Make sure you hit that subscribe button for Youtube Joshua Chen 'cause this guy's gonna blow your mind with his coding skills!
Inspired by Joshua chen :)
bruh wdym somehow, you were #1 on leetcode smh
Since Golovanov399 FSTed, you are in top 3!
Wow! Time to update blog title now, I guess :)
One day I'll learn not to assign a huge number to an int variable, but not today
RIP, but thanks for doing that :) Python superiority!
Auto comment: topic has been updated by Joshc (previous revision, new revision, compare).
Congratulations!