Info Edge Software Engineer Interview Questions, Process, and Tips

DSA Questions around DP

Q1. Circular linked list?
Add your answer
Q2. Topological sorting in graph
Ans. 
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...read more
Answered by AI
Add your answer

Easy to medium questions

Q1. DSA questions based on Arrays
Add your answer

Don't exactly remeber the questions now

Q1. It was a string problem
Add your answer
Q2. Again just a better version of question 1
Add your answer

Q1. Puzzles were asked
Add your answer
Q2. Project related and some DSA questions
Add your answer

Q1. Project related questions were asked.
Add your answer
Q2. Detailed review of the company
Add your answer

Q1. The greatest strength and weakness
Ans. 
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...read more
Answered by AI
Add your answer
Q2. How to cope with stress?
Ans. 
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...read more
Answered by AI
Add your answer

Q1. Topological Sort Implementation
Ans. 
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
Answered by AI
Add your answer
Q2. Linked List reversal in groups of k
Ans. 
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
Answered by AI
Add your answer

2 Programming Questions MCQ on CS fundamentals and aptitude

Q1. What are the pillars of OOPS?
Ans. 
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
Answered by AI
View 1 more answer
Q2. Arrange a string based on the frequency of the characters
Ans. 
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.
Answered by AI
Add your answer
Q3. Addition of 2 numbers represented by Linked List
Ans. 
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
Answered by AI
Add your answer

Q1. Questions on React JS , OOPS, OS, My internship work experience
Add your answer
Q2. Coding Question on tree
Add your answer

Q1. Write a program to evaluate an algebraic expression e.x. (x+y-z) where the values of x,y,z are already provided to you
Ans. 
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
Answered by AI
Add your answer

Q1. Generic HR questions
Add your answer