VK coding interview
questions, leaked.
7 problems reported across recent VK interviews. Top patterns: array, two pointers, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
VK's coding assessment leans heavily on array manipulation and two-pointer techniques. You're looking at 5 array problems across 7 total, with most at easy difficulty but two medium-hard curveballs that trip candidates who haven't drilled sliding window and dynamic programming patterns. The good news: it's a short, focused problem set. The bad news: you need clean implementations fast. If you hit a wall on something like Longest Subarray of 1's, StealthCoder runs invisibly during your screen share and surfaces a working solution while you stay calm.
Top problems at VK
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Maximize Distance to Closest Person | MEDIUM | 100.0 | 49% | Array |
| 02 | Move Zeroes | EASY | 95.6 | 63% | Array · Two Pointers |
| 03 | Valid Parentheses | EASY | 90.2 | 42% | String · Stack |
| 04 | Summary Ranges | EASY | 83.2 | 53% | Array |
| 05 | Merge Sorted Array | EASY | 83.2 | 53% | Array · Two Pointers · Sorting |
| 06 | Longest Subarray of 1's After Deleting One Element | MEDIUM | 73.3 | 69% | Array · Dynamic Programming · Sliding Window |
| 07 | Valid Palindrome | EASY | 73.3 | 51% | Two Pointers · String |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual VK OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array5 · 71%
- two pointers3 · 43%
- string2 · 29%
- dynamic programming1 · 14%
- sliding window1 · 14%
- stack1 · 14%
- sorting1 · 14%
Nearly 71 percent of VK's problems are array-based, so your first week should be Move Zeroes, Merge Sorted Array, Summary Ranges, and Maximize Distance to Closest Person. Two-pointer work is woven into at least three of them. That's your foundation. The medium problems (Maximize Distance to Closest Person and Longest Subarray of 1's) require sliding window and dynamic programming thinking, not just brute force. Valid Parentheses and Valid Palindrome are your string warm-ups. You'll likely encounter one curveball in the actual OA. That's where StealthCoder is your hedge: when you've optimized your array approach but missed the sliding-window insight, it solves mid-interview, invisible to the proctor, and you stay in control.
Companies with similar patterns
If you prepped for VK, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass VK.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
VK interview FAQ
Should I practice all 7 problems before my VK OA?+
Focus on the 5 array problems first. They represent over 70 percent of their catalog. Merge Sorted Array, Move Zeroes, and Summary Ranges are absolute must-drills. Add Valid Parentheses and Valid Palindrome for string and stack basics. The two medium problems (Maximize Distance and Longest Subarray) are your final push if you have time.
How much time should I spend on two-pointer problems?+
Two-pointer techniques appear in at least 3 of 7 problems at VK. After you nail Move Zeroes and Merge Sorted Array, spend half your remaining prep time reinforcing the pattern on Valid Palindrome. It's a lightweight skill that compounds fast.
Are sliding window and dynamic programming critical for VK?+
They're critical for one problem: Longest Subarray of 1's After Deleting One Element. That's your only sliding-window problem in the full set, but it's medium difficulty. If you're short on time, drill it last or accept it as your OA hedge.
What's the hardest problem VK has reported?+
Longest Subarray of 1's and Maximize Distance to Closest Person are both medium. Neither is reported as hard. The difficulty skews easy, so if you're confident on basic array and string work, you're already ahead. The medium problems test pattern recognition, not complex algorithms.
How much harder is VK's OA than the public problem list?+
Unknown. The 7 problems shown are reported examples, not guaranteed to be the exact set you'll see. Prepare them as your baseline and assume one or two new twists. That's why you need clean, transferable array and two-pointer logic, not memorized solutions.