Interview atlas
Explore 100 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered Tech Mahindra ×
Reported in Tech Mahindra interview loops. Hash set based linear-time approach for sequence detection.
Reported in Tech Mahindra interview loops. Heap and selection strategy question with multiple valid approaches.
Reported in Tech Mahindra interview loops. Advanced string window question seen in strong coding interviews.
Reported in Tech Mahindra interview loops. Graph traversal question using DFS or BFS flood-fill.
Reported in Tech Mahindra interview loops. Topological sort and directed cycle detection interview staple.
Reported in Tech Mahindra interview loops. Dynamic programming optimization with unbounded choices.
Reported in Tech Mahindra interview loops. Simple but important recurrence-based DP interview problem.
Reported in Tech Mahindra interview loops. Data structure trade-off question for autocomplete and dictionary lookups.
Reported in Tech Mahindra interview loops. Hard interview classic requiring binary search partition logic.
Reported in Tech Mahindra interview loops. Disjoint set union structure used in graph connectivity interviews.
Reported in Tech Mahindra interview loops. Pattern recognition question for linear-time array scans.
Reported in Tech Mahindra interview loops. System design problem testing reliability, fan-out, and channel abstraction.
Reported in Tech Mahindra interview loops. Design question around large files, durability, and secure uploads.
Reported in Tech Mahindra interview loops. System design interview around indexing, ranking, and freshness.
Reported in Tech Mahindra interview loops. Critical design topic focused on correctness under retries and failures.