American Express Interview Guide

Showing 3 of 25 questions

Ranking

A question's ranking corresponds to how commonly it's asked by American Express. The higher the ranking, the more likely you'll encounter it in a American Express interview.

Question

Frequency

Difficulty

Minimum Deletions to Make Character Frequencies Unique

Given a string, find the minimum number of characters you must delete so that all remaining character frequencies are unique. No two characters can have the same frequency.

ArraysGreedy Algorithms

Very likely

If you have a American Express interview, it's very likely that you will get this question

Medium

#1. Minimum Deletions to Make Character Frequencies Unique

Medium

Given a string, find the minimum number of characters you must delete so that all remaining character frequencies are unique. No two characters can have the same frequency.

ArraysGreedy Algorithms

This question is very likely to be asked in your American Express interview

Maximum Equal Frequency

Given an array of numbers, find the longest prefix where removing exactly one element makes all remaining element frequencies equal. Return the length of this prefix.

ArraysSliding WindowsGreedy Algorithms

Very likely

If you have a American Express interview, it's very likely that you will get this question

Hard

#2. Maximum Equal Frequency

Hard

Given an array of numbers, find the longest prefix where removing exactly one element makes all remaining element frequencies equal. Return the length of this prefix.

ArraysSliding WindowsGreedy Algorithms

This question is very likely to be asked in your American Express interview

Find a Value of a Mysterious Function Closest to Target

You're given a mysterious function and a target value. Find an input value to the function that produces an output closest to the target.

ArraysSliding WindowsBit Manipulation

Very likely

If you have a American Express interview, it's very likely that you will get this question

Hard

#3. Find a Value of a Mysterious Function Closest to Target

Hard

You're given a mysterious function and a target value. Find an input value to the function that produces an output closest to the target.

ArraysSliding WindowsBit Manipulation