SAP Coding Interview Questions
We track 42 coding questions asked at SAP, tagged with the algorithms and concepts they test. The most common: Array, String, Two Pointers, Dynamic Programming, Hash Table.
Browse all 42 SAP questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array19.4%
- Two Pointers8.2%
- String8.1%
- Math6.5%
- Dynamic Programming5.8%
- Hash Table5.6%
- Linked List4.0%
- Stack3.8%
- Recursion2.6%
- Depth-First Search2.5%
- Other (29)33.9%
How many questions involve each concept
Share of all 42 tracked SAP questions that touch each concept. Questions usually involve several, so these overlap.
- Array54.8%
- String21.4%
- Two Pointers21.4%
- Dynamic Programming19.0%
- Hash Table16.7%
- Math14.3%
- Linked List11.9%
- Stack11.9%
- Depth-First Search9.5%
- Binary Tree7.1%
- Breadth-First Search7.1%
- Matrix7.1%
Where SAP differs from the average company
Concept weight at SAP relative to the average across all companies we track. Green means SAP leans on it harder than most.
- Recursion2.4×
- Two Pointers2.3×
- Linked List1.9×
- Monotonic Stack1.9×
- Binary Search0.80×
- Matrix0.74×
- Greedy0.67×
- Sorting0.59×
SAP specialties
Concepts that show up at SAP but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 42 tracked SAP questions.
- Junior38% (16)
- Mid/Senior48% (20)
- Staff14% (6)
Every concept in SAP interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 23 | 54.8% | 19.4% |
| String | 9 | 21.4% | 8.1% |
| Two Pointers | 9 | 21.4% | 8.2% |
| Dynamic Programming | 8 | 19.0% | 5.8% |
| Hash Table | 7 | 16.7% | 5.6% |
| Math | 6 | 14.3% | 6.5% |
| Linked List | 5 | 11.9% | 4.0% |
| Stack | 5 | 11.9% | 3.8% |
| Depth-First Search | 4 | 9.5% | 2.5% |
| Binary Tree | 3 | 7.1% | 2.0% |
| Breadth-First Search | 3 | 7.1% | 1.9% |
| Matrix | 3 | 7.1% | 1.7% |
| Recursion | 3 | 7.1% | 2.6% |
| Sorting | 3 | 7.1% | 2.3% |
| Tree | 3 | 7.1% | 2.0% |
| Binary Search | 2 | 4.8% | 2.4% |
| Design | 2 | 4.8% | 1.4% |
| Divide and Conquer | 2 | 4.8% | 1.3% |
| Enumeration | 2 | 4.8% | 1.1% |
| Greedy | 2 | 4.8% | 2.0% |
| Monotonic Stack | 2 | 4.8% | 1.3% |
| Prefix Sum | 2 | 4.8% | 1.7% |
| Backtracking | 1 | 2.4% | 0.8% |
| Binary Indexed Tree | 1 | 2.4% | 0.5% |
| Binary Search Tree | 1 | 2.4% | 0.6% |
| Bit Manipulation | 1 | 2.4% | 0.5% |
| Bitmask | 1 | 2.4% | 0.5% |
| Combinatorics | 1 | 2.4% | 0.8% |
| Counting | 1 | 2.4% | 0.8% |
| Database | 1 | 2.4% | 2.4% |
| Doubly-Linked List | 1 | 2.4% | 0.6% |
| Graph Theory | 1 | 2.4% | 0.8% |
| Heap (Priority Queue) | 1 | 2.4% | 0.5% |
| Number Theory | 1 | 2.4% | 0.6% |
| Queue | 1 | 2.4% | 0.8% |
| Quickselect | 1 | 2.4% | 0.5% |
| Sliding Window | 1 | 2.4% | 0.8% |
| Trie | 1 | 2.4% | 0.8% |
| Union-Find | 1 | 2.4% | 0.5% |
Practice a SAP interview
Take a realistic AI-led mock interview with questions SAP actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required