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

Razorpay Front end Developer Interview Questions and Answers

Updated 27 Nov 2024

Razorpay Front end Developer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Oct 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Was asked to create a UI component keeping in mind scalability and reuseability.

Round 2 - Coding Test 

General discussion about resume and projects, and then some basic JS coding questions like implement throttling and memoization.

Round 3 - Behavioral 

(3 Questions)

  • Q1. Discussion about past experiences and projects
  • Q2. Why you want to leave current job.
  • Q3. Expectations from the role and company

Interview Preparation Tips

Topics to prepare for Razorpay Front end Developer interview:
  • Javascript
  • React.Js
Interview preparation tips for other job seekers - Feedback from HR was very quick, all rounds were scheduled in quick succession. Although one point, HR did not confirm availability before scheduling the interviews. Also didn't get any feedback after getting rejected.
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed before Oct 2023. There were 3 interview rounds.

Round 1 - Coding Test 

It was on hackerrank, it was given to solve 3 questions in JS along with quiz on js concepts

Round 2 - Coding Test 

It was a js fundamental round, was asked similar JS problems asked in the hackerrank test

Round 3 - Technical 

(4 Questions)

  • Q1. Describe your favourite/last project
  • Ans. 

    Developed a responsive e-commerce website for a local boutique selling handmade jewelry

    • Used HTML, CSS, and JavaScript to create a visually appealing and user-friendly interface

    • Implemented a product carousel to showcase different jewelry collections

    • Integrated a payment gateway for secure online transactions

  • Answered by AI
  • Q2. How to keep your updated in tech
  • Ans. 

    Stay updated by regularly reading tech blogs, attending conferences, taking online courses, and networking with other professionals.

    • Read tech blogs regularly (e.g. TechCrunch, Mashable)

    • Attend tech conferences and workshops

    • Take online courses and tutorials (e.g. Udemy, Coursera)

    • Network with other professionals in the field (e.g. LinkedIn, Meetup)

  • Answered by AI
  • Q3. Do you try every new framework comes in the market
  • Ans. 

    I do not try every new framework that comes in the market, but I do stay updated on the latest trends and evaluate them based on project requirements.

    • I prioritize learning frameworks that align with the project needs

    • I assess the pros and cons of new frameworks before deciding to use them

    • I stay updated on industry trends and experiment with new frameworks in personal projects

  • Answered by AI
  • Q4. How will you optimise a code
  • Ans. 

    Optimizing code involves identifying and fixing bottlenecks to improve performance and efficiency.

    • Identify and remove unnecessary code or functions

    • Use efficient algorithms and data structures

    • Minimize network requests and optimize asset loading

    • Implement caching mechanisms

    • Profile and analyze code performance

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Razorpay Front end Developer interview:
  • promises
  • Javascript
  • closures
  • call bind apply
  • web optimisation
Interview preparation tips for other job seekers - Razorpay interviews are easy to clear if your basis concepts are right.

Skills evaluated in this interview

Front end Developer Interview Questions Asked at Other Companies

Q1. Non-Decreasing Array Problem Statement Given an integer array ARR ... read more
Q2. Find Unique Element in Array You have been provided an integer ar ... read more
asked in JUSPAY
Q3. Dijkstra's Shortest Path Problem Statement You are given an undir ... read more
asked in JUSPAY
Q4. Encode N-ary Tree to Binary Tree Problem Statement You are provid ... read more
Q5. Sort Linked List Based on Actual Values You are given a Singly Li ... read more

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Not Selected

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

Round 1 - Technical 

(3 Questions)

  • Q1. Closures, setTimeout, Eventloop in javascript
  • Q2. How to center a div in css3
  • Ans. 

    To center a div in CSS3, use the 'margin: auto;' property along with a set width.

    • Set the width of the div

    • Use 'margin: auto;' to center the div horizontally

    • Make sure the parent container has a defined width

  • Answered by AI
  • Q3. Call , bind and apply functions in javascript
  • Ans. 

    call, bind, and apply are methods used to manipulate the context of a function in JavaScript.

    • call() is used to invoke a function with a specified 'this' value and arguments provided individually.

    • bind() is used to create a new function with a specified 'this' value and initial arguments.

    • apply() is used to invoke a function with a specified 'this' value and arguments provided as an array.

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. Expected salery

I was interviewed in Aug 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Easy

1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.

  • Q1. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.

    • Implement a doubly linked list to keep track of the order of keys based on their recent usage.

    • Use a hashmap to store key-value pairs for quick access and updates.

    • When capacity is reached, evict the least recently used item before inserting a new one.

    • Update the order of keys in the linked list whenever a ke

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?

  • Q1. 

    String Palindrome Verification

    Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.

    Input:

    The input is a single string without any leading or trailing...
  • Ans. 

    Check if a given string is a palindrome considering only alphanumeric characters.

    • Remove non-alphanumeric characters from the input string.

    • Compare the string with its reverse to check for palindrome.

    • Handle edge cases like empty string or single character input.

    • Use two pointers approach for efficient comparison.

  • Answered by AI
  • Q2. DBMS Questions

    normalization, indexing

  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Indexing is a technique to quickly retrieve data from a database.

    • Normalization helps in reducing data redundancy by breaking down tables into smaller, related tables.

    • Indexing is used to quickly retrieve data by creating indexes on columns in a table.

    • Normalization ensures data integrity by minimizing data dupli...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Hard

late at 8.00 pm

  • Q1. 

    Priority CPU Scheduling Problem

    Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...

  • Ans. 

    Implement Priority CPU Scheduling algorithm to compute waiting time and turn-around time for processes.

    • Implement a function that takes in burst times, priorities, and number of processes as input

    • Sort the processes based on priority, with lower process ID as tiebreaker

    • Calculate waiting time and turn-around time for each process based on the scheduling algorithm

  • Answered by AI
  • Q2. Can you explain the concept of data spooling in operating systems?
  • Ans. 

    Data spooling is a process where data is temporarily stored in a buffer before being sent to an output device.

    • Data spooling helps in managing the flow of data between different devices by storing it temporarily.

    • It allows for efficient processing of data by decoupling the input/output operations.

    • Examples of data spooling include print spooling, where print jobs are stored in a queue before being sent to the printer.

  • Answered by AI
  • Q3. What is the difference between inheritance and generalization in the context of database management systems?
  • Ans. 

    Inheritance is a relationship between a superclass and subclass, while generalization is a relationship between entities with common characteristics.

    • Inheritance involves a parent-child relationship where the child class inherits attributes and methods from the parent class.

    • Generalization involves grouping entities with common attributes into a higher-level entity.

    • Inheritance is a specific form of generalization in obje...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Frontend Developer in GurgaonEligibility criteriaabove 8 CGPAPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - DATA STRUCTURES, OOPS, DBMS, NETWORKING, ALGORITHMSTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : be confident
Tip 2 : make sure to talk less
Tip 3 : give precise answer

Application resume tips for other job seekers

Tip 1 : mention only relevant things
Tip 2 : be precise

Final outcome of the interviewRejected

Skills evaluated in this interview

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

Razorpay Interview FAQs

How many rounds are there in Razorpay Front end Developer interview?
Razorpay interview process usually has 3 rounds. The most common rounds in the Razorpay interview process are Coding Test, Technical and Behavioral.
What are the top questions asked in Razorpay Front end Developer interview?

Some of the top questions asked at the Razorpay Front end Developer interview -

  1. Do you try every new framework comes in the mar...read more
  2. How to keep your updated in t...read more
  3. How will you optimise a c...read more

Tell us how to improve this page.

Razorpay Front end Developer Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more
Join Razorpay Revolutionize the FinTech space with groundbreaking solutions

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 747 Interviews
PhonePe Interview Questions
4.0
 • 297 Interviews
PayPal Interview Questions
3.9
 • 206 Interviews
HighRadius Interview Questions
2.9
 • 182 Interviews
Fiserv Interview Questions
3.0
 • 172 Interviews
Visa Interview Questions
3.5
 • 138 Interviews
Angel One Interview Questions
3.9
 • 135 Interviews
MasterCard Interview Questions
3.9
 • 134 Interviews
Revolut Interview Questions
2.5
 • 95 Interviews
View all
Razorpay Front end Developer Salary
based on 20 salaries
₹10.1 L/yr - ₹34.5 L/yr
252% more than the average Front end Developer Salary in India
View more details

Razorpay Front end Developer Reviews and Ratings

based on 2 reviews

4.6/5

Rating in categories

4.0

Skill development

4.6

Work-life balance

4.6

Salary

4.6

Job security

5.0

Company culture

5.0

Promotions

3.4

Work satisfaction

Explore 2 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