Upload Button Icon Add office photos

Filter interviews by

PayBingo Interview Questions and Answers

Updated 10 May 2021

PayBingo Interview Experiences

1 interview found

Interview Questions & Answers

user image Anonymous

posted on 10 May 2021

I applied via Referral and was interviewed before May 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Why you are fit for this profile and what is your contribution to the organization?

Interview Preparation Tips

Interview preparation tips for other job seekers - This is very critical question about once fitment to the roll as well as contribution. Preapare one snapshot of total 20 years plus experience in 5 to 6 line items. As far as contribution part comes cost control, value creation, foucus on high revenue product or service line, Technical upgradtion, which ultimately results in to productivity with higher profit margin. This value creation depends on business aspects as well.

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Instahyre and was interviewed in Oct 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Basic Nodejs questions

Round 2 - Technical 

(2 Questions)

  • Q1. Live peer coding interview
  • Q2. Fundamental of JS and clean code architecture
Round 3 - HR 

(2 Questions)

  • Q1. Salary expectation
  • Q2. Joining date and

Interview Preparation Tips

Interview preparation tips for other job seekers - Experience was good

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 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 was interviewed before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart 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 interviewRejected

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: It was a good one but both questions would have been easy if we know more libraries in java
Tips: Both the questions were related to bigint. It could have been better if both questions were from different areas
Duration: 90 minutes

Round: Technical Interview
Experience: I felt my interview went fine since i was able to answer most of their questions.They gave many hints even if i didn't get the right one
Tips: Everything was fine

Round: HR Interview
Experience: I was able to see myself how i responded to questions asked regarding me and sometimes i was just blabbering
Tips: nothing

General Tips: One must be good at datastrucures and algorithms
Skill Tips: nothing
Skills: Datastructures and Algorithms
Duration: 2
College Name: IIT Madras
Motivation: I wanted to do something for the company where I ordered many of my things
Funny Moments: No funny moments as such but I enjoyed talking to the hr interviewer

Software Developer Interview Questions & Answers

Flipkart user image RAJIVTEJA NAGIPOGU

posted on 25 Aug 2015

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: The test started very late due to some technical issues and space issues. So , It helped us to be far more relaxed.
Duration: 11/2 hr minutes
Total Questions: 2

Round: Technical Interview
Experience: The Overall Technical Interview was a mixture of innovation and apprehension and it really helped me to get my strengths and weaknesses out. The questions outsmarted me at the beginning, Later I did.

Round: HR Interview
Experience: HR was very friendly. He asked about my strengths and weaknesses. And then we continued talking about the nature of work and sincerity and technicality expected from my side, while taking a stroll in cool night air.

Skills: Algorithms and DataStructures
Duration: 2 months
College Name: IIT Madras
Motivation: The work specification

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. First question was about a robot and tracking his movements.Given a string of moves a robot makes check if he ends up at the location he starts from?
  • Q2. Given a list of stars and their distances from the earth.Find an efficient solution to find the k closest stars to earth?
  • Ans. 

    Efficient solution to find k closest stars to earth from a list of stars and their distances.

    • Use a priority queue to store the distances of stars from earth.

    • Iterate through the list of stars and add their distances to the priority queue.

    • Pop k elements from the priority queue to get the k closest stars to earth.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: The online coding test is not that difficult. The questions are very easy. Only thing is that you have to come up with an efficient solution.The naive solutions are fairly obvious.
Tips: Practice some algorithms questions.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: First question was very simple. I was asked for the solution first and then to write the code on paper and show it to him.Second question requires more time to think.
Tips: A good knowledge of data structures and algorithms will help you clear the interview with ease.

Round: HR Interview
Experience: The guy asking questions makes you feel relaxed. He will give you a feedback about the test and the questions asked in the test. I appreciated the feedback. He pointed out things i could have done better.
Tips: The HR interview is relatively easy. Its just a chat about you and your interests and some other questions like "why should I hire you?".

General Tips: A good knowledge of Data structures and Algorithms will help clear the interview and the test.
Skill Tips: Practice Data structures and Algorithms questions.
Skills: Data structures and Algorithms, Coming up with efficient solutions
Duration: 2
College Name: IIT Madras
Motivation: I wanted to apply for Flipkart as I have seen its meteoric rise in the past few years. It has transformed the wasy people shop in India.

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Question 1: General HR questions, some based on the CV Question 2: A marketing specific question

Interview Preparation Tips

Round: Test
Experience: The test basically tests your ability to solve questions as quickly as possible as it's a 60 minute test for 60 questions. The level of difficulty is pretty decent, so one just needs to be focused right from the beginning. English can trouble a bit, so some practice in English sections is also advisable.
Tips: Prepare from Arun Sharma Quantitative Aptitude and Logical Reasoning for CAT. It's a wholesome book and has enough questions to practice and build concepts. Join a test series so that you get a timed analysis of your performance, the ability to skip tough questions and to score as many marks as possible.
Duration: 40 minutes

Round: Group Discussion
Experience: It went pretty well. We had a great discussion. The approach was to list out all the problems one by one and think of probable solutions for each of them. During this, general group dynamics should be taken in consideration. Respect the views and thoughts of other people. Add value to the discussion by thinking critically and bringing new content every now and then. Always be specific and speak to the point.
Tips: Read. Read and Read.
Follow google news, read relevant articles in newspapers, magazines, social media sites or any other place.
Follow Quora, It'a an amazing source to boost your knowledge around any topic.
Duration: 50 minutes

Round: HR Interview
Experience: Be spontaneous, little humorous and lastly very confident. Communication skills improve with time, so start as early as possible. Take part in discussions. Speak up !
Tips: Have a sound knowledge about the industry and the company. They just check your approach. So be very clear and critical on the approach. Have good reasons to back what ever you present. Rest will be fine.

Skills: Communication And Confidence, Analytical Skills, Business Logic, Business Acumen
College Name: Institute of Management, Nirma University

I was interviewed before May 2016.

Interview Questionnaire 

4 Questions

  • Q1. Tell us about yourself
  • Ans. 

    I am a passionate software engineer with experience in developing web applications and a strong background in computer science.

    • Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React

    • Strong background in computer science with knowledge of data structures and algorithms

    • Proficient in programming languages such as Java, Python, and C++

    • Familiar with Agile development methodolog

  • Answered by AI
  • Q2. Why Flipkart
  • Ans. 

    Flipkart is a leading e-commerce platform in India with a strong focus on technology and innovation.

    • Flipkart offers a challenging and dynamic work environment for software engineers.

    • The company has a strong reputation for investing in technology and innovation.

    • Flipkart has a large user base and offers opportunities to work on a variety of projects.

    • The company has a strong focus on customer satisfaction and user experie...

  • Answered by AI
  • Q3. Are you comfortable to reallocate
  • Ans. 

    Yes, I am comfortable with reallocating as needed.

    • I am flexible and adaptable to changing circumstances.

    • I have experience working in dynamic environments where priorities can shift.

    • I am willing to take on new challenges and responsibilities as required.

  • Answered by AI
  • Q4. Why should we hire you
  • Ans. 

    I have a strong technical background, excellent problem-solving skills, and a proven track record of delivering high-quality software.

    • Extensive experience in software development, including proficiency in multiple programming languages such as Java, Python, and C++

    • Strong problem-solving skills demonstrated through successful completion of complex projects

    • Proven track record of delivering high-quality software on time a...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: 2 problem statements to be coded using any language
Tips: Focussed on string manipulations and enormous data size handling
Duration: 1 hour 30 minutes
Total Questions: 2

Skills: C/C++
College Name: Guru Premsukh Memorial College of Engineering

Interview Questionnaire 

9 Questions

  • Q1. A sentence is given which contains lowercase English letters and spaces. It may contain multiple spaces. Get first letter of every word and return the result as a string. The result should not contain any ...
  • Q2. Find Nth largest element in the BST
  • Ans. 

    Find Nth largest element in the BST

    • Traverse the BST in reverse inorder and keep track of count

    • If count equals N, return the current node's value

    • If count exceeds N, stop traversing and return null

    • If count is less than N, continue traversing

  • Answered by AI
  • Q3. Given a BST, find the node which contains the value which is equal to or greater than the input value?
  • Ans. 

    Find node in BST with value equal to or greater than input value.

    • Start at root node

    • If input value is less than current node value, move to left child

    • If input value is greater than or equal to current node value, move to right child

    • Repeat until node with desired value is found or null is reached

  • Answered by AI
  • Q4. Write a program to check if a binary tree is balanced
  • Ans. 

    Program to check if a binary tree is balanced

    • Calculate height of left and right subtrees recursively

    • Check if the difference in height is not more than 1

    • Repeat for all nodes in the tree

    • Time complexity: O(nlogn) or O(n)

    • Space complexity: O(h) where h is the height of the tree

  • Answered by AI
  • Q5. Given s string, Find max size of a sub-string, in which no duplicate chars present?
  • Ans. 

    Find max size of a sub-string with no duplicate characters in a given string.

    • Use a sliding window approach with two pointers.

    • Maintain a hash set to keep track of unique characters.

    • Update the maximum length of the substring as you iterate through the string.

  • Answered by AI
  • Q6. What is a hash table? Explain how they work (hash function and buckets)?
  • Ans. 

    A hash table is a data structure that stores key-value pairs and uses a hash function to map keys to buckets.

    • Hash function takes a key and returns an index to a bucket

    • Collisions occur when multiple keys map to the same bucket

    • Collision resolution techniques include chaining and open addressing

    • Example: Dictionary in Python uses hash tables to store key-value pairs

  • Answered by AI
  • Q7. WAP to find a continuous subset whose sum is divisible by 7. We are given a array of number (-ve and +ve). calculate the complexity of your algorithm?
  • Ans. 

    WAP to find a continuous subset divisible by 7 from an array of numbers. Calculate algorithm complexity.

    • Iterate through the array and calculate the prefix sum modulo 7 at each index.

    • Store the prefix sum modulo 7 in a hash table with the index as the value.

    • If a prefix sum modulo 7 is already in the hash table, the subarray between the two indices has a sum divisible by 7.

    • Time complexity is O(n) and space complexity is O

  • Answered by AI
  • Q8. Given a 2-dimensional array of integers, find the value 1 in the array, and set all those rows, and columns to 1, which contains one of the values as 1
  • Ans. 

    Given a 2D array of integers, set rows and columns to 1 if they contain 1.

    • Iterate through the array to find the index of 1

    • Use two arrays to keep track of rows and columns with 1

    • Iterate through the rows and columns arrays to set values to 1

  • Answered by AI
  • Q9. How to find a number in a rotated sorted array. He was looking for the binary search kind of solution?

Interview Preparation Tips

General Tips: Flipkart Interview Process :-Telephonic Round : 1F2F : 3 Rounds
Skills: Data structure, Algorithm
College Name: NA

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

Flipkart Interview Questions
4.0
 • 1.4k Interviews
Bharti Airtel Interview Questions
4.0
 • 844 Interviews
Paytm Interview Questions
3.3
 • 776 Interviews
PhonePe Interview Questions
4.0
 • 307 Interviews
Freecharge Interview Questions
4.0
 • 53 Interviews
Mobikwik Interview Questions
4.1
 • 47 Interviews
Google Pay Interview Questions
4.2
 • 35 Interviews
Amazon Pay Interview Questions
4.0
 • 13 Interviews
Ola Money Interview Questions
3.1
 • 1 Interview
Jio Money Interview Questions
4.2
 • 1 Interview
View all

PayBingo Reviews and Ratings

based on 2 reviews

3.1/5

Rating in categories

3.1

Skill development

3.8

Work-life balance

3.1

Salary

3.1

Job security

3.1

Company culture

2.4

Promotions

3.1

Work satisfaction

Explore 2 Reviews and Ratings
Area Sales Manager
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Manager
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare PayBingo with

Paytm

3.3
Compare

PhonePe

4.0
Compare

Mobikwik

3.7
Compare

Freecharge

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