What is a database index and when should you add one? — Deloitte interview
Reported in Deloitte interview 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 Deloitte interview loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in Deloitte interview loops. HR negotiation question requiring research and flexible framing.
Reported in Deloitte interview loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in Deloitte interview loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in Deloitte interview loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.
Reported in Deloitte interview loops. Graph traversal question covering shortest paths, connectivity, and complexity.
Reported in Deloitte interview loops. Pointer manipulation staple for junior coding interviews.
Reported in Deloitte interview loops. Foundational search algorithm with clear loop invariants and edge cases.
Reported in Deloitte interview loops. Classic array + hash map problem testing optimal time–space trade-offs.
Reported in Accenture interview loops. Security and networking question covering encryption, certificates, and performance.
Reported in Accenture interview loops. SQL performance question covering B-trees, composite indexes, and trade-offs.
Reported in Accenture interview loops. HR negotiation question requiring research and flexible framing.
Reported in Accenture interview loops. Sort-and-sweep array problem common in calendar and scheduling interviews.
Reported in Accenture interview loops. Sliding window pattern for substring problems with hash set or map tracking.
Reported in Accenture interview loops. Tree recursion warm-up that often leads to balanced-tree and diameter follow-ups.