American Express
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I was interviewed before Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
It consist three question - first que is of related to tree and i gave difficulty level of this question as hard. second que is of based on logical and reasoning , it is medium level question and third que can be done by map and it is also medium level que.
In codility platform we are not able to see hidden test cases whether it is satisfied or not . we just have to submit after passing sample testcases.
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
T (number of test cases)
For each test case:
N (siz...
The minimum number of swaps required to sort a given array of distinct elements in ascending order.
Use a graph-based approach to find cycles in the array
Count the number of swaps needed to fix each cycle
Sum up the swaps needed for all cycles to get the total minimum swaps
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
The first line consists of an...
Find the maximum sum of a subsequence without choosing adjacent elements in an array.
Use dynamic programming to keep track of the maximum sum at each index, considering whether to include or exclude the current element.
At each index, the maximum sum is either the sum of the current element and the sum two positions back, or the sum at the previous index.
Iterate through the array and update the maximum sum accordingly.
E...
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a...
Print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node encountered at each level
Use a queue to perform level order traversal
Keep track of the current level and the maximum level seen so far
Round duration - 30 minutes
Round difficulty - Medium
basically this round is just same as HR round . they asked me behavioural questions and about my projects , hackathon. the timing is mid noon and interviewer is supportive , it makes first comfortable then start questioning . for this round i suggest be honest , don't just express your qualities but trying to show them by your skills and work.
Tip 1 : all we know focus on ds and algorithms is must but how should we prepare ? so , the answer is read concepts and then practice question topic wise or company wise in gfg.
Tip 2 : do focus on cp it is must to clear very first coding round. Also many of them do cp but in their comfort zone that means those question from which they have good hold but i say this would not give any benefit . so , solve que out of comfort zone , which takes time but is is most efficient way.
Tip 3 : Also balance between cp and projects is must.
Tip 1 : it is crisp . for ex - you have a good knowledge on java, cpp , c , python . and lets say you have basic knowledge of html,css then don't mention these subjects.
Tip 2 : Achievements should be in reverse chronological order like first focus on college achievements , then on school.
Tip 3 : i saw like many of them made just one resume and use for all , but i suggest each time made resume according to post you apply for and in which company. which increases your chances in shortlisted candidates.
I was interviewed before Sep 2020.
Round duration - 120 minutes
Round difficulty - Easy
It consisted of 3 coding questions which were purely based on Data Structures and Algorithms.
Question 1 - Find the length of the longest switching sub-array. An array is called switching if all numbers in even positions are equal and all numbers in odd positions are equal.
Question 2 - It was a long passage question on Dynamic Programming but the solution was really easy.
Question 3 - Given a string S consisting of N lowercase letters, return the minimum number of letters that must be deleted to obtain a word in which every letter occurs a unique number of times. Ex - "aaaabbbb" should return 1, as when we delete 1 a or 1 b , a and b will have different frequencies.
The major point to note in the coding round was that they did not have any time or space limit, so brute force solutions were also accepted.
The result of my test was declared just as the test ended and I scored a 100%, but they took a long time to release the final shortlist. There was a gap of about a week between the test and interviews.
Determine the length of the longest contiguous subarray in a given array of positive integers, where the subarray qualifies as 'switching'. An array is defined...
Find the length of the longest switching subarray in a given array of positive integers.
Iterate through the array and keep track of the longest switching subarray found so far.
Check if the numbers at even and odd positions are identical to determine a switching subarray.
Return the length of the longest switching subarray.
Example: For input [1, 4, 1, 4, 3, 2, 3, 0], the longest switching subarray is [1, 4, 1, 4] with le
Given a string 'STR' with lowercase letters, determine the minimum number of deletions required to ensure that every letter in the string appears a unique number of time...
The task is to find the minimum number of deletions needed in a string to ensure each character appears a unique number of times.
Iterate through the string and count the frequency of each character
Track the frequencies in a hashmap
Identify the characters with duplicate frequencies and calculate the minimum deletions needed
Return the minimum number of deletions for each test case
Round duration - 40 minutes
Round difficulty - Easy
Amex came for two profiles - Tech Role and Analyst, 19 and 23 people respectively were shortlisted for the interviews. Fortunately, I was shortlisted for both the roles. I was asked basic question of C++ and it was majorly an HR Round
Round duration - 20 minutes
Round difficulty - Easy
It was a fairly simple round conssting of 5 - 6 questions related to coding, puzzles and me.
What are your interests?
What projects have you done and your field of interest?
Round duration - 50 minutes
Round difficulty - Easy
This round was purely technical
No introduction was done, straight to the point
My preference was the Tech Role, so as I was selected in this, I never had to give interviews for the Analyst role. In total 5 people were selected in the Analyst profile and 4 in the Tech profile.
In the end, I was offered a 6 months internship at Amex.
Given a singly linked list of integers, determine if it is a palindrome. A linked list is considered a palindrome if it reads the same forward and backward.
Check if a singly linked list is a palindrome by comparing elements from both ends.
Traverse the linked list to find the middle point
Reverse the second half of the linked list
Compare the first half with the reversed second half to check for palindrome
Example: Input: 1 2 3 2 1 -1, Output: true
Tip 1 : Do practice a lot of data structures from renowned websites like LeetCode and also from CodeZen
Tip 2 : In your introduction, when asked, you just need to tell your life story.
Tip 3 : Maintain eye contact with the interviewers and clarify every details about the question before proceeding to the solution
Tip 1: Add most recent and relevant projects only
Tip 2: you should know each and everything written on your resume
I was interviewed before Sep 2020.
Round duration - 120 minutes
Round difficulty - Easy
The coding round was at 11 am in the morning. The questions were of medium level. The questions were purely based on Data Structures and Algorithms.
Given an array of integers ARR
of length 'N' and a positive integer 'K', find the maximum elements for each contiguous subarray of size K.
ARR = [3, 4,...
Implement a function to find maximum elements for each contiguous subarray of size K in an array of integers.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque that are out of the current window and add the maximum element to the result array.
Return the result array containing maximum elements for each subarray of size K.
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.
The first...
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 in the substring.
Maintain a hashmap to store the characters and their frequencies within the window.
Update the window size and characters count as you iterate through the string.
Keep track of the longest substring length with at most K distinct char...
Round duration - 45 minutes
Round difficulty - Easy
I was selected for the interview. The interview was conducted early in the morning at 10 am. The interviewer was very friendly and calm.
Round duration - 30 minutes
Round difficulty - Easy
This round was a mix of technical, puzzles and HR. The interview was fairly easy, The interviewer asked for my introduction and continued with the interview then.
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Implement a stack using two queues to store integer values with specified functions.
Use two queues to simulate stack operations efficiently.
Maintain one queue for storing elements and another for temporary storage during push operation.
Ensure proper handling of edge cases like empty stack or invalid operations.
Example: Push operation involves transferring elements from one queue to another before adding the new element...
Round duration - 45 minutes
Round difficulty - Easy
This was the last round for getting selected as an intern. However, this was a pure technical round. Only coding questions were asked. Also, at the end he asked me the question, Why American express?
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
A...
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
You are provided with two sorted lists of closed intervals, INTERVAL1
and INTERVAL2
. A closed interval [x, y] (x < y) signifies the set of real numbers z such that x ...
Find the intersections of two sorted lists of closed intervals.
Iterate through both interval lists to find intersections
Compare the intervals and find the common range
Handle cases where there is no intersection between intervals
Tip 1 : Have confidence in Data Structures and Algorithms. Have your concepts very clear and then pick one coding platform( leetcode, InterviewBit, CodeZen, GeeksForGeeks) and try to practice around 7-10 questions everyday with varying difficulty and different topics.Also solving questions is not enough, try to optimize it. Analyze its space and time complexities.
Tip 2 : Study properly about OOPS concepts. Coding Ninja's Data Structures and Algorithms course is great for preparing the OOPS concepts specifically. For OS and DBMS refer to your college notes and GeekForGeeks articles.
Tip 3 : Keep participating in coding contests. It helps you increase your problem solving skills.
Tip 1 : Add those skills, projects and achievements which are relevant to your role.
Tip 2 : Do not fake any skills, projects or achievements.
Tip 3 : You do need to have a several number of projects. 1 good project with good knowledge of it will also do fine. The similar rule goes for skills also.
Tip 4 : Try to write achievements which proves your technical skills, leadership quality, communication skills or teamwork.
What people are saying about American Express
I was interviewed before Nov 2020.
Given a list of cities numbered from 0 to N-1 and a matrix DISTANCE
consisting of 'N' rows and 'N' columns, representing the distances between each pair of cities, find the sho...
Tip 1 : Do competitive programming in 1st and 2nd yr
Tip 2 : Clear the basic of all data structures, algorithms and time, space complexities before trying leetcode.
Tip 3 : Dedicate 2-3 months to Interviewbit.
Tip 1 : Have atleast 2 projects.
Tip 2 : Competitive Coding ranks gives advantage.
American Express interview questions for designations
Race condition is a situation where multiple threads/processes access and manipulate shared data simultaneously.
It can be eliminated by using synchronization techniques like locks, semaphores, and mutexes.
Another way is to use atomic operations that ensure the data is accessed and modified atomically.
Using thread-safe data structures can also prevent race conditions.
Example: Two threads trying to increment a shared var...
JCube is a Java library for creating and manipulating Rubik's Cube puzzles.
JCube provides classes for representing Rubik's Cube puzzles and algorithms for solving them.
It supports various cube sizes and can generate random scrambles.
JCube can be used in Java applications or as a standalone command-line tool.
It is open source and available on GitHub.
Regression testing is the process of testing changes made to a software application to ensure that existing functionality still works.
It is performed after making changes to the software
It ensures that existing functionality is not affected by the changes
It helps to catch any defects or bugs that may have been introduced
It can be automated using testing tools
Examples include retesting after bug fixes, testing after new
Software engineering principles are the best practices and guidelines for developing high-quality software.
Software should be designed with modularity and scalability in mind.
Code should be well-documented and easy to read.
Testing and debugging should be an integral part of the development process.
Version control should be used to manage code changes.
Security and privacy should be considered throughout the development
A Singleton class is a class that can only have one instance at a time.
It restricts the instantiation of a class to a single object.
It provides a global point of access to that instance.
It is often used in situations where a single object is required to coordinate actions across a system.
Example: Database connection manager, Configuration manager, Logger manager.
Testing principles ensure software quality, while design principles guide software development.
Testing principles include unit testing, integration testing, and acceptance testing.
Design principles include SOLID, DRY, and KISS.
Testing principles ensure that software meets requirements and is free of defects.
Design principles guide software development to be modular, maintainable, and scalable.
I have the necessary skills, experience, and passion to contribute to VISA's success.
I have a strong background in software development and have worked on projects similar to those at VISA.
I am a quick learner and can adapt to new technologies and programming languages easily.
I am passionate about creating high-quality software that meets the needs of users and exceeds their expectations.
I am a team player and can work...
A profile that challenges me to learn and grow while allowing me to contribute to a team.
A position that encourages continuous learning and development
A role that allows me to collaborate with a team and contribute to projects
A company culture that aligns with my values and work ethic
I am interested in exploring new opportunities and challenges that this company can offer.
I am impressed with the company's reputation and growth potential.
I am excited about the projects and technologies this company is working on.
I believe this company can provide me with a better work-life balance and career growth opportunities.
I am looking for a company culture that aligns with my values and goals.
I am open to exp...
Autocomplete in IDEs helps developers write code faster by suggesting code snippets and completing code as they type.
Autocomplete should suggest code snippets based on the context of the code being written
Autocomplete should prioritize suggestions based on frequency of use
Autocomplete should also suggest variable and function names
Autocomplete should be customizable to allow for user-defined snippets and suggestions
Exa...
My weakness is public speaking.
I tend to get nervous when speaking in front of large groups.
I am working on improving my public speaking skills by practicing and seeking feedback.
I have taken courses and attended workshops to help me overcome my fear of public speaking.
Comparing 2 basketball game scenarios with different number of trials and baskets required to win
Calculate the probability of winning in each game scenario using binomial distribution formula
Compare the probabilities to determine which game scenario is preferable
In game1, the probability of winning is p. In game2, the probability of winning is the sum of probabilities of making 2 or 3 baskets
If p is high, game1 is pref...
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Implement Binary Search Tree using given array of strings.
Sort the array in ascending order
Find the middle element and make it the root of the tree
Recursively create left and right subtrees using the left and right halves of the array
Repeat until all elements are added to the tree
Print the given Binary search tree in ascending order
Traverse the left subtree recursively
Print the root node
Traverse the right subtree recursively
Find buy and sell points for maximum profit in an array of stock prices in O(n)
Iterate through the array and keep track of the minimum price seen so far
Calculate the profit at each index by subtracting the minimum price from the current price
Update the maximum profit and buy/sell points accordingly
Return the buy and sell points for maximum profit
Chennai faces problems related to water scarcity, traffic congestion, and pollution.
Water scarcity due to inadequate rainfall and poor management of water resources.
Traffic congestion due to the increasing number of vehicles and poor road infrastructure.
Pollution caused by industries, vehicular emissions, and improper waste disposal.
Need more context on the question to provide an answer.
Please provide more information on the problem to be solved.
Without context, it is difficult to provide a solution.
Can you please provide more details on the problem statement?
Visa is a global payments technology company that connects consumers, businesses, banks and governments in more than 200 countries and territories.
Visa operates the world's largest retail electronic payments network.
VisaNet, the company's global processing system, handles more than 65,000 transaction messages a second.
Visa is constantly innovating to improve payment security and convenience, with initiatives such as Vi...
Developed a web application using Python and Django framework for managing inventory and sales.
Used Python programming language for backend development
Implemented Django framework for building web application
Designed database schema for inventory and sales data
Integrated frontend using HTML, CSS, and JavaScript
Implemented user authentication and authorization features
Business Analyst
875
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
702
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
590
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
544
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Analyst
491
salaries
| ₹0 L/yr - ₹0 L/yr |
MasterCard
Visa
PayPal
State Bank of India