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