How do you find the kth largest element efficiently? — Criteo interview
Reported in Criteo European engineering loops. Heap and selection strategy question with multiple valid approaches.
Interview atlas
Explore 105 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered Criteo ×
Reported in Criteo European engineering loops. Heap and selection strategy question with multiple valid approaches.
Reported in Criteo European engineering loops. Advanced string window question seen in strong coding interviews.
Reported in Criteo European engineering loops. Graph traversal question using DFS or BFS flood-fill.
Reported in Criteo European engineering loops. Topological sort and directed cycle detection interview staple.
Reported in Criteo European engineering loops. Dynamic programming optimization with unbounded choices.
Reported in Criteo European engineering loops. Simple but important recurrence-based DP interview problem.
Reported in Criteo European engineering loops. Data structure trade-off question for autocomplete and dictionary lookups.
Reported in Criteo European engineering loops. Hard interview classic requiring binary search partition logic.
Reported in Criteo European engineering loops. Disjoint set union structure used in graph connectivity interviews.
Reported in Criteo European engineering loops. Pattern recognition question for linear-time array scans.
Reported in Criteo European engineering loops. System design problem testing reliability, fan-out, and channel abstraction.
Reported in Criteo European engineering loops. Design question around large files, durability, and secure uploads.
Reported in Criteo European engineering loops. System design interview around indexing, ranking, and freshness.
Reported in Criteo European engineering loops. Critical design topic focused on correctness under retries and failures.
Reported in Criteo European engineering loops. Geo-spatial system design covering matching latency and surge logic.