Assessment tips
- Confirm the current Tech Mahindra pattern from the drive mail before practising old papers
- Finish one problem or section fully before starting the next
- Revise the fundamentals listed in the round table on this page
How Tech Mahindra fresher interviews usually run, synthesized from campus AMCAT/SHL write-ups. We reorganized aptitude → coding/psychometric → conversational → short technical → HR into a prep map - treat this as a volume-recruiter pattern, not a product-company DSA gauntlet.
Typical loop (candidate-reported): Online Assessment (aptitude, essay/story, coding, psychometric) → Conversational / Versant-style spoken English → short Technical interview → HR. Duration often 2-3 weeks from application to offer; some drives split online day from offline interviews ~15 days later.
Eligibility (from student reports): 6.0+ CGPA in 10th, 12th, and graduation.
Fresher package ballpark (from student reports): Associate: ₹3.5-4.5 LPA. Confirm on your offer letter.
| Round | Duration | What they test |
|---|---|---|
| Aptitude + essay / story | 90–142 min | Quant, logical, verbal; sectional cutoffs on many drives |
| Technical + psychometric | 65–90 min | 1–2 coding problems, pseudocode, CS MCQs, personality screen |
| Conversational / Versant-style | 30–90 min | Listening, repetition, spoken English on AMCAT/SHL |
| Technical Interview | 7–45 min | OOPs, SQL, DSA basics, C/Java syntax, projects |
| HR Interview | 15–30 min | Relocation, shifts, motivation, family/background on some campuses |
These are rewritten from public candidate write-ups, not invented composites. Details differ by campus and year.
Tech Mahindra is a volume recruiter, and the write-ups reflect that: the individual stories are thin and repetitive, but they agree closely on the structure, which makes the pattern itself the useful thing here.
Source: Tech Mahindra Interview Experience (On-Campus) - GeeksforGeeks
The same write-up notes multiple package tiers in the same drive, and a probation period after which stronger performers can be routed into CoE training tracks.
Takeaways
Source: Tech Mahindra On-Campus Recruitment Process - GeeksforGeeks
A second account describes the same funnel split into two phases: all online assessments on one day (aptitude/reasoning/verbal, then an essay-writing section judged on clarity and grammar, then a two-question coding test), followed by offline interviews after a gap of roughly 15 days once call letters go out.
The technical interview here was resume-driven and conceptual rather than algorithmic: OOP, SQL and joins, computer networking basics, SDLC and Agile. HR covered relocation, strengths and weaknesses, and hobbies.
Takeaways
Common thread: the elimination happens in the online phase, and the interviews are short conceptual checks. Reports consistently say interviewers test clarity of fundamentals, not advanced coding - so revise OOP, SQL and basic networking well enough to explain them out loud, and do not neglect the English/communication sections.
Source: Tech Mahindra Interview Experience (On Campus) 2024 - 25 - GeeksforGeeks
Takeaway: Even a brief technical slot can follow a long online funnel - have a 30-second project pitch ready before the conversational round, not after.
Source: Tech Mahindra Interview Experience (On-Campus) - GeeksforGeeks
Takeaway: Platform fatigue is real - schedule rest between conversational and live interviews; keep water and a quiet room for the spoken sections.
Source: Synthesised from TimesWave Tech Mahindra 2026 prep guide and multiple campus reposts
Some batches report a single 15–25 minute TR+HR slot instead of separate days: rapid-fire OOPs, SQL, testing basics (defect lifecycle, severity vs priority), then immediate relocation and shift questions. Testing-heavy prompts appear more often at Tech Mahindra than at pure product firms - even general ASE hires get smoke vs sanity or white vs black box vocabulary.
Takeaway: Pack one testing definition, one SQL JOIN explanation, and one relocation answer into the same mental stack; interviewers may not pause between technical and HR.
After technical rounds, Tech Mahindra usually closes with a short HR / hiring-manager conversation: motivation, location, notice period, and a couple of behavioural stories. Prepare those answers on the dedicated page rather than cramming them into this hub.
Use these as frames, not scripts - interviewers probe follow-ups.
Q. Write a program to check whether a string is a palindrome.
A. Use two indices, one at each end, comparing the characters and moving inward while the left index is less than the right; return false on the first mismatch and true if the pointers cross. That is O(n) time and O(1) extra space, better than reversing the string into a new buffer, which costs O(n) space. Clarify the requirements before coding - whether to ignore case, whether to skip non-alphanumeric characters, and how to treat an empty string, which is conventionally a palindrome. The cleaned variant simply advances each pointer past non-alphanumeric characters before comparing lowercased values.
Q. How would you compute the nth Fibonacci number, and what is the complexity of each approach?
A. Naive recursion returning fib(n-1) plus fib(n-2) recomputes the same subproblems and costs exponential time, roughly O(1.618 to the power n), with O(n) stack depth - it is what interviewers want you to reject. Memoising the results into an array reduces it to O(n) time and O(n) space. The iterative bottom-up version keeps only the last two values, so it is O(n) time and O(1) space, which is the answer to give. Mention that the values overflow a 32-bit int around n equal to 47, so you need a 64-bit type or big integers, and that matrix exponentiation gets it to O(log n) if pressed.
Q. Reverse a singly linked list iteratively.
A. Keep three pointers - previous initialised to null, current initialised to the head, and a temporary next. In each iteration store current.next in next, point current.next at previous, move previous to current, and move current to next, looping until current is null; then return previous as the new head. It runs in O(n) time with O(1) space in a single pass. The recursive version is elegant but costs O(n) stack space and risks a stack overflow on a long list. The mistake to avoid is reassigning current.next before saving it, which loses the rest of the list immediately.
Q. Write a SQL query to find the highest-paid employee in each department.
A. The window-function form is clearest: SELECT dept_id, name, salary FROM (SELECT dept_id, name, salary, RANK() OVER (PARTITION BY dept_id ORDER BY salary DESC) AS rnk FROM employees) t WHERE rnk = 1. RANK returns every tied top earner, whereas ROW_NUMBER would arbitrarily pick one - state which behaviour you want. Without window functions, join the table to a grouped subquery: SELECT e.dept_id, e.name, e.salary FROM employees e JOIN (SELECT dept_id, MAX(salary) AS m FROM employees GROUP BY dept_id) d ON d.dept_id = e.dept_id AND d.m = e.salary. Selecting a name alongside a bare MAX without grouping or joining is the classic wrong answer, because the name is not functionally determined by the group.
Q. What does chmod 755 mean, and how do Linux file permissions work?
A. Each file carries three permission triplets - owner, group, and others - each holding read, write, and execute bits worth 4, 2, and 1 respectively. 755 therefore grants the owner read, write, and execute (4 plus 2 plus 1), and grants group and others read and execute (4 plus 1), which is the normal mode for a directory or a script that everyone may run but only the owner may modify. On a directory the bits mean something different: read lists names, write creates and deletes entries, and execute permits traversing into it, so a directory with read but not execute is nearly useless. 644 is the usual mode for a plain data file, and chmod +x adds the execute bit for every triplet subject to the umask.
Assessment tips
Interview tips
HR tips
These links are research inputs we used to map AMCAT/SHL funnels and recurring prompts - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways for Tech Mahindra.
Round patterns draw on GeeksforGeeks, GeeksforGeeks phased process write-up, TalentBattle campus summaries, and 2025–2026 prep guides (FreshersNow, PrepInsta, PapersAdda). Cross-check the current drive mail and careers.techmahindra.com for official eligibility. For OA practice, see Tech Mahindra placement papers.