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