Upload Button Icon Add office photos

Filter interviews by

ThoughtSpot Software Developer Intern Interview Questions, Process, and Tips

Updated 20 Jan 2025

Top ThoughtSpot Software Developer Intern Interview Questions and Answers

  • Q1. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
  • Q2. What is the index of the first occurrence where a pattern string matches with a text string?
  • Q3. Implement a persistence stack with constant time operations

ThoughtSpot Software Developer Intern Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Indian Institute of Information Technology (IIIT), Kota and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Coding Test 

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Round 2 - Technical 

(2 Questions)

  • Q1. What is the index of the first occurrence where a pattern string matches with a text string?
  • Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at National Institute of Technology (NIT), Warangal and was interviewed in Mar 2024. There were 3 interview rounds.

Round 1 - Coding Test 

There were 3 questions in the online assessment.

1 - Binary Search
2 - DP
3 - Graphs

Round 2 - Technical 

(1 Question)

  • Q1. Implement a persistence stack with constant time operations
  • Ans. 

    Implement a persistence stack with constant time operations

    • Use a combination of a stack and a hashmap to achieve constant time operations for push, pop, and get operations

    • Maintain a stack to store the elements and a hashmap to store the index of each element in the stack

    • When pushing an element, add it to the stack and update its index in the hashmap

    • When popping an element, remove it from the stack and also remove its i...

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. Median of two sorted arrays and OOPs basics
  • Ans. 

    Finding the median of two sorted arrays and discussing OOPs basics

    • To find the median of two sorted arrays, merge the arrays and then calculate the median

    • OOPs basics include concepts like encapsulation, inheritance, polymorphism, and abstraction

    • Example: Median of [1, 3] and [2] is 2.0

  • Answered by AI

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at Sri Krishna College of Engineering and Technology, Coimbatore and was interviewed before May 2023. There were 3 interview rounds.

Round 1 - Coding Test 

We had 21 questions including 3 coding questions. It was simple and beginners friendly questions

Round 2 - One-on-one 

(1 Question)

  • Q1. Questions were asked based on DBMS, SQL, api, simple coding and testing
Round 3 - Technical 

(1 Question)

  • Q1. I was asked to describe my projects and questions were asked based on that. Had scenario based questions

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 100 Minutes
Round difficulty - Hard

**Criteria:
8 CPI or Above (only CSE, MnC). All students irrespective of history of backlogs or current backlogs were considered if they satisfied the CPI criteria.

It was first round..
This round was the Online test which was around 1 Hour 40 Minutes long(don't remember exact time).

Timing from 19:00 to 20:40
Environement was comfortable.
Hackerrank is a good platform for online tests.

All questions were new for me, So cant give any links.

  • Q1. 

    Minimum Removals Problem Statement

    Given an integer array ARR of size N and an integer K, determine the minimum number of elements that need to be removed so that the difference between the maximum and mi...

  • Q2. 

    Minimum Number of Stabs to Kill the King

    You are given the initial health of a king represented by an integer N. Your task is to determine the minimum number of stabs required to reduce the king's health ...

  • Q3. 

    Minimum Time Problem Statement

    In a city with ‘N’ junctions and ‘M’ bi-directional roads, each junction is connected to other junctions with specified travel times. No road connects a junction to itself, ...

Round 2 - Video Call 

(1 Question)

Round duration - 75 Minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on zoom. Interviewer shared codepad link and you were asked to code and pass sample test case given by interviewer. Only one question(coding) was asked(More follow questions).
Interviewer was really helpful..

  • Q1. 

    XOR Query Problem Statement

    Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.

    There are two types of que...

Round 3 - Video Call 

(1 Question)

Round duration - 90 Miinutes
Round difficulty - Medium

Again pattern was same(Zoom video call and I was asked to code and 1 question was there(+Follow up)).
Timing was afternoon time around 13:00

  • Q1. 

    Scramble String Problem Statement

    You are given an integer 'N' and two strings S and R, each having the size N. Determine if you can scramble string S to obtain string R using specified operations.

    Your ...

Round 4 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

It was a zoom video call.
In starting 5 minutes, interviewer tried to make me comfortable with him..

Interview Preparation Tips

Eligibility criteriaAbove 8.0Rubrik, Inc. interview preparation:Topics to prepare for the interview - Data Structure, Algorithms(DP and Graph are must), Web Development, OOPS, Operating System, Database and Management, Competitive Programming, OR any other topic that you like for projectsTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Do Complete Interview Bit, Puzzles and some questions from LeetCode
Tip 2 : Do 2 or 3 projects. Projects using different technologies are preffered.
Tip 3 : Give Practice Contests on Codeforces, Codechef. These help you to clear coding rounds which are useful for shortlisting for interview..

Application resume tips for other job seekers

Tip 1 : Never put anything on resume that you are not comfortable with.. Because if interviewer just start with that topic and you are not comfortable, this create bad impression on interviewer.
Tip 2 : Have 2 or 3 projects on different technologies.
Tip 3 : Put 2 or 3 college time achievement. (can be Competitive programming or Academic performance)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Basic DSA questions, best time to buy and sell stock and its variation

Round 2 - Technical 

(2 Questions)

  • Q1. Basic nosql vs sql questions
  • Q2. Designing system for google playstore
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Nov 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

It was a written tet with three sections one technical mcq second apti and three coding questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. How to solve problem in the written test
  • Q2. Project questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well and luck matters
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Basic OOP questions for python programming language

Round 2 - HR 

(2 Questions)

  • Q1. What's abstraction
  • Ans. 

    Abstraction is the concept of hiding complex implementation details and showing only the necessary information to the user.

    • Abstraction allows users to focus on what an object does instead of how it does it

    • It helps in reducing complexity and improving efficiency in software development

    • Example: In object-oriented programming, abstract classes and interfaces are used to achieve abstraction

  • Answered by AI
  • Q2. What's the difference between SQL and NoSQL database
  • Ans. 

    SQL databases are relational databases with structured data, while NoSQL databases are non-relational databases with flexible, unstructured data.

    • SQL databases use structured query language for defining and manipulating data, while NoSQL databases use different query languages or APIs.

    • SQL databases are table-based, with a predefined schema, while NoSQL databases are document, key-value, wide-column, or graph-based.

    • SQL d...

  • Answered by AI
Round 3 - Technical 

(2 Questions)

  • Q1. Reverse a linked list
  • Ans. 

    Reverse a linked list by changing the direction of pointers

    • Start with three pointers: current, prev, and next

    • Iterate through the linked list, updating pointers to reverse the direction

    • Update the head of the linked list to the last node after reversing

  • Answered by AI
  • Q2. Implement binary search algorithm
  • Ans. 

    Binary search algorithm efficiently finds the target value in a sorted array.

    • Start by defining the low and high indices of the array.

    • Calculate the mid index and compare the target value with the value at mid.

    • If target is less than mid value, update high to mid-1; if greater, update low to mid+1.

    • Repeat until target is found or low is greater than high.

  • Answered by AI
Round 4 - One-on-one 

(2 Questions)

  • Q1. Brief Introduction and basic questions
  • Q2. Future plans and how am i going to achieve them

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. They asked to design a database table
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium to hard questions based on arrays, dp

Round 2 - Technical 

(2 Questions)

  • Q1. Quick sort algorithm
  • Ans. 

    Quick sort is a popular sorting algorithm that uses divide and conquer strategy.

    • Divides array into smaller sub-arrays based on a pivot element

    • Recursively sorts sub-arrays

    • Combines sorted sub-arrays to get final sorted array

    • Time complexity: O(n log n) on average, O(n^2) worst case

    • Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]

  • Answered by AI
  • Q2. Modified rotate a matrix
  • Ans. 

    Rotate a matrix by 90 degrees in place

    • Transpose the matrix

    • Reverse each row of the transposed matrix

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - study well and at the end, they would not hire anyone

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. To print all permutation of a string
  • Ans. 

    Use recursion to generate all possible permutations of a given string.

    • Use recursion to swap characters in the string to generate permutations

    • Keep track of visited characters to avoid duplicates

    • Base case: when the length of the string is 1, add it to the result array

  • Answered by AI
Round 2 - One-on-one 

(1 Question)

  • Q1. Coin change Problem of finding number of ways to achieve K value
  • Ans. 

    The coin change problem involves finding the number of ways to make a certain value using a given set of coins.

    • Use dynamic programming to solve the coin change problem efficiently.

    • Create a 1D array to store the number of ways to make each value from 0 to the target value.

    • Iterate through the coins and update the array based on the current coin's value.

    • The final answer will be stored in the last element of the array.

    • Exam...

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. Suduko solver question is given to me

Skills evaluated in this interview

ThoughtSpot Interview FAQs

How many rounds are there in ThoughtSpot Software Developer Intern interview?
ThoughtSpot interview process usually has 2-3 rounds. The most common rounds in the ThoughtSpot interview process are Coding Test, Technical and One-on-one Round.
What are the top questions asked in ThoughtSpot Software Developer Intern interview?

Some of the top questions asked at the ThoughtSpot Software Developer Intern interview -

  1. Given a string, how can we find the minimum length substring whose sum is great...read more
  2. What is the index of the first occurrence where a pattern string matches with a...read more
  3. Implement a persistence stack with constant time operati...read more

Tell us how to improve this page.

ThoughtSpot Software Developer Intern Interview Process

based on 2 interviews

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Mu Sigma Interview Questions
2.6
 • 229 Interviews
Tiger Analytics Interview Questions
3.7
 • 221 Interviews
Fractal Analytics Interview Questions
4.0
 • 204 Interviews
Vyapar Interview Questions
3.4
 • 53 Interviews
ZIGRAM Interview Questions
3.9
 • 26 Interviews
MapmyIndia Interview Questions
3.8
 • 24 Interviews
RGBSI Interview Questions
3.5
 • 24 Interviews
View all
Software Engineer
44 salaries
unlock blur

₹7.4 L/yr - ₹25.8 L/yr

Member Technical Staff
31 salaries
unlock blur

₹12.6 L/yr - ₹45 L/yr

Technical Staff Member 3
12 salaries
unlock blur

₹26 L/yr - ₹57.6 L/yr

QA Engineer
12 salaries
unlock blur

₹5.8 L/yr - ₹13.8 L/yr

Mts Software Engineer
9 salaries
unlock blur

₹13 L/yr - ₹38 L/yr

Explore more salaries
Compare ThoughtSpot with

Mu Sigma

2.6
Compare

Fractal Analytics

4.0
Compare

Tiger Analytics

3.7
Compare

LatentView Analytics

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview