Siemens Coding Interview Questions
We track 26 coding questions asked at Siemens, tagged with the algorithms and concepts they test. The most common: Array, Hash Table, Sorting, String, Linked List.
Browse all 26 Siemens questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array19.4%
- Math10.3%
- Hash Table8.5%
- String8.0%
- Linked List6.7%
- Sorting6.4%
- Two Pointers6.4%
- Greedy3.8%
- Recursion3.8%
- Dynamic Programming3.2%
- Other (19)23.7%
How many questions involve each concept
Share of all 26 tracked Siemens questions that touch each concept. Questions usually involve several, so these overlap.
- Array53.8%
- Hash Table26.9%
- Sorting23.1%
- String23.1%
- Linked List15.4%
- Math15.4%
- Two Pointers15.4%
- Greedy11.5%
- Heap (Priority Queue)11.5%
- Binary Indexed Tree7.7%
- Breadth-First Search7.7%
- Depth-First Search7.7%
Where Siemens differs from the average company
Concept weight at Siemens relative to the average across all companies we track. Green means Siemens leans on it harder than most.
- Binary Indexed Tree18.0×
- Segment Tree9.0×
- Recursion3.5×
- Linked List3.2×
- String0.84×
- Breadth-First Search0.77×
- Depth-First Search0.74×
- Dynamic Programming0.52×
Siemens specialties
Concepts that show up at Siemens but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 26 tracked Siemens questions.
- Junior31% (8)
- Mid/Senior54% (14)
- Staff15% (4)
Every concept in Siemens interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 14 | 53.8% | 19.4% |
| Hash Table | 7 | 26.9% | 8.5% |
| Sorting | 6 | 23.1% | 6.4% |
| String | 6 | 23.1% | 8.0% |
| Linked List | 4 | 15.4% | 6.7% |
| Math | 4 | 15.4% | 10.3% |
| Two Pointers | 4 | 15.4% | 6.4% |
| Greedy | 3 | 11.5% | 3.8% |
| Heap (Priority Queue) | 3 | 11.5% | 2.2% |
| Binary Indexed Tree | 2 | 7.7% | 1.8% |
| Breadth-First Search | 2 | 7.7% | 1.7% |
| Depth-First Search | 2 | 7.7% | 1.7% |
| Divide and Conquer | 2 | 7.7% | 1.0% |
| Dynamic Programming | 2 | 7.7% | 3.2% |
| Recursion | 2 | 7.7% | 3.8% |
| Segment Tree | 2 | 7.7% | 1.8% |
| Stack | 2 | 7.7% | 3.2% |
| Binary Search | 1 | 3.8% | 1.3% |
| Bit Manipulation | 1 | 3.8% | 1.9% |
| Bucket Sort | 1 | 3.8% | 0.5% |
| Counting | 1 | 3.8% | 0.5% |
| Design | 1 | 3.8% | 1.0% |
| Doubly-Linked List | 1 | 3.8% | 1.0% |
| Graph Theory | 1 | 3.8% | 1.0% |
| Sweep Line | 1 | 3.8% | 0.5% |
| Matrix | 1 | 3.8% | 0.8% |
| Ordered Set | 1 | 3.8% | 0.5% |
| Quickselect | 1 | 3.8% | 0.5% |
| Union-Find | 1 | 3.8% | 0.8% |
Practice a Siemens interview
Take a realistic AI-led mock interview with questions Siemens actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required