Filter interviews by
I have 3 years of experience in testing. Testing is the process of evaluating a system or application to identify defects or errors.
I have 3 years of experience in manual and automated testing
Testing involves executing test cases to identify defects or errors in a system or application
Types of testing include functional testing, regression testing, performance testing, and user acceptance testing
Black box, White Box, Regression, and Smoke testing are different types of software testing techniques.
Black box testing focuses on testing the functionality of the software without knowing its internal code.
White box testing involves testing the internal code structure, paths, and logic of the software.
Regression testing is performed to ensure that new code changes do not adversely affect existing functionalities.
Smok...
Test cases are scenarios designed to validate the functionality of a software application. Bug life cycle refers to the stages a bug goes through from identification to resolution.
Test Cases: - Verify login functionality with valid credentials - Test adding items to a shopping cart - Validate search functionality by entering keywords
Bug Life Cycle: - Bug identification - Bug logging - Bug prioritization - Bug fixing - ...
Yes, I can write code for File Handling in various programming languages.
Use functions like fopen(), fclose(), fread(), fwrite() for file operations
Handle errors using error handling techniques like try-catch or if-else statements
Examples: C - fopen("file.txt", "r"), Python - with open("file.txt", "r") as file:
I am comfortable with coding and my preferred language is Java.
Proficient in Java programming language
Comfortable writing test scripts and automation code
Familiar with debugging and troubleshooting code issues
I applied via Referral and was interviewed in May 2024. There were 2 interview rounds.
Crud operation in the mern stack develoment
I applied via Naukri.com and was interviewed in Jul 2021. There were 3 interview rounds.
I was interviewed in Oct 2016.
My hobbies include hiking, playing guitar, and cooking.
Hiking: I enjoy exploring nature trails and challenging myself physically.
Playing guitar: I love learning new songs and improving my skills.
Cooking: I like experimenting with different recipes and creating delicious meals.
In 5 years, I see myself as a senior software developer leading a team and working on complex projects.
Leading a team of developers
Working on complex projects
Continuously learning and improving my skills
Contributing to the growth and success of the company
I want to join DELL because of their innovative technology solutions and strong reputation in the industry.
DELL is known for their cutting-edge technology solutions which align with my passion for software development.
I admire DELL's strong reputation in the industry and their commitment to customer satisfaction.
I believe joining DELL will provide me with opportunities for growth and career advancement.
I was interviewed in Jan 2017.
I was interviewed in Sep 2016.
I was interviewed before May 2016.
Find an odd occurring number among even occurring numbers.
Use XOR operation to cancel out even occurring numbers and get the odd occurring number.
Iterate through the array and XOR each element with the result variable.
The final result will be the odd occurring number.
Print the spiral order of a binary tree and matrix.
For binary tree, use level order traversal and alternate direction for each level.
For matrix, use four pointers to traverse in spiral order.
Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9
Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13
Finding pairs in an array with a given sum.
Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.
Use a hash table to store the elements of the array and their indices for faster lookup.
If there are multiple pairs with the same sum, return any one of them.
If no pair is found, return null or an empty array.
Find total number of k element with given avg in an array in minimum time complexity.
Use sliding window technique to traverse the array in O(n) time complexity.
Maintain a sum variable to keep track of the sum of elements in the window.
If the sum of elements in the window is equal to k times the given avg, increment the count.
Move the window by subtracting the first element and adding the next element in the array.
Printing non-boundary elements of a binary tree
Traverse the tree in any order (preorder, inorder, postorder)
Check if the current node is not a boundary node (not the first or last node in its level)
If it is not a boundary node, print its value
Recursively traverse its left and right subtrees
based on 2 interviews
Interview experience
Business Development Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Patient Care Manager
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Teleperformance
Optum Global Solutions
FIS
Dell