i
Foodhub
Filter interviews by
I applied via Naukri.com and was interviewed before Jun 2021. There were 3 interview rounds.
Top trending discussions
I applied via Campus Placement
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
I applied via Referral and was interviewed before Sep 2021. There were 2 interview rounds.
There are 2 questions Both are average everyone can do.
Left view of Binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree level by level from left to right
Keep track of the first node encountered at each level
Example: For a tree with root node A and left children B and C, the left view would be [A, B]
I applied via Campus Placement and was interviewed in Jul 2022. There was 1 interview round.
Medium to hard questions based on arrays, dp
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
Divides array into smaller sub-arrays based on a pivot element
Recursively sorts sub-arrays
Combines sorted sub-arrays to get final sorted array
Time complexity: O(n log n) on average, O(n^2) worst case
Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Rotate a matrix by 90 degrees in place
Transpose the matrix
Reverse each row of the transposed matrix
posted on 4 Jan 2025
I applied via Company Website and was interviewed before Jan 2024. There were 2 interview rounds.
Online technical aptitude test
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
Asked array questions medium level
based on 2 reviews
Rating in categories
SME
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Test Engineer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Automation Test Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Zomato
Swiggy
Uber eats
DineOut