DSA Doctor
Verified Company Vault
Vk DSA Interview Questions
13 curated coding interview questions directly asked in Vk technical rounds, sorted by frequency with recency and difficulty diagnostics.
13
Total Questions
7 (54%)
Easy Problems
6 (46%)
Medium Problems
0 (0%)
Hard Problems
🔥 Most Tested Topics:
Strings (4)Core DSA (4)Arrays (4)Trees (2)Backtracking (1)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 567 | Permutation in String | Medium | Strings; Backtracking | Hashing / Sliding Window; Sliding Window; Backtracking | 48.9% | 100.0% | 6m |
| 849 | Maximize Distance to Closest Person | Medium | Core DSA | Implementation / Reasoning | 49.8% | 100.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 87.5% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 75.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 75.0% | all |
| 228 | Summary Ranges | Easy | Arrays | Sorting / Prefix / Scan | 54.2% | 75.0% | all |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium | Arrays | Sorting / Prefix / Scan | 71.2% | 75.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 165 | Compare Version Numbers | Medium | Core DSA | Implementation / Reasoning | 46.4% | 62.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 101 | Symmetric Tree | Easy | Trees | DFS / BFS | 61.2% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |