Where can I find company-wise LeetCode questions for American Express?

LeetMap Pro provides a complete, verified list of 28 company-wise American Express coding interview questions filtered by 30-day, 3-month, and 6-month recency windows, 100% free with no paywall or subscription.

How does LeetMap track American Express interview problem recency?

LeetMap weights problem occurrences across 30-day, 3-month, and 6-month recency windows to ensure candidates focus on problems actively being asked in the current hiring cycle.

What difficulty distribution should I expect in American Express coding rounds?

For American Express, Medium difficulty problems represent the largest share (14 problems), followed by Easy (8) and Hard (6). Mastering foundational patterns like Trees, Graphs, and Dynamic Programming is essential.

American ExpressLeetCode Questions

Verified

28 questions·8 Easy·14 Medium·6 Hard

Company-wise coding interview questions asked by American Express, ranked by real frequency across 30-day, 3-month, and 6-month recency windows.

⌘K

#3013Divide an Array Into Subarrays With Minimum Cost II

Hard·Freq 100%·Acc 54.7%

#1647Minimum Deletions to Make Character Frequencies Unique

Medium·Freq 100%·Acc 61.5%

#1201Ugly Number III

Medium·Freq 100%·Acc 31.7%

#1224Maximum Equal Frequency

Hard·Freq 100%·Acc 38.3%

#1521Find a Value of a Mysterious Function Closest to Target

Hard·Freq 100%·Acc 47.4%

#3010Divide an Array Into Subarrays With Minimum Cost I

Easy·Freq 100%·Acc 80.6%

#2278Percentage of Letter in String

Easy·Freq 100%·Acc 75.3%

#2202Maximize the Topmost Element After K Moves

Medium·Freq 100%·Acc 24.1%

#2317Maximum XOR After Operations

Medium·Freq 100%·Acc 80.0%

#1775Equal Sum Arrays With Minimum Number of Operations

Medium·Freq 100%·Acc 54.7%

#2997Minimum Number of Operations to Make Array XOR Equal to K

Medium·Freq 100%·Acc 85.5%

#1Two Sum

Easy·Freq 97%·Acc 57.8%

#4016Maximum Area of Two Non-Overlapping Square Submatrices

Medium·Freq 89%·Acc 0.4%

#242Valid Anagram

Easy·Freq 84%·Acc 68.3%

#121Best Time to Buy and Sell Stock

Easy·Freq 84%·Acc 57.0%

#3Longest Substring Without Repeating Characters

Medium·Freq 79%·Acc 39.4%

#1304Find N Unique Integers Sum up to Zero

Easy·Freq 71%·Acc 78.4%

#2850Minimum Moves to Spread Stones Over Grid

Medium·Freq 71%·Acc 0.5%

#153Sum

Medium·Freq 60%·Acc 39.4%

#189Rotate Array

Medium·Freq 60%·Acc 45.2%

#46Permutations

Medium·Freq 60%·Acc 82.1%

#205Isomorphic Strings

Easy·Freq 60%·Acc 48.7%

#14Longest Common Prefix

Easy·Freq 60%·Acc 47.9%

#142Linked List Cycle II

Medium·Freq 60%·Acc 58.5%

#1250Check If It Is a Good Array

Hard·Freq 60%·Acc 65.5%

#239Sliding Window Maximum

Hard·Freq 60%·Acc 0.5%

#56Merge Intervals

Medium·Freq 60%·Acc 0.5%

#23Merge k Sorted Lists

Hard·Freq 60%·Acc 0.6%

#	Problem	Difficulty	Frequency↓	Acceptance
#3013	Divide an Array Into Subarrays With Minimum Cost II3 sources	Hard	100%	54.7%
#1647	Minimum Deletions to Make Character Frequencies Unique3 sources	Medium	100%	61.5%
#1201	Ugly Number III3 sources	Medium	100%	31.7%
#1224	Maximum Equal Frequency3 sources	Hard	100%	38.3%
#1521	Find a Value of a Mysterious Function Closest to Target3 sources	Hard	100%	47.4%
#3010	Divide an Array Into Subarrays With Minimum Cost I3 sources	Easy	100%	80.6%
#2278	Percentage of Letter in String3 sources	Easy	100%	75.3%
#2202	Maximize the Topmost Element After K Moves3 sources	Medium	100%	24.1%
#2317	Maximum XOR After Operations3 sources	Medium	100%	80.0%
#1775	Equal Sum Arrays With Minimum Number of Operations3 sources	Medium	100%	54.7%
#2997	Minimum Number of Operations to Make Array XOR Equal to K	Medium	100%	85.5%
#1	Two Sum3 sources	Easy	97%	57.8%
#4016	Maximum Area of Two Non-Overlapping Square Submatrices2 sources	Medium	89%	0.4%
#242	Valid Anagram3 sources	Easy	84%	68.3%
#121	Best Time to Buy and Sell Stock3 sources	Easy	84%	57.0%
#3	Longest Substring Without Repeating Characters3 sources	Medium	79%	39.4%
#1304	Find N Unique Integers Sum up to Zero3 sources	Easy	71%	78.4%
#2850	Minimum Moves to Spread Stones Over Grid2 sources	Medium	71%	0.5%
#15	3Sum3 sources	Medium	60%	39.4%
#189	Rotate Array3 sources	Medium	60%	45.2%
#46	Permutations3 sources	Medium	60%	82.1%
#205	Isomorphic Strings3 sources	Easy	60%	48.7%
#14	Longest Common Prefix3 sources	Easy	60%	47.9%
#142	Linked List Cycle II3 sources	Medium	60%	58.5%
#1250	Check If It Is a Good Array3 sources	Hard	60%	65.5%
#239	Sliding Window Maximum2 sources	Hard	60%	0.5%
#56	Merge Intervals2 sources	Medium	60%	0.5%
#23	Merge k Sorted Lists2 sources	Hard	60%	0.6%

Showing 28 of 28 questionsWindow: All Time

American Express Technical Interview Overview & Company-Wise Questions

Software engineering and technical interviews at American Express emphasize real-world problem solving, algorithmic efficiency, and scalable data structure design. The curated dataset above contains 28 verified LeetCode problems, categorized by frequency and filtered across recent interview seasons.

Frequently Asked Questions

What are the top LeetCode questions for American Express?

Leading questions include Divide an Array Into Subarrays With Minimum Cost II, Minimum Deletions to Make Character Frequencies Unique, Ugly Number III. Reviewing questions with higher recency (within the last 30 to 90 days) yields the highest return on preparation time.

Where can I practice company-wise LeetCode questions for American Express?

You can practice all 28 American Express LeetCode questions right here on LeetMap Pro. Filter by 30-day, 3-month, and 6-month recency, track your progress with local checkpoints, and practice curated SQL problems completely free.

How should I prepare for American Express coding rounds?

Begin by reviewing Medium-difficulty problems (14 tracked), which constitute the majority of technical rounds. Complement coding practice with foundational DSA patterns like Sliding Window, Two Pointers, and Graph Traversal.

Explore Peer Tech Firms

Google Questions Meta Questions Amazon Questions Apple Questions Netflix Questions Microsoft Questions Bloomberg Questions Citadel Questions

Recommended Patterns

Dynamic Programming Graph Traversal Two Pointers Roadmap Graph