Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

ThoughtSpot SDE Intern Guide: The IIT OA, Then Technical and Managerial Rounds

3 min read

Prepare for ThoughtSpot SDE intern interviews with reported assessment patterns, interview questions, and preparation advice.

In this article
On this page

Last reviewed November 16, 2026.

For students applying for ThoughtSpot's SDE internship (with a PPO route).

Built by the Codinzhub team from ThoughtSpot intern OA questions that IIT Guwahati students shared on Codinzhub in September and October 2026, plus earlier intern interview experiences. Each one is one student's memory, so use this as a map, not a promise.

The 30-second version. ThoughtSpot's internship OA at IIT Guwahati had 3 DSA questions, and the same three appeared twice (September 28 and October 25, 2026): subarrays with at most K elements divisible by P, minimum cameras on a binary tree, and minimum cost to connect points by Manhattan distance. One student reported a ₹1 lakh monthly stipend and a PPO of about ₹76 lakh CTC for strong performers. After the OA, earlier interns had two technical rounds and a managerial round.

Other ThoughtSpot roles: Member of Technical Staff (MTS-1) · SDE intern · Frontend engineer (experienced)

Round-by-round breakdown

Stage 1: Online assessment

At a glance

  • Length: about 90 minutes
  • Questions per round: 3 DSA
  • What was asked: distinct subarrays with a divisibility rule, tree greedy, minimum spanning tree
  • Most common: the same three questions in both 2026 rounds at IIT Guwahati

What students were asked:

#Question (our summary)How to approach itPractice
1Count distinct subarrays that contain at most (or exactly) K elements divisible by PTwo loops with a running count, and a set of rolling hashes (or a trie) to count only distinct onesSubarrays with At Most K Divisible Elements, OA (Sept 28)
2Fewest cameras on a binary tree so every node is watched (a camera covers parent, itself and children)Greedy DFS with three states: covered, has camera, needs coverMinimum Surveillance Systems, Binary Tree Cameras
3Connect N servers at minimum total cable cost, where cost is Manhattan distancePrim's algorithm in O(N²) on the dense graphMinimum Cable Cost, Minimum Cost to Connect All Points

An August 2026 ThoughtSpot paper at IIT BHU (role not stated) had three different questions: pairs of servers connectable through a node on a tree, the best team with no age-score conflicts and minimum cost to cut a cake.

More questions: Browse ThoughtSpot questions.

Stage 2: Technical interviews

At a glance

  • Length: about an hour each; two rounds, sometimes on the same day
  • Questions per round: 2 coding problems
  • What was asked: BFS on boards, sliding windows, partition DP, a class with running max and min
  • Most common: snakes and ladders as a BFS

What earlier interns were asked:

  • Round 1: minimum throws to finish snakes and ladders (BFS); count subarrays with exactly K different integers (sliding window, at most K minus at most K − 1).
  • Round 2: split an array into two sets with the smallest difference of sums (subset DP); design a class that tracks a changing stock price and returns its maximum and minimum over time (heaps or ordered maps with lazy deletion).

Stage 3: Managerial round

What to expect. Your introduction, then deep questions on your projects and the technologies on your resume. One intern who listed React was asked about its internals. They were also asked to choose between ThoughtSpot and another offer. Their advice: know everything on your resume, be ready to code a feature, and get your syntax right.

The Codinzhub Next-Round Playbook

  • Practise the three Guwahati questions; they repeated across two rounds this year.
  • Learn the binary tree cameras greedy and Prim's O(N²) by heart.
  • Remove any technology from your resume you cannot explain in depth.

About this guide

This guide is researched and written by the Codinzhub team from questions and experiences students shared on Codinzhub and in public interview write-ups, rewritten in our own words. Practice links open the full question on Codinzhub. Interviewed for this role? Share your experience on Codinzhub and we will update the guide.

Ready for the next topic?

Keep track of what you’ve learned.