American Express
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
There were three coding questions.
I applied via Company Website and was interviewed in Aug 2024. There was 1 interview round.
Use streams to find prime numbers in an array
Use Java streams to filter out non-prime numbers from the array
Check if a number is prime by dividing it by all numbers less than its square root
Create a method to check if a number is prime
Basic coding questions were asked , majorly focused on graph and trees
What people are saying about American Express
90 mins in Codility platforms
American Express interview questions for designations
I leverage Spring Java for dependency injection, MVC framework, and transaction management in my projects.
Utilize Spring's dependency injection to manage object dependencies and improve code maintainability
Leverage Spring MVC framework for building web applications with clean separation of concerns
Use Spring's transaction management to ensure data integrity and consistency in database operations
Get interview-ready with Top American Express Interview Questions
Implement security in microservices by using authentication, authorization, encryption, and monitoring.
Use authentication mechanisms like OAuth, JWT, or API keys to verify the identity of clients accessing the microservices.
Implement authorization controls to define what actions users can perform within the microservices.
Encrypt data in transit and at rest using protocols like HTTPS and TLS, and tools like Vault or AWS...
I applied via Job Fair and was interviewed before Nov 2023. There were 2 interview rounds.
Program to print 1 to n prime numbers
Iterate from 2 to n and check if each number is prime
Use a function to check if a number is prime
Print the prime numbers found
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
Normal DS Algo on HackerEarth
I was interviewed in Sep 2021.
Round duration - 90 Minutes
Round difficulty - Medium
You are given a list of N
strings called A
. Your task is to determine whether you can form a given target string by combining one or more strings from A
.
The strings from A
c...
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to form the target string.
Use recursion to try different combinations of strings.
Check if the current combination forms the target string.
Return true if a valid combination is found, otherwise return false.
In a directed graph with 'N' nodes numbered from 0 to N-1, determine whether every possible path starting from a given source node (SRC) eventua...
Determine if all paths from a source node lead to a destination node in a directed graph.
Check if there is at least one path from source to destination.
If a node has no outgoing edges, it should be the destination.
Ensure the number of paths from source to destination is finite.
Traverse the graph to validate all paths lead to the destination.
Round duration - 45 Minutes
Round difficulty - Medium
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 can be either the sum of the current element and the element two positions back, or the sum at the previous index.
Iterate through the array and update the maximum sum accor...
Given a string STR and a non-empty string PTR, identify all the starting indices of anagrams of PTR within STR.
An anagram of a string is another string ...
Given a string STR and a non-empty string PTR, find all starting indices of anagrams of PTR within STR.
Create a frequency map of characters in PTR.
Use sliding window technique to check anagrams in STR.
Return the starting indices of anagrams found.
Round duration - 45 Minutes
Round difficulty - Easy
First half of the interview was based on DBMS, OS and some puzzles. Second half was dedicated to projects related questions.
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Practice atleast 200 leetcode easy to medium level questions
Tip 2 : Take part in hackathon to learn time management during coding test
Tip 3 : Make 2-3 good projects
Tip 1 : It should be ATS friendly
Tip 2 : Do not be repetitive
Tip 3 : Be confident about techs you mention on your resume
I was interviewed before Dec 2020.
Round duration - 90 minutes
Round difficulty - Medium
Given an array of integers and a number 'K', your task is to find the maximum possible sum of disjoint pairs of numbers where the absolute difference...
Find maximum sum of disjoint pairs with absolute difference less than K in an array.
Iterate through the array and sort it.
Find all possible disjoint pairs with absolute difference less than K.
Calculate the sum of these pairs to get the maximum sum.
Ninja, while learning Binary Search Trees (BST), accidentally swapped two nodes in her self-constructed BST. Your task is to help Ninja by correcting the BST so that a...
The task is to correct a Binary Search Tree by swapping two nodes in the tree.
Parse the input level order tree and construct the BST
Identify the two nodes that are swapped incorrectly
Swap the values of the incorrectly swapped nodes to correct the BST
Return the corrected BST in level order form
Tip 1 : Solve Code chef long challenges
Tip 2 : Solve at least problem A, B,C of codeforces competition(help to solve problems in time limit).
Tip 3 : Having at least 1 good project is a plus point.
Tip 1 : Not more than 2 pages(1 page is good)
Tip 2 : Must know about each and every point in the resume.
Tip 3 : There should be no grammatical error in the resume.
based on 8 interviews
1 Interview rounds
based on 3 reviews
Rating in categories
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