Phone screen :
Q1 : PrefixSum + querying
You will be given the infinite queries of range [l,r) and nums, and find out whether this query range of elements in nums equal to the target or not.
Need to work for this large query set, asked optimisations and any further optimisation in queryingQ2 : Min path to reach end of a 2*2 grid with obstacles ( Binary Grid )
Passed ✅
Loop Rounds 🚀 - 3 C + 1 B + 1 S.D
Round 1 - Coding
Q1:
https://leetcode.com/problems/k-closest-points-to-origin/description/
Q2:
Tree Mountain View - Right View + Left View and handling the root element, cause it appear twice in RV & LV
Solution : Did Right View, then Left View and while building solution ignored root for onceTC - O(N)
SC - O(N)
Asked to do it in one single loop , still O(N) , Just Explained the approach, No time left
Round 2 - Coding
Q1:
https://leetcode.com/problems/simplify-path/description/?envType=problem-list-v2&envId=stack
with CWD feature as well, struggled a bit to understand the question but
wrote the optimal code using Stack
Q2:
Won't remember, but from the top 100 frequent asked questions, around HashMaps
Round 3: Behavioral
Round - 4 - System Deisgn
- Asked about FB live feed, just like Instagram feedAfter week's time, got result - Reject ❌
They won't share any feedback and won't even care after the result
Tips from my experience
OP community gave a lot to me, Its time to give it back, All the best for those who are in this battle !
***** At the end, All we need is one. YES ! ✅ ******