Nokia interview questions

Tech / SWE · 6 questions
Report an interview →

Browse 6 Nokia interview questions for software engineering and software development interview preparation. Questions in this collection are tagged for full-time roles. Explore the topics and stages below and filter the collection to plan your practice.

Interview stages in this collection
Online assessment (OA), Phone screen, Onsite
Practice topics
Array (3), Hash Table (2), Math (2), Number Theory (2), Sorting (2), String (2), Design (1), Enumeration (1)

Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what Nokia will ask. Locked question details require points. Public examples below are free to read.

Read 3 free Nokia interview question examples

Browse all Nokia questions

6 questions

Free Nokia interview question examples

Read the full problem statements and use the links to revisit or share a specific example.

Candy Discount

Easy · Online assessment (OA) · Full-time

Got this greedy problem in my Nokia OA. A candy shop has a deal where every third candy is free if you buy two, but the free one has to cost less than or equal to the cheaper of the two you paid for. Given an array of candy prices, find the minimum total cost to buy them all. The interviewer asked me to prove why the greedy approach gives the optimal result and whether it still works if the deal applies to every fourth candy instead.

LRU Cache

Medium · Phone screen · Onsite · Full-time

LRU cache design came up in my Nokia onsite. Implement get and put in O(1) with eviction of the least recently used entry when capacity is exceeded. I went with the classic doubly linked list plus hash map combo. The interviewer was interested in how this relates to real caching systems in telecom infrastructure and asked about thread-safe variants. We had a good discussion about whether a concurrent hash map with a lock-striped linked list would actually preserve LRU ordering.

Good Array

Hard · Phone screen · Onsite · Full-time

This was an interesting number theory question from my Nokia technical round. Given an array of positive integers, determine if you can pick a subset, multiply each by any integer, and make them sum to 1. Sounds complicated but it reduces to checking if the GCD of the entire array is 1, which comes from Bezout's identity. The interviewer was impressed that I recognized the reduction quickly and asked me to explain why GCD being 1 is both necessary and sufficient.