Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Dec 2024. There were 2 interview rounds.
A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.
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.
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
I applied via Campus Placement and was interviewed in Mar 2024. There were 3 interview rounds.
There were 3 questions in the online assessment.
1 - Binary Search
2 - DP
3 - Graphs
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...
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
Top trending discussions
posted on 28 Oct 2023
It was basic test. online.
2 questions on arrays. online.
The general topic. Be point to point
Medium to hard questions based on arrays, dp
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]
Rotate a matrix by 90 degrees in place
Transpose the matrix
Reverse each row of the transposed matrix
I applied via Campus Placement and was interviewed in Jul 2022. There was 1 interview round.
I applied via Referral and was interviewed in Dec 2021. There were 4 interview rounds.
I applied via Job Portal and was interviewed in Apr 2021. There was 1 interview round.
I applied via Job Portal and was interviewed in Apr 2021. There was 1 interview round.
Some of the top questions asked at the ThoughtSpot Software Developer Intern interview -
based on 2 interviews
Interview experience
Software Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Staff Member 3
12
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Mts Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Mu Sigma
Fractal Analytics
Tiger Analytics
LatentView Analytics