ThoughtSpot Software Developer Intern Interview Questions, Process, and Tips

It was good 20 mcqs 3 coding questions

Q1. Dsa and core subjects like cn os
Add your answer
Q2. Dsa questions and core subjects
Add your answer

Q1. Basic family discussion and salary details
Add your answer

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

Q1. Basic nosql vs sql questions
Add your answer
Q2. Designing system for google playstore
Add your answer

Basic OOP questions for python programming language

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

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

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

Q1. They asked to design a database table
Add your answer

Medium to hard questions based on arrays, dp

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

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

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

Q1. Suduko solver question is given to me
Add your answer