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