i
Info
Edge
Work with us
Filter interviews by
Converting postfix expressions to prefix involves rearranging operators and operands based on their positions.
Postfix (Reverse Polish Notation) places operators after their operands, e.g., 'AB+' means 'A + B'.
Prefix (Polish Notation) places operators before their operands, e.g., '+AB' means 'A + B'.
To convert, use a stack: push operands, pop for operators, and rearrange accordingly.
Example: Postfix 'AB+C*' convert...
Combination sum problem involves finding all unique combinations of numbers that sum up to a target value.
Use backtracking to explore all combinations.
Start with an empty combination and add numbers recursively.
Avoid duplicates by ensuring the same number isn't used multiple times in one combination.
Example: For candidates [2, 3, 6, 7] and target 7, valid combinations are [7] and [2, 2, 3].
Consider edge cases like...
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 ha...
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
Arrow functions are shorter syntax for writing function expressions.
Arrow functions do not have their own 'this' keyword.
They cannot be used as constructors.
They cannot be used as methods in objects.
They have implicit return statements.
They have a more concise syntax than normal functions.
SEO standards include optimizing website content, using relevant keywords, and building quality backlinks.
Optimize website content with relevant keywords and meta tags
Ensure website is mobile-friendly and has fast loading speed
Build quality backlinks from reputable sources
Use descriptive and unique page titles and URLs
Regularly update website content and add new pages
Avoid duplicate content and keyword stuffing
Uti...
Tree shaking is a process of eliminating unused code in React applications.
It is a part of the build process that removes dead code from the final bundle.
It helps in reducing the size of the bundle and improving the performance of the application.
It works by analyzing the code and identifying the parts that are not used.
It is achieved through tools like webpack and babel.
Example: If a component is not used in the ...
Code splitting is a technique to split code into smaller chunks to improve performance.
Code is divided into smaller chunks that can be loaded on demand
Reduces initial load time and improves performance
Used in modern web development frameworks like React, Angular, and Vue
Example: splitting a large JavaScript file into smaller modules
Higher-order components are functions that take a component and return a new component with additional functionality.
Higher-order components (HOCs) are a pattern in React for reusing component logic.
They are functions that take a component and return a new component with additional functionality.
HOCs can be used for adding props, state, or lifecycle methods to a component.
Examples of HOCs include connect() from Re...
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.
I appeared for an interview in May 2025, where I was asked the following questions.
I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.
The duration was one hour
Converting postfix expressions to prefix involves rearranging operators and operands based on their positions.
Postfix (Reverse Polish Notation) places operators after their operands, e.g., 'AB+' means 'A + B'.
Prefix (Polish Notation) places operators before their operands, e.g., '+AB' means 'A + B'.
To convert, use a stack: push operands, pop for operators, and rearrange accordingly.
Example: Postfix 'AB+C*' converts to ...
Combination sum problem involves finding all unique combinations of numbers that sum up to a target value.
Use backtracking to explore all combinations.
Start with an empty combination and add numbers recursively.
Avoid duplicates by ensuring the same number isn't used multiple times in one combination.
Example: For candidates [2, 3, 6, 7] and target 7, valid combinations are [7] and [2, 2, 3].
Consider edge cases like empt...
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...
I applied via Job Fair and was interviewed in Jan 2023. There was 1 interview round.
Topic description
Pointer 1
Pointer 2
Pointer 3
I applied via Naukri.com and was interviewed in Feb 2022. There were 2 interview rounds.
Coding decoding, algebra,trigonometry etc.
Class & object:-
Class:- Class is a blueprint/template.
Class is not real world entity.
Class don't occupy memory.
Object:- Object is instance of Class.
Object is a real world entity.
Object Occupy memory.
Method:-Method is code ...
I applied via Naukri.com and was interviewed in Mar 2022. There were 4 interview rounds.
Aptitude solving questions
Discussion
I applied via Referral and was interviewed before Feb 2021. There were 4 interview rounds.
SEO standards include optimizing website content, using relevant keywords, and building quality backlinks.
Optimize website content with relevant keywords and meta tags
Ensure website is mobile-friendly and has fast loading speed
Build quality backlinks from reputable sources
Use descriptive and unique page titles and URLs
Regularly update website content and add new pages
Avoid duplicate content and keyword stuffing
Utilize ...
Hooks were introduced to allow functional components to use state and lifecycle methods.
Hooks were introduced in React 16.8
They allow functional components to use state and lifecycle methods
This makes it easier to reuse code and manage state
Examples of hooks include useState, useEffect, and useContext
Code splitting is a technique to split code into smaller chunks to improve performance.
Code is divided into smaller chunks that can be loaded on demand
Reduces initial load time and improves performance
Used in modern web development frameworks like React, Angular, and Vue
Example: splitting a large JavaScript file into smaller modules
Tree shaking is a process of eliminating unused code in React applications.
It is a part of the build process that removes dead code from the final bundle.
It helps in reducing the size of the bundle and improving the performance of the application.
It works by analyzing the code and identifying the parts that are not used.
It is achieved through tools like webpack and babel.
Example: If a component is not used in the appli...
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...
What people are saying about Info Edge
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
Some of the top questions asked at the Info Edge Software Engineer interview for freshers -
based on 4 interview experiences
Difficulty level
Duration
based on 34 reviews
Rating in categories
5-8 Yrs
Not Disclosed
Senior Executive
761
salaries
| ₹3.7 L/yr - ₹8 L/yr |
Sales Executive
658
salaries
| ₹10 L/yr - ₹10 L/yr |
Associate Senior Executive
603
salaries
| ₹2.8 L/yr - ₹6.2 L/yr |
Assistant Manager
578
salaries
| ₹4.4 L/yr - ₹9.5 L/yr |
Senior Software Engineer
371
salaries
| ₹14 L/yr - ₹25.5 L/yr |
TCS
Amazon
Flipkart
Indiamart Intermesh