Tredence

Role: Data Analyst

College: Not Specified

Interview Date: December 8, 2023

Interview Type: On-Campus

Result: Not Specified

Difficulty: Medium

Rounds: 3 rounds

Topics Asked: MCQs (Python, SQL), Programming (Python, SQL), Grammar, Verbal Abilities, ML Algorithms (k-nearest neighbour, K means clustering, Linear Regression), Dijkstra's algorithm, Sorting (Bubble/Selection, Quick Sort, Merge Sorting), SQL (WHERE vs HAVING, COALESCE), Puzzles.

Experience:

This experience details the process for a Data Analyst role.

Round 1: Online Assessment This was a 2-hour online assessment on HackerEarth. It comprised 60 questions: 55 MCQs, 2 Python programming questions, and 3 SQL questions. The difficulty was medium.

Round 2: SpeechEx Assessment This round was conducted on the Mettl platform. It focused on basic grammar and verbal abilities, with questions like "What is success to you in life? Elaborate."

Round 3: Interview Round This was a 30-minute interview, mostly resume-based. Questions included:

• Explanation and differences of ML algorithms like k-nearest neighbor, K-means clustering, and Linear Regression.
• Dijkstra's algorithm and its associated problems (e.g., why it doesn't work for negative edge weights, leading to Bellman-Ford).
• Which of Dijkstra and Bellman-Ford is more Greedy.
• Pseudo-code for Dijkstra's algorithm.
• Working of Bubble/Selection and Quick Sort.
• Code for Merge Sorting.
• A Python coding question: "Write a function that returns 2 when we pass the value as 3 and returns 3 when we pass the value as 2 without using any conditional statements." (Solution: using array indexes or `5 - value`).
• Difference between WHERE and HAVING clauses in SQL.
• What is the COALESCE statement in SQL?
• Given a number, find the smallest number of the same length that can be formed using its digits.
• "Any questions for me?"