Upload Button Icon Add office photos

Filter interviews by

Clear (1)

RapiPay Node JS Developer Interview Questions and Answers

Updated 30 May 2024

RapiPay Node JS Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Nov 2023. There was 1 interview round.

Round 1 - Technical 

(4 Questions)

  • Q1. Explain your role and responsibilities in the projects you have done so far.
  • Q2. How to setup node js server
  • Ans. 

    To setup a Node.js server, you need to install Node.js, create a server file, write code to create a server, and run the server.

    • Install Node.js on your machine

    • Create a server file (e.g. server.js)

    • Write code to create a server using the 'http' module

    • Run the server using the command 'node server.js'

  • Answered by AI
  • Q3. Explain other methods of sorting with example other than inbuilt function
  • Ans. 

    Other methods of sorting include bubble sort, selection sort, and insertion sort.

    • Bubble sort: repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

    • Selection sort: repeatedly finds the minimum element from the unsorted part of the array and swaps it with the first unsorted element.

    • Insertion sort: builds the final sorted array one item at a time by inserting each el

  • Answered by AI
  • Q4. What is promise, how to implement it
  • Ans. 

    A promise is an object representing the eventual completion or failure of an asynchronous operation.

    • Promises are used to handle asynchronous operations in JavaScript.

    • They can be created using the Promise constructor.

    • Promises have three states: pending, fulfilled, or rejected.

    • They can be chained using .then() and .catch() methods.

    • Example: const myPromise = new Promise((resolve, reject) => { ... });

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

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

Interview Questionnaire 

21 Questions

  • Q1. Discussion of previous written test questions
  • Q2. Find the odd repeating element from a set of repeating elements
  • Ans. 

    Find the odd repeating element from an array of strings

    • Use a hash table to count the frequency of each element

    • Iterate through the hash table to find the element with an odd count

  • Answered by AI
  • Q3. A 2D matrix is given which is row wise and column wise sorted. Find a particular element from it
  • Ans. 

    Finding an element in a sorted 2D matrix

    • Start from the top right corner or bottom left corner

    • Compare the target element with the current element

    • Move left or down if the target is smaller, else move right or up

    • Repeat until the target is found or all elements are checked

  • Answered by AI
  • Q4. SQL Query to find Nth highest salary from table
  • Ans. 

    SQL query to find Nth highest salary from table

    • Use ORDER BY and LIMIT clauses

    • Use subquery to get the Nth highest salary

    • Handle cases where there are less than N distinct salaries

  • Answered by AI
  • Q5. Another basic SQL query
  • Q6. Write a function that returns '3' when '4' is passed as an input and vice versa without using if-else condition
  • Ans. 

    Function to swap '3' and '4' without using if-else

    • Use XOR operator to swap the values

    • Convert the input to ASCII code and perform the swap

    • Use a lookup table to map the values

  • Answered by AI
  • Q7. Question on Suffix trees
  • Q8. Question on Tries
  • Q9. Question on Ternary search trees
  • Q10. Question on hash maps
  • Q11. Question on complexity of an algorithm
  • Q12. 3-4 SQL queries
  • Q13. Question on SQL joins
  • Q14. JAVA questions on static block,static function and static variables
  • Q15. JAVA questions on memory initialization and references
  • Q16. Puzzle on measuring exactly half a glass of water
  • Q17. Introduce yourself
  • Ans. 

    I am a software developer with experience in Java and Python.

    • Proficient in Java and Python programming languages

    • Experience in developing web applications using Spring framework

    • Familiarity with database management systems like MySQL and MongoDB

  • Answered by AI
  • Q18. Why PAYTM?
  • Ans. 

    PAYTM is a leading digital payment platform in India with a wide range of services.

    • PAYTM has a user-friendly interface and offers a seamless payment experience.

    • It provides a variety of services like mobile recharges, bill payments, and online shopping.

    • PAYTM has a strong focus on security and fraud prevention measures.

    • It has a large user base and is widely accepted by merchants across India.

    • PAYTM is constantly innovatin...

  • Answered by AI
  • Q19. Will you go for further studies?
  • Ans. 

    Yes, I am open to pursuing further studies in the future.

    • I believe in continuous learning and staying updated with the latest technologies.

    • Further studies can help me specialize in a particular field and enhance my skills.

    • I may consider pursuing a master's degree in computer science or a related field.

    • However, my immediate focus is on gaining practical experience and contributing to the organization.

  • Answered by AI
  • Q20. Why do you think has PAYTM grown so fast?
  • Ans. 

    PAYTM grew fast due to its innovative approach and early adoption of digital payments.

    • Early adoption of digital payments in India

    • Innovative approach with features like mobile recharges, bill payments, and cashback offers

    • Expansion into e-commerce and financial services

    • Strategic partnerships with major companies like Uber and Alibaba

  • Answered by AI
  • Q21. (looking at my CGPA of 9) You can get a better company. Then Why PAYTM only?

Interview Preparation Tips

Round: Test
Experience: there were 20 mcqs and 2 coding questions. It was a pen and paper test. We were given 1 hour to solve it. The mcqs were of average difficulty. The 2 coding questions were:
1. A variation of the standard Josephus Problem
2. Find the 'x' largest elements from 'n' input elements without using sorting.
Tips: They focus on algorithms not on complete solutions. Do not leave any question unattempted. If you do not know the exact approach then use Brute-Force approach.

Round: Technical Interview
Experience: The Interviewer was very nice. He was focussing on the approach used not on codes.
Tips: Be calm and think by basics :)

Round: Technical Interview
Experience: The interviewer asked high level data structures in this round. But again he saw the approach used and not exact solution
Tips: Don't give up. Tell whatever you know

Round: Technical Interview
Experience: JAVA questions were based on very detailed concepts. Study OOP properly.
Tips: Maintain your calm :)

Round: HR Interview
Experience: Overall the experience was nice and smooth.
Tips: If they allow you to ask them any question then ask them something about the company. They should find you interested in the company :)

General Tips: Just be cool. Show them you are enthusiastic to learn and work. While prepration focus on Basics and Algorithms. Prepare DBMS nicely too :)
Skill Tips: Have full knowledge about your projects
Skills: JAVA, Data Structures, Operating systems, Network Programming, DBMS
College Name: NIT Jalandhar
Motivation: PAYTM is a perfect mix for the dynamic startup culture and stability of a big organiztaion. PAYTM has an amazing work culture and excellent opportunities for growth

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.

Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.

College Name: BITS Pilani

Interview Preparation Tips

Skills: Algorithm, Java, Data structure
College Name: na

I was interviewed before Sep 2020.

Round 1 - Face to Face 

Round duration - 45 minutes
Round difficulty - Medium

I applied thorough LinkedIn and got a call from HR for the interview.
I went to their Noida Office.
First round was mainly focused on Javascript fundamentals.
Interviewer was also friendly.

Round 2 - Face to Face 

(2 Questions)

Round duration - 1 hour
Round difficulty - Medium

Second round was after 15 minutes of the first round. The focus of this round was DS & Algorithms.

  • Q1. 

    Find Subarray with Given Sum

    Given an array ARR of N integers and an integer S, determine if there exists a subarray (of positive length) within the given array such that the sum of its elements equals S....

  • Ans. 

    Given an array and a target sum, find a subarray that sums up to the target sum.

    • Iterate through the array while keeping track of the running sum and the starting index of the subarray.

    • Use a hashmap to store the running sum and its corresponding index.

    • If the running sum - target sum is found in the hashmap, it means a subarray with the target sum exists.

    • Return the starting and ending indices of the subarray or [-1, -1]

  • Answered by AI
  • Q2. 

    Minimum Number of Platforms Required

    You are provided with two arrays, AT and DT, representing the arrival and departure times of all trains arriving at a railway station.

    Your task is to determine the m...

  • Ans. 

    This question asks to find the minimum number of platforms required at a railway station so that no train needs to wait.

    • Sort the arrival and departure times arrays in ascending order.

    • Initialize a variable 'platforms' to 1 and 'maxPlatforms' to 1.

    • Iterate through the arrival and departure times arrays simultaneously.

    • If the current arrival time is less than or equal to the current departure time, increment 'platforms'.

    • If ...

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

  • Q1. What JavaScript questions did he ask you during the managerial round, and can you describe the work culture of his team?
  • Ans. 

    The interviewer asked about JavaScript questions and the work culture of the team during the managerial round.

    • JavaScript questions related to closures, prototypes, event handling, and asynchronous programming may have been asked.

    • Work culture may involve collaboration, innovation, agile methodologies, and continuous learning.

    • Examples of work culture could include regular team meetings, code reviews, hackathons, and ment

  • Answered by AI
Round 4 - Face to Face 

Round duration - 15 minutes
Round difficulty - Easy

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaI applied for Frontend role so Javascript was needed.Paytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - JavaScript,React.js,Java,Node.js,DS & Algo,Time required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Be strong at your basics.
Tip 2 : Don't hesitate to ask questions to interviewer.
Tip 3 : Prepare good for DS & Algo as most companies have a separate round for it.

Application resume tips for other job seekers

Tip 1: If possible make 1 page resume
Tip 2: Don't put too many things. Keep it simple. If you're a fresher and have good projects, do put them before your academic section.
Tip 3: Be ready to explain everything you have in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

DS/ALGO and problem-solving was asked in round one

Interview Preparation Tips

Interview preparation tips for other job seekers - ok process

I was interviewed in Mar 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.

    Input:

    The first...
  • Ans. 

    Find the length of the longest substring with at most K distinct characters in a given string.

    • Use a sliding window approach to keep track of the characters and their counts within the window.

    • Maintain a hashmap to store the characters and their frequencies.

    • Update the window size and characters count as you iterate through the string.

    • Return the maximum window size encountered for each test case.

  • Answered by AI
  • Q2. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

  • Ans. 

    Find the number with the maximum frequency in an array of integers.

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Find the number with the maximum frequency and return it.

    • If multiple elements have the same maximum frequency, return the one that appears first.

  • Answered by AI
  • Q3. 

    Ninja and Bombs Problem Statement

    Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...

  • Ans. 

    Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.

    • Check if the x-coordinate is even or odd by using bitwise AND operation with 1.

    • Return 1 if x-coordinate is even, else return 0.

    • Handle multiple test cases by iterating through each input.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I was asked a coding question then, a system design question and some basic operating systems and oops questions

  • Q1. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store seen elements.

  • Answered by AI
  • Q2. Can you design a Google Search Engine?
  • Ans. 

    Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.

    • Develop a web crawler to discover and retrieve web pages.

    • Implement an indexing system to store and organize the content of web pages.

    • Design a ranking algorithm to determine the relevance of search results.

    • Include features like autocomplete, spell check, and personalized search results.

    • Optimize for speed and scalabil...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, System Design, Operating SystemsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms

Application resume tips for other job seekers

Tip 1 : Mention your projects
Tip 2 : Mention your internships

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

The first round was an assessment round comprised of MCQ questions of DSA, RDBMS, MySQL questions and 2 coding questions to be written in java only

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) to explore all possible paths from the source cell to the destination cell.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse through the matrix.

    • Return the shortest path length found or -1 if no valid path exists.

  • Answered by AI
  • Q2. 

    Kth Smallest Element Problem Statement

    You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...

  • Ans. 

    Find the K-th smallest element in an array of distinct integers.

    • Sort the array and return the element at index K-1.

    • Use a min-heap to find the K-th smallest element efficiently.

    • Implement quickselect algorithm for optimal performance.

  • Answered by AI
Round 2 - Telephonic Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The basic data structure round duration 1 hour, in this Interviewer, was very friendly and asked some casual questions. After that, he asked me to code.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array of integers.

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

    • At each index, decide whether to include the current element in the subarray or start a new subarray.

    • Update the maximum sum if a new maximum is found.

    • Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.

    • Example: For array [-5, -1, -8, -9]

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

Advance data structure round duration 1 hour, in this Interviewer asked some basic questions on oops, puzzles and asked me to code them later.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during the reversal process.

  • Answered by AI
  • Q2. 

    Trapping Rain Water

    You are provided with an array ARR of integers representing an elevation map, where ARR[i] denotes the elevation of the ith bar. Determine the maximum amount of rainwater that can be t...

  • Ans. 

    Given an array representing an elevation map, find the maximum amount of rainwater that can be trapped between the bars.

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

    • Calculate the trapped water by finding the minimum of the maximum heights on the left and right minus the current bar height.

    • Sum up the trapped water for all bars to get the total trapped rainwater.

    • Example: Fo...

  • Answered by AI
Round 4 - Telephonic Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Medium

Vice President interview round duration 30mins, in this round VP’s of different domains taking interview to the selected candidates.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.

    • Keep track of the maximum profit that can be obtained by performing two transactions.

    • Consider all possible combinations of buying and selling stocks to maxim...

  • Answered by AI
Round 5 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

This round lasted for 30mins basic HR questions were asked

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7.5 CGPAMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, OOPS, System Design, Algorithms, Dynamic Programming, Operating systems, DevelopmentTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare DSA well.
Tip 2 : Always remember and go through your all projects.
Tip 3 : Practice as many DSA questions as you can.

Application resume tips for other job seekers

Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

  • Q1. 

    Sort 0 and 1 Problem Statement

    Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...

  • Ans. 

    Sort an array of 0s and 1s in linear time without using additional arrays.

    • Iterate through the array and maintain two pointers, one for 0s and one for 1s.

    • Swap elements at the two pointers based on the current element being 0 or 1.

    • Continue this process until the entire array is sorted in place.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

  • Q1. 

    Valid Perfect Square Check

    An integer N is provided, and the task is to determine if N is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.

    ...

  • Ans. 

    Implement a function to check if a given integer is a perfect square.

    • Create a function that takes an integer as input and returns true if it is a perfect square, false otherwise.

    • Iterate through possible square roots of the input integer and check if the square of the root equals the input.

    • Return true if a perfect square is found, false otherwise.

  • Answered by AI
  • Q2. 

    Merge Sort Problem Statement

    Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.

    Example:

    Input:
    ARR = [5, 3, 8,...
  • Ans. 

    Implement Merge Sort algorithm to sort a given sequence of numbers in non-descending order.

    • Merge Sort is a divide-and-conquer algorithm that splits the array into two halves, recursively sorts each half, and then merges the sorted halves back together.

    • Time complexity of Merge Sort is O(n log n) in the worst case scenario.

    • It is a stable sorting algorithm, meaning that the relative order of equal elements is preserved.

    • Ex...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

  • Q1. 

    Bottom View of Binary Tree Problem Statement

    Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...

  • Ans. 

    The task is to print the bottom view of a binary tree from left to right.

    • Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

    • Store the nodes at each horizontal distance in a map, updating it as you traverse the tree.

    • After traversal, extract the bottom-most nodes at each horizontal distance to get the bottom view sequence.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 70 minutes
Round difficulty - Medium

There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.

  • Q1. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
  • Ans. 

    Implement multiple RecyclerViews on a magnified screen in an Android app by adjusting item sizes and spacing.

    • Adjust item sizes and spacing based on screen magnification level

    • Use nested RecyclerViews or custom layouts to display multiple lists

    • Implement custom item decorators to manage spacing between RecyclerViews

    • Consider using a GridLayoutManager with custom span sizes for each RecyclerView

  • Answered by AI
  • Q2. How would you implement various activities related to cart functionality in an e-commerce application?
  • Ans. 

    Implementing cart functionality in an e-commerce application involves managing user interactions, updating quantities, handling discounts, and processing orders.

    • Create a data structure to store cart items, quantities, and prices.

    • Implement add to cart, remove from cart, and update quantity functionalities.

    • Handle discounts, promotions, and coupon codes.

    • Calculate total price, including taxes and shipping costs.

    • Implement c...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Interview Preparation Tips

Eligibility criteriaCGPA - 7 & above, Active backlogs - NoneMobiKwik interview preparation:Topics to prepare for the interview - Basic DSA, Arrays, String, Trees, Problem SolvingTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions

Application resume tips for other job seekers

Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)

Final outcome of the interviewSelected

Skills evaluated in this interview

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

RapiPay Interview FAQs

How many rounds are there in RapiPay Node JS Developer interview?
RapiPay interview process usually has 1 rounds. The most common rounds in the RapiPay interview process are Technical.
What are the top questions asked in RapiPay Node JS Developer interview?

Some of the top questions asked at the RapiPay Node JS Developer interview -

  1. explain other methods of sorting with example other than inbuilt funct...read more
  2. what is promise, how to implement...read more
  3. How to setup node js ser...read more

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

COMPANY BENEFITS

KNR Constructions

20 benefits

COMPANY BENEFITS

IRB Infrastructure

60 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

INTERVIEWS

RapiPay

No Interviews

INTERVIEWS

ProcDNA

No Interviews

INTERVIEWS

ProcDNA

No Interviews

INTERVIEWS

Yubi

No Interviews

INTERVIEWS

Porter

No Interviews

Tell us how to improve this page.

RapiPay Node JS Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 747 Interviews
PolicyBazaar Interview Questions
3.6
 • 345 Interviews
PhonePe Interview Questions
4.0
 • 297 Interviews
HighRadius Interview Questions
2.9
 • 182 Interviews
Razorpay Interview Questions
3.6
 • 148 Interviews
Visa Interview Questions
3.5
 • 138 Interviews
Angel One Interview Questions
3.9
 • 135 Interviews
Revolut Interview Questions
2.5
 • 95 Interviews
Rupeek Interview Questions
3.7
 • 60 Interviews
View all
RapiPay Node JS Developer Salary
based on 5 salaries
₹11 L/yr - ₹13 L/yr
113% more than the average Node JS Developer Salary in India
View more details
Territory Sales Manager
146 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
101 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Area Sales Manager
58 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
44 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
33 salaries
unlock blur

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