DSA Doctor
Verified Company Vault
Maq Software DSA Interview Questions
7 curated coding interview questions directly asked in Maq Software technical rounds, sorted by frequency with recency and difficulty diagnostics.
7
Total Questions
1 (14%)
Easy Problems
4 (57%)
Medium Problems
2 (29%)
Hard Problems
🔥 Most Tested Topics:
Strings (4)Trees (3)Core DSA (2)Arrays (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 467 | Unique Substrings in Wraparound String | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 43.1% | 100.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 75.0% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 62.5% | all |
| 516 | Longest Palindromic Subsequence | Medium | Core DSA | Implementation / Reasoning | 65.4% | 62.5% | all |
| 196 | Delete Duplicate Emails | Easy | Arrays | Sorting / Prefix / Scan | 66.0% | 62.5% | all |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 62.5% | all |