#How’d it go?
1 messages · Page 1 of 1 (latest)
I remember you posting about having to do it Monday lol and now redo 😅 got me scared ngl
My router/IPS went down in the middle of the interview, so after frantically trying to fix it for like 5-10 minutes I switched to hotspot, lost that time. I got two questions one was an easier medium one was a harder medium follow up question
I was 98% of the way there for question 2 but I ran out of time
I spent like 10 minutes trying to fix a bug that I couldn’t figure out
The interviewer was no help either he was like oh there’s probably just a problem in the recursion like no shit Sherlock
Damn dude, I’ve heard they’re no use but really??
These are usually like FT engineers tho wtf
I had a for loop going through an array and doing a recursive call on each element right
But I was doing return rec() directly
Sheesh
But I should’ve been doing if rec() == True: return True
Literally that one tiny changed fixed everything
Did U prep with karat tagged?
Trying to see what I could do last minute other than my b75 prep
The reason is because if the recursion ever returned false, it would just die instead of continuing through the whole graph
Noooo dude I feel it for u
My questions weren’t tagged I don’t think
Good luck dude you got this
He starts with runtime analysis questions btw
10 minutes of that
Straightforward or curveballs
Where it’s like here’s some pseudo code what’s the runtime, or here’s 2 functions that do the same thing, which is better time complexity, what’s a case where the worse one would be better
For me the first question of that was a bit wacky
Shìt
It was a function that chopped off the last digit of an integer
Until it reached 0
I didn’t know how to formalize that runtime@because it’s basically O(length of digit)
Like n/=10 each time
Yes
Wait
Would it be log base 10
Of the input
Now that I think about it that would make sense