DSA Doctor
Verified Company Vault
Nagarro DSA Interview Questions
8 curated coding interview questions directly asked in Nagarro technical rounds, sorted by frequency with recency and difficulty diagnostics.
8
Total Questions
4 (50%)
Easy Problems
4 (50%)
Medium Problems
0 (0%)
Hard Problems
🔥 Most Tested Topics:
Strings (3)Core DSA (2)Linked List (1)Trees (1)Stack / Queue (1)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 100.0% | 6m |
| 2320 | Count Number of Ways to Place Houses | Medium | Core DSA | Implementation / Reasoning | 43.9% | 100.0% | all |
| 3852 | Smallest Pair With Different Frequencies | Easy | Core DSA | Implementation / Reasoning | 69.4% | 100.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 62.5% | all |
| 225 | Implement Stack using Queues | Easy | Stack / Queue | Monotonic Stack / Simulation | 69.9% | 62.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 62.5% | all |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 62.3% | 62.5% | all |