Replying to @Rini_5865
Day 66, nice. For House Robber II you can keep the same memo function and call it twice: on houses 0..n-2 and on 1..n-1, then take the max. Watch n == 1, the one input where that split breaks.
1
Replying to @MarkoAtTech
The prompt that says PROD in red. Everyone who has one installed it the day after.
Replying to @vaishnavidotdev
Day 38, nice. The first two are the same sliding window: grow right, and shrink left while the window breaks the rule. In the max-element one, after shrinking until the window has fewer than k copies of the max, every start before left worked, so add left to the answer.
Coding interview tip: read the constraints before you pick an algorithm.
n ≤ 20 → exponential is fine (backtracking)
n ≤ 10^3 → O(n²)
n ≤ 10^5 → O(n log n)
n ≤ 10^6 → O(n)
The input size usually tells you which solution they expect.
1
40
AI writes most of the code now.
Coding interviews still ask you to write it by hand.
Should they?
47
AI writes most of the code now.
Coding interviews still ask you to write it by hand.
Should they? Genuinely curious where people land on this.
44
Replying to @AshutoshP2128
356 days, nice. Median of Two Sorted Arrays at O(n+m) is where most people start. The follow-up is O(log(min(n,m))): binary search where to cut the shorter array, so the two left parts hold half the elements and every left value is <= every right value.
1
Quick one, no running it first:
In Python, how long does `x in my_list` take on a list of n items?
A) O(1)
B) O(log n)
C) O(n)
And what changes if my_list is a set?
23
Replying to @buildwithpb
99% of startups fail; you never see the money. FAANG is still the surest shot to generational wealth
2
A senior engineer is someone who has broken production at least once and still remembers exactly how it felt.
1
2
79
Replying to @nehaaaa_6
Love the pitch! If you’d like free lifetime access to Firecode to prep for coding and system design interviews, just slide in the DMs 🙂
1




