DSA Doctor
Verified Company Vault
Amdocs DSA Interview Questions
5 curated coding interview questions directly asked in Amdocs technical rounds, sorted by frequency with recency and difficulty diagnostics.
5
Total Questions
2 (40%)
Easy Problems
3 (60%)
Medium Problems
0 (0%)
Hard Problems
🔥 Most Tested Topics:
Arrays (3)Strings (1)Trees (1)Design (1)Core DSA (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2950 | Number of Divisible Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 74.6% | 100.0% | all |
| 3391 | Design a 3D Binary Matrix with Efficient Layer Tracking | Medium | Arrays; Design | Sorting / Prefix / Scan; Data Structure Design | 66.4% | 100.0% | all |
| 3875 | Construct Uniform Parity Array I | Easy | Arrays | Sorting / Prefix / Scan | 76.3% | 100.0% | all |
| 3876 | Construct Uniform Parity Array II | Medium | Arrays | Sorting / Prefix / Scan | 49.9% | 100.0% | all |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 62.5% | all |
