InfoEdge Software Engineering 0-1years interview experience
- Posted
- 1 Sept 2026
Summary
I attended a multi‑stage interview for a Software Engineering role at InfoEdge. I was asked a mix of basic OOP, SQL, and DSA questions, but struggled with several of the algorithmic problems and was ultimately rejected.
How it went
AI interview (total 8 ques): IT WAS NON ELIMINATORY
- Asked intro
- Project I worked on and issues faced
- Encapsulation and inheritance and where using more inheritance is problematic
- Personal project inheritance issue
- Process vs threads
- What sorting algorithm will you use if array is almost sorted – I answered insertion sort
- Real scenario where I used insertion sort on an almost sorted array
Technical round 1: ELIMINATORY
- Introduction
- DSA question: number of islands
- SQL query: count all the employees from each department where salary >= 10000
- Normalization
- What is foreign key
- Clustering and non‑cluster index
- AI related questions – tokens, RAG, agents
Overall review of Technical round 1: it was pretty easy if you know basics then you’re good to go.
Technical round 2: ELIMINATORY (Pen paper round)
- Explained OOP concepts
- Given class A{getData()} and class B extends A{getData()}; asked which type of polymorphism is applied
- Four object‑creation examples and asked for output
- DSA questions:
- Find the 3rd largest element in an array (with constraint of using only 1 variable)
- Given two unsorted arrays, return two arrays in sorted order (example provided)
- Balanced parentheses with restrictions on using stack or extra space
- SQL: count number of students in each department using student and department tables
- Resume‑based and AI questions based on my experience
Another interviewer allowed the use of ChatGPT.
Overall review of Technical round 2: worst interview experience.
Verdict: rejected
Questions asked (7)
- 01
Number of Islands
Data Structures & Algorithms · Medium
Given a 2‑D grid of ‘1’s (land) and ‘0’s (water), count the number of distinct islands. An island is formed by connecting adjacent lands horizontally or vertically.
- 02
Count Employees per Department with Salary Filter
Data Structures & Algorithms · Easy
Write a SQL query that returns, for each department, the number of employees whose salary is greater than or equal to 10000.
- 03
Identify Polymorphism Type
Other
Given the classes:
```java class A { void getData() { /* ... */ } } class B extends A { void getData() { /* ... */ } } ```
What kind of polymorphism is demonstrated when callinggetData()on a reference of typeAthat points to an instance ofB? - 04
Third Largest Element with One Variable Constraint
Data Structures & Algorithms · Hard
Find the third largest distinct element in an unsorted array using only one auxiliary variable (i.e., minimal extra space). Sorting is not allowed.
- 05
Sort Two Unsorted Arrays Independently
Data Structures & Algorithms · Hard
Given two unsorted arrays, produce two arrays where each is sorted in non‑decreasing order while preserving the original pairing. Example:
Input:
arr1 = [1,9,3,6]
arr2 = [6,3,9,2,1]
Output:
arr1 = [1,1,2,3]
arr2 = [3,6,6,9,9] - 06
Balanced Parentheses without Stack
Data Structures & Algorithms · Hard
Check if a string containing various types of brackets (e.g., (), {}, []) is balanced. The interviewer prohibited the use of a stack and any additional data structures that increase space.
- 07
Count Students per Department
Data Structures & Algorithms · Easy
SQL query to count the number of students in each department using the
studentanddepartmenttables.