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