Razorpay

Round 1: Tech A DSA question was asked: Given a number 'n', find the smallest k such that all the bits of n in base k are 1. Round 2: Tech. Given an array of n integers, remove a subarray such that the sum of remaining elements is divisible by k.

4 rounds Round 1: Low Level Design (1 hour 30 min) Round 2: Hiring Manager (45 min) Round 3: High Level Design (1 hour) Round 4: Engineering Manager (1 hour)

My friends got it from Elitmus. Medium, GFG, LeetCode questions are important. For frontend, knowledge of JS is necessary. A low-level system design is a plus. Good company and great salary.