Filter interviews by
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
Count pretty numbers ending with 2, 3, or 7 within a given range.
Iterate through the range from x to y and check if each number ends with 2, 3, or 7.
Increment a counter for each pretty number found.
Return the total count of pretty numbers within the range.
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
I applied via Referral and was interviewed before Oct 2023. There was 1 interview round.
I have over 10 years of experience in project management across various industries.
Managed cross-functional teams to successfully deliver projects on time and within budget
Implemented project management best practices to improve efficiency and productivity
Led the development and execution of project plans, schedules, and budgets
Communicated effectively with stakeholders to ensure alignment and transparency
Utilized proj...
Implemented regular performance reviews, training programs, and feedback mechanisms to continuously improve team performance.
Conduct regular performance reviews to identify strengths and areas for improvement
Implement training programs to enhance skills and knowledge
Establish feedback mechanisms for continuous improvement
Set clear performance goals and expectations
I applied via LinkedIn and was interviewed in Mar 2024. There was 1 interview round.
CureSkin interview questions for popular designations
Top trending discussions
MCQs and 1 coding question
To delete one child node, we need to identify the parent node and remove the child node from its list of children.
Identify the parent node of the child node to be deleted
Remove the child node from the parent node's list of children
I applied via Campus Placement and was interviewed before Apr 2023. There was 1 interview round.
It was on-campus placement interview.
Two rounds of interview were there and both were of DSA (DP and sorting algo).
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...
based on 8 interviews
Interview experience
based on 75 reviews
Rating in categories
Customer Success Specialist
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Online Reputation Management Executive
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Support Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Care Executive
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Tata 1mg
Netmeds.com
Practo
PharmEasy