Official X for Firecode. Coding Interview Prep - Done Right. See what the hype is about at https://nitter.gq/t.co/ATzwG2aScM
San Francisco, CA
Joined April 2015
- Tweets704
- Following79
- Followers3.2K
- Likes459
If you're tired of the grind and want to understand the science behind effective interview prep, I wrote up everything I've learned from my journey and our 50,000+ users.
No fluff, just what actually works: firecode.io/firelogs/log/why…
Your future self will thank you for reading this. [10/10]
2
94
I call it the "Leetcode Paradox" - the harder you grind, the worse you perform.
It's like going to the gym and doing 1000 different exercises once. You'll be sore, exhausted, and no stronger. Your brain works the same way. It needs targeted repetition, not random exposure. [8/10]
1
1
54
I get why people grind though. I did the same thing.
Georgia Tech grad, 4.0 GPA, thought I was hot stuff. Then I failed interview after interview at Google, Facebook, you name it. I was doing 6-hour weekend study sessions that left me exhausted and no better prepared. [5/10]
1
64
Here's what really blew my mind - we had an engineer land a $1.6 MILLION offer (yes, really) at a well-known AI company.
Want to know their secret? They didn't solve 1000 problems. They practiced 20-30 minutes daily using something called spaced repetition. That's it. [4/10]
1
56
There's this thing called the Ebbinghaus Forgetting Curve that nobody talks about in interview prep.
Basically, your brain is actively working against you. You forget 50% of what you learn in an hour. 90% is gone within a week.
That tree traversal you mastered 3 weeks ago? Yeah, it's gone. Cmd + Delete deleted. [3/10]
2
187
The Problem:
Given a binary tree, find its height (nodes on the longest root-to-leaf path).
Output: 3
1
12
🧵 Daily Algorithm Challenge: Height of a Binary Tree
This problem was recently asked by LinkedIn, Microsoft, and Google at the TPS stage. Let's solve it step by step!
[1/8]
2
1
90
