Related Coding / DSA
Cheapest Route Within a Stop Limit
Given one-way routes between cities each with a cost, find the cheapest total cost from a source city to a destination city using at most k intermediate stops.
Given a list of direct exchange rates, find the effective conversion rate between any two currencies by multiplying rates along a path in a directed graph.
You are building a currency exchange system. You receive a list of direct exchange rates, each described as (from_currency, to_currency, rate), meaning 1 unit of from_currency buys `rate` units of to_currency. Design and implement a system that: 1. Ingests the list of exchange rates. 2. Answers queries: given a source currency and a target currency, return the effective conversion rate (or indicate that conversion is not possible). Assume inverse rates are implied: if A→B = r, then B→A = 1/r. Assume every provided rate is positive. If the same directed pair appears multiple times, the last provided rate replaces earlier ones, and the final rate table is internally consistent so any valid path yields the same effective rate. Return 1.0 for a known currency converted to itself, and -1.0 when either currency is unknown or no path exists. Start with any clarifying questions.
Work in the provided coding workspace while explaining your decisions to the live interviewer. Validation may use inline tests, examples, comments, or a verbal walkthrough.
Practice this problem in the live coding workspace while the interviewer probes your clarification, implementation, trade-offs, and validation.
Continue to DashboardContinue preparing
Related Coding / DSA
Given one-way routes between cities each with a cost, find the cheapest total cost from a source city to a destination city using at most k intermediate stops.
Related Coding / DSA
Given a sequence of integers (possibly negative) and a target sum, count how many contiguous subarrays sum exactly to the target.
Related Coding / DSA
Given a number of courses and a list of prerequisite pairs, determine a valid order to complete all courses, or report that no valid order exists.
Related Coding / DSA
Given a small 2-by-3 sliding tile puzzle board with one blank space, find the minimum number of adjacent tile slides needed to reach a specified target arrangement, or report it is unreachable.