BLACK FRIDAY: Up to 35% off Premium

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Low Level Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 134. Gas Station

Given two arrays gas and cost around a circular route, find the unique starting station index from which you can travel clockwise once without your running fuel (gas[i] - cost[i] cumulative) ever dropping below zero, or return -1 if impossible. The key is that a solution exists iff total gas >= total cost, and you must pick the start where the running sum never becomes negative.

Asked at:

Bloomberg

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late January, 2025

Bloomberg

Junior

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 134. Gas Station

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact