AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Razorpay
Compare
Filter interviews by
Razorpay Solution Engineer Interview Questions and Answers
Razorpay Solution Engineer Interview Experiences
2 interviews found
Aakhib S
I applied via LinkedIn and was interviewed in Jun 2023. There were 3 interview rounds.
(1 Question)
- Q1. Basic questions and project related stuff
(1 Question)
- Q1. More aboutcrestful API
Anonymous
Selected
I applied via LinkedIn and was interviewed before Feb 2023. There was 1 interview round.
(3 Questions)
- Q1. It was a Good exp
- Q2. Basic understanding of API and basic looping questions
- Q3. Palindrome, Fibonacci, all basic coding questions to understand if you have knowledge of coding language
Interview Preparation Tips
Solution Engineer Jobs at Razorpay
Top trending discussions
Interview questions from similar companies
(1 Question)
- Q1. Diff between react and jQuery
- Ans.
React is a modern JavaScript library for building user interfaces, while jQuery is a fast and concise JavaScript library for DOM manipulation.
React is component-based, promoting reusability and modularity.
React uses a virtual DOM for efficient updates, while jQuery directly manipulates the DOM.
React is declarative, making it easier to reason about the UI, while jQuery is imperative.
React is typically used for single-pa...
I was interviewed before Jan 2021.
(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 Mmatrix 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...
- Q2.
Balanced Parentheses Combinations
Given an integer
Nrepresenting 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...
(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
- 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.
- 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
- 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...
(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: ...
- 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
Round duration - 30 minutes
Round difficulty - Easy
HR round where the interviewer asked questions to know more about me.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I was interviewed before Jan 2021.
(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
trueif 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
- 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.
(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
STRconsisting 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
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I was interviewed before Jan 2021.
(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.
- 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
- 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...
(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
Ndistinct positive integers and a numberK, 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.
- 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 ...
- 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
- 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...
(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
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.
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.
Skills evaluated in this interview
I was interviewed in Jun 2017.
Interview Questionnaire
11 Questions
- Q1. How does ajax call work
- Ans.
Ajax calls allow for asynchronous communication between client and server without reloading the page.
Ajax stands for Asynchronous JavaScript and XML
Uses XMLHttpRequest object to send and receive data
Allows for partial page updates without reloading the entire page
Can handle data in various formats such as JSON, XML, HTML, and plain text
Example: $.ajax({url: 'example.com', success: function(data){console.log(data)}});
- Q2. Difference between REST and SOAP
- Ans.
REST is lightweight and uses HTTP while SOAP is XML-based and has more features.
REST uses HTTP methods like GET, POST, PUT, DELETE while SOAP uses XML messaging.
REST is stateless while SOAP can maintain state.
REST is faster and easier to use while SOAP is more secure and reliable.
REST is used for web services while SOAP is used for enterprise-level services.
Example of REST: Twitter API. Example of SOAP: Amazon Web Serv
- Q3. What is GET and POST
- Ans.
GET and POST are HTTP methods used for sending data to a server.
GET is used to retrieve data from a server
POST is used to submit data to a server
GET requests can be cached and bookmarked
POST requests are not cached and cannot be bookmarked
GET requests have length restrictions
POST requests have no length restrictions
GET requests are less secure than POST requests
- Q4. What is observer pattern
- Ans.
Observer pattern is a design pattern in which an object maintains a list of its dependents and notifies them automatically of any state changes.
Also known as publish-subscribe pattern
Used in event-driven systems
Allows loose coupling between objects
Example: A weather station broadcasts weather updates to multiple displays
Example: A stock market ticker notifies multiple investors of stock price changes
- Q5. What is singleton
- Ans.
Singleton is a design pattern that restricts the instantiation of a class to a single object.
Singleton ensures that only one instance of a class exists in the entire application.
It provides a global point of access to the instance.
Commonly used in scenarios where a single instance needs to coordinate actions across the system.
Example: Database connection manager, logger, configuration manager.
- Q6. What is immutable in java
- Ans.
Immutable in Java refers to objects whose state cannot be changed after creation.
String, Integer, and other wrapper classes are immutable in Java.
Immutable objects are thread-safe and can be shared without synchronization.
To create an immutable class, make all fields final and private, and don't provide setters.
Examples of immutable classes in Java include LocalDate, LocalTime, and LocalDateTime.
- Q7. How do you create immutable in java
- Ans.
Creating immutable in Java
Use final keyword to make variables immutable
Use private constructor to prevent object modification
Use defensive copying to prevent modification of mutable objects
Use enum to create immutable objects
Use String class to create immutable strings
- Q8. Where have you used immutable in java
- Q9. What is dependency injection
- Ans.
Dependency injection is a design pattern that allows objects to receive dependencies rather than creating them internally.
It helps to decouple the code and makes it more testable and maintainable.
It allows for easier swapping of dependencies without changing the code.
There are three types of dependency injection: constructor injection, setter injection, and interface injection.
Example: Instead of creating a database co...
- Q10. What is CORS
- Ans.
CORS stands for Cross-Origin Resource Sharing. It is a security feature implemented in web browsers to restrict access to resources from different origins.
CORS allows web servers to specify which origins are allowed to access its resources
It is implemented using HTTP headers
CORS prevents malicious websites from accessing sensitive data from other websites
Examples of resources that may be restricted by CORS include cook
- Q11. How do you overcome CORS
- Ans.
CORS can be overcome by configuring the server to allow cross-origin requests.
Configure the server to include the Access-Control-Allow-Origin header
Use JSONP (JSON with Padding) to bypass CORS restrictions
Use a proxy server to make the request on behalf of the client
Use a browser extension to disable CORS restrictions during development
Use a server-side proxy to forward requests to the target server
Interview Preparation Tips
Skills evaluated in this interview
Mohit Gupta
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
- 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 ...
Interview Preparation Tips
Experience: Simple questions
Duration: 1 hour 10 minutes
Total Questions: 3
College Name: IIT Guwahati
Skills evaluated in this interview
RAJIVTEJA NAGIPOGU
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.
- 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
- 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...
Interview Preparation Tips
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 Referral
Interview Questionnaire
13 Questions
- Q1. Which is my dream company?
- Q2. What is my biggest achievement till date?
- Ans.
My biggest achievement till date is successfully leading a team to develop and launch a new software product ahead of schedule.
Led a team of developers to create a new software product
Completed the project ahead of schedule
Received positive feedback from clients and stakeholders
- Q3. How would I handle conflicts with my team members?
- Ans.
I would address conflicts directly and respectfully, seeking to understand the root cause and find a mutually beneficial solution.
Listen actively to understand the other person's perspective
Communicate clearly and respectfully
Identify the root cause of the conflict
Brainstorm potential solutions together
Be willing to compromise and find a mutually beneficial solution
- Q4. I have saved money from a year and bought my dream bike. It is the last round of Paypal interview today. I am on my way on the bike and it breaks down in a no parking zone. Suggest a winwin situation so...
- Q5. What is success according to me?
- Ans.
Success is achieving personal goals, feeling fulfilled, and making a positive impact.
Success is subjective and can vary from person to person.
It involves setting and achieving goals, both short-term and long-term.
Feeling fulfilled and content with one's accomplishments is a key aspect of success.
Making a positive impact on others or the world can also be a measure of success.
Success is not just about material wealth or...
- Q6. I was asked to write a code snippet from my project
- Q7. Program to implement Dijkstra’s algorithm
- Ans.
Dijkstra's algorithm finds the shortest path between nodes in a graph.
Create a graph with nodes and edges
Assign a tentative distance to each node
Set the initial node as current and mark it visited
For each neighbor of the current node, calculate the tentative distance
If the tentative distance is less than the current distance, update the distance
Mark the current node as visited and select the unvisited node with the sma...
- Q8. Program to reverse a singly linked list
- Ans.
A program to reverse a singly linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
- Q9. Which algorithm would I use to sort a linked list and why? Subsequently, I was asked to explain the logic of merge sort
- Q10. Suggest as many methods as possible for finding the nth largest element in an unsorted linked list
- Ans.
Methods to find nth largest element in an unsorted linked list
Traverse the linked list and store elements in an array, sort the array and return the nth largest element
Use quickselect algorithm to find the nth largest element in O(n) time complexity
Implement a max heap and extract the nth largest element
Divide the linked list into smaller sublists and recursively find the nth largest element
Use merge sort to sort the l
- Q11. How would I explain the concept of prime number to an illiterate?
- Ans.
A prime number is a number that is divisible only by 1 and itself.
A prime number has exactly two factors: 1 and itself.
Prime numbers cannot be divided evenly by any other number.
Examples of prime numbers include 2, 3, 5, 7, 11, 13, 17, etc.
- Q12. Give a few test cases for a bank transaction
- Ans.
Test cases for a bank transaction
Transaction amount within account balance limit
Transaction amount exceeds account balance limit
Transaction to a valid account number
Transaction to an invalid account number
Transaction with correct transaction code
Transaction with incorrect transaction code
Transaction during bank working hours
Transaction outside bank working hours
- Q13. Design classes for educational institutions in a city
- Ans.
Design classes for educational institutions in a city
Identify the main entities: schools, students, teachers, courses
Create a School class with attributes like name, address, and a list of students and teachers
Create a Student class with attributes like name, age, and a list of courses
Create a Teacher class with attributes like name, specialization, and a list of courses
Create a Course class with attributes like name, ...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Razorpay Interview FAQs
Tell us how to improve this page.
Razorpay Interviews By Designations
- Razorpay Product Manager Interview Questions
- Razorpay Senior Software Engineer Interview Questions
- Razorpay Software Engineer Interview Questions
- Razorpay Senior Associate Interview Questions
- Razorpay Software Developer Interview Questions
- Razorpay Product Development Engineer Interview Questions
- Razorpay Territory Manager Interview Questions
- Razorpay Data Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Solution Architect Interview Questions
- Senior Solution Architect Interview Questions
- Solution Consultant Interview Questions
- Solution Specialist Interview Questions
- Associate Solution Lead Interview Questions
- Solution Developer Interview Questions
- AWS Solution Architect Interview Questions
- Solution Integrator Interview Questions
- Show more
Razorpay Solution Engineer Interview Process
based on 2 interviews
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
Razorpay Solution Engineer Reviews and Ratings
based on 1 review
Rating in categories
|
Analyst
100
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Junior Analyst
94
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Engineer
93
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
83
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Development Engineer
77
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
PayPal
BharatPe
BillDesk
- Home >
- Interviews >
- Razorpay Interview Questions >
- Razorpay Solution Engineer Interview Questions
