Filter interviews by
Clear (1)
I was interviewed in Sep 2024.
Normal Aptitude Test
Truncate is a SQL command used to delete all rows from a table without deleting the table structure.
Truncate is faster than using the DELETE command because it does not log individual row deletions.
Truncate resets the identity seed of the table.
Truncate cannot be rolled back like the DELETE command.
Truncate is typically used when you want to quickly remove all data from a table.
Example: TRUNCATE TABLE TableName;
Top trending discussions
I applied via Referral
I applied via Campus Placement
I applied via LinkedIn and was interviewed in Apr 2020. There were 4 interview rounds.
Reducing delivery time can be achieved by optimizing the supply chain, improving communication, and automating processes.
Analyze the supply chain and identify bottlenecks
Implement automation tools to streamline processes
Improve communication between departments and with customers
Use data analytics to forecast demand and plan accordingly
Consider outsourcing or partnering with third-party logistics providers
Invest in tec...
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...
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
I applied via Campus Placement
The aptitutde test was entirely based on your logical reasoning and aptitude handling skills.
I applied via Campus Placement and was interviewed in Sep 2023. There were 4 interview rounds.
First round is gamified aptitude that is playfull easy to crake.
That was a aptitude test easy to crake. major question are percentage,reasoning,average,ven diagram,number system, basic math question
Science base assessment (at the first they give certain amount of course and course source that we need to study) easy 10 mcq question we need to learn the course.
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
4 questions , 3 DSA questions medium level and 1 DB design round
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Customer Success Specialist
116
salaries
| ₹0 L/yr - ₹0 L/yr |
Production Analyst
54
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Medical Data Analyst
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Practo
Curofy
Lybrate
Portea Medical