i
Info Edge
Filter interviews by
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Topic- future of automobile sector
I applied via Campus Placement and was interviewed in Nov 2022. There were 5 interview rounds.
The aptitude test is medium tough. If you have already given competitive exams like CAT, CMAT, XAT, etc. then it should not be difficult for you. Remember that time management is of utmost importance.
The group discussion is where I would suggest you try to take the lead by starting first as it may create a positive impact. Also, try to speak points relevant to the topic and keep it short to give others a chance to speak too. Group discussion is not all about you speaking most of the time but also giving others a chance to others to listen to them. Also, do not try to cheat or indulge in malpractice by taking the help of the internet or keeping a tab open and speaking by reading from it as it is easy to understand that what you're saying is not your own words but from somewhere else.
BCG matrix is a strategic tool used to analyze a company's product portfolio and make decisions about resource allocation.
BCG stands for Boston Consulting Group, the consulting firm that developed the matrix.
The matrix categorizes a company's products into four categories: stars, cash cows, question marks, and dogs.
Stars are high-growth, high-market-share products that require heavy investment to maintain their positio...
Investments have been made in various areas including technology, infrastructure, and marketing.
Investments have been made in technology to improve our products and services.
Infrastructure investments have been made to expand our reach and improve logistics.
Marketing investments have been made to increase brand awareness and customer acquisition.
Specific examples include investing in a new CRM system, expanding our war...
I applied via Campus Placement and was interviewed before Oct 2019. There were 4 interview rounds.
What people are saying about Info Edge
posted on 13 Mar 2024
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
What's Important roles in Justdial
My strength is my ability to build strong relationships with clients, weakness is sometimes being too detail-oriented, and hobbies include hiking and photography.
Strength: Building strong relationships with clients
Weakness: Being too detail-oriented at times
Hobbies: Hiking and photography
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.
The algorithm finds the position of the 3rd occurrence of 'B' in an n-ary tree from a given index in constant time complexity.
Traverse the n-ary tree using a depth-first search (DFS) algorithm
Keep track of the count of 'B' occurrences
When the count reaches 3, return the current position
If the end of the tree is reached before the 3rd 'B', return -1
Check if a given string is a composite of two words from a limited dictionary.
Create a hash set of all the words in the dictionary.
Iterate through all possible pairs of substrings in the given string.
Check if both substrings are present in the hash set.
If yes, return true. Else, return false.
Switch adjacent nodes in a single linked list.
Traverse the linked list and swap adjacent nodes.
Keep track of previous node to update its next pointer.
Handle edge cases for first two nodes and last node.
Example: 1->2->3->4 becomes 2->1->4->3.
Traverse only the left sub-tree of a binary search tree.
Start at the root node
If the left child exists, visit it and repeat the process
If the left child does not exist, return to the parent node
Continue until all nodes in the left sub-tree have been visited
Design an efficient data structure for two lifts in a building of n floors.
Use a priority queue to keep track of the floors each lift is heading to
Implement a scheduling algorithm to determine which lift to assign to a new request
Consider adding a weight limit to each lift to prevent overloading
Use a hash table to keep track of the current location of each lift
To find the maximum number that can be formed from the digits of an integer.
Convert the integer to a string
Sort the characters in descending order
Join the sorted characters to form the maximum number
based on 2 interviews
Interview experience
based on 39 reviews
Rating in categories
Senior Executive
747
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Senior Executive
657
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
603
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
448
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
355
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
JustDial
Indiamart Intermesh
PolicyBazaar