16 curated coding interview questions directly asked in Barclays technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 3474 | Lexicographically Smallest Generated String | Hard | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 53.5% | 100.0% | all |
| 3070 | Count Submatrices with Top-Left Element and Sum Less Than k | Medium | Arrays | Sorting / Prefix / Scan | 74.8% | 87.5% | all |
| 2961 | Double Modular Exponentiation | Medium | Core DSA | Implementation / Reasoning | 48.1% | 87.5% | all |
| 2833 | Furthest Point From Origin | Easy | Core DSA | Implementation / Reasoning | 77.0% | 87.5% | all |
| 3080 | Mark Elements on Array by Performing Queries | Medium | Arrays | Sorting / Prefix / Scan | 49.3% | 87.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 386 | Lexicographical Numbers | Medium | Graphs | BFS / DFS / Topological Sort | 76.2% | 50.0% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 176 | Second Highest Salary | Medium | Core DSA | Implementation / Reasoning | 47.0% | 50.0% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 50.0% | all |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 50.0% | all |
| 151 | Reverse Words in a String | Medium | Strings | Hashing / Sliding Window | 56.4% | 50.0% | all |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | Arrays | Sorting / Prefix / Scan | 56.6% | 50.0% | all |
| 763 | Partition Labels | Medium | Dynamic Programming | State Transition | 81.9% | 50.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |