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