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 SDE-2 Interview Questions and Answers

Updated 3 Mar 2023

Razorpay SDE-2 Interview Experiences

1 interview found

SDE-2 Interview Questions & Answers

user image Anonymous

posted on 3 Mar 2023

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

I applied via Hirist and was interviewed in Feb 2023. There were 6 interview rounds.

Interview Preparation Tips

Interview preparation tips for other job seekers - They don't ask DSA so focus on core android and you are good-to-go

Rate your
company

🤫 100% anonymous

How was your last interview experience?

Share interview

Interview questions from similar companies

SDE-2 Interview Questions & Answers

PayPal user image Anonymous

posted on 17 May 2022

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

There will be 2 coding questions easy to medium based on DP and linkedlist.

  • Q1. 

    Count Ways To Reach The N-th Stair Problem Statement

    You are given a number of stairs, N. Starting at the 0th stair, you need to reach the Nth stair. Each time you can either climb one step or two steps. ...

  • Ans. 

    The problem involves finding the number of distinct ways to climb to the N-th stair by taking one or two steps at a time.

    • Use dynamic programming to solve this problem efficiently.

    • The number of ways to reach the N-th stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle large inputs by taking modulo 10^9+7 of the result.

    • Example: For N=3, there are 3 ways to climb to the third sta

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

the questions will be be based on trees, linked list and stacks and queues, DP

  • Q1. 

    Left View of a Binary Tree

    Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.

    Inpu...

  • Ans. 

    The task is to print the left view of a binary tree, which contains the nodes visible when the tree is viewed from the left side.

    • Traverse the tree level by level and keep track of the leftmost node at each level

    • Use a queue for level order traversal and a map to store the leftmost nodes

    • Print the values of the leftmost nodes stored in the map as the left view of the tree

  • Answered by AI
  • Q2. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Ans. 

    The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.

    • Use a stack to keep track of elements for which the next greater element is not found yet.

    • Iterate through the array from right to left and pop elements from the stack until a greater element is found.

    • Store the next greater element for each element in a separate array.

    • If the stack is empty afte...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

(DSA, work experience and personal projects)

  • Q1. 

    Problem: Sort an Array of 0s, 1s, and 2s

    Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.

    Input:

    The input sta...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in increasing order.

    • Use a three-pointer approach to partition the array into sections of 0s, 1s, and 2s.

    • Iterate through the array and swap elements based on their values to achieve the sorting.

    • Time complexity should be O(N) where N is the number of elements in the array.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

It started in the afternoon after the lunch.

  • Q1. You will be given certain conditions for which you need to design a system. Can you explain your approach to low-level system design?
  • Ans. 

    Approach to low-level system design involves understanding requirements, breaking down components, defining interfaces, and optimizing performance.

    • Understand the requirements and constraints of the system

    • Break down the system into smaller components/modules

    • Define clear interfaces between components for communication

    • Optimize performance by considering data structures, algorithms, and resource utilization

  • Answered by AI
Round 5 - HR 

(1 Question)

Round duration - 25 minutes
Round difficulty - Easy

Once all the rounds were cleared. I was told that i have 1 more round with manager.

  • Q1. How do you handle critical situations in a workplace?
  • Ans. 

    I remain calm, assess the situation, prioritize tasks, communicate effectively, and collaborate with team members to find a solution.

    • Remain calm and composed under pressure

    • Assess the situation to understand the root cause

    • Prioritize tasks based on urgency and impact

    • Communicate effectively with team members and stakeholders

    • Collaborate with team members to brainstorm and implement solutions

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Babu Banarasi Das University. I applied for the job as SDE - 2 in ChennaiEligibility criteria2 years of experience.Paypal interview preparation:Topics to prepare for the interview - Arrays, Hashmap, String, LinkedList, Stacks and queues, recursion, DP, Backtracking, graphTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : If you are good with any programming Language(Java and C++ preferred but again its your choice) start with DSA directly. Learn the basic Arrays, Linked List, Stacks, Queues, Trees, Hashing, Graphs, Dynamic programming, Heaps, searching and sorting. (PS:-Courses and resources i will not mention as there are many materials available just choose the one you like and start preparing!!)

Tip 2 : Once you feel OK start practising problems try to solve by yourself, if not take hints, and at the end you can check solution if still unsolved.

Tip 3 : Try to connect with people on linkedin. Try to know the techstacks and try to get referrals. Keep on applying once feel ready 80% because you are never 100% ready for anything.

Application resume tips for other job seekers

Tip 1 : Keep your resume updated with all the tech stacks you worked on, your projects, your latest experience.
Tip 2 : The resume need to be short and crisp. it takes only a min. For HR to read your resume. and align it with job requirement.

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

PayPal user image Anonymous

posted on 21 May 2022

I appeared for an interview before May 2021.

Round 1 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

Problem-solving round in javascript.
Asked me questions of easy to medium level data structures and algorithm.

  • Q1. 

    Similar String Groups Problem Statement

    Two strings S1 and S2 are considered similar if either S1 equals S2 or we can swap two letters of S1 at different positions so that it equals S2.

    Input:

    The first...
  • Ans. 

    The problem involves determining the number of similar string groups in a given list of strings based on a specific criteria.

    • Iterate through each pair of strings in the list and check if they are similar based on the given criteria.

    • Use a hash set to keep track of visited strings to avoid counting duplicates in the same group.

    • Consider implementing a function to check if two strings are similar by allowing at most one sw...

  • Answered by AI
Round 2 - Video Call 

Round duration - 50 minutes
Round difficulty - Medium

Javascrip specific questions

Round 3 - HR 

Round duration - 50 minutes
Round difficulty - Easy

Focussed on behavioural aptitude

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in BangaloreEligibility criteriaNo criteriaPaypal interview preparation:Topics to prepare for the interview - JavaScript, ReactJS, Redux, DS, Algorithms.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare the concepts of JavaScript and react thoroughly
Tip 2 : Practice using projects
Tip 3 : Practice data structure and algorithms and practice there questions

Application resume tips for other job seekers

Tip 1 : Use keywords in technologies where you want to be shortlisted in
Tip 2 : Do not put false things in your resume

Final outcome of the interviewSelected

SDE-2 Interview Questions & Answers

PayPal user image Anonymous

posted on 25 May 2022

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Medium

There were 2 coding questions. One was easy to medium difficult and other was of medium difficulty.

  • Q1. 

    Sum Queries in a Sorted Array

    Given two arrays arr and queries, your task is to determine the sum of all elements in arr that are less than or equal to each element in queries. The array arr is provided i...

  • Ans. 

    Find sum of elements in a sorted array less than or equal to each element in queries.

    • Iterate through queries and for each query, find the sum of elements in arr less than or equal to the query element.

    • Use binary search to efficiently find the index of the last element less than or equal to the query element.

    • Keep track of cumulative sum while iterating through arr to avoid recalculating sums.

    • Return the list of sums for

  • Answered by AI
  • Q2. 

    Find K Closest Elements

    Given a sorted array 'A' of length 'N', and two integers 'K' and 'X', your task is to find 'K' integers from the array closest to 'X'. If two integers are at the same distance, pre...

  • Ans. 

    Given a sorted array, find K integers closest to X, preferring smaller ones in case of same distance.

    • Use binary search to find the closest element to X in the array.

    • Maintain two pointers to expand around the closest element to find K closest elements.

    • Compare distances and values to select the K closest elements, preferring smaller ones if distances are equal.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Reverse Only Letters Problem Statement

    You are given a string S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.

    Example:

    Input:
    S = "...
  • Ans. 

    Reverse the letters of a string while keeping non-alphabet characters in their original position.

    • Iterate through the string and store the non-alphabet characters in their original positions.

    • Reverse the letters of the string using two pointers approach.

    • Combine the reversed letters with the non-alphabet characters to get the final reversed string.

  • Answered by AI
  • Q2. 

    Find The Sum Of The Left Leaves Problem Statement

    Given a binary tree with ‘root’, your task is to find and return the sum of all the left leaf nodes.

    Example:

    Input:
    1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1...
  • Ans. 

    Find and return the sum of all the left leaf nodes in a binary tree.

    • Traverse the binary tree using depth-first search (DFS)

    • Check if a node is a leaf node and a left child

    • Sum up the values of all left leaf nodes

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 Minutes
Round difficulty - Easy

Questions related to Java, OOPs, SQL etc. 

Round 4 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

It was an HR round.Questions related to resume, Low level design, work experience, behavioural etc. This round stretched more than scheduled time so another round was scheduled which was again a DSA based technical round.

Round 5 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 3 problems. easy, medium and hard.

  • Q1. 

    Median of Two Sorted Arrays

    Given two sorted arrays A and B of sizes N and M, find the median of the merged array formed by combining arrays A and B. If the total number of elements, N + M, is even, the m...

  • Ans. 

    Find the median of two sorted arrays by merging them and calculating the median of the combined array.

    • Merge the two sorted arrays into one sorted array.

    • Calculate the median of the combined array based on the total number of elements.

    • Return the median as the result.

  • Answered by AI
  • Q2. 

    Palindrome Checker Problem Statement

    Given an alphabetical string S, determine whether it is a palindrome or not. A palindrome is a string that reads the same backward as forward.

    Input:

    The first line ...
  • Ans. 

    Check if a given string is a palindrome or not.

    • Iterate through the string from both ends and compare characters.

    • If all characters match, return 1 indicating a palindrome.

    • If any characters don't match, return 0 indicating not a palindrome.

  • Answered by AI
  • Q3. 

    Minimum Character Deletion Problem Statement

    You have been provided a string STR. Your task is to find and return the minimum number of characters that need to be deleted from STR so that each character's...

  • Ans. 

    Find the minimum number of character deletions needed to make each character's frequency unique in a given string.

    • Iterate through the string and count the frequency of each character.

    • Identify characters with the same frequency and calculate the minimum deletions needed to make them unique.

    • Return the total minimum deletions for each test case.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Mechanical Engineering from King Khalid University. I applied for the job as SDE - 2 in BengaluruEligibility criteriaNo CirteriaPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating System, DBMS, Computer Network, OOPS, System Design (HLD/LLD)Time required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practice Daily. Consistency is the key
Tip 2 : Try to do at least 5 questions daily (LC, gfg, etc any platform u are comfortable with)
Tip 3 : Have some projects on resume related to the tech stack you want to work with.

Application resume tips for other job seekers

Tip 1 : Have some projects on resume.
Tip 2 : Be prepared with in depth questions on whatever is written on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

Paytm user image Anonymous

posted on 17 May 2022

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

Anytime

  • Q1. 

    Problem: Sort an Array of 0s, 1s, and 2s

    Given an array/list ARR consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.

    Input:

    The input sta...
  • Ans. 

    The task is to sort an array of 0s, 1s, and 2s in increasing order.

    • Use a three-pointer approach to partition the array into three sections: 0s, 1s, and 2s.

    • Initialize three pointers: low, mid, and high. low points to the start of the array, mid points to the current element being processed, and high points to the end of the array.

    • While mid <= high, if ARR[mid] is 0, swap ARR[low] and ARR[mid], increment low and mid. If

  • Answered by AI
  • Q2. 

    Connect Ropes with Minimum Cost

    Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...

  • Ans. 

    The task is to connect N ropes into one rope with minimum cost.

    • Sort the array of rope lengths in ascending order.

    • Initialize a variable to keep track of the total cost.

    • While there are more than one rope, take the two shortest ropes and connect them.

    • Add the cost of connecting the two ropes to the total cost.

    • Replace the two shortest ropes with the connected rope.

    • Repeat the above steps until only one rope remains.

    • Return th

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.

    Example of Sub...

  • Ans. 

    The task is to find the maximum possible sum of a non-empty subarray of an array.

    • Iterate through the array and keep track of the maximum sum encountered so far

    • If the current element is greater than the sum so far, start a new subarray

    • If the current element plus the sum so far is greater than the maximum sum, update the maximum sum

    • Return the maximum sum

  • Answered by AI
  • Q2. 

    Diameter of a Binary Tree Problem Statement

    Given a binary tree, return the length of its diameter. The diameter of a binary tree is defined as the length of the longest path between any two nodes in the ...

  • Ans. 

    The diameter of a binary tree is the length of the longest path between any two end nodes in the tree.

    • The diameter of a binary tree can be calculated by finding the maximum of the following three values: 1) the diameter of the left subtree, 2) the diameter of the right subtree, and 3) the longest path that passes through the root node.

    • To find the diameter of a binary tree, we can use a recursive approach where we calcu...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

This round was more aroung sytem design and my past work experience.

  • Q1. Can you describe the system design for a platform like BookMyShow and the questions that were raised during the discussion?
  • Ans. 

    Design a bookmyshow system

    • Design a system to book and manage movie tickets

    • Consider features like seat selection, payment, and ticket cancellation

    • Include user authentication and authorization

    • Implement a database to store movie and theater information

    • Consider scalability and performance of the system

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This is non-tech round.They just want to check your nature ,attitude and team work skills.

  • Q1. Why do you want to leave your current job and what are your thoughts on the CTC being offered?
  • Ans. 

    I want to leave my current job for better growth opportunities and a more challenging role.

    • Seeking new challenges and opportunities for professional growth

    • Looking for a role that aligns better with my skills and interests

    • Desire to work in a more dynamic and innovative environment

    • Seeking better compensation and benefits

    • Wanting to expand my knowledge and skills in a different domain

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 2 in NoidaEligibility criteriaFor SDE-2 the minium 2 year of work experience was required.Paytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - DSA, Trees and Graphs, System Design, LLD, OOPSTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Pratice DSA and focus on the core subject like Database and OS
Tip 2 : Practice atlest 2 question everday to maintain consistency.

Application resume tips for other job seekers

Tip 1 : Crisp Resume : Every body knows about this step, you must create a crisp resume mentioning about your key skills, always add impact numbers if possible (for example : increased efficiency by 50%, reduced cost by 2X, etc.) Add keywords around your skills, highlight them using BOLD in resume. 
Tip 2 : Use Linkedin : Send connections requests directly to the recruiters rather than asking for referrals.

Final outcome of the interviewSelected

Skills evaluated in this interview

SDE-2 Interview Questions & Answers

PayPal user image Anonymous

posted on 4 Aug 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Aug 2023. There were 4 interview rounds.

I appeared for an interview 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 appeared for an interview 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 appeared for an interview 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 appeared for an interview 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)}});

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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...

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI

Interview Preparation Tips

Skills: Java Programming

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Razorpay Interview FAQs

How many rounds are there in Razorpay SDE-2 interview?
Razorpay interview process usually has 6 rounds. The most common rounds in the Razorpay interview process are Technical, Resume Shortlist and Assignment.
What are the top questions asked in Razorpay SDE-2 interview?

Some of the top questions asked at the Razorpay SDE-2 interview -

  1. Basic android questions and assignment-related questi...read more
  2. Viewmodel Working, Work Manager, Versioning, Storage, Network...read more
  3. MVVM, Room DB, Corouti...read more

Recently Viewed

COMPANY BENEFITS

Angel One

No Benefits

JOBS

Aggreko

No Jobs

SALARIES

Angel One

JOBS

PayPal

No Jobs

JOBS

Amazon

No Jobs

SALARIES

Angel One

SALARIES

Angel One

JOBS

Ethos

No Jobs

COMPANY BENEFITS

Angel One

No Benefits

COMPANY BENEFITS

Angel One

No Benefits

Tell us how to improve this page.

Razorpay SDE-2 Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Sopra Steria

Success to our employee's well-being? A work-life balance that's simply unbeatable.

Join Razorpay Revolutionize the FinTech space with groundbreaking solutions

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 752 Interviews
PhonePe Interview Questions
4.0
 • 300 Interviews
PayPal Interview Questions
3.9
 • 207 Interviews
HighRadius Interview Questions
2.9
 • 183 Interviews
Fiserv Interview Questions
3.0
 • 172 Interviews
Visa Interview Questions
3.5
 • 138 Interviews
Angel One Interview Questions
3.9
 • 135 Interviews
KFintech Interview Questions
3.5
 • 135 Interviews
MasterCard Interview Questions
3.9
 • 134 Interviews
View all
Razorpay SDE-2 Salary
based on 9 salaries
₹30 L/yr - ₹55 L/yr
15% more than the average SDE-2 Salary in India
View more details
Junior Analyst
115 salaries
unlock blur

₹2.4 L/yr - ₹5.5 L/yr

Analyst
100 salaries
unlock blur

₹3.5 L/yr - ₹7.3 L/yr

Software Engineer
99 salaries
unlock blur

₹7.5 L/yr - ₹26.5 L/yr

Senior Software Engineer
98 salaries
unlock blur

₹15.3 L/yr - ₹50 L/yr

Senior Associate
93 salaries
unlock blur

₹5.2 L/yr - ₹15 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