7 curated coding interview questions directly asked in Trilogy technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2564 | Substring XOR Queries | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 35.7% | 100.0% | all |
| 2569 | Handling Sum Queries After Update | Hard | Arrays | Sorting / Prefix / Scan | 31.1% | 100.0% | all |
| 2425 | Bitwise XOR of All Pairings | Medium | Core DSA | Implementation / Reasoning | 66.9% | 100.0% | all |
| 2403 | Minimum Time to Kill All Monsters | Hard | Arrays | Sorting / Prefix / Scan | 57.6% | 100.0% | all |
| 115 | Distinct Subsequences | Hard | Core DSA | Implementation / Reasoning | 51.9% | 62.5% | all |
| 592 | Fraction Addition and Subtraction | Medium | Core DSA | Implementation / Reasoning | 66.4% | 62.5% | all |
| 2438 | Range Product Queries of Powers | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 62.5% | all |