I had a very unpleasant interview experience at Coinswitch. The first round was dedicated to Data Structures and Algorithms, where I was given two medium-level LeetCode questions. I managed to solve and run both problems successfully. Although further interviews were initially scheduled for the same day, I later received an email after the first round indicating that they were proceeding with other candidates. My subsequent attempts to obtain proper feedback were unfortunately met with silence, making it a truly frustrating experience.

I applied for the SDE 1 position at CoinSwitch Kuber after seeing a posting on LinkedIn. Shortly after applying, I received a link to complete a Hackerearth Online Assessment. This assessment included three medium-hard questions: one based on Dijkstra's Shortest Path Algorithm, another on Tree Traversal, and a third one that I couldn't recall. I managed to complete the first question and partially complete the second.

A few days later, a recruiter contacted me, informing me that there would only be two interview rounds: one focused on Data Structures & Algorithms (DSA) and one HR round.

My Round 1 (Problem Solving) lasted for 1 hour. We discussed two main problems:

1. The first question involved a grid of m*n size, and I had to calculate the number of ways to move from the top-left corner to the bottom-right corner, only being allowed to move down and right. This was a straightforward Dynamic Programming problem.
2. The second problem presented a sorted array containing both negative and positive numbers. The task was to square all the numbers and return them in a sorted format. For example, given [-5, -3, 0, 1, 4], the expected output was [0, 1, 9, 16, 25]. I first proposed a brute-force solution involving squaring all numbers and then sorting the array, which would have an O(n log n) complexity. The interviewer prompted me for a more optimized solution. I then suggested an approach where I stored negative and positive numbers in separate arrays, squared them individually, and then merged these two already sorted lists, achieving O(n) complexity. They pushed for even further optimization to use constant space, and while I was able to explain the approach using binary search and a two-pointer technique, there wasn't enough time to implement it. They seemed content with my approach.

Next was Round 2 (HR Round), which lasted for 30 minutes. This round primarily involved discussions about my current company and the projects I had worked on. I had to explain my projects in considerable detail. Additionally, I was asked to explain the database systems used by Google Sheets.

A few days following the interviews, I was extended an offer.