Wise Coding Interview Questions
26 Wise coding interview problems with full optimal solutions — 13 easy, 10 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 Wise interviewer values, and a FAQ section.
Showing 10 problems of 26
- #14mediumfoundational
14. Add Two Numbers
Sum two integers represented as digit linked lists with carry propagation — Wise uses this as the canonical money-math probe (no floats, ever).
- #15mediumfoundational
15. Longest Substring Without Repeating Characters
Find the longest unique-character window in a string — Wise uses it as a stand-in for the longest streak of unmatched ledger entries in a reconciliation scan.
- #16mediumfoundational
16. Container With Most Water
Pick two columns that hold the most water — Wise reframes this as picking the two FX liquidity pools that maximize a peer match.
- #17mediumfoundational
17. 3Sum
Find every triplet in an array that sums to zero — Wise uses it as a three-leg peer pooling probe (two senders cover one receiver).
- #18mediumfoundational
18. Group Anagrams
Bucket strings by anagram class — Wise treats this as the canonical hash-keyed bucketing problem behind their FX matching engine.
- #19mediumfoundational
19. Merge Intervals
Merge overlapping intervals into a minimal cover — Wise uses it as a stand-in for collapsing overlapping settlement windows in cross-border batches.
- #20mediumfoundational
20. Unique Paths
Count grid paths from top-left to bottom-right moving only right or down — Wise frames it as counting candidate FX routes through their corridor graph.
- #21mediumfoundational
21. Permutations
Generate every permutation of a distinct-integer array — Wise uses this to probe controlled backtracking, which is the same pattern as enumerating FX routing legs.
- #22mediumfoundational
22. Word Break
Decide if a string segments into dictionary words — Wise uses it as a stand-in for whether a multi-currency payment can be decomposed into legal corridor hops.
- #23mediumfoundational
23. LRU Cache
Design a get/put cache with O(1) eviction of the least recently used key — Wise probes this for FX rate caches in front of their pricing oracles.