Filter interviews by
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
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.
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 ...
Design an LRU (Least Recently Used) cache to efficiently store and retrieve data with limited capacity.
Use a hash map for O(1) access to cache items.
Use a doubly linked list to maintain the order of usage.
When adding a new item, if the cache exceeds capacity, remove the least recently used item.
Example: For a cache of capacity 2, adding (1,1) and (2,2), then (3,3) removes (1,1).
Implement 'get' to return the value ...
Design a messaging app like Whatsapp
Implement end-to-end encryption for secure messaging
Allow users to send text messages, images, videos, and documents
Include features like group chats, voice and video calls, status updates
Provide option for users to share their location
Develop a user-friendly interface with customizable settings
A library for API testing that provides a set of functions and utilities to simplify the testing process.
The library should have functions to send HTTP requests and validate responses.
It should support different authentication methods like OAuth, JWT, etc.
The library should handle common API testing scenarios like testing CRUD operations, handling different HTTP methods, etc.
It should provide utilities for data-dr...
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
Promises in JavaScript are objects representing the eventual completion or failure of an asynchronous operation.
Promises help in handling asynchronous operations in a more organized manner.
They can be in three states: pending, fulfilled, or rejected.
Promises can be chained using .then() method to handle success and failure cases.
They can also be used with async/await for more readable asynchronous code.
Load balancing is a technique used to distribute network traffic across multiple servers to ensure optimal performance and availability.
Types of load balancing include: round robin, least connections, IP hash, and weighted round robin.
Round robin distributes traffic evenly across servers in a sequential manner.
Least connections directs traffic to the server with the fewest active connections.
IP hash uses the clien...
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 Naukri.com and was interviewed in Apr 2024. There were 2 interview rounds.
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
I appeared for an interview in Sep 2024, where I was asked the following questions.
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
1 hr and it is pretty easy and having snippets technical questions etc
I didn't selected for second round
Promises in JavaScript are objects representing the eventual completion or failure of an asynchronous operation.
Promises help in handling asynchronous operations in a more organized manner.
They can be in three states: pending, fulfilled, or rejected.
Promises can be chained using .then() method to handle success and failure cases.
They can also be used with async/await for more readable asynchronous code.
Leet code problem
Medium hard
Easy to Medium Leetcode questions
I appeared for an interview before Mar 2024, where I was asked the following questions.
Top trending discussions
Some of the top questions asked at the ThoughtSpot interview -
The duration of ThoughtSpot interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 15 interview experiences
Difficulty level
Duration
based on 32 reviews
Rating in categories
3-7 Yrs
Not Disclosed
10-15 Yrs
Not Disclosed
Software Engineer
45
salaries
| ₹8 L/yr - ₹25 L/yr |
Member Technical Staff
32
salaries
| ₹12.5 L/yr - ₹50 L/yr |
Technical Staff Member 3
15
salaries
| ₹22 L/yr - ₹59 L/yr |
QA Engineer
13
salaries
| ₹3.7 L/yr - ₹13.8 L/yr |
Solution Analyst
12
salaries
| ₹5.5 L/yr - ₹9.5 L/yr |
Aurigo
Prime Focus Technologies
Vyapar
MapmyIndia