Upload Button Icon Add office photos

Filter interviews by

Card91 Interview Questions and Answers

Updated 12 Aug 2024

Card91 Interview Experiences

1 interview found

Operations Interview Questions & Answers

user image Anonymous

posted on 12 Aug 2024

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

I applied via Walk-in and was interviewed before Aug 2023. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Favorite product
  • Ans. 

    My favorite product is the iPhone because of its sleek design, user-friendly interface, and high-quality camera.

    • Sleek design

    • User-friendly interface

    • High-quality camera

  • Answered by AI
  • Q2. How would you enter Thailand in Cards product
  • Ans. 

    To enter Thailand in Cards product, we would need to establish partnerships with local banks, comply with regulatory requirements, and offer localized features.

    • Establish partnerships with local banks in Thailand to enable card usage

    • Comply with regulatory requirements set by the Bank of Thailand

    • Offer localized features such as language options, currency conversion, and local promotions

    • Ensure seamless integration with lo...

  • Answered by AI

Operations Interview Questions asked at other Companies

Q1. Please help me design a warehouse for sports shoes (box dimension 2ft/1ft) and since you are from North India, tell me where shall it be located in North India?
View answer (1)

Interview questions from similar companies

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 applied via Referral

Interview Questionnaire 

2 Questions

  • Q1. Tell me about your experience in current company??
  • Q2. If you read the JD tell me how you can manage it.

Interview Preparation Tips

Interview preparation tips for other job seekers - We know communication skill is important. But you can't reject someone who is good in communication but they are speaking with english+hindi+ regional language. Then your object is you just need someone who is good in english. In India not every people knows english well. When we are hired in company we have to visiti market have to communicate other companies for business or communicate with clients. That time english is important but not necessary because if i am able to clarify the client or merchant with other language or mixed with english that is also skilled communication. You rejecting someone who is good in is field, technically sound, can write in English, but if he/she used 2/3 words in hindi/other language (which interviewer can understand) you can't reject them. If you reject them for this reason than you are just searching for english speaking parrot not a skilled employee.

I applied via Referral and was interviewed in Jan 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Good and well package

Interview Preparation Tips

Interview preparation tips for other job seekers - Field marketing Approaches is very important

I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Do u have bike?

Interview Preparation Tips

Interview preparation tips for other job seekers - They want people for this position,u have to just attend interview

I applied via Naukri.com and was interviewed in Mar 2021. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Write a program to Create a spiral array using 2D-array
  • Ans. 

    Program to create a spiral array using 2D-array

    • Create a 2D-array with given dimensions

    • Initialize variables for row, column, and direction

    • Fill the array in a spiral pattern by changing direction when necessary

    • Return the spiral array

  • Answered by AI
  • Q2. Write a program to find Minimum length of string in 'bdcabdcbaabbbac' containing substring 'abc'

Interview Preparation Tips

Interview preparation tips for other job seekers - I recently got interviewed at PAYTM.I felt paytm will check your programming skills rather than your conceptual skills .In beginning they asked few questions related to concepts then they continued with only DS and algo.

Skills evaluated in this interview

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

Card91 Interview FAQs

How many rounds are there in Card91 interview?
Card91 interview process usually has 1 rounds. The most common rounds in the Card91 interview process are One-on-one Round.
How to prepare for Card91 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 Card91. The most common topics and skills that interviewers at Card91 expect are Javascript, MySQL, Angularjs, Postgresql and HTML.

Tell us how to improve this page.

Card91 Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

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
Razorpay Interview Questions
3.6
 • 148 Interviews
Freecharge Interview Questions
3.8
 • 53 Interviews
Mobikwik Interview Questions
3.7
 • 47 Interviews
Google Pay Interview Questions
4.2
 • 34 Interviews
Link Group Interview Questions
3.8
 • 34 Interviews
BillDesk Interview Questions
3.2
 • 14 Interviews
Amazon Pay Interview Questions
4.1
 • 13 Interviews
View all

Card91 Reviews and Ratings

based on 8 reviews

3.7/5

Rating in categories

3.3

Skill development

3.1

Work-life balance

3.3

Salary

2.7

Job security

3.6

Company culture

2.8

Promotions

3.3

Work satisfaction

Explore 8 Reviews and Ratings
Presales Specialist

Bangalore / Bengaluru

4-6 Yrs

Not Disclosed

Explore more jobs
Senior Software Engineer
8 salaries
unlock blur

₹14.2 L/yr - ₹30 L/yr

Software Engineer
6 salaries
unlock blur

₹5 L/yr - ₹8 L/yr

Software Developer
6 salaries
unlock blur

₹3.6 L/yr - ₹9.8 L/yr

Senior Executive Operations
4 salaries
unlock blur

₹5 L/yr - ₹6.7 L/yr

Assistant Manager
3 salaries
unlock blur

₹4 L/yr - ₹5.5 L/yr

Explore more salaries
Compare Card91 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