ThoughtSpot Sdet Engineer Interview Questions and Answers

Coding question about strings

Q1. Complete interview about ci/cd, git, sql, postman etc
Add your answer

Q1. Current project
Ans. 
Currently working on developing automated test scripts for a web application using Selenium and Java.
• Utilizing Selenium for automated testing

• Writing test scripts in Java

• Testing web application functionality and performance
Answered by AI
Add your answer

Q1. Tell me ab hmm df⅝⅘
Ans. 
The question seems to be incomplete or garbled, please provide more context or clarification.
• Ask for clarification or more context from the interviewer

• Confirm if the question was stated correctly

• Provide a response based on the information provided
Answered by AI
Add your answer

Q1. Regex related related programming question
Add your answer

Q1. Domain specific interview(Android) - Took 1.10 hrs - They asked why and how in most of the questions
Add your answer
Q2. Android architecture like service, activity, most of the topics covered in 1 hrs interview
Add your answer
Q3. Jetpack AAC, like work manager, LiveData vs MutableLiveData
Add your answer

Q1. DSPS round - Asked data structure and concepts and then - Ask 2 or 3 data structures and algorithm problems - Give you 15/20 min each It was asked me string manipulations & tree.
Add your answer
Q2. Two string manipulation with hashing technique
Ans. 
Hashing technique can be used for efficient string manipulation operations.
• Hashing can be used for string comparison, substring search, and pattern matching.

• Rabin-Karp algorithm is a popular hashing-based substring search algorithm.

• Hash tables can be used for efficient string indexing and searching.

• Hashing can also be used for string compression and encryption.
Answered by AI
Add your answer
Q3. Tree related problem
Add your answer

Coding round with domain
- It was asked me paging, searching, MVVM, listing with RV and coding standards

CODING ON DSA AND THEY ARE VERY MUCH STANDARD QUESTIONS,

Q1. LCA OF THE BINARY TREE
Ans. 
Find the lowest common ancestor of two nodes in a binary tree.
• Traverse the tree recursively to find the paths from root to the two nodes.

• Compare the paths to find the last common node.

• If one of the nodes is the ancestor of the other, return the ancestor node.

• If either of the nodes is not present in the tree, return null.
Answered by AI
Add your answer
Q2. K DISTANCE NODES FROM CURRENT NODE
Ans. 
Finding nodes at a distance of K from the current node in a tree/graph.
• Use BFS/DFS to traverse the tree/graph.

• Maintain a visited set to avoid revisiting nodes.

• Keep track of the distance of each node from the current node.

• Return all nodes at a distance of K from the current node.
Answered by AI
Add your answer
Q3. DO YOU HAVE ANY QUESTIONS FOR US
Add your answer

Easy to medium questions

Q1. Project related questions
Add your answer
Q2. Basic knowledge on relevant courses
Add your answer