Available question text
Given a list of buses and the stops they take, given a start and end stop, find the minimum number of transfers needed to reach. Return -1 if its not possible.
Related questions
Continue with questions that share topics or the same question type.
- DP problem: You are given several service options. For each option i, bandwidth[i] is the amount of bandwidth required, and request[i] is the number of requests that can be handled using that bandwidth.
Given a maximum bandwidth limit totalBandwidth, choose a subset of the options so that the total bandwidth used does not exceed totalBandwidth, while the total number of handled requests is as large as possible.
Return the maximum number of requests that can be handled.
Other questions
- Given a graph as an adjacency list that represents a single ring, return all the nodes in the order they appear on the ring, starting from any node and going in either direction.
Other questions
- Given two strings s and t, return the minimum window substring of s that contains every character of t including duplicates, or an empty string if no such window exists. Walk through the sliding-window approach using two pointers and a character-frequency hashmap, analyze the O(|s| + |t|) time complexity, and discuss how to adapt it when t contains characters not present in s or when s arrives as a stream that cannot be fully buffered.
Other questions
- Given a list of events, find which user should be rate-limited. Then there are multiple follow-up questions after you're done with this.
Other questions
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Snap
Given a list of buses and the stops they take, given a start and end stop, find the minimum number of transfers needed to reach. Return -1 if its not possible.
Reported date not specified · 1 source report
Software Developer
Source snapshot: Nov 12, 2026
View source