Hello all,

Question as title, do I have to do the 2 questions perfectly to get pass?

Onsite:

Q1
My go-to solution is to store all nodes. Here are sth that deviated from perfect:

• interviewer asked me to reduce memory use to constant, and I asked for hint and got a hint on depth, then I came out w/ the solution. Even that I didn't have the optimized code first but I came out to fix it step-by-step by my own w/o additional hint.
• I gave the complexity of log n and after the interview I realized that it could be linear for imbalance tree.

Q2
I got the linear solution done. For the binary search one I clearly looked rusty:

• I got confused to go left or right if mid > mid+1 or vice versa.
• I got wrong w/ l = mid + 1 (missing plus 1). I ran through the dry run and figured out the error by my own. I mean, do people really expect to get binary search details correct in the first place if you do not see it beforehead?

For the second coding interview I think I did fine. However, the interviewer kept asking for alternative solution for Q2, possibly to reduce memory usage.

In short, both interviews were not 100% perfect especially the first one, does that mean a rejection?

I still have ML and behaviral. Was thinking if I'll get a rejection due to the above at the end then might just stop interviewing right now. I am interviewing E5. Does that make things different as I imagine the background fit and behavioral might have heavier weights for a senior role compared to a new grad. position?

Thanks!