i
Info Edge
Filter interviews by
I applied via Naukri.com and was interviewed before May 2023. There was 1 interview round.
I applied via Referral and was interviewed in Oct 2022. There were 2 interview rounds.
Nellore is preferred over Hyderabad due to its strategic location, cost-effectiveness, and availability of skilled workforce.
Strategic location: Nellore is situated on the east coast of India, making it an ideal location for industries that rely on port facilities for import and export.
Cost-effectiveness: Nellore offers lower costs of living and business operations compared to Hyderabad, making it an attractive choice ...
What people are saying about Info Edge
I applied via LinkedIn and was interviewed in Dec 2023. There were 2 interview rounds.
General questions and current affairs
I applied via Company Website and was interviewed in Mar 2024. There were 2 interview rounds.
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
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 4 interviews
Interview experience
based on 67 reviews
Rating in categories
Senior Executive
747
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Senior Executive
610
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
604
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
448
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
352
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
JustDial
Indiamart Intermesh
PolicyBazaar