Premium Employer

i

This company page is being actively managed by Razorpay Team. If you also belong to the team, you can get access from here

Razorpay Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Razorpay Software Developer Interview Questions, Process, and Tips

Updated 22 Oct 2024

Top Razorpay Software Developer Interview Questions and Answers

  • Q1. Trapping Rain Water Problem Statement You are given a long type array/list ARR of size N , representing an elevation map. The value ARR[i] denotes the elevation of the i ...read more
  • Q2. Reverse Linked List Problem Statement Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes. Input: The ...read more
  • Q3. Middle of a Linked List You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list. If there is an o ...read more

Razorpay Software Developer Interview Experiences

4 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. LLD HLD HM rounds
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Blood relation, coding and decoding, number system , percentage

Interview Preparation Tips

Interview preparation tips for other job seekers - coding and decoding percentage ages averages

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
3
Average
Difficulty level
-
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.

Round 1 - Coding Test 

Asked to write an in memory SQL database. Time was 1.5 hours. I made the mistake of choosing C++ and writing the code to make it very flexible and extensible. This led to me not being able to complete the task in the given time.
Tip: practice LLD round in a high level language like Python or Typescript. Speed is very important.

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 mins
Round difficulty - Hard

There were questions related to DP and DFS.

 

  • Q1. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 mins
Round difficulty - Medium

At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts

  • Q1. Can you describe the process of designing an LRU Cache from scratch during your System Design Round?
  • Ans. 

    Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.

    • Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.

    • Implement methods for getting and setting key-value pairs in the cache.

    • When a new item is added to the cache, check if it exceeds the maximum capacity. I...

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
  • Q3. 

    Middle of a Linked List

    You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.

    If there is an odd number of elements, return the ...

  • Ans. 

    Return the middle element of a singly linked list, or the one farther from the head if there are even elements.

    • Traverse the linked list with two pointers, one moving twice as fast as the other

    • When the fast pointer reaches the end, the slow pointer will be at the middle

    • If there are even elements, return the one that is farther from the head node

    • Handle edge cases like linked list of size 1 or empty list

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 mins
Round difficulty - Medium

It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaGood ProjectsRazorpay interview preparation:Topics to prepare for the interview - Projects, Development, NoSQL, Data Structure, OOPS, DBMS, Algorithm.Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions 
Tip 3 : Know the complexities of the code that you’ve written.

Application resume tips for other job seekers

Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Razorpay interview questions for designations

 Software Developer Intern

 (3)

 Junior Software Developer

 (1)

 Software Engineer

 (6)

 Android Developer

 (2)

 Java Developer

 (1)

 Senior Software Engineer

 (7)

 Software Development Engineer

 (3)

 Front end Developer

 (2)

Interview questions from similar companies

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.

  • Q1. 

    Minimum Cost Path Problem Statement

    Given an N x M matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y) and ends at the top left corner of t...

  • Ans. 

    The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.

    • Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.

    • Consider the three possible moves: down, right, and down-right diagonal.

    • Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.

    • Finally, the mini...

  • Answered by AI
  • Q2. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use backtracking to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Character Counting Challenge

    Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...

  • Ans. 

    Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.

    • Read characters from input stream until '$' is encountered

    • Count lowercase alphabets, digits, and white spaces separately

    • Print the counts of each character type as three integers separated by spaces

  • Answered by AI
  • Q2. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Find K largest elements in an unsorted array and return them in non-decreasing order.

    • Sort the array in non-decreasing order.

    • Return the last K elements of the sorted array.

  • Answered by AI
  • Q3. How can you check whether you have an internet connection on your system?
  • Ans. 

    To check internet connection on a system, you can use various methods like pinging a website or checking network status.

    • Use ping command to check connectivity to a website (e.g. ping www.google.com)

    • Check network status using network settings or command line tools

    • Try accessing a website or online service to verify internet connection

  • Answered by AI
  • Q4. What happens when you type a URL in a web browser?
  • Ans. 

    When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.

    • Browser checks cache for DNS resolution

    • If not found, browser sends a DNS query to resolve the domain name to an IP address

    • Browser establishes a TCP connection with the server

    • Browser sends an HTTP request to the server for the webpage

    • Server processes the...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Counting Sort Problem Statement

    Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?

    Example:

    Input:
    ...
  • Ans. 

    Implement counting sort algorithm to sort an array of integers without comparisons.

    • Count the frequency of each element in the input array.

    • Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.

    • Place each element in its correct position based on the prefix sum.

    • Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.

    • Example: ...

  • Answered by AI
  • Q2. What are the applications of the Fibonacci series in real life?
  • Ans. 

    The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.

    • Used in algorithms for optimization problems and dynamic programming.

    • Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.

    • Applied in financial markets for predicting stock prices and analyzing market trends.

    • Utilized in art and design for creating

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round where the interviewer asked questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

  • Q1. 

    Subset Sum Equal To K Problem Statement

    Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    Provide true if such a subset exists, otherwise r...

  • Ans. 

    Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    • Use dynamic programming to solve this problem efficiently

    • Create a 2D array to store if a subset with a particular sum exists

    • Iterate through the array and update the 2D array accordingly

    • Check if the value at the end of the iteration is true for the given K

  • Answered by AI
  • Q2. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Use a queue to keep track of visited nodes and their neighbors.

    • Ensure to print the traversal sequence in the correct order.

    • Handle disconnected components by checking for unvisited nodes.

    • Follow the BFS approach of exploring neighbors before moving to the next level.

  • Answered by AI
Round 2 - HR 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

  • Q1. 

    Replace Spaces in a String

    Given a string STR consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".

    Input:

    The first line contains an integ...
  • Ans. 

    Replace spaces in a string with '@40'.

    • Iterate through each character in the string

    • Replace spaces with '@40'

    • Return the modified string

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview Round with questions based on Data structures, OOPS and SQL.

  • Q1. 

    Delete a Node from a Linked List

    You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.

    Input:

    The first line co...
  • Ans. 

    Implement a function to delete a node from a linked list at a specified position.

    • Traverse the linked list to find the node at the specified position.

    • Update the pointers of the previous and next nodes to skip the node to be deleted.

    • Handle edge cases such as deleting the head or tail of the linked list.

    • Ensure to free the memory of the deleted node to avoid memory leaks.

  • Answered by AI
  • Q2. Write an SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the ORDER BY clause to sort salaries in descending order

    • Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries

    • Combine the above steps in a single query to find the nth highest salary

  • Answered by AI
  • Q3. Can you explain the concepts of Object-Oriented Programming (OOP)?
  • Ans. 

    OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.

    • OOP focuses on creating objects that interact with each other to solve problems.

    • Key concepts include encapsulation, inheritance, and polymorphism.

    • Encapsulation involves bundling data and methods that operate on the data into a single unit.

    • Inheritance allows classes to inherit at...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site­ like the one satyam has.

  • Q1. 

    Kth Largest Element Problem

    Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

    Example:

    Input:
    N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order and return the Kth element.

    • Handle multiple test cases efficiently.

    • Ensure all elements in the array are distinct.

  • Answered by AI
  • Q2. What are virtual functions?
  • Ans. 

    Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.

    • Virtual functions are declared in a base class with the 'virtual' keyword.

    • They are overridden in derived classes using the 'override' keyword.

    • They allow a function to be called based on the runtime type of an object.

    • Virtual functions enable dynamic binding and late binding in C++.

    • Example: virtual void ...

  • Answered by AI
  • Q3. Design a Cinema Ticket Reservation System.
  • Ans. 

    Design a Cinema Ticket Reservation System

    • Use a database to store movie information, showtimes, and seat availability

    • Allow users to search for movies, select showtimes, and choose seats

    • Implement a payment system for ticket purchases

    • Send confirmation emails with QR codes for ticket validation

  • Answered by AI
  • Q4. In how many attempts can you find a defective ball among 10 given balls using a two-pan balance scale?
  • Ans. 

    You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.

    • Divide the 10 balls into two groups of 5 each.

    • Weigh the two groups on the balance scale.

    • If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.

    • Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.

    • Weigh the two groups on the bala...

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.

  • Q1. Can you tell me about your projects and your extracurricular activities?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Dec 2017.

Interview Questionnaire 

3 Questions

  • Q1. You need to find the maximum water pond formed in bw the building
  • Ans. 

    To find the maximum water pond formed between buildings.

    • Identify the lowest point between the buildings.

    • Calculate the area of the pond using the distance between the buildings and the depth of the pond.

    • Consider any obstacles or uneven ground that may affect the pond's shape.

    • Use a surveying tool or satellite imagery to get accurate measurements.

    • Take into account any drainage systems or natural water flow that may affect

  • Answered by AI
  • Q2. On mars you have to place n robots and they are connected via GPS. now you need to move each robot such that the whole mars is visited and each robot visit the minimum area(meaning no overlapping of area)...
  • Q3. Design dictionary using trie....having operations of inserting a word, updating and deleting (needed to write full running code)
  • Ans. 

    Design a dictionary using trie with insert, update and delete operations.

    • Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word

    • For insert operation, traverse the trie and add nodes for each character in the word

    • For update operation, delete the existing word and insert the updated word

    • For delete operation, mark the end of word flag as false and delete the node if it ...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Simple questions
Duration: 1 hour 10 minutes
Total Questions: 3

College Name: IIT Guwahati

Skills evaluated in this interview

Software Developer Interview Questions & Answers

PayPal user image RAJIVTEJA NAGIPOGU

posted on 3 Dec 2016

I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.

Interview Questionnaire 

6 Questions

  • Q1. Given an array of numbers find the subset of numbers that give zero sum.
  • Ans. 

    Find subset of numbers in array that sum up to zero.

    • Use a nested loop to iterate through all possible subsets.

    • Calculate the sum of each subset and check if it equals zero.

    • Store the subset if the sum is zero.

    • Optimize the solution by using a hash set to store the cumulative sum of elements.

  • Answered by AI
  • Q2. Explain how bfs works?
  • Ans. 

    BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.

    • BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.

    • It uses a queue data structure to keep track of the vertices to be visited.

    • BFS guarantees that it visits all the vertices of a connected graph.

    • It can be used to find the shortest path between two

  • Answered by AI
  • Q3. Discussion on the projects I have done.
  • Q4. Question on Linked List.
  • Q5. Project Discussion
  • Q6. Strengths and weaknesses. Where do you see yourself in 5 years?
  • Ans. 

    In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.

    • Continuously improving my technical skills through learning and hands-on experience

    • Taking on leadership roles and mentoring junior developers

    • Contributing to the development of cutting-edge software solutions

    • Building strong relationships with clients and stakeholders

    • Staying updated with the latest indu...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

Round: Technical + HR Interview
Experience: I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

College Name: IIT Madras

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: Aptitude questions were logical, not tough. For coding, one question, not basic but very logical.
Tips: for coding part try practicing on hackerrank.
Duration: 45+30 minutes
Total Questions: 20+1

Round: Technical Interview
Experience: Interviewer asked all about Linked list and Data structures and algorithm.
Tips: Atleast try learning some basic concepts of linked list, stacks, queues and binary tree.

General Tips: Interview was fair, without any partiality for girls/boys or B.Tech/Dual.
Skill Tips: Be confident and reply frankly. Never let them know that you are nervous.
Skills: Confidence
Duration: 2.5
College Name: IIT Madras
Funny Moments: "Lets go for a walk". HR interviewer will take you for a round to ask you HR questions.

Please prepare for two questions "Tell me something about you" and "Why PayPal, why not any other company".
Contribute & help others!
anonymous
You can choose to be anonymous

Razorpay Interview FAQs

How many rounds are there in Razorpay Software Developer interview?
Razorpay interview process usually has 1 rounds. The most common rounds in the Razorpay interview process are Coding Test, Aptitude Test and Technical.

Recently Viewed

INTERVIEWS

Truedge Software Solutions

No Interviews

INTERVIEWS

Slice

No Interviews

DESIGNATION

INTERVIEWS

eTouch - Virtusa

No Interviews

JOBS

Juniper Networks

No Jobs

DESIGNATION

SALARIES

Accentuate Technology

INTERVIEWS

Well Point IT Solutions

No Interviews

DESIGNATION

SALARIES

Juniper Networks

Tell us how to improve this page.

Razorpay Software Developer Interview Process

based on 4 interviews

Interview experience

4
  
Good
View more
Join Razorpay Revolutionize the FinTech space with groundbreaking solutions
Razorpay Software Developer Salary
based on 74 salaries
₹7 L/yr - ₹26 L/yr
80% more than the average Software Developer Salary in India
View more details

Razorpay Software Developer Reviews and Ratings

based on 11 reviews

3.6/5

Rating in categories

3.3

Skill development

3.4

Work-life balance

3.5

Salary

3.1

Job security

3.1

Company culture

2.5

Promotions

2.9

Work satisfaction

Explore 11 Reviews and Ratings
Analyst
100 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
95 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Junior Analyst
94 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
83 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer
77 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Razorpay with

Paytm

3.3
Compare

PayPal

3.9
Compare

BharatPe

3.5
Compare

BillDesk

3.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent