i
Info
Edge
Work with us
Filter interviews by
Dijkstra's algorithm finds the shortest path between nodes in a graph, optimizing route selection in various applications.
Graph Representation: Dijkstra's algorithm works on weighted graphs, where edges have non-negative weights, representing distances or costs.
Initialization: It starts by setting the initial node's distance to zero and all others to infinity, marking the initial node as visited.
Relaxation Process...
Yes, I am proficient in Excel and can utilize its features for data analysis and reporting.
I can create complex formulas, such as VLOOKUP and INDEX-MATCH, to analyze data efficiently.
I am skilled in using pivot tables to summarize large datasets and extract meaningful insights.
I can create visually appealing charts and graphs to present data clearly.
I am familiar with data validation techniques to ensure data inte...
A palindrome is a string that reads the same forwards and backwards, like 'racecar' or 'level'.
A simple way to check for a palindrome is to reverse the string and compare it to the original.
Example: 'madam' reversed is 'madam', so it's a palindrome.
Ignoring spaces and punctuation can be important: 'A man, a plan, a canal, Panama!' is a palindrome.
Case sensitivity matters: 'Racecar' is not the same as 'racecar' unl...
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
Program to find the largest palindromic substring in input string.
Iterate through each character in the input string and check for palindromic substrings.
Keep track of the largest palindromic substring found so far.
Use dynamic programming or expand around center approach for efficient solution.
Example: Input string 'babad', largest palindromic substring is 'bab' or 'aba'.
Program to find all triplets with a given sum in an array.
Use three nested loops to iterate through all possible combinations of triplets.
Check if the sum of the current triplet is equal to the given sum.
Store the triplets that satisfy the condition in a list and return the list.
Program to find elements present in one array but not in other array
Iterate through each element in the first array and check if it exists in the second array
If not found, add it to a new array of unique elements
Repeat the process for the second array to find elements unique to it
Program to evaluate a mathematical expression using stack
Use a stack to store operands and operators
Iterate through the expression and push operands onto the stack
When an operator is encountered, pop operands from the stack, perform the operation, and push the result back onto the stack
Continue until the entire expression is evaluated
The final result will be the top element of the stack
Find minimum number of coins for a given value using backtracking and dynamic programming.
Backtracking involves exploring all possible solutions and choosing the best one.
Dynamic programming involves breaking down the problem into smaller subproblems and solving them.
For backtracking, we can start with the largest coin and keep subtracting it until we reach the target value.
For dynamic programming, we can create a...
I appeared for an interview in May 2025, where I was asked the following questions.
Logical reasoning, Quantitative aptitude
Array,Strings,DSA concepts like searching algorithm
I appeared for an interview in Oct 2024, where I was asked the following questions.
Dijkstra's algorithm finds the shortest path between nodes in a graph, optimizing route selection in various applications.
Graph Representation: Dijkstra's algorithm works on weighted graphs, where edges have non-negative weights, representing distances or costs.
Initialization: It starts by setting the initial node's distance to zero and all others to infinity, marking the initial node as visited.
Relaxation Process: The...
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
I appeared for an interview in Dec 2024.
Yes, I am proficient in Excel and can utilize its features for data analysis and reporting.
I can create complex formulas, such as VLOOKUP and INDEX-MATCH, to analyze data efficiently.
I am skilled in using pivot tables to summarize large datasets and extract meaningful insights.
I can create visually appealing charts and graphs to present data clearly.
I am familiar with data validation techniques to ensure data integrity...
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...
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 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...
What people are saying about Info Edge
Some of the top questions asked at the Info Edge Software Engineer interview -
based on 15 interview experiences
Difficulty level
Duration
based on 34 reviews
Rating in categories
5-8 Yrs
Not Disclosed
Senior Executive
681
salaries
| ₹3.5 L/yr - ₹8 L/yr |
Sales Executive
658
salaries
| ₹10 L/yr - ₹10 L/yr |
Assistant Manager
617
salaries
| ₹4.3 L/yr - ₹9.5 L/yr |
Associate Senior Executive
601
salaries
| ₹2.8 L/yr - ₹6.2 L/yr |
Senior Software Engineer
367
salaries
| ₹14 L/yr - ₹25 L/yr |
TCS
Amazon
Flipkart
Indiamart Intermesh