Info Edge coding interview
questions, leaked.
7 problems reported across recent Info Edge interviews. Top patterns: array, hash table, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Info Edge's online assessment hits you with array problems five times out of seven. You'll see one easy warm-up, then five medium-difficulty problems that chain together array manipulation, hash tables, and math patterns. One hard problem sits at the end, usually a graph or design problem to separate confident candidates from the rest. Most candidates spend too much time on the easy problem and run out of mental energy for the medium tier. If you blank on a pattern mid-OA, StealthCoder solves it in seconds, invisible to the proctor. But the real edge is knowing which topics to drill first.
Top problems at Info Edge
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Find the Maximum Factor Score of Array | MEDIUM | 100.0 | 40% | Array · Math · Number Theory |
| 02 | Find the Minimum and Maximum Number of Nodes Between Critical Points | MEDIUM | 100.0 | 69% | Linked List |
| 03 | Count Almost Equal Pairs I | MEDIUM | 95.0 | 38% | Array · Hash Table · Sorting |
| 04 | Two Out of Three | EASY | 84.5 | 77% | Array · Hash Table · Bit Manipulation |
| 05 | Bus Routes | HARD | 73.1 | 47% | Array · Hash Table · Breadth-First Search |
| 06 | Subrectangle Queries | MEDIUM | 73.1 | 86% | Array · Design · Matrix |
| 07 | Longest Palindromic Substring | MEDIUM | 64.1 | 36% | Two Pointers · String · Dynamic Programming |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Info Edge OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array5 · 71%
- hash table3 · 43%
- sorting1 · 14%
- counting1 · 14%
- enumeration1 · 14%
- bit manipulation1 · 14%
- breadth first search1 · 14%
- design1 · 14%
- matrix1 · 14%
- math1 · 14%
Arrays dominate this assessment. Five of seven problems touch arrays, and three of those also need hash tables to solve efficiently. That's your foundation: master array iteration, sliding windows, and hash-table lookups under time pressure. Sorting shows up once, counting once, and bit manipulation once. The hard problem at the end is Bus Routes, a breadth-first-search pattern disguised as an array problem. Don't skip graph problems in your prep. The five medium problems are the real gauntlet. Most candidates can solve them, but only under 45 minutes if they've seen the pattern before. If you haven't, you'll rebuild the solution from scratch and hit time. That's where StealthCoder becomes your hedge on the live OA. Math and number theory appear in the highest-ranked medium problem, so if you're weak on divisors and factors, drill that first.
Companies with similar patterns
If you prepped for Info Edge, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Info Edge.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Info Edge interview FAQ
How many array problems should I solve before Info Edge's OA?+
At least 15 to 20, because arrays appear in five of their seven problems. Focus on two-pointer, sliding window, and prefix-sum patterns. One easy and five medium means you need speed and pattern recognition, not just correctness.
Is hash table knowledge required for this OA?+
Yes. Three problems explicitly require hash tables, and two of those are medium difficulty. You'll use it for counting, grouping, and fast lookups. Practice converting 'count unique' or 'find pairs' problems into hash-table solutions.
What should I drill first for Info Edge?+
Array problems, then hash-table combinations. The hard problem is Bus Routes, a BFS problem, so don't skip graph patterns. Sorting and bit manipulation appear only once each, so treat those as bonuses after you've locked down arrays and hash tables.
Is the difficulty distribution even for Info Edge?+
No. One easy, five medium, one hard. The medium tier is where 80 percent of your points live. The easy problem is a confidence builder. Don't spend more than 8 minutes on it and save your energy for the medium problems.
Do I need to study graph algorithms for Info Edge?+
Yes, but only BFS. Bus Routes is their hard problem and it's a breadth-first-search pattern wrapped in an array context. One hard problem usually determines pass or fail when candidates tie on medium problems.