8 curated coding interview questions directly asked in Info Edge technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 69.5% | 100.0% | all |
| 3334 | Find the Maximum Factor Score of Array | Medium | Arrays | Sorting / Prefix / Scan | 41.1% | 100.0% | all |
| 3265 | Count Almost Equal Pairs I | Medium | Core DSA | Implementation / Reasoning | 38.3% | 100.0% | all |
| 2032 | Two Out of Three | Easy | Core DSA | Implementation / Reasoning | 77.6% | 87.5% | all |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 75.0% | all |
| 1476 | Subrectangle Queries | Medium | Core DSA | Implementation / Reasoning | 86.4% | 75.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 62.5% | all |