i
Info Edge
Filter interviews by
I applied via Campus Placement and was interviewed in Oct 2019. There were 5 interview rounds.
Find sum of k smallest numbers in a BST.
Traverse the BST in-order and add the k smallest numbers to a sum variable.
Use a priority queue to keep track of the k smallest numbers.
If k is greater than the number of nodes in the BST, return the sum of all nodes.
If k is 0, return 0.
Design algorithm and database for seat booking system of BookMyShow and handle failed payments.
Create a database with tables for movies, theaters, seats, bookings, and payments
Use a locking mechanism to prevent double booking of seats
If payment fails, release the locked seats and notify the user
Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;
Code for time stamp in C
Use the time.h header file
Call the time() function to get the current time in seconds
Convert the time to a string using strftime() function
Use the format string to specify the desired format of the time stamp
Rearrange array in consecutive pair multiplication in descending order.
Create a new array to store the multiplied values
Use a loop to iterate through the original array and multiply consecutive pairs
Write a compare function to sort the new array in descending order
Code to rearrange an array in maximum-minimum form.
Sort the array in descending order.
Create a new array and alternate between adding the maximum and minimum values from the sorted array.
Return the new array.
Time complexity: O(nlogn)
Space complexity: O(n)
stoi() function converts a string to an integer.
stoi() is a C++ function that takes a string as input and returns an integer.
It is used to convert a string of digits into an integer.
It can also handle negative numbers and ignore leading whitespace.
Example: int num = stoi("123"); // num is now 123
Code for finding the longest common substring in an array of strings.
Iterate through the first string and check for all possible substrings
Check if the substring is present in all other strings
Keep track of the longest common substring found so far
Return the longest common substring
Answers to common technical questions in a software engineering interview
A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.
A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.
Common Linux commands include ls...
Logical reasoning, Quantitative aptitude
Array,Strings,DSA concepts like searching algorithm
I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.
Easy 3 hours long , Math logical reasoning , english grammer
1 easy question , 1 medium question and 1 hard question
A palindrome of a string is a word, phrase, number, or other sequence of characters that reads the same forward and backward.
Check if the string is equal to its reverse to determine if it is a palindrome.
Ignore spaces and punctuation when checking for palindromes.
Examples: 'racecar', 'madam', 'A man, a plan, a canal, Panama!'
Yes, I am open to relocation for the right opportunity.
I am willing to relocate for the right job opportunity
I have experience moving for previous jobs
I am flexible and adaptable to new environments
I come from a close-knit family with a strong emphasis on education and hard work.
My parents are both engineers and have always encouraged me to pursue a career in technology.
I have two siblings, one of whom is also in the tech industry.
Family gatherings often involve discussions about the latest advancements in the field.
I was interviewed in Dec 2024.
Info Edge interview questions for designations
I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.
The duration was one hour
Get interview-ready with Top Info Edge Interview Questions
Resume walkthrough and 1 medium level DSA question.
DSA Questions around DP
Topological sorting is a linear ordering of vertices in a directed acyclic graph where for every directed edge uv, vertex u comes before v.
Topological sorting is used in scheduling tasks, such as in project management or task scheduling algorithms.
It can be implemented using depth-first search (DFS) algorithm.
Kahn's algorithm is another popular method for topological sorting.
Example: Given a graph with vertices A, B, C...
Easy to medium questions
I applied via campus placement at Motilal Nehru Institute National Institute of Technology (NIT), Allahabad and was interviewed before Sep 2023. There were 5 interview rounds.
Don't exactly remeber the questions now
My greatest strength is my problem-solving skills and my greatest weakness is my tendency to overthink.
Strength: I excel at breaking down complex problems into manageable tasks and finding efficient solutions.
Weakness: I sometimes spend too much time analyzing a situation and second-guessing myself, which can lead to delays in decision-making.
Strength: In a previous project, I was able to identify a critical bug in the...
To cope with stress, it is important to practice self-care, seek support from others, and engage in stress-relieving activities.
Practice self-care by getting enough sleep, eating well, and exercising regularly.
Seek support from friends, family, or a therapist to talk about your feelings and get advice.
Engage in stress-relieving activities such as meditation, yoga, or hobbies you enjoy.
Set boundaries and prioritize task...
Topological sort is a linear ordering of vertices in a directed acyclic graph.
Topological sort is used to find a linear ordering of vertices in a directed acyclic graph.
It is commonly implemented using depth-first search (DFS) algorithm.
The algorithm starts by visiting a vertex and then recursively visits all its adjacent vertices before adding it to the result list.
Topological sort is not possible if the graph has cyc
Reverses a linked list in groups of k
Break the linked list into groups of k nodes
Reverse each group individually
Connect the reversed groups back together
I applied via FirstNa
2 Programming Questions MCQ on CS fundamentals and aptitude
The pillars of OOPS are Abstraction, Encapsulation, Inheritance, and Polymorphism.
Abstraction: Hiding implementation details and showing only necessary information.
Encapsulation: Binding data and functions together and restricting access to them.
Inheritance: Creating new classes from existing ones, inheriting properties and methods.
Polymorphism: Ability of objects to take on multiple forms and behave differently based
The question asks to arrange a string based on the frequency of the characters.
Create a dictionary to store the frequency of each character in the string.
Sort the dictionary based on the frequency of characters in descending order.
Create a new string by concatenating the characters in the sorted dictionary.
Addition of 2 numbers represented by Linked List
Traverse both linked lists simultaneously and add the corresponding nodes
If the sum is greater than 9, carry over the 1 to the next node
If one linked list is shorter than the other, pad it with 0's
Return the sum as a new linked list
Program to evaluate algebraic expression with given values
Use a stack to keep track of operators and operands
Iterate through the expression and push operands onto the stack
When an operator is encountered, pop the top two operands and perform the operation
Push the result back onto the stack
Repeat until the entire expression has been evaluated
What people are saying about Info Edge
Some of the top questions asked at the Info Edge Software Engineer interview -
based on 14 interviews
5 Interview rounds
based on 32 reviews
Rating in categories
Senior Executive
743
salaries
| ₹2.5 L/yr - ₹7.7 L/yr |
Associate Senior Executive
608
salaries
| ₹2 L/yr - ₹6.2 L/yr |
Assistant Manager
600
salaries
| ₹3.5 L/yr - ₹9.5 L/yr |
Sales Executive
448
salaries
| ₹3.9 L/yr - ₹10 L/yr |
Senior Software Engineer
357
salaries
| ₹10 L/yr - ₹32.8 L/yr |
TCS
JustDial
Indiamart Intermesh
PolicyBazaar