American Express Senior Dispute Analyst Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

The round was divided into 5 parts.
1st part - 2 easy coding questions
2nd part - 7 MCQs
3rd part - 8 MCQs
4th part - 1 hard coding question
5th part - 2 ethical based questions

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
• Implement a doubly linked list to keep track of the order of keys based on their recent usage.

• Use a hashmap to store key-value pairs for quick access.

• When capacity is reached, evict the least recently used item before inserting a new item.

• Update the order of keys in the linked list whenever a key is acc...read more
Answered by AI
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Example of Sub...read more
Ans. 
The goal is to find the maximum sum of a non-empty contiguous subarray within an array of integers.
• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Consider edge cases like all negative numbers in the array.

• Example: For input [1, -3, 4, -2, -1, 6], the maximum subarray sum is 7 (subarray [4, -2, -1, 6]).
Answered by AI
Add your answer
Q3. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Ans. 
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
• Use Breadth First Search (BFS) algorithm to find the shortest path.

• Keep track of visited cells to avoid revisiting them.

• Calculate the path length by counting the number of 1s in the path.

• Return -1 if no valid path exists.
Answered by AI
Add your answer

It was difficult aptitude test. One need to be well versed in aptitude and coding ( any programming language).

Q1. I don't know i didn't pass aptitude test
Add your answer