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 Member of Technical Staff (MTS-1) Campus Guide: The Campus OA, Question by Question

7 min read

Prepare for ThoughtSpot member of technical staff interviews with reported assessment patterns, interview questions, and preparation advice.

In this article
On this page

Last reviewed November 16, 2026.

For students in the 2026 to 2027 placement season.

Built by the Codinzhub team from ThoughtSpot online assessment questions that IIT students shared on Codinzhub between October 25 and November 4, 2026. Each question is one student's memory of their paper, so use this as a map, not a promise.

The 30-second version. ThoughtSpot hires freshers on campus as Member of Technical Staff (MTS-1); students also called the role SDE, SDE 1 or FTE. The online assessment is 3 coding questions in 90 minutes, all medium. In 2026 it ran at IIT Guwahati, IIT Roorkee and IIT (BHU) Varanasi. Graphs dominate: almost every paper had a "maximum constant speed" bottleneck path and a "highest floor using elevators" connectivity question. Students who clear the OA go on to technical interviews and an HR round.

How this guide was built. The OA section comes entirely from questions IIT students posted on Codinzhub. No student has posted their ThoughtSpot interview rounds yet this season, so the interview section comes from the Codinzhub team's research into ThoughtSpot's earlier campus drives, and we mark it clearly.

Other ThoughtSpot roles: SDE intern · Frontend engineer (experienced)

Who this guide is for

You are at an IIT, ThoughtSpot is on your placement list, and you have the OA in the next few days. This guide tells you what the paper looks like, which questions came up at each campus, how to approach each one, and what happens after.

Round-by-round breakdown

Stage 1: Shortlisting

What to expect. ThoughtSpot comes through your placement cell. Everyone who registers takes the OA; there was no resume shortlist before it in these drives.

Stage 2: Online assessment

At a glance

  • Length: 90 minutes
  • Questions per round: 3 coding questions, all marked medium
  • What was asked: graph connectivity, bottleneck paths, shortest paths with a twist, counting subsets, games, DP
  • Most common: the bottleneck "constant speed" path and the "highest reachable floor" by elevators

What to expect. Different campuses got different papers, and even within one campus students saw different versions of the same idea (the elevator question appears under at least five names). One IIT BHU student noted that brute force sometimes passed, so if you are stuck, submit a simple correct solution first.

IIT (BHU) Varanasi, October 28

Students here saw three question families. Most students got one from each.

#Question (our summary)How to approach itPractice
1You must drive at one constant speed and no road allows more than its limit. What is the highest speed that still lets you reach every city (or reach the last city from city 0)?The answer is the smallest edge on the best route: build a maximum spanning tree, or binary search the speed and check connectivityMaximum Constant Speed in a Graph, Travel Plan, Maximum Possible Speed Threshold
2Elevators each link two floors. Starting on floor 1, what is the highest floor you can reach?Everything connected to floor 1: BFS, DFS or union-find, then take the maximumMaximum Floor Reachable Using Elevators, Climbing Up and Down, Highest Reachable Floor
3aEach person has a count of coins of M types. Count non-empty groups whose total of every coin type is evenTurn each person into a bitmask of odd counts; count subsets with XOR 0 (XOR basis: 2^(N − rank) − 1), or DP over masks when M is smallEmployee of the Year, Count Valid Groups, Even Vector Sum Subsets
3bK² students are points (maths, physics) on a K by K grid. Choose N with no two sharing a maths score, a physics score, or other conditionsAn N-queens style placement count with backtracking or combinatoricsN-Queens Variation, Valid Committees

IIT Roorkee, November 3 and 4

#Question (our summary)How to approach itPractice
1Shortest path from s to t where you may halve up to k edge weights (not two in a row, in one version)Dijkstra on (node, passes used) statesShortest Path with Constrained Edge Relaxations, Dijkstra
2Remove two elements from array A, add the same positive x to the rest, and get array B (in any order). Find the smallest xSort both; only a few candidates for x exist (B's smallest minus one of A's three smallest); check each with a hash map or two pointersArray Transformation, Minimum Increment Value
3Turn x into y with the fewest steps: +1, −1, divide by 11 if divisible, divide by 5 if divisibleBFS over numbers, with a sensible upper boundMinimum Operations to Make Two Numbers Equal, Queue

IIT Roorkee, October 25 (Member of Technical Staff)

Question (our summary)Practice
The furthest reading a dial can reach after a chosen set of turnsFurthest Dial Reading
Count digit labels that decode to a balanced bracket stringDigital Labels to Balanced Brackets

IIT Guwahati, October 25

#Question (our summary)How to approach itPractice
1Three functions defined in terms of each other's earlier values; return f(n) for n up to 9Small DP table or memoised recursionRecursive Function
2Ships arrive and leave; a harbour needs cleaning time before the next ship. Fewest harbours needed?Meeting rooms with the cleaning time added to each departure, using a min-heapMinimum Number of Harbors
3Two players remove a positive even number of candies from a tray; whoever cannot move losesGame theory: find the winning pattern from small casesTrays of Candies

More questions: Browse ThoughtSpot questions.

Stage 3: Technical interviews

At a glance

  • Length: about an hour each
  • Questions per round: 1 or 2 coding problems, then discussion
  • What was asked: problem solving, coding, design basics, your projects
  • Most common: DSA with follow-ups

What to expect. From our research into earlier ThoughtSpot campus drives: students who cleared the OA had two or three technical rounds focused on problem solving and coding, with design basics and a deep discussion of their projects in the later round. Expect to write working code and to explain complexity.

Stage 4: HR round

What to expect. From our research: a short online HR conversation about you, your projects and why ThoughtSpot. Know what ThoughtSpot makes: a search and AI-driven analytics product for business data.

More from Codinzhub: every college and every year

These are the other 20 questions and experiences for this role on Codinzhub, from all colleges and drives, newest first.

Question or experienceCollege or driveTypePosted
Hash mapIIT RoorkeeOA question2026-11-03
Problem: Maximum Possible Minimum Edge SpeedIIT (BHU) VaranasiOA question2026-10-28
Maximum Floor Reachable Using an ElevatorIIT (BHU) VaranasiOA question2026-10-28
Maximum Floor Reachable Using ElevatorsIIT (BHU) VaranasiOA question2026-10-28
Maximum Constant Speed in a GraphIIT (BHU) VaranasiOA question2026-10-28
Maximize the minimum edge speed while visiting all graph nodesIIT (BHU) VaranasiOA question2026-10-28
Maximise Reachable Floor HeightIIT (BHU) VaranasiOA question2026-10-28
Counting Valid Group SelectionsIIT (BHU) VaranasiOA question2026-10-28
Count the Number of Valid CommitteesIIT (BHU) VaranasiOA question2026-10-28
Recurrence Relation (F, G, H)Indian Institute of TechnologyOA question2026-10-26
Count Subarrays With Maximum-Minimum Difference ≤ KIndian Institute of TechnologyOA question2026-10-26
Amit and BobIndian Institute of TechnologyOA question2026-10-26
Minimum Number of Berths Required for ShipsIndian Institute of TechnologyOA question2026-10-25
Max mod subsequenceNot statedOA question2026-10-25
Count the Arrangements in Which Adem WinsIndian Institute of TechnologyOA question2026-10-25
Topological Sort / Cycle Detection Problem:IITOA question2026-10-06
ThoughtSpot SDE 1 Interview ExperienceIITInterview experience2026-10-06
Sliding Window Rate LimiterIITOA question2026-10-06
Ribbon Cutting — Binary Search on AnswerIITOA question2026-10-06
Longest Ribbon Piece After Each Cut — Ordered SetIITOA question2026-10-06

Topics to prioritise

From the 2026 papers: graphs first (BFS, DFS, union-find, maximum spanning tree, Dijkstra with extra state), then bitmasks and XOR, heaps for interval scheduling, BFS over numbers, and simple game theory.

The Codinzhub Next-Round Playbook

What IIT students who sat this OA recommend. Put together by the Codinzhub team from the ThoughtSpot questions in this guide.

To get past the OA

  • Practise the two repeat questions until they take under 15 minutes each: the bottleneck "constant speed" path and the "highest floor" connectivity.
  • Learn Dijkstra on (node, extra state); it covers the Roorkee paper's hardest question.
  • Learn the XOR trick for "even in every dimension" subset counting.
  • If a solution feels too slow, submit it anyway; brute force passed some tests.

To get past the interviews

  • Be ready to explain your OA solutions; interviewers at many companies start there.
  • Pick one project you can explain in depth, including what you would change.

FAQ

Is the role SDE or MTS?

Both names were used. ThoughtSpot's title for freshers is Member of Technical Staff (MTS-1).

Do all campuses get the same paper?

No. Guwahati, Roorkee and BHU each had different questions, though graphs appeared everywhere.

About this guide

This guide is researched and written by the Codinzhub team from questions IIT students shared on Codinzhub, plus research into ThoughtSpot's earlier campus drives where student reports are missing. Questions are our own short summaries; the practice links open the full question on Codinzhub. Sat this OA or the interviews? Share your experience on Codinzhub and we will update the guide.

Ready for the next topic?

Keep track of what you’ve learned.