Synthesized from 13 candidate submissions for ALL.
Tiger Analytics employs a balanced interview process that scales in complexity based on seniority, ranging from foundational data structures and SQL for entry-level roles to deep architectural and DevOps reasoning for senior positions. Candidates should expect a mix of technical competency assessments, including matrix operations and database logic, alongside discussions regarding their past technical decision-making.
The candidate went through three interview opportunities at Tiger Analytics over a span of one year. The process included coding rounds, technical rounds, an online assessment, and an HR round. The candidate was rejected after the first two attempts and rejected the offer in the third attempt due to existing offers and salary expectations.
A 45-minute coding round consisting of 2 questions, categorized as 1 Easy-Medium and 1 Medium. The candidate solved 1 question fully and partially solved the second.
A 45-minute technical round where the interviewer asked 2 coding questions (factorial of a number and matrix multiplication) and 1 complex SQL query. The interviewer also asked basic SQL and Python questions.
A 45-minute technical round where the interviewer asked 2 coding questions (Best time to buy stock and shorten a string based on frequency). The candidate explained the logic for the first question and optimized it. The second question was solved quickly. The interviewer also asked about the candidate's projects.
A 1-hour online assessment consisting of 2 coding questions and some ML-based MCQs. The candidate solved 1 medium coding question and partially solved the second. The MCQs were attempted but not fully completed due to time constraints.
A 30-minute HR round where the HR discussed the candidate's application and expectations. The candidate rejected the offer after being selected for the next round.
The interview was of average difficulty, focusing on fundamental data structures and linear algebra implementation.
The interview consisted of two technical problems involving array manipulation and matrix operations, focusing on implementation and complexity optimization.
Solve an array-based problem and implement the adjugate of a matrix, including handling edge cases and optimizing the time complexity.
Interview Digest