Info Edge Software Developer Interview Questions and Answers for Experienced

Q1. Design airline service.
Ans. 
Design an airline service for booking flights and managing reservations.
• Create a user-friendly website or mobile app for customers to search and book flights.

• Implement a secure payment system for online bookings.

• Develop a system for managing flight schedules, seat availability, and reservations.

• Include features for customers to check-in online, select seats, and view flight status.

• Offer loyalty programs and discounts f
Answered by AI
Add your answer

Q1. Tasks in a class using js
Ans. 
Tasks in a class using JavaScript involve defining properties and methods for objects.
• Define properties using 'this' keyword

• Create methods within the class using 'function'

• Access properties and methods using dot notation
Answered by AI
Add your answer

3 questions all DSA trees graphs

Q1. 2 DSA medium difficulty
Add your answer
Q2. Find middle of linked list
Ans. 
To find the middle of a linked list, use the two-pointer approach.
• Initialize two pointers, slow and fast, pointing to the head of the linked list.

• Move the slow pointer one step at a time and the fast pointer two steps at a time.

• When the fast pointer reaches the end of the list, the slow pointer will be at the middle.
Answered by AI
Add your answer
Q3. Topological sort
Add your answer

60 mins - aptitude test, then followed by mcq's and 2 coding questions for total 2 hrs in mettl platform

Q1. Reverse elements in an array OOPS concepts Reverse LinkedList all with efficent time complexities Project related,Acid Properties
Add your answer

Q1. General questions like where do you see yourself in next 5 years, why should we hire you etc...
Add your answer

Q1. Asked to make a dynamic button component
Add your answer

Q1. Asked to make an API call using debouncing
Add your answer

Asked a Question about Trees

Q1. Basics about DS, SQL
Add your answer

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

Q1. Find Bugs in Code
Given a Problem Statement and a Code we need to find the bug in the code and correct the given code.
Ans. 
Tip 1: Other than writing code we must be able to understand others code as well.
Answered Anonymously
Add your answer
Q2. Count nodes within K-distance
You are given a connected, undirected and acyclic graph with some of the nodes as marked and a positive number 'K'. You need to return the count of all such nodes whic...read more
Ans. 
I knew that this has to be done in O(n logn ) or less time complexity so I approached in this way :
 
Intuition
From root, say the target node is at depth 3 in the left branch. It means that any nodes that are distance K - 3 in the right branch should be added to the answer.
 
Algorithm
Traverse every node with a depth first search dfs. We'll add all nodes x to the answer such that node is the node on the path from
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1.  Largest subarray with equal number of 0s and 1s
You are given an array consisting of 0s and 1s. You need to find the length of the largest subarray with an equal number of 0s and 1s.
For example:
If th...read more
Ans. 
Approach : I changed array entry for 0 to -1.
Then I took Prefix sum of array and then the problem changed to finding two index in array such that arr[i]=arr[j] and abs(j-i) is maximum.
Time Complexity : O(n) where n= number of elements in array.
Space Complexity : O(n)
Answered Anonymously
Add your answer
Q2. Computer System Architecture
Discussion about how the file system is stored on disk and how it works.
Ans. 
Ans:- Explained him about xv6 file system. Explained mainly directory inodes, file inodes and data blocks. Explained how ls accesses this hierarchical structure to retrieve all the files and directories in the directory
Answered Anonymously
Add your answer
Q3. Computer System Architecture
Distinguish between RISC and CISC architectures.
Ans. 
Ans:-Take a look at this https://superuser.com/questions/883330/what-is-the-difference-between-intel-cisc-and-arm-risc-architecture.
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.