Ripple

Mid-sized

Ripple is a technology company specializing in enterprise blockchain and cryptocurrency solutions for cross-border payments and financial settlements. It is known for its RippleNet payment network and its association with the XRP digital asset, providing infrastructure for banks and financial institutions to enable faster, lower-cost global transactions.

3 interview notes · updated Jul 2026

Ripple·Software Engineer·Technical Phone Screen

Jun 2026

Ripple software engineer interview with a coding problem around order book logic and greedy algorithms. Pretty domain-specific given what Ripple does, which made it feel less like a generic leetcode screen and more like something you'd actually work on there.

Given a list of sell orders for XRP (each with a price per XRP and a quantity), and a USD budget, write a function that calculates exactly how much XRP a customer can purchase. Partial fills on the last order are allowed.

“The greedy part clicked pretty fast: sort by price ascending, buy cheap orders first.”

View Post

Ripple·Software Engineer·Technical Phone Screen

May 2026

Did a technical phone screen for a Software Engineer role at Ripple. One tree problem, but the follow-ups kept it interesting longer than I expected.

Given a binary tree and two target nodes, return the path between them as an ordered list of node values.
If the tree can contain duplicate values, how does your approach change and what should you use to identify the two target nodes?
If the tree is a BST, does the algorithm change, and how does the time complexity compare to a general binary tree?

“My first instinct was to find the path from root to each node, then stitch them together at the lowest common ancestor.”

View Post

Ripple·Software Engineer·Technical Phone Screen

Apr 2026

Did a technical screen for a Software Engineer role at Ripple. One tree problem, but the follow-ups kept it interesting longer than I expected.

Given a binary tree and two node values that both exist in the tree, return the sequence of node values along the path connecting those two nodes.
How would your approach change if node values in the tree are not unique?
If the tree is a BST rather than a generic binary tree, how does that change your time complexity and how would you find the LCA more efficiently?

“I went with the LCA approach: find the lowest common ancestor, build the path from LCA down to each node, then stitch them together with LCA appearing once in the middle.”

View Post