Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Nov 2024. There were 2 interview rounds.
ReactJS and PHP based User Management Portal
Use a hashmap to store the frequency of each number in the array.
Create a hashmap to store the frequency of each number in the array.
Iterate through the array and update the frequency in the hashmap.
Return the hashmap with the frequency of each number.
The default session time in PHP is 24 minutes.
Default session time in PHP is 24 minutes
Session time can be changed using the 'session.gc_maxlifetime' directive in php.ini file
Session time can also be set using the 'session_set_cookie_params()' function in PHP
SQL query to retrieve duplicate email addresses from a table
Use GROUP BY and HAVING clause to identify duplicates
Select the email column and count the occurrences
Filter the results to show only emails with count greater than 1
CORS allows web applications to make requests to a different domain than the one it originated from.
CORS is enabled on the server side by setting the 'Access-Control-Allow-Origin' header to specify which domains are allowed to make requests.
Options requests are sent by the browser to check if the server allows the actual request. The server should respond with the appropriate headers.
CORS can be configured to allow spe...
Use indexing, pagination, caching, and optimized queries to fetch large amounts of data quickly.
Utilize indexing on database columns to speed up search queries.
Implement pagination to limit the number of records fetched at once.
Use caching mechanisms to store frequently accessed data and reduce database load.
Optimize queries by selecting only necessary columns and avoiding unnecessary joins.
Consider using asynchronous ...
I have worked on projects involving customer segmentation, sales forecasting, and sentiment analysis using analytics.
Customer segmentation: Used clustering algorithms to group customers based on their behavior and demographics.
Sales forecasting: Utilized time series analysis to predict future sales trends and optimize inventory management.
Sentiment analysis: Applied natural language processing techniques to analyze cus...
I applied via Referral and was interviewed before Aug 2023. There was 1 interview round.
Goqii interview questions for popular designations
I applied via Facebook and was interviewed before Jul 2023. There was 1 interview round.
Protein is important for weight loss as it helps increase metabolism, reduce appetite, and preserve muscle mass. The recommended daily protein intake varies based on factors like age, gender, activity level, and goals.
Protein helps increase metabolism by requiring more energy to digest compared to fats and carbs
Protein reduces appetite by promoting feelings of fullness and satiety
Protein preserves muscle mass during we...
I applied via Referral and was interviewed in Feb 2022. There were 3 interview rounds.
I applied via Referral and was interviewed in Sep 2021. There were 2 interview rounds.
Aptitude test
I had to read 8 modules which consisted of assesment, each assesment consisted of 15 mcq in 3 minutes and I had to crack 4 interviews
Top trending discussions
I applied via Walk-in and was interviewed before Dec 2022. There were 4 interview rounds.
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 was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Your task is to complete predefined functions t...
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
The fir...
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 7 interviews
Interview experience
Health Coach
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Application Developer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
CURE India
HealthifyMe
Practo
Tata 1mg