SoFi·Software Engineer·Technical Phone Screen
Jul 2026
SoFi software engineer interview that went deep on a classic jump game problem. They didn't just want code, they wanted the full treatment: proof of correctness, complexity analysis, edge cases, the works.
- Given an array of non-negative integers where each value represents the max steps you can jump forward from that index, first determine if you can reach the last index from index 0, and then find the minimum number of jumps to get there. They wanted an O(n) time, O(1) space solution, plus a correctness proof, complexity analysis, and a full edge case walkthrough.
“This is jump game 1 and 2 stapled together, which I didn't expect.” The rest of the author's notes on Software Engineer interview at SoFi, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post