Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Nov 2022. There were 3 interview rounds.
A test plan is a document that outlines the scope, approach, resources, and schedule of testing activities.
Defines the objectives and scope of testing
Outlines the testing approach and methodologies to be used
Specifies the resources, schedule, and responsibilities for testing
Includes test scenarios, test cases, and test data
Identifies risks and mitigation strategies
Provides a basis for monitoring and controlling the tes
Test strategy is a high-level plan to achieve testing objectives and goals.
Test strategy outlines the approach to be taken for testing a particular project or product.
It includes the scope of testing, resources, timelines, and risks involved.
Test strategy helps in ensuring that testing is conducted in a systematic and organized manner.
Examples: Agile testing strategy, risk-based testing strategy, automation testing str
The CTC (Cost to Company) and expectations for the Test Manager role.
CTC (Cost to Company) includes salary, bonuses, benefits, and other perks offered by the company.
Expectations may include experience level, skills, responsibilities, and goals for the role.
CTC and expectations can vary based on company size, industry, location, and candidate's qualifications.
For example, a Test Manager may expect a CTC of $80,000 with...
Top trending discussions
I applied via Campus Placement and was interviewed in Jun 2022. There were 5 interview rounds.
50 mcq were asked in 12 mins. Most of the candidates qualified this round.
3 coding questions of basic DSA were asked. Also few mcqs from Operating System, Networking and DBMS.
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
15 minutes test.
50 questions
easy questions
Management , Leadership , Character Type questions
2 coding questions
resume grilling
easy medium questions
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
45 mins, Basic aptitude , comprehension and decision making questions
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
Reverse a given Linked List with O(1) and O(N) space complexity.
For O(1) space complexity, use three pointers to reverse the links in place.
For O(N) space complexity, use a stack to store the nodes and then pop them to create the reversed list.
Be careful with edge cases such as empty list or list with only one node.
Find the celebrity in a party of N people where only one person is known to everyone.
The celebrity doesn't know anyone in the party.
We can use a stack to keep track of potential celebrities.
If a person knows someone, they cannot be a celebrity.
If a person doesn't know someone, we can push them onto the stack.
After iterating through all people, we check if the stack has only one person and if that person is known to eve
Merge Sort and Quick Sort are sorting algorithms that use divide and conquer approach.
Merge Sort divides the array into two halves, sorts them recursively, and then merges them.
Quick Sort selects a pivot element, partitions the array around the pivot, and recursively sorts the sub-arrays.
Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has an average case time complexity of O(nlogn).
Merge Sort ...
Compute amount of water trapped in an elevation map after raining
Iterate through the array and find the maximum height on the left and right of each bar
Calculate the amount of water that can be trapped on each bar using the difference between the minimum of the two maximum heights and the height of the bar
Add up the amount of water trapped on each bar to get the total amount of water trapped
Zigzag traversal of a binary tree is a way of traversing the tree in a zigzag pattern.
Use a stack to keep track of nodes to be visited.
For each level, alternate between adding nodes to the stack from left to right and right to left.
Pop nodes from the stack and add their children to the stack in the appropriate order.
Repeat until all nodes have been visited.
Sort a dictionary by key or value in ascending/descending order.
Use sorted() function with lambda function to sort by key or value.
For ascending order, use reverse=False and for descending order, use reverse=True.
Example: sorted_dict = sorted(dictionary.items(), key=lambda x: x[0], reverse=True)
I applied via Naukri.com and was interviewed in May 2021. There were 4 interview rounds.
Quick sort is a divide and conquer algorithm that sorts the array by selecting a pivot element and partitioning the other elements around it. Merge sort is also a divide and conquer algorithm that divides the array into two halves, sorts them separately and then merges them.
Quick sort has an average time complexity of O(n log n) while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is an in-place...
System design for Naukri.com platform
Identify user requirements and design the system architecture accordingly
Use scalable and reliable technologies for high traffic handling
Implement features like job search, job posting, resume upload, etc.
Ensure data security and privacy of users
Integrate with third-party services like payment gateways, social media platforms, etc.
Highest sum of contiguous subarray in an array
Use Kadane's algorithm to find the maximum sum subarray
Initialize max_so_far and max_ending_here to 0
Loop through the array and update max_ending_here and max_so_far
Return max_so_far as the highest subset sum subarray
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Add two linked lists and return the sum as a linked list.
Traverse both linked lists and add the corresponding nodes.
Handle carry over while adding nodes.
Create a new linked list to store the sum and return it.
Quick sort is faster but unstable, while merge sort is slower but stable.
Quick sort uses a pivot element to divide the array into two parts and recursively sorts them.
Merge sort divides the array into two halves, sorts them separately, and then merges them.
Quick sort has an average time complexity of O(n log n), while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is not stable, meaning that the...
I applied via Campus Placement and was interviewed in Jun 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Feb 2023. There were 4 interview rounds.
If the cost price of an item is Rs. 150 and the selling price is Rs. 200, what is the profit percentage?
A stack is a LIFO data structure while a queue is a FIFO data structure.
Stack: Last In First Out (LIFO), used in undo/redo functionality, backtracking, and recursion.
Queue: First In First Out (FIFO), used in job scheduling, breadth-first search, and printing.
Stack uses push() and pop() operations while queue uses enqueue() and dequeue() operations.
A compiler translates the entire program into machine code before execution, while an interpreter translates and executes the program line by line.
A compiler converts the source code into an executable file, while an interpreter executes the code directly.
Compilers typically produce faster and more efficient code, while interpreters provide faster development and debugging.
Examples of compilers include GCC, Clang, and ...
I handle stress and pressure by practicing time management, seeking support from colleagues, and maintaining a healthy work-life balance.
I prioritize tasks and create a schedule to manage my time effectively.
I communicate with my team and seek their assistance or guidance when needed.
I engage in stress-relieving activities outside of work, such as exercising or spending time with loved ones.
I practice mindfulness and d...
based on 1 interview
Interview experience
Software Developer
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
UI Developer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Delhivery
Ecom Express
XpressBees
Shadowfax Technologies