Nokia coding interview
questions, leaked.
6 problems reported across recent Nokia interviews. Top patterns: array, sorting, math. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Nokia's coding interviews lean hard on arrays and sorting, with a healthy dose of math and number theory thrown in. You're looking at 6 problems total, half of them easy, but the hard one (Check If It Is a Good Array) is a genuine obstacle if you haven't drilled GCD and divisibility logic. Most candidates walk in unprepared for the math angle. If you hit that wall during the live assessment, StealthCoder runs invisibly and surfaces a solution in seconds. Your real prep window is narrow, so you need a ruthless priority list.
Top problems at Nokia
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Minimum Cost of Buying Candies With Discount | EASY | 100.0 | 62% | Array · Greedy · Sorting |
| 02 | Check If It Is a Good Array | HARD | 88.3 | 61% | Array · Math · Number Theory |
| 03 | LRU Cache | MEDIUM | 88.3 | 45% | Hash Table · Linked List · Design |
| 04 | Count Primes | MEDIUM | 88.3 | 35% | Array · Math · Enumeration |
| 05 | Longest Common Prefix | EASY | 88.3 | 45% | String · Trie |
| 06 | Valid Anagram | EASY | 88.3 | 67% | Hash Table · String · Sorting |
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 Nokia OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array3 · 50%
- sorting2 · 33%
- math2 · 33%
- number theory2 · 33%
- hash table2 · 33%
- string2 · 33%
- greedy1 · 17%
- linked list1 · 17%
- design1 · 17%
- doubly linked list1 · 17%
Array problems dominate Nokia's question set, appearing in half their known problems. Sorting and math tie for second, each showing up twice. This tells you something: Nokia cares about optimization and number properties, not just data structure manipulation. The easy tier (Minimum Cost of Buying Candies, Longest Common Prefix, Valid Anagram) is beatable with clean implementations. The medium-tier problems (LRU Cache, Count Primes) are where most candidates stall, especially LRU Cache if you haven't hand-coded a doubly-linked list before. The hard problem demands GCD reasoning. Spend your prep time on array manipulation, hash table patterns, and prime sieving. When the live assessment starts, StealthCoder is your safety net if a math problem blindsides you.
Companies with similar patterns
If you prepped for Nokia, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Nokia.
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. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Nokia interview FAQ
Should I memorize the Sieve of Eratosthenes for Nokia interviews?+
Yes. Count Primes is in their top problems, and it's a medium-difficulty filter. Know the algorithm cold, understand space-time tradeoffs, and practice writing it without hints. You'll see number theory concepts in at least one problem.
How much time should I spend on LRU Cache specifically?+
Significant time. It's their only design problem in the known set and requires fluent doubly-linked list manipulation. Practice building it from scratch twice. If you blank on the eviction logic mid-interview, that's where you're most likely to stall.
Are the easy problems worth drilling, or should I skip to medium?+
Drill them. Valid Anagram, Longest Common Prefix, and Minimum Cost of Buying Candies are speed tests. Clean, fast implementations on those three buy you confidence and time for the harder problems. Missing an easy is a bad look.
What's the priority order if I have three days left?+
Day one: arrays and sorting fundamentals, including merge and partition patterns. Day two: hash table patterns and LRU Cache hand-coding. Day three: number theory (GCD, prime enumeration, divisibility checks). Math is your weak point relative to the other topics.
Do I need to know tries for Nokia, or is it just one problem?+
Longest Common Prefix can be solved without a trie, but trie knowledge helps. It's one problem, so it's not a bottleneck. Focus on arrays, sorting, and hash tables first. Trie is a nice-to-have, not a must-have for this company.