Company :- CoinSwitch Kuber
Location :- Bangalore
YOE :- 1 year 3 months
Education :- B.Tech. from Tier 2 College
Compensation Details
Fixed :- 20 LPA
Joining Bonus :- 2 Lakhs (if you could join within 45 days) I was not able to get this bonus
Relocation Bonus :- 75,0000
Stocks :- 8 Lakhs vested over 4 years
Experience
Applied using LinkedIn, saw a posting there and applied
After Applying, I got a link to Hackerearth Online Assessment,
There were 3 Medium-Hard Questions
- Based on Dijsktra Shortest Path Algorithm
- Based on Tree Traversal
Don't remember the third one
I completed the first one and partially completed the second one.
Got a call from Recruiter after few days, He told me there are going to be 2 rounds only ( one DSA and one HR)
Round 1 ( Problem Solving, 1 hour)
- Given a grid of m*n size, calculate the number of ways to move from top left corner to bottom right corner if you can only move in down and right direction. ( Simple DP question)
- Given a sorted array of negative and positive numbers, square all of them and give the output in sorted format
- the brute force solution is to square all numbers and sort the array ( Complexity ==> nlogn ). They wanted more optimized solution.
- I stored all the negative numbers and positive numbers in different arrays and squared them separatley, then merged those 2 sorted lists(since positive and negative number arrays are already sorted) (Complexity ==> O(n))
- They wanted it to optimize it more to use constant space, I was able to give them the approach( binary search + two pointer) but there was no time to implement, they were fine with it.
Ex. input [-5, -3, 0, 1, 4 ] , Expected output [0, 1, 9, 16, 25]
Round 2 ( HR Round, 30 minutes)
Discussion based on my current company and projects.
Had to explain things in detail for my project.
Explain database systems used by Google sheets.
I was extended the offer a few days later.
Note: My first post, don't mind the decoration of the post that I have not done😂😂😂