Filter interviews by
Be the first one to contribute and help others!
I appeared for an interview in Oct 2024, where I was asked the following questions.
I managed a critical project with tight deadlines by prioritizing tasks, collaborating effectively, and maintaining clear communication.
Prioritization: I identified the most critical features to deliver first, ensuring that the core functionality was completed on time.
Collaboration: I organized daily stand-up meetings with the team to discuss progress and address any blockers, fostering a collaborative environment.
Time...
The K-sorted array problem involves sorting an array where each element is at most K positions away from its target position.
Definition: A K-sorted array is an array where each element is guaranteed to be within K indices of its final sorted position.
Example: For an array [3, 2, 1, 5, 4] with K=2, the sorted array would be [1, 2, 3, 4, 5].
Approach: Use a min-heap (or priority queue) to efficiently sort the elements, ma...
I applied via Walk-in and was interviewed in Jan 2024. There were 2 interview rounds.
20 mins based on aptitude
90 min based on DSA
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
Online test assement
I applied via Approached by Company and was interviewed before May 2023. There were 2 interview rounds.
Java, coding , programming etc.
I applied via Company Website and was interviewed in Jan 2024. There were 3 interview rounds.
All questions were based on class 10th mathematics.
Array and string related problem
I appeared for an interview in Apr 2025, where I was asked the following questions.
Algorithm and data structures
A linked list is a linear data structure where each element is a separate object with a reference to the next element.
Each element in a linked list is called a node
Nodes are connected using pointers or references
Linked lists can be singly linked (each node points to the next) or doubly linked (each node points to the next and previous)
I applied via Referral and was interviewed in Mar 2024. There were 2 interview rounds.
It was basically 2 ques round 1 from DP and 1 from graph
I am a seasoned SDET Engineer with 5+ years of experience in designing, developing, and executing automated test scripts.
Proficient in programming languages such as Java, Python, and C#
Experienced in using testing frameworks like Selenium and JUnit
Skilled in creating test plans, test cases, and test scripts
Familiar with CI/CD tools such as Jenkins and Git
Strong problem-solving and analytical skills
In the next 5 years, I see myself growing into a senior SDET role, leading a team of engineers, and contributing to innovative testing strategies.
Advancing to a senior SDET position within the company
Leading a team of engineers in testing projects
Contributing to the development of innovative testing strategies
Continuing to enhance my skills and knowledge in software testing
A Binary Search Tree (BST) is a data structure that maintains sorted order for efficient searching, insertion, and deletion.
A BST is a tree where each node has at most two children.
The left child contains values less than the parent node.
The right child contains values greater than the parent node.
Example: Inserting 10, 5, and 15 creates a tree with 10 as root, 5 as left child, and 15 as right child.
Searching for a val...
I applied via Newspaper Ad
Coding questions with some MCQ level medium
Center Manager
3
salaries
| ₹4.8 L/yr - ₹6.6 L/yr |
TCS
Accenture
Wipro
Cognizant