9 curated coding interview questions directly asked in Hrt technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard | Trees | DFS / BFS | 36.1% | 100.0% | all |
| 2246 | Longest Path With Different Adjacent Characters | Hard | Strings | Hashing / Sliding Window | 54.0% | 100.0% | all |
| 2285 | Maximum Total Importance of Roads | Medium | Arrays | Sorting / Prefix / Scan | 69.1% | 100.0% | all |
| 1566 | Detect Pattern of Length M Repeated K or More Times | Easy | Strings | Hashing / Sliding Window | 43.9% | 100.0% | all |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | Easy | Arrays | Sorting / Prefix / Scan | 59.2% | 100.0% | all |
| 1342 | Number of Steps to Reduce a Number to Zero | Easy | Core DSA | Implementation / Reasoning | 85.8% | 100.0% | all |
| 1323 | Maximum 69 Number | Easy | Arrays | Sorting / Prefix / Scan | 84.5% | 100.0% | all |
| 3225 | Maximum Score From Grid Operations | Hard | Arrays | Sorting / Prefix / Scan | 64.5% | 100.0% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |