11 curated coding interview questions directly asked in Ukg technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 761 | Special Binary String | Hard | Strings | Hashing / Sliding Window | 79.3% | 100.0% | all |
| 3380 | Maximum Area Rectangle With Point Constraints I | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 100.0% | all |
| 3382 | Maximum Area Rectangle With Point Constraints II | Hard | Arrays | Sorting / Prefix / Scan | 24.0% | 100.0% | all |
| 3138 | Minimum Length of Anagram Concatenation | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 39.8% | 75.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | all |
| 2539 | Count the Number of Good Subsequences | Medium | Core DSA | Implementation / Reasoning | 48.6% | 75.0% | all |
| 3136 | Valid Word | Easy | Strings | Hashing / Sliding Window | 50.9% | 75.0% | all |
| 2592 | Maximize Greatness of an Array | Medium | Arrays | Sorting / Prefix / Scan | 61.7% | 75.0% | all |
| 3511 | Make a Positive Array | Medium | Arrays | Sorting / Prefix / Scan | 36.8% | 62.5% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | all |