i
Tata 1mg
Filter interviews by
Clear (1)
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].
Top trending discussions
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
Take away home - coding task
Binary Search questions were asked
Peak in a mountain array question were asked
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
I applied via Campus Placement
I applied via Referral
I applied via Campus Placement
1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth
I was interviewed in Nov 2023.
Questions were based on Computer Science Fundamentals, Coding and SQL
based on 1 interview
Interview experience
Team Lead
259
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
255
salaries
| ₹0 L/yr - ₹0 L/yr |
Pharmacist
250
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
185
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
144
salaries
| ₹0 L/yr - ₹0 L/yr |
PharmEasy
Netmeds.com
Medlife
Practo