Upload Button Icon Add office photos

Filter interviews by

RapiPay Software Engineer Interview Questions and Answers

Updated 21 Jul 2024

RapiPay Software Engineer Interview Experiences

3 interviews found

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

(2 Questions)

  • Q1. Project questions
  • Q2. Coding questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Great place to work

Software Engineer Interview Questions & Answers

user image Shivani Verma

posted on 27 Apr 2024

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

Profit and Loss, Numbers questions

Round 2 - Coding Test 

Java related questions

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Bridge and torch problem : Four people come to a river in the nig ... read more
asked in Capgemini
Q2. In a dark room,there is a box of 18 white and 5 black gloves. You ... read more
asked in TCS
Q3. Find the Duplicate Number Problem Statement Given an integer arra ... read more
Q4. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q5. Puzzle : 100 people are standing in a circle .each one is allowed ... read more
Round 1 - Coding Test 

Basi Java questions

Round 2 - Case Study 

Basic question

Interview Preparation Tips

Interview preparation tips for other job seekers - Basic coding question asked ……. a

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 70 minutes
Round difficulty - Medium

It consisted of three coding questions varying from easy to medium.

  • Q1. 

    Distributing Coins in a Binary Tree

    You are provided with the root of a binary tree that consists of 'N' nodes. Each node in this tree contains coins, and the total number of coins across all nodes is equ...

  • Ans. 

    Determine the minimum number of moves required to distribute coins in a binary tree so that every node has exactly one coin.

    • Traverse the binary tree in a bottom-up manner to distribute coins efficiently.

    • Keep track of the excess or deficit of coins at each node to calculate the minimum moves required.

    • Transfer coins from nodes with excess coins to nodes with deficits to balance the distribution.

    • Example: For the input ROO...

  • Answered by AI
  • Q2. 

    Distinct Subsets Count

    Given an array arr of N integers that may include duplicates, determine the number of subsets of this array containing only distinct elements.

    The result should be returned modulo ...

  • Ans. 

    Count the number of distinct-element subsets in an array modulo 10^9+7.

    • Iterate through the array and keep track of distinct elements using a set.

    • Calculate the number of subsets using the formula 2^distinct_count - 1.

    • Return the result modulo 10^9+7 for each test case.

  • Answered by AI
  • Q3. 

    0-1 Knapsack Problem Statement

    A thief is robbing a store and can carry a maximal weight 'W' in his knapsack. There are 'N' items, where the i-th item has a weight 'wi' and value 'vi'. Consider the maximu...

  • Ans. 

    The 0-1 Knapsack Problem involves maximizing the value of items a thief can steal within a weight limit.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the maximum value that can be achieved at each weight limit.

    • Iterate through the items and weights to fill the array with optimal values.

    • Return the maximum value achievable at the given weight limit.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interview was focused on data structures as well as computer fundamentals along with puzzles.

  • Q1. 

    Sort an Array in Wave Form

    You are given an unsorted array ARR. Your task is to sort it so that it forms a wave-like array.

    Input:

    The first line contains an integer 'T', the number of test cases.
    For ea...
  • Ans. 

    Sort an array in wave form where each element is greater than or equal to its adjacent elements.

    • Iterate through the array and swap adjacent elements to form a wave pattern.

    • Ensure that the first element is greater than or equal to the second element.

    • There can be multiple valid wave arrays, so any valid wave array is acceptable.

  • Answered by AI
  • Q2. 

    Reverse a Linked List Problem Statement

    You are given a Singly Linked List of integers. Your task is to reverse the Linked List by changing the links between nodes.

    Input:

    The first line of input contai...
  • Ans. 

    Reverse a given singly linked list by changing the links between nodes.

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

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

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Easy

The Round was mainly focused on resume+ dsa + system design +computer fundamentals

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use a min heap to store the larger half of the numbers and a max heap to store the smaller half.

    • Keep the two heaps balanced by ensuring the size difference is at most 1.

    • If the total number of elements is odd, the median is the top of the larger heap. If even, average the tops of both heaps.

  • Answered by AI
  • Q2. Can you explain the implementation of an LRU (Least Recently Used) Cache in a database management system?
  • Ans. 

    LRU cache in a database management system stores most recently used data and removes least recently used data when full.

    • LRU cache is implemented using a doubly linked list and a hash map.

    • Each node in the linked list represents a key-value pair.

    • When a key is accessed, it is moved to the front of the linked list.

    • If the cache is full, the least recently used node at the end of the list is removed.

    • Example: If cache size is...

  • Answered by AI
  • Q3. Design a stack that supports the getMin() operation in O(1) time and O(1) extra space.
  • Ans. 

    Use two stacks - one to store actual values and one to store minimum values.

    • Use two stacks - one to store actual values and one to store minimum values

    • When pushing a new value, check if it is smaller than the current minimum and push it to the min stack if so

    • When popping a value, check if it is the current minimum and pop from min stack if so

    • getMin() operation can be done by peeking at the top of the min stack

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in NoidaEligibility criteria10th /12 th-60 % Btech-7 CGPAPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - DSA, OOPs, Computer Networking, System Design ,OOPsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Properly grasp over basic concepts
Tip 2 : Prepare good for DS & Algo as most companies have a separate round for it.
Tip 3 : Don't lie over your resume

Application resume tips for other job seekers

Tip 1 : Don't Lie over your resume
Tip 2 : Avoid unnecessary details like Hobbies, family details, declaration, date, signature, etc.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. What is solid principles
  • Ans. 

    SOLID principles are a set of five design principles for writing maintainable and scalable code.

    • S - Single Responsibility Principle

    • O - Open/Closed Principle

    • L - Liskov Substitution Principle

    • I - Interface Segregation Principle

    • D - Dependency Inversion Principle

  • Answered by AI
  • Q2. What are internal working of has set
  • Ans. 

    HashSet is a collection that stores unique elements by using a hash table.

    • Elements are stored based on their hash code

    • Uses hashCode() and equals() methods to check for duplicates

    • Does not maintain insertion order

    • Allows null values

    • Example: HashSet set = new HashSet<>(); set.add("apple"); set.add("banana");

Answered by AI

Skills evaluated in this interview

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

I applied via Naukri.com and was interviewed before Apr 2023. There were 4 interview rounds.

Round 1 - Assignment 

Python, SQL related questions

Round 2 - Technical 

(2 Questions)

  • Q1. SQL, Python related
  • Q2. Spark internals
Round 3 - Technical 

(2 Questions)

  • Q1. SQL, Python related
  • Q2. Spark internals
Round 4 - One-on-one 

(1 Question)

  • Q1. General managerial questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be good with SQL, Python and Spark to clear data engineering interviews
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before May 2023. There were 2 interview rounds.

Round 1 - Coding Test 

1 Hour, Asked LRU Cache

Round 2 - Technical 

(1 Question)

  • Q1. About Resume and experience
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Left Side of binary tree

Round 2 - Technical 

(1 Question)

  • Q1. LCA of Binary Search Tree
  • Ans. 

    The Lowest Common Ancestor (LCA) of a Binary Search Tree is the node that is the common ancestor of two given nodes.

    • The LCA of a Binary Search Tree can be found by comparing the values of the two nodes with the current node's value and traversing left or right accordingly.

    • If one node's value is less than the current node's value and the other node's value is greater, then the current node is the LCA.

    • If both nodes are l...

  • Answered by AI
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via Recruitment Consulltant and was interviewed before Mar 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Basic SQL understanding ETL pipelines Reporting tools

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well
Round 1 - Coding Test 

Standard leetcode problems - stacks,queues etc

Round 2 - One-on-one 

(1 Question)

  • Q1. Practice geeksforgeeks questions

Interview Preparation Tips

Interview preparation tips for other job seekers - do leetcode questions thouroughly and keep calm during the interview. if stuck ask for hints and try to solve with brute force approach first and then try to optimize it

RapiPay Interview FAQs

How many rounds are there in RapiPay Software Engineer interview?
RapiPay interview process usually has 1-2 rounds. The most common rounds in the RapiPay interview process are Coding Test, Aptitude Test and Technical.
How to prepare for RapiPay Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at RapiPay. The most common topics and skills that interviewers at RapiPay expect are Java, Microservices, MySQL, People Management and AWS.
What are the top questions asked in RapiPay Software Engineer interview?

Some of the top questions asked at the RapiPay Software Engineer interview -

  1. Project questi...read more
  2. Coding questi...read more

Tell us how to improve this page.

RapiPay Software Engineer Interview Process

based on 3 interviews

Interview experience

4.3
  
Good
View more
RapiPay Software Engineer Salary
based on 102 salaries
₹4.3 L/yr - ₹16.5 L/yr
16% more than the average Software Engineer Salary in India
View more details

RapiPay Software Engineer Reviews and Ratings

based on 13 reviews

1.3/5

Rating in categories

2.0

Skill development

1.7

Work-life balance

1.7

Salary

1.1

Job security

1.1

Company culture

1.1

Promotions

1.2

Work satisfaction

Explore 13 Reviews and Ratings
Territory Sales Manager
146 salaries
unlock blur

₹2.2 L/yr - ₹5.5 L/yr

Software Engineer
102 salaries
unlock blur

₹4.3 L/yr - ₹16.5 L/yr

Area Sales Manager
58 salaries
unlock blur

₹3.7 L/yr - ₹7 L/yr

Assistant Manager
44 salaries
unlock blur

₹2.5 L/yr - ₹7 L/yr

Software Developer
33 salaries
unlock blur

₹5.8 L/yr - ₹13 L/yr

Explore more salaries
Compare RapiPay with

Paytm

3.3
Compare

PhonePe

4.0
Compare

Mobikwik

3.7
Compare

Payed

2.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview