Filter interviews by
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
I applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.
OOPs is a programming paradigm that uses objects to represent real-world entities and their interactions.
OOPs stands for Object-Oriented Programming.
It focuses on encapsulation, inheritance, and polymorphism.
Encapsulation means hiding the implementation details of an object from the outside world.
Inheritance allows creating new classes based on existing ones.
Polymorphism allows using a single interface to represent dif...
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.
I applied via Company Website and was interviewed in Jun 2022. There was 1 interview round.
Success at work is measured by achieving goals, delivering high-quality work, and receiving recognition.
Achieving goals set by the team or organization
Delivering high-quality work that meets or exceeds expectations
Receiving recognition from colleagues, managers, or clients
Meeting deadlines and completing tasks efficiently
Contributing to the overall success of the team or project
I know multiple programming languages.
I am proficient in Java, Python, and C++.
I have experience with web development languages such as HTML, CSS, and JavaScript.
I am familiar with scripting languages like Bash and PowerShell.
I have worked with database query languages like SQL.
I have knowledge of mobile app development languages like Swift and Kotlin.
I applied via Naukri.com and was interviewed before Jan 2024. There was 1 interview round.
I appeared for an interview in Jul 2024.
Create an API using Notepad to check if a string is a palindrome or not.
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Hard
This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
The first and only line of input contains an integer, denoting the value of N.
Print an hourglass pattern based on the given integer 'N'.
Read the integer 'N' as input
Print the top half of the hourglass pattern with decreasing numbers
Print the bottom half of the hourglass pattern with increasing numbers
Handle the constraints for 'N' values between 1 and 50
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Use BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider bidirectional edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
Use one additional stack to assist in sorting the elements.
Pop elements from the input stack and push them onto the auxiliary stack in sorted order.
Keep track of the current minimum element to maintain ascending order.
Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Round duration - 90 minutes
Round difficulty - Easy
This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Find the largest palindrome number strictly less than a given palindrome number.
Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.
Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.
If the number has an odd length, simply mirror the first half to create the largest
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process.
Track the time taken to rot all fresh oranges.
Return -1 if all fresh oranges cannot be rotten.
Handle edge cases like empty grid or no fresh oranges.
Tip 1 : Relax and don't stress. Practice
Tip 2 : Build Resume according to Job Description , but don't lie.
Tip 3 : Have good projects and knowledge regarding important subjects related to interviews
Tip 1 : Include only genuine information, never lie in resume , it will impact to bad impression.
Tip 2 : Skills relevant to Job Description
Tip 3 : Resume should not be more than 2 pages
Tip 4 : Have some projects and internship on your resume because it will give good impression
Some of the top questions asked at the ThoughtSpot Software Developer Intern interview -
based on 2 interviews
Interview experience
Software Engineer
44
salaries
| ₹7.4 L/yr - ₹25.8 L/yr |
Member Technical Staff
30
salaries
| ₹12.5 L/yr - ₹45 L/yr |
QA Engineer
12
salaries
| ₹5.8 L/yr - ₹13.8 L/yr |
Technical Staff Member 3
10
salaries
| ₹26 L/yr - ₹52 L/yr |
Solution Analyst
10
salaries
| ₹5.5 L/yr - ₹9.5 L/yr |
Aurigo
Prime Focus Technologies
Vyapar
MapmyIndia