16 curated coding interview questions directly asked in Fractal Analytics technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | Arrays | Sorting / Prefix / Scan | 65.4% | 100.0% | all |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Hard | Arrays | Sorting / Prefix / Scan | 48.6% | 100.0% | all |
| 3441 | Minimum Cost Good Caption | Hard | Arrays | Sorting / Prefix / Scan | 20.9% | 100.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 87.5% | all |
| 392 | Is Subsequence | Easy | Core DSA | Implementation / Reasoning | 49.0% | 87.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 75.0% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 75.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 75.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 62.5% | all |
| 270 | Closest Binary Search Tree Value | Easy | Trees; Binary Search | DFS / BFS; Binary Search | 49.2% | 62.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | all |
| 185 | Department Top Three Salaries | Hard | Core DSA | Implementation / Reasoning | 60.5% | 62.5% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 197 | Rising Temperature | Easy | Core DSA | Implementation / Reasoning | 51.3% | 62.5% | all |