Info Edge Interview Questions — 7 DSA Problems
7 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Info Edge LeetCode questions for software engineering interviews.
- Find the Minimum and Maximum Number of Nodes Between Critical Points (MEDIUM) — Linked List
- Find the Maximum Factor Score of Array (MEDIUM) — Array, Math, Number Theory
- Count Almost Equal Pairs I (MEDIUM) — Array, Hash Table, Sorting, Counting, Enumeration
- Two Out of Three (EASY) — Array, Hash Table, Bit Manipulation
- Bus Routes (HARD) — Array, Hash Table, Breadth-First Search
- Subrectangle Queries (MEDIUM) — Array, Design, Matrix
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
IE
Info Edge
7 questions tracked7 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 7 of 7 questions
1MediumFind the Minimum and Maximum Number of Nodes Between Critical Points✓ Our Solution Linked List
3ArrayHash TableSortingCounting+1
4ArrayHash TableBit Manipulation
5ArrayHash TableBreadth-First Search
7Two PointersStringDynamic Programming