Explain INNER, LEFT, RIGHT, and FULL OUTER JOIN with examples — Criteo interview
Reported in Criteo European engineering loops. SQL fundamentals question for filtering and combining relational data.
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. SQL fundamentals question for filtering and combining relational data.
Reported in Criteo European engineering loops. Graph algorithm for task scheduling, build systems, and course prerequisites.
Reported in Criteo European engineering loops. Senior system design combining sharding, eviction, consistency, and observability.
Reported in Criteo European engineering loops. Lead and senior managerial question on architecture judgment and stakeholder alignment.
Reported in Criteo European engineering loops. Opening HR/behavioral question setting narrative arc for the entire interview.
Reported in Criteo European engineering loops. Stack-based DSA question that checks correctness under nested and mixed brackets.
Reported in Criteo European engineering loops. Frequent array optimization question testing dynamic programming intuition.
Reported in Criteo European engineering loops. Array prefix-suffix pattern often asked in coding rounds.
Reported in Criteo European engineering loops. Classic linked list pointer question in entry and mid-level interviews.
Reported in Criteo European engineering loops. Hash set based linear-time approach for sequence detection.
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.