Thoughtspot

# Interview Experience The interview process consisted of **three rounds**, focusing on DSA, problem-solving, implementation skills, and projects. ## Round 1: DSA and Problem-Solving This round consisted of two DSA questions. Question 1: Grid-Based Path Counting** Given an `n × m` grid, where `0` represents a free cell and `1` represents a blocked cell, find the number of ways to travel from `(0, 0)` to `(n-1, m-1)` without passing through any blocked cells. The first question was relatively straightforward and primarily tested basic DSA and dynamic programming concepts. Question 2: Longest Path in a DAG** Given a directed acyclic graph (DAG) with `n` nodes, calculate the maximum distance from every node to any reachable node. The task was to print the maximum distance for each node from `1` to `n`. This question was slightly more challenging and required a good understanding of graph algorithms and DAG traversal. ## Round 2: Implementation-Based DSA This round focused on implementation skills, logical thinking, and handling constraints. The question was based on a grid-filling problem similar to match-three games. Given a matrix of size `n × m`, the task was to fill it with randomly generated `0`s and `1`s while ensuring that **no three consecutive identical values appear horizontally or vertically**. For example, three consecutive `0`s or three consecutive `1`s should not occur in any row or column. The solution required using a random number generator while maintaining the given constraints. This round tested practical implementation skills, careful handling of edge cases, and the ability to translate problem requirements into working code. ## Round 3: Project Discussion The final round focused on my projects. The interviewer asked questions about the projects I had worked on, their implementation, the technologies used, and the technical decisions behind them. This round primarily evaluated my understanding of my own work and my ability to explain the design and implementation clearly. ## Overall Experience The interview covered a mix of standard DSA, graph algorithms, dynamic programming, implementation-based problem-solving, and project discussions. The first round was more algorithm-focused, the second emphasized coding and constraints, and the third evaluated practical project knowledge. Preparation tip:** Practice grid-based DP problems, DAG and longest-path concepts, implementation-heavy questions, and be prepared to explain every project on your resume in depth.