Nubank Coding Interview Questions
25 Nubank coding interview problems with full optimal solutions — 13 easy, 9 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Nubank interviewer values, and a FAQ section.
Showing 3 problems of 25
- #23hardfoundational
23. Sliding Window Maximum
Return the maximum in each sliding window of size k as it slides across nums; Nubank uses the monotonic deque to test whether candidates can replace a naive heap with an O(n) trick under real-time risk scoring constraints.
- #24hardfoundational
24. Find Median from Data Stream
Design a data structure supporting addNum and findMedian over a numeric stream; Nubank uses the two-heap split as an analog for running-quantile risk scoring over a card-auth firehose.
- #25hardfoundational
25. LFU Cache
Design a Least-Frequently-Used cache with O(1) get and put, breaking ties by recency; Nubank uses it to gauge whether senior candidates can layer two hash maps with frequency buckets for hot-credit-line caching.