Filter interviews by
Clear (1)
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I was interviewed in Nov 2023.
Questions were based on Computer Science Fundamentals, Coding and SQL
I applied via Campus Placement
1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth
I applied via Naukri.com and was interviewed before Jul 2023. There were 3 interview rounds.
Coding round and technical questions
Some technical questions and few questions related to past projects
PharmEasy interview questions for designations
Top trending discussions
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 Referral
I applied via Campus Placement
Remove duplicates from array of strings
Create a new empty array
Loop through the original array
Check if the current element exists in the new array
If not, add it to the new array
Return the new array
Use isinstance() function to check if num is int or not.
Use isinstance(num, int) to check if num is an instance of int class.
This function returns True if num is an instance of int class, else False.
Example: isinstance(5, int) will return True.
Example: isinstance(5.0, int) will return False.
I applied via Other and was interviewed in Dec 2021. There were 4 interview rounds.
Arrange odd and even numbers in an array, even on RHS and odd on LHS.
Create two pointers, one at the start and one at the end of the array.
Swap the elements at the pointers if they are in the wrong position.
Continue swapping until the pointers meet in the middle.
BODMAS is a mathematical rule used to evaluate expressions with multiple operators.
BODMAS stands for Brackets, Orders, Division, Multiplication, Addition, and Subtraction.
It is used to determine the order in which operations are performed in an expression.
Brackets are evaluated first, followed by orders (exponents and roots), then division and multiplication, and finally addition and subtraction.
For example, in the exp...
based on 5 interviews
1 Interview rounds
based on 14 reviews
Rating in categories
Pharmacist
281
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
191
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Delight Officer
147
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
113
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Medlife
Tata 1mg
Netmeds.com
Practo