I recently interviewed for an SDE 2 role at Moneyview with around 3 years of backend development experience. Since I could not find many interview experiences online while preparing, I decided to share mine to help future candidates.
The interview started directly with few computer science fundamentals followed by two coding questions.
A variation of LeetCode 76 (Minimum Window Substring).
I was able to come up with the brute force solution and discuss its complexity. However, I could not derive the most optimal approach expected by the interviewer.
K-th Minimum Element in a BST.
Again, I was able to explain the straightforward solution but struggled to arrive at the optimal approach during the interview. The expected solution involved utilizing the BST properties along with inorder traversal.
malloc() and calloc()?Rejected after the first technical round.
I hope this helps future candidates preparing for Moneyview interviews.