Summary
I interviewed for a Full Stack Engineer position at Gushwork, which involved DSA and other technical questions. Unfortunately, I failed the interview, primarily because I was unable to solve the first DSA question.
Full Experience
YOE: ~2 Years
DSA Questions:
- https://leetcode.com/problems/merge-sorted-array/ (but without using any extra space)
- Variation of LCA
Before starting with DSA they also asked other questions:
- Why do we sometimes call API in batches?
- Probablity question - what will be the probability of failure (could be easily solved using P(F) = 1 - P(S) approch)
Verdict: Failed (couldn't solve 1st question)
Interview Questions (3)
Given two sorted integer arrays, nums1 and nums2, merge nums2 into nums1 such that nums1 contains all elements from both arrays. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. nums1 has a length of m + n, where m is the number of elements initially in nums1 and n is the number of elements initially in nums2. You are explicitly instructed to solve this problem without using any extra space.
Explain the reasons and benefits for sometimes calling APIs in batches instead of individual requests.
A probability question asking to determine the probability of failure, with a hint that it can be easily solved using the approach P(F) = 1 - P(S).