American-Express Questions
Here are the LeetCode questions for American-Express.
Total: 24
Easy: 9
Medium: 11
Hard: 4
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 10 | |
| 2 | String | 8 | |
| 3 | Hash Table | 7 | |
| 4 | Two Pointers | 5 | |
| 5 | Math | 3 | |
| 6 | Dynamic Programming | 3 | |
| 7 | Stack | 2 | |
| 8 | Sorting | 2 | |
| 9 | Simulation | 2 | |
| 10 | Linked List | 1 | |
| 11 | Backtracking | 1 | |
| 12 | Greedy | 1 | |
| 13 | Tree | 1 | |
| 14 | Depth-First Search | 1 | |
| 15 | Breadth-First Search | 1 | |
| 16 | Design | 1 | |
| 17 | Trie | 1 | |
| 18 | Sliding Window | 1 | |
| 19 | Heap (Priority Queue) | 1 | |
| 20 | Matrix | 1 | |
| 21 | Monotonic Stack | 1 | |
| 22 | Data Stream | 1 | |
| 23 | Enumeration | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Divide an Array Into Subarrays With Minimum Cost II | Visit | Hard | |
| 2 | Divide an Array Into Subarrays With Minimum Cost I | Visit | Easy | |
| 3 | Minimum Number of Operations to Make Array XOR Equal to K | Visit | Medium | |
| 4 | Maximum XOR After Operations | Visit | Medium | |
| 5 | Percentage of Letter in String | Visit | Easy | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 24 questions for free!
Log In