Interview atlas
Explore 28 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered N26 ×
Reported in N26 European engineering loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in N26 European engineering loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in N26 European engineering loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in N26 European engineering loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in N26 European engineering loops. HR negotiation question requiring research and flexible framing.
Reported in N26 European engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in N26 European engineering loops. Security and networking question covering encryption, certificates, and performance.
Reported in N26 European engineering loops. Array prefix-suffix pattern often asked in coding rounds.
Reported in N26 European engineering loops. Hash set based linear-time approach for sequence detection.
Reported in N26 European engineering loops. Heap and selection strategy question with multiple valid approaches.
Reported in N26 European engineering loops. Topological sort and directed cycle detection interview staple.
Reported in N26 European engineering loops. Dynamic programming optimization with unbounded choices.
Reported in N26 European engineering loops. Pattern recognition question for linear-time array scans.