Dell
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Great experience it was really smooth process
Great Experience it was a smooth process
Top trending discussions
Good it was nice information and Engineering
Good it was nice information and Engineering
Good it was nice information and Engineering
XPath is a way to locate elements on a web page using their HTML structure.
Use Chrome DevTools to inspect elements and generate XPath
Avoid using absolute XPath as it can be brittle
Use relative XPath with unique attributes for better stability
I have worked on a keyword-driven automation framework using Selenium and TestNG.
Utilized Excel sheets to store test cases and keywords
Implemented reusable functions for common actions like clicking, inputting text, etc.
Used TestNG for test case management and reporting
Integrated with Jenkins for continuous integration
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
To verify if a record is deleted from a page with 10 records, we can check if the record is no longer displayed.
Locate the record on the page
Verify that the record is no longer visible
Confirm that the total number of records displayed is now 9
posted on 30 Jun 2022
I applied via Naukri.com and was interviewed in Jun 2022. There were 4 interview rounds.
I applied via Shine and was interviewed in Oct 2024. There were 2 interview rounds.
10m aptitude and image questions
50m DSA, cp CPP AND leetcode proper hard
Types of testing include unit testing, integration testing, system testing, and acceptance testing.
Unit testing: Testing individual components or modules of the software.
Integration testing: Testing how multiple components work together.
System testing: Testing the entire system as a whole.
Acceptance testing: Testing to ensure the software meets the requirements of the end users.
posted on 15 Nov 2021
I applied via Hackerearth contest and was interviewed in Oct 2021. There was 1 interview round.
Reverse a linked list
Iterate through the linked list and change the direction of the pointers
Use three pointers to keep track of the current, previous, and next nodes
Make sure to update the head and tail pointers accordingly
Swap 2 numbers without using a third variable
Use the XOR operation to swap the numbers
Assign the first number to the second number using XOR
Assign the second number to the first number using XOR
Height of a binary tree is the maximum number of edges from the root node to any leaf node.
The height of an empty tree is 0.
The height of a tree with only one node is 1.
The height of a tree can be calculated recursively by finding the height of its left and right subtrees and adding 1 to the maximum of the two heights.
The time complexity of finding the height of a binary tree is O(n), where n is the number of nodes in
Sum queries on a 2D matrix
Iterate through each query and calculate the sum of elements in the given range
Use prefix sum technique to optimize the solution
Preprocess the matrix to store the sum of elements in each row and column for faster calculation
I applied via Company Website and was interviewed in Aug 2024. There was 1 interview round.
Difficult coding question, and 30 MCQs. MCQs are mix of technical and QA Theory questions. Coding question is from dynamic programming.
Interview experience
Senior Software Engineer
1.7k
salaries
| ₹9.9 L/yr - ₹36 L/yr |
Software Engineer
1.1k
salaries
| ₹4.8 L/yr - ₹18 L/yr |
Principal Software Engineer
940
salaries
| ₹18.6 L/yr - ₹53.2 L/yr |
Software Engineer2
836
salaries
| ₹7 L/yr - ₹23 L/yr |
Senior Analyst
596
salaries
| ₹5.9 L/yr - ₹19 L/yr |
Helmerich & Payne
Lenovo
Apple
Acer India