LeetCode 1094: Car Pooling Solution

Master LeetCode problem 1094 (Car Pooling), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1094. Car Pooling

Medium

Array Sorting Heap (Priority Queue)Simulation Prefix Sum

Problem Explanation

Explanation:

To solve this problem, we can simulate the car's journey along the road and keep track of the number of passengers at each location. We will iterate over the trips array, incrementing the passenger count at the pickup location and decrementing it at the drop-off location. At each step, we check if the total number of passengers exceeds the car's capacity. If it does, we return false, indicating that it is not possible to pick up and drop off all passengers. If we complete all trips without exceeding the capacity at any point, we return true.

We need to keep track of the passenger count at each location.
Iterate over the trips and update the passenger count accordingly.
Check if the passenger count exceeds the capacity at any point.

Time Complexity: O(n), where n is the number of trips. Space Complexity: O(maximum location), where maximum location is the maximum value of any location in the trips.

Solution Code

class Solution {
    public boolean carPooling(int[][] trips, int capacity) {
        int[] passengerCount = new int[1001];
        for (int[] trip : trips) {
            passengerCount[trip[1]] += trip[0];
            passengerCount[trip[2]] -= trip[0];
        }
        
        int currPassengers = 0;
        for (int count : passengerCount) {
            currPassengers += count;
            if (currPassengers > capacity) {
                return false;
            }
        }
        
        return true;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1094 (Car Pooling)?

This page provides optimized solutions for LeetCode problem 1094 (Car Pooling) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1094 (Car Pooling)?

The time complexity for LeetCode 1094 (Car Pooling) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1094 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1094 in Java, C++, or Python.

Back to LeetCode Solutions