Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Juspay Technologies Quality Analyst Interview Questions and Answers

Updated 12 Aug 2024

Juspay Technologies Quality Analyst Interview Experiences

1 interview found

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

I applied via LinkedIn and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Onw beginner level coding challenge

Round 2 - Assignment 

Create postman collection for a given scenario using provided API document

Round 3 - One-on-one 

(2 Questions)

  • Q1. Scenario based questions
  • Q2. Project experience
  • Ans. 

    I have 3 years of experience working on various software projects as a Quality Analyst.

    • Led testing efforts for multiple software releases

    • Created and executed test cases to ensure product quality

    • Collaborated with cross-functional teams to identify and resolve defects

    • Utilized automation tools like Selenium for regression testing

    • Participated in Agile ceremonies such as sprint planning and retrospectives

  • Answered by AI

Interview questions from similar companies

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. Role And responsibilities
Round 2 - HR 

(1 Question)

  • Q1. 7 QC tools, feedback

Interview Preparation Tips

Interview preparation tips for other job seekers - Cheap company, cheap people, Bad experience about Company.
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Sep 2024. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Im waiting for Interview
  • Q2. Ready to join Phonepe - please call XXXXX
Round 2 - HR 

(2 Questions)

  • Q1. Please contact XXXXX
  • Q2. I'm immediate joiner, 6 Yrs of exp in quality auditing

I applied via Recruitment Consulltant and was interviewed in Feb 2022. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. About self,SDLC,STLC,smoke, regression, basic Mysql, Update table query, types of joins, Jira,postman,soapui, jmeter

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep prapare basic queries and basic testing only
Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. We want QA do you give interview
  • Q2. Please give interview
Round 2 - Behavioral 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. Quality questions

Interview Preparation Tips

Interview preparation tips for other job seekers - HR is responsive only till scheduling interview
HR is not responding after interview
Finally thank you email
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed in Apr 2024. There were 2 interview rounds.

Round 1 - Coding Test 

You should be familiar with core java features. Collections, converting one collection Array / Vector to other. Removing duplicates. Lambda chaining / Functional programming. Basic SQL - Joins, Aggregates etc.

Round 2 - One-on-one 

(1 Question)

  • Q1. Explain Architecture of applications you worked on. Justify use of components. System Design questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - No need to grind leet code here. But you should know how to solve day to day problems. Do projects end to end. You should know the backend well.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.

Round 1 - Aptitude Test 

1hr aptitude + coding

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

I was interviewed in Jan 2025.

Round 1 - Coding Test 

Test was based on arrays and some dsa concepts.

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

Juspay Technologies Interview FAQs

How many rounds are there in Juspay Technologies Quality Analyst interview?
Juspay Technologies interview process usually has 3 rounds. The most common rounds in the Juspay Technologies interview process are Coding Test, Assignment and One-on-one Round.

Recently Viewed

INTERVIEWS

Adani Enterprises

No Interviews

SALARIES

Koch Business Solutions

INTERVIEWS

Adani Enterprises

No Interviews

SALARIES

Hexaware Technologies

INTERVIEWS

Adani Enterprises

No Interviews

SALARIES

Sify Technologies

SALARIES

Sify Technologies

INTERVIEWS

Reliance Industries

No Interviews

INTERVIEWS

Adani Enterprises

No Interviews

INTERVIEWS

Juspay Technologies

No Interviews

Tell us how to improve this page.

Juspay Technologies Quality Analyst Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 753 Interviews
PhonePe Interview Questions
4.0
 • 300 Interviews
PayPal Interview Questions
3.9
 • 207 Interviews
Razorpay Interview Questions
3.6
 • 148 Interviews
Mobikwik Interview Questions
3.7
 • 47 Interviews
Jodo Interview Questions
3.6
 • 22 Interviews
OneCard Interview Questions
3.5
 • 21 Interviews
Credgenics Interview Questions
3.5
 • 18 Interviews
BillDesk Interview Questions
3.2
 • 14 Interviews
Amazon Pay Interview Questions
4.1
 • 13 Interviews
View all
Juspay Technologies Quality Analyst Salary
based on 7 salaries
₹4 L/yr - ₹12 L/yr
46% more than the average Quality Analyst Salary in India
View more details
Product Engineer
63 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
58 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer
55 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Manager
48 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
47 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Juspay Technologies with

Razorpay

3.6
Compare

Payed

2.7
Compare

CCAvenue

2.5
Compare

BillDesk

3.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent