Upload Button Icon Add office photos

Visa

Compare button icon Compare button icon Compare

Filter interviews by

Visa Staff Engineer Interview Questions and Answers

Updated 10 Jan 2025

Visa Staff Engineer Interview Experiences

3 interviews found

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

Coding test at hacker rank , it was simple

Staff Engineer Interview Questions & Answers

user image Mayank Upadhyaya

posted on 28 Jun 2024

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Dec 2023. There were 2 interview rounds.

Round 1 - Se 

(2 Questions)

  • Q1. Binary insertion sort
  • Q2. Difference between map and hash tables
  • Ans. 

    Map is an abstract data type that stores key-value pairs, while hash table is a specific implementation of a map using hashing.

    • Map is a general concept, while hash table is a specific implementation of a map using hashing functions.

    • Map allows any type of keys, while hash table typically requires keys to be hashable.

    • Map may not guarantee order, while hash table may use hashing to provide faster access times.

    • Example: Map...

  • Answered by AI
Round 2 - Coding Test 

Graph question showing dendency of different services marked 1 to n determine which service should be deployed first so as to now disturb the sequence

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview is very easy , but work culture is very challenging and demanding join at your own risk

Skills evaluated in this interview

Staff Engineer Interview Questions Asked at Other Companies

Q1. Swap Adjacent Bit Pairs Problem Statement Given an integer N, you ... read more
Q2. Search In Rotated Sorted Array Problem Statement Given a rotated ... read more
Q3. Minimum Jumps Problem Statement Bob and his wife are in the famou ... read more
Q4. Level Order Traversal of Binary Tree Given a Binary Tree of integ ... read more
asked in Nagarro
Q5. How to write HTML code considering web accessibility for disabled ... read more
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Basic questions on TPF, TPFDF, ASSEMBLERS.
Round 3 - Technical 

(1 Question)

  • Q1. Basic questions on C & C++.
Round 4 - Behavioral 

(1 Question)

  • Q1. Situation or Scenario based question.
Round 5 - HR 

(1 Question)

  • Q1. Compensation Discussion.

Interview Preparation Tips

Interview preparation tips for other job seekers - Keeps your basics clear. Be true and confident. Don't fake.

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 appeared for an interview before Mar 2016.

Interview Questionnaire 

2 Questions

  • Q1. Some technical questions were asked
  • Q2. They spring hibernate MVC flow and core java and Oracle connectivity questions

Interview Preparation Tips

Round: Technical + HR Interview
Experience: There was a Team manager and his junior for the interview

I applied via Naukri.com and was interviewed before Apr 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. 1. Explain SCD Type 2 Implementation in Informatica
  • Ans. 

    SCD Type 2 is a technique used to track historical changes in data over time in a data warehouse.

    • SCD Type 2 maintains a separate row for each change in data, with a start and end date.

    • It requires a surrogate key to uniquely identify each row.

    • Informatica provides a built-in SCD Type 2 transformation to implement this technique.

    • Example: tracking changes in customer addresses over time.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Kindly focus on basic BI terminologies, common to trivial scenarios and introductory information on latest trending tools and technologies.

Skills evaluated in this interview

I applied via Company Website and was interviewed before Jan 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. Pl sql Unix api configuration
  • Q2. Routing how to use proxy
  • Ans. 

    Routing through a proxy involves configuring the proxy server to forward requests to the destination server.

    • Configure the proxy server to listen for incoming requests

    • Configure the proxy server to forward requests to the destination server

    • Configure the client to use the proxy server for outgoing requests

    • Use a proxy server to bypass network restrictions or improve performance

    • Examples: Nginx, Apache, Squid

  • Answered by AI
Round 3 - One-on-one 

Interview Preparation Tips

Interview preparation tips for other job seekers - Avoid this company. You can be fired any day without notice.

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

Timing: 6:00 pm
3 coding questions of medium to be solved in 70 minutes.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.

    Input:

    The first line of input contains the size of the arr...
  • Ans. 

    Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.

    • Use Kadane's algorithm to find the maximum subarray sum in O(N) time.

    • Initialize two variables: maxEndingHere and maxSoFar to keep track of the maximum sum.

    • Iterate through the array and update the variables accordingly.

    • Return the maxSoFar as the result.

  • Answered by AI
  • Q2. 

    Closest Leaf in a Binary Tree

    Ninja is stuck in a maze represented as a binary tree, and he is at a specific node ‘X’. Help Ninja find the shortest path to the nearest leaf node, which is considered an ex...

  • Ans. 

    Find the minimum distance from a given node to the nearest leaf node in a binary tree.

    • Traverse the binary tree from the given node 'X' to find the nearest leaf node.

    • Use a queue for level order traversal to efficiently find the nearest leaf node.

    • Calculate the distance from node 'X' to each leaf node and return the minimum distance.

  • Answered by AI
  • Q3. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process of oranges.

    • Track the time taken to rot all fresh oranges and return the result.

    • If any fresh oranges remain after simulation, return -1 as it is impossible to rot all oranges.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was friendly, encouraging, and humble.

  • Q1. 

    Smallest Integer Not Representable as Subset Sum

    Given a non-decreasing sorted array ARR of N positive numbers, determine the smallest positive integer that cannot be expressed as the sum of elements from...

  • Ans. 

    The task is to find the smallest positive integer value that cannot be represented as a sum of elements of any proper subset of the given array.

    • The array is sorted in non-decreasing order, so we can iterate through the array and keep track of the maximum sum we can form.

    • If the current element is greater than the maximum sum + 1, then the maximum sum + 1 is the smallest positive integer that cannot be represented.

    • If all...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Medium

Timing: 2:00 pm
Online round over google meet, code at google docs.
The interviewer was not speaking much. It was a bit strange.

  • Q1. 

    Bottom Right View of Binary Tree Problem Statement

    Your task is to identify and return the bottom right view of a given binary tree.

    This involves viewing the binary tree from an angle of 45 degrees from...

  • Ans. 

    Identify and return the bottom right view of a given binary tree by viewing it from an angle of 45 degrees from the bottom right side.

    • Traverse the binary tree in a right-to-left manner and keep track of the last node encountered at each level.

    • Use a queue for level order traversal and update the result array with the last node at each level.

    • Return the result array sorted in ascending order as the bottom right view of th

  • Answered by AI
Round 4 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

Timing: 7:00 pm
The interviewer was friendly and in a bit of a hurry.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indraprastha Institute of Information Technology Delhi. I applied for the job as SDE - 1 in DelhiEligibility criteriaNone except no active backlogsPaytm (One97 Communications Limited) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DP, OOPS, Operating Systems, Computer Networks, DBMSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : DSA is the key. Starting from scratch, one can become proficients in a couple of months.
Tip 2 : Solve questions just a bit outside your comfort zone. Solve too easy to too hard questions is not of any use.
Tip 3 : Be consistent, make a habit of following good coding practices.
Tip 4 : Get to know the ins and out of your projects. You must be very confident while explaining those.
Tip 5 : Don't just directly to system-design, brush up on OOPS principles, networks, OS, DBMS before that.

Application resume tips for other job seekers

Tip 1: Keep it crisp and to the point. Make bullet points.
Tip 2: Bold the things you want to be paid attention to. Use numbers rather than vague sentences.
Tip 3: Only put the things you are confident about.
Tip 4: Don't put things irrelevant to the job, it only dilutes the main content.

Final outcome of the interviewSelected

Skills evaluated in this interview

Visa Interview FAQs

How many rounds are there in Visa Staff Engineer interview?
Visa interview process usually has 2-3 rounds. The most common rounds in the Visa interview process are Technical, Coding Test and Resume Shortlist.
How to prepare for Visa Staff Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Visa. The most common topics and skills that interviewers at Visa expect are Computer science, Python, SQL, Automation and Coding.
What are the top questions asked in Visa Staff Engineer interview?

Some of the top questions asked at the Visa Staff Engineer interview -

  1. Difference between map and hash tab...read more
  2. Basic questions on TPF, TPFDF, ASSEMBLE...read more
  3. Situation or Scenario based questi...read more

Tell us how to improve this page.

Visa Staff Engineer Interview Process

based on 3 interviews

Interview experience

4.7
  
Excellent
View more

Interview Questions from Similar Companies

ICICI Bank Interview Questions
4.0
 • 2.4k Interviews
HDFC Bank Interview Questions
3.9
 • 2.1k Interviews
Axis Bank Interview Questions
3.8
 • 1.5k Interviews
Paytm Interview Questions
3.3
 • 753 Interviews
American Express Interview Questions
4.2
 • 361 Interviews
PayPal Interview Questions
3.9
 • 207 Interviews
HighRadius Interview Questions
2.9
 • 184 Interviews
Fiserv Interview Questions
3.0
 • 172 Interviews
Razorpay Interview Questions
3.6
 • 148 Interviews
View all
Visa Staff Engineer Salary
based on 70 salaries
₹24.6 L/yr - ₹64 L/yr
27% more than the average Staff Engineer Salary in India
View more details

Visa Staff Engineer Reviews and Ratings

based on 10 reviews

3.6/5

Rating in categories

3.3

Skill development

3.6

Work-life balance

3.8

Salary

3.7

Job security

3.0

Company culture

3.2

Promotions

3.3

Work satisfaction

Explore 10 Reviews and Ratings
Senior Software Engineer
646 salaries
unlock blur

₹14.5 L/yr - ₹44 L/yr

Software Engineer
248 salaries
unlock blur

₹9.7 L/yr - ₹34.6 L/yr

Staff Software Engineer
157 salaries
unlock blur

₹20 L/yr - ₹61 L/yr

Senior Data Engineer
91 salaries
unlock blur

₹20 L/yr - ₹45 L/yr

Senior Software Test Engineer
87 salaries
unlock blur

₹18 L/yr - ₹41.6 L/yr

Explore more salaries
Compare Visa with

MasterCard

3.9
Compare

American Express

4.2
Compare

PayPal

3.9
Compare

State Bank of India

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