Filter interviews by
I applied via LinkedIn and was interviewed before Jun 2022. There were 5 interview rounds.
Basic Python syntax, networking and linux basics in MCQs along with two coding questions with Leetcode easy difficulty.
Top trending discussions
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
2 question of DSA (easy, medium) in 60 minutes
Deletion in min heap involves removing the root node and rearranging the heap to maintain the min heap property.
To delete the root node in a min heap, swap it with the last node in the heap.
Remove the last node and then heapify the heap starting from the root to maintain the min heap property.
Example: If the min heap is [10, 20, 30, 25, 40], after deletion the heap becomes [20, 25, 30, 40].
I applied via Job Fair and was interviewed in Mar 2024. There was 1 interview round.
Severity, Priority, and Criticality are different aspects of issue management in software testing.
Severity refers to the impact of a defect on the system's functionality.
Priority indicates the order in which defects should be fixed based on business needs.
Criticality combines severity and priority to determine the overall importance of a defect.
For example, a defect causing a system crash would have high severity, high...
Equivalence partitioning is a software testing technique where input data is divided into partitions and only one value from each partition is tested.
Input data is divided into groups or partitions based on similar characteristics
One value from each partition is selected as a representative for testing
Helps in reducing the number of test cases while ensuring maximum coverage
Example: Testing a login form with valid, inv
Backward compatibility refers to the ability of a system to accept input intended for an older version of the system.
Allows newer versions of software to work with data or systems from older versions
Ensures that changes in the software do not break compatibility with existing data or systems
Helps in smooth transition and adoption of new versions without disrupting existing processes
A paradox in testing refers to a situation where a test case both passes and fails at the same time.
Paradox in testing can occur when a test case has conflicting requirements or conditions.
It can also happen when there are errors in the test setup or execution that lead to unexpected results.
For example, a test case may pass when run individually but fail when run as part of a test suite due to dependencies.
Identifying...
PUT and PATCH are HTTP methods used for updating resources in RESTful APIs.
PUT is used to update or replace an existing resource entirely
PATCH is used to partially update an existing resource
PUT is idempotent, meaning multiple identical requests will have the same effect as a single request
PATCH is not idempotent, meaning multiple identical requests may have different effects
Oops concepts refer to object-oriented programming principles like inheritance, polymorphism, encapsulation, and abstraction.
Inheritance: Allows a class to inherit properties and behavior from another class. Example: Parent class 'Animal' and child class 'Dog'.
Polymorphism: Ability of an object to take on multiple forms. Example: Method overloading and overriding.
Encapsulation: Bundling data and methods that operate on...
I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.
Hackerrank - 3 questions 2 hrs
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
Hackerrank test with medium questions
posted on 6 Jan 2023
I applied via campus placement at Indian Institute of Technology (IIT), Guwahati and was interviewed in Dec 2022. There were 3 interview rounds.
4 Coding questions, I solved 3 and shortlisted for interview
I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.
2 question of DSA (easy, medium) in 60 minutes
Deletion in min heap involves removing the root node and rearranging the heap to maintain the min heap property.
To delete the root node in a min heap, swap it with the last node in the heap.
Remove the last node and then heapify the heap starting from the root to maintain the min heap property.
Example: If the min heap is [10, 20, 30, 25, 40], after deletion the heap becomes [20, 25, 30, 40].
There were 2 questions in coding one with array and in string releated
I applied via Shine and was interviewed before Oct 2023. There was 1 interview round.
Software Engineer
17
salaries
| ₹10.8 L/yr - ₹25 L/yr |
Senior Software Engineer
6
salaries
| ₹22 L/yr - ₹41.3 L/yr |
Software Developer
5
salaries
| ₹6.6 L/yr - ₹36.3 L/yr |
Data Scientist
4
salaries
| ₹27 L/yr - ₹34 L/yr |
Accountant
4
salaries
| ₹10.4 L/yr - ₹10.4 L/yr |
CrowdStrike
Palo Alto Networks
FireEye
NortonLifeLock's