ThoughtSpot Interview Questions, Process, and Tips

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

Q1. What is the index of the first occurrence where a pattern string matches with a text string?
Ans. 
The index of the first occurrence where a pattern string matches with a text string.
• Use string searching algorithms like Knuth-Morris-Pratt or Boyer-Moore for efficient pattern matching.

• Iterate through the text string and check for matches with the pattern string.

• Return the index of the first occurrence where the pattern matches with the text.
Answered by AI
Add your answer
Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Ans. 
Use sliding window technique to find minimum length substring with sum >= target.
• Initialize two pointers at start of string

• Expand window by moving right pointer until sum >= target

• Shrink window by moving left pointer while updating minimum length

• Repeat until end of string is reached
Answered by AI
Add your answer

Q1. Focus is on linux. Troubleshooting on linux regarding performance, CPU, disk etc
Add your answer
Q2. Linux commands to perform certain task if you know cloud basics of cloud SG VPC EC2 instance
Add your answer
Q3. Linux network troubleshooting and basics
Add your answer

Q1. Focused on advanced linux TS
Add your answer

There were 3 questions in the online assessment.

1 - Binary Search
2 - DP
3 - Graphs

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...read more
Answered by AI
Add your answer

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
Add your answer