CoinSwitch Kuber | SDE - II | Bangalore | May 2022
Summary
I interviewed for an SDE-II position at CoinSwitch Kuber, where I faced several data structure and algorithm problems, including twisted versions of LeetCode problems like 'Sort Items by Groups Respecting Dependencies' and 'Next Greater Element II'.
Full Experience
I applied for the SDE-II role at CoinSwitch Kuber through LinkedIn and received a call from the recruiter within a week, who then scheduled my interview rounds. I have 2.9 years of experience working in a product-based startup. The first round was conducted by a senior engineer and involved several coding problems.
One problem was similar to LeetCode 1203, 'Sort Items by Groups Respecting Dependencies', but with additional criteria. I discussed my approach and attempted to code it, but unfortunately, all test cases didn't pass.
The second problem was 'Remove Nth Node From End of List', similar to LeetCode 19. However, I was specifically asked to write the entire code from scratch, including setting up the main function to construct a linked list and then integrating the removeNthFromEnd method. I successfully implemented everything, and the interviewer seemed satisfied.
Finally, for a problem similar to LeetCode 503, 'Next Greater Element II', the interviewer presented a twisted version where the array was not circular for the last elements, requiring a modified approach. I provided a C++ solution for this problem.
Interview Questions (3)
The problem was similar to LeetCode 1203, Sort Items by Groups Respecting Dependencies, but included additional twisted criteria not specified here. I discussed the approach and attempted to code it, but I couldn't pass all test cases.
Given the problem to remove the Nth node from the end of a linked list (similar to LeetCode 19), I was required to implement the entire solution from scratch, including the main function to construct a linked list and then integrate the removeNthFromEnd method. I successfully wrote the complete code, and the interviewer was satisfied.
The problem was a modified version of LeetCode 503, Next Greater Element II. Instead of a circular array, the interviewer expected a non-circular behavior for the last elements. Specifically, for input nums = [1,2,3,4,3], the expected output was [2,3,4,-1,-1] instead of [2,3,4,-1,4]. The explanation given was: 'Last element 3, there's not greater to its next (right) so it'll show -1'.