Interview atlas
Explore 105 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered Ericsson ×
Reported in Ericsson European engineering loops. Classic linked list pointer question in entry and mid-level interviews.
Reported in Ericsson European engineering loops. Hash set based linear-time approach for sequence detection.
Reported in Ericsson European engineering loops. Heap and selection strategy question with multiple valid approaches.
Reported in Ericsson European engineering loops. Advanced string window question seen in strong coding interviews.
Reported in Ericsson European engineering loops. Graph traversal question using DFS or BFS flood-fill.
Reported in Ericsson European engineering loops. Topological sort and directed cycle detection interview staple.
Reported in Ericsson European engineering loops. Dynamic programming optimization with unbounded choices.
Reported in Ericsson European engineering loops. Simple but important recurrence-based DP interview problem.
Reported in Ericsson European engineering loops. Data structure trade-off question for autocomplete and dictionary lookups.
Reported in Ericsson European engineering loops. Hard interview classic requiring binary search partition logic.
Reported in Ericsson European engineering loops. Disjoint set union structure used in graph connectivity interviews.
Reported in Ericsson European engineering loops. Pattern recognition question for linear-time array scans.
Reported in Ericsson European engineering loops. System design problem testing reliability, fan-out, and channel abstraction.
Reported in Ericsson European engineering loops. Design question around large files, durability, and secure uploads.
Reported in Ericsson European engineering loops. System design interview around indexing, ranking, and freshness.