Tiger Analytics Analyst Interview Questions and Answers

Aptitude ques based on straight line, circle,pnc, probability

Coding ques level was medium to tough. Had to solve 3 ques out of 5

Q1. Buy and sell stocks to earn maximum profit. It is available on leetcode
Ans. 
Maximize profit by buying and selling stocks on given days with optimal strategy.
• Track the minimum price seen so far while iterating through the prices.

• Calculate potential profit by subtracting the current price from the minimum price.

• Update the maximum profit if the potential profit is greater than the current maximum.

• Example: For prices [7, 1, 5, 3, 6, 4], buy at 1 and sell at 6 for a profit of 5.
Answered by AI
Add your answer
Q2. Rotate two dimensional array
Ans. 
Rotate a 2D array by 90 degrees clockwise or counterclockwise.
• Transpose the matrix by swapping elements across the diagonal

• Reverse each row or column depending on clockwise or counterclockwise rotation

• Example: [[1,2],[3,4]] rotated clockwise becomes [[3,1],[4,2]]
Answered by AI
Add your answer

Basic Maths, Probability, Coding Questions

Writing codes to basic questions

We had questions on aptitude - like upstream, downstream problems, etc.

Q1. Live coding using Python/CPP
Ans. 
Live coding using Python/CPP
• Practice coding challenges on platforms like LeetCode or HackerRank to improve coding skills

• Understand data structures and algorithms to solve coding problems efficiently

• Use online IDEs like Repl.it or CodePen for live coding sessions
Answered by AI
Add your answer

Q1. Questions on SQL
Add your answer

General Aptitude( Probability dominats) and objective coding

Moderate levels coding questions Refer hacker rank

Q1. Coding, guesstimate, probability,
Add your answer

Q1. Generation HR questions refer youtube
Add your answer

One simple coding test and general aptitute

Q1. Matrix multiplication, reverse a array. Puzzels.
Add your answer
Q2. Reverse array elements
Ans. 
Reverse the order of elements in an array of strings efficiently.
• Use a two-pointer approach: one pointer at the start and one at the end of the array.

• Swap the elements at these pointers and move towards the center.

• Continue until the pointers meet or cross each other.

• Example: For ['apple', 'banana', 'cherry'], the reversed array will be ['cherry', 'banana', 'apple'].
Answered by AI
Add your answer
Q3. Puzzle available on google
Add your answer

Python programming 2 questions, 7 MCQs on data science, ml, statistics

Q1. Project related questions, basic data science conceptual questions, scenario based questions
Add your answer