22 questions · from 4 interviews

Infoedge interview questions

Every question candidates reported from their Infoedge interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.

Infoedge coding and DSA questions

  1. 01

    Minimum Time to Burn a Binary Tree

    Given a binary tree and a starting node where fire ignites, compute the minimum time required to burn the entire tree. The fire spreads to adjacent nodes (parent and children) in 1 unit of time per edge.

    Medium · From InfoEdge (Naukri.com) - SDE Role | Interview Experience | 6M + FTE | OnCampus | 2026

  2. 02

    Reconstruct Names from OCR Text

    You are given a list of names and a dictionary of valid names. An OCR system has produced a concatenated string with all whitespace removed. Determine which names from the list can be reconstructed from the scanned text using the dictionary. Constraints are…

    Hard · From InfoEdge (Naukri.com) - SDE Role | Interview Experience | 6M + FTE | OnCampus | 2026

  3. 03

    Number of Islands

    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.

    Medium · From InfoEdge Software Engineering 0-1years interview experience

  4. 04

    Count Employees per Department with Salary Filter

    Write a SQL query that returns, for each department, the number of employees whose salary is greater than or equal to 10000.

    Easy · From InfoEdge Software Engineering 0-1years interview experience

  5. 05

    Third Largest Element with One Variable Constraint

    Find the third largest distinct element in an unsorted array using only one auxiliary variable (i.e., minimal extra space). Sorting is not allowed.

    Hard · From InfoEdge Software Engineering 0-1years interview experience

  6. 06

    Sort Two Unsorted Arrays Independently

    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]

    Hard · From InfoEdge Software Engineering 0-1years interview experience

  7. 07

    Balanced Parentheses without Stack

    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.

    Hard · From InfoEdge Software Engineering 0-1years interview experience

  8. 08

    Count Students per Department

    SQL query to count the number of students in each department using the student and department tables.

    Easy · From InfoEdge Software Engineering 0-1years interview experience

  9. 09

    Top K Frequent Elements

    Given an integer array nums and an integer k , return the k most frequent elements. You may return the answer in any order. Example: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2]

    From My Friend's Info Edge Interview (Bucket Sort Surprise)

  10. 10

    Max Consecutive Ones III (with A/B variant)

    Given an array containing 'A's and 'B's, return the maximum number of consecutive 'A's in the array if you can flip at most k 'B's to 'A's. This was a variant of the LeetCode problem 'Max Consecutive Ones III' where 0s and 1s were replaced by As and Bs.

    Medium · From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

  11. 11

    Next Permutation

    Implement the next permutation function, which rearranges numbers into the lexicographically next greater permutation of numbers. If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).

    Medium · From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

  12. 12

    Implement Stack using Queues

    Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack ( push , top , pop , and empty ).

    Easy · From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

Infoedge system design questions

  1. 01

    Website Parsing Service Architecture

    Design the architecture for a service that parses websites containing images, large PDFs and large amounts of text. Specifically address how to process a 100 MB PDF without losing context, discussing chunking, overlapping strategies, and potential use of LLMs.

    From InfoEdge (Naukri.com) - SDE Role | Interview Experience | 6M + FTE | OnCampus | 2026

  2. 02

    Local Document Retrieval System for Event

    Case study: As the manager of an event‑organising company with a 6‑person team and a deadline tomorrow, you must handle 100 large PDFs related to real estate. You have only a pendrive to distribute the PDFs and cannot use LLMs due to size and time…

    From InfoEdge (Naukri.com) - SDE Role | Interview Experience | 6M + FTE | OnCampus | 2026

  3. 03

    Low-Level Design of an E-commerce Platform

    Design a low-level architecture for an e-commerce platform. I was asked to identify and outline the main classes that would form the core of the system and briefly list the key APIs involved for interactions like user management, product catalog, cart, and…

    From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

  4. 04

    Horizontal vs. Vertical Scaling

    Explain the fundamental differences between horizontal and vertical scaling in distributed systems. Discuss their respective advantages, disadvantages, and typical use cases.

    From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

Infoedge other questions

  1. 01

    Identify Polymorphism Type

    Given the classes: java class A { void getData() { / ... / } } class B extends A { void getData() { / ... / } } What kind of polymorphism is demonstrated when calling getData() on a reference of type A that points to an instance of B ?

    From InfoEdge Software Engineering 0-1years interview experience

  2. 02

    Difference between 'finally' and 'finalize' keywords

    Explain the difference between the finally block and the finalize() method in Java, including their purpose and when they are used.

    From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

  3. 03

    Difference between 'Comparable' and 'Comparator' interfaces

    Explain the key differences between the Comparable and Comparator interfaces in Java, and provide scenarios where each would be appropriate.

    From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

  4. 04

    Internal Working of TreeMap

    Describe the internal data structure and working mechanism of TreeMap in Java, focusing on how it stores and retrieves elements while maintaining order.

    From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

  5. 05

    SpringBoot @Transactional Annotation

    Explain the purpose and functionality of the @Transactional annotation in Spring Boot. How does it manage transactions, and what are its common uses?

    From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

  6. 06

    Nth Highest Salary SQL Query

    Write a SQL query to find the n th highest salary from an Employee table, which has columns like id and salary . The query should handle cases where the n th highest salary does not exist.

    Medium · From InfoEdge Senior Software Engineer(1-3yoe) Interview Experience

Infoedge interview questions FAQ

What questions are asked in Infoedge interviews?

Candidates reported 22 distinct questions across 4 Infoedge interviews. 12 coding and DSA questions, 4 system design questions, 6 other questions.

How difficult are Infoedge interview questions?

Of the questions candidates rated, 25% were easy, 42% medium and 33% hard.