What is a database index and when should you add one? — Rivian interview
Reported in Rivian USA engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Interview atlas
Explore 2,994 curated Q&As across 124 employers — filter by career stage, round, or company.
Reported in Rivian USA engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in Rivian USA engineering loops. HR negotiation question requiring research and flexible framing.
Reported in Rivian USA engineering loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in Rivian USA engineering loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in Rivian USA engineering loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in Rivian USA engineering loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in Rivian USA engineering loops. Pointer manipulation staple for junior coding interviews.
Reported in Rivian USA engineering loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in Rivian USA engineering loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in Anduril USA engineering loops. Recruiter or HR question about logistics, time zones, and loop structure.
Reported in Anduril USA engineering loops. Security and networking question covering encryption, certificates, and performance.
Reported in Anduril USA engineering loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in Anduril USA engineering loops. HR negotiation question requiring research and flexible framing.
Reported in Anduril USA engineering loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in Anduril USA engineering loops. Sliding window pattern for substring problems with hash set or map tracking.