Info Edge Software Developer Intern Interview Questions and Answers

Graphs ,arrays , Hashmaps and Heaps

Q1. Graphs related dfs
Add your answer
Q2. Changes on graph structure
Ans. 
Changes on graph structure involve adding, removing, or modifying nodes and edges.
• Adding a new node to the graph

• Removing an existing node from the graph

• Modifying the weight of an edge in the graph
Answered by AI
Add your answer

Q1. Design parking lot app
Ans. 
A parking lot app to help users find available parking spots and pay for parking.
• Include a map feature to show available parking spots in real-time

• Allow users to reserve parking spots in advance

• Integrate payment options for users to pay for parking

• Provide notifications for parking expiration or availability of nearby spots
Answered by AI
Add your answer
Q2. Design parking lot app for blind people
Ans. 
A parking lot app designed for blind people to easily navigate and find available parking spots.
• Include voice-guided navigation to direct users to available parking spots

• Use sensors to detect empty parking spaces and relay information to the app

• Provide audio alerts for obstacles or other vehicles in the parking lot

• Include a feature for users to easily locate their parked vehicle when returning
Answered by AI
Add your answer

It consists of aptitude and 2 easy coding questions

Q1. Tell about your project
Ans. 
Developed a web application for managing inventory
• Used HTML, CSS, and JavaScript for the frontend

• Implemented a RESTful API using Node.js and Express.js for the backend

• Utilized a PostgreSQL database for storing inventory data

• Implemented authentication and authorization using JSON Web Tokens (JWT)

• Implemented features like adding, updating, and deleting inventory items
Answered by AI
Add your answer
Q2. Some basic SQL question
Add your answer

Round duration - 90 mintues
Round difficulty - Medium

Goes good no problem at all exam is between 10 to 11:30.

Q1. 
Game of Dominoes Problem Statement
Rafiq loves to play with piles of dominoes, especially when they are of equal heights. His father gifted him 'N' piles of dominoes, each with a positive number of stacke...read more
Add your answer
Q2. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Goes good no problem at all exam at same time between 10 to 11:30.

Q1. What problems did you face in your project and how did you deal with them?
Add your answer
Q2. 
Ninja and Sorted Arrays Problem
You are given two sorted integer arrays, ARR1 and ARR2, with sizes M and N, respectively. Merge these arrays into ARR1 as a single sorted array. Assume ARR1 has a size equa...read more
Add your answer