CCCPaste

Car Pooling | Optimal

class Solution {
    public boolean carPooling(int[][] trips, int capacity) {
        int n = trips.length;

        int in_car = 0;int[] amt = new int[1001];

        for(int i =0; i capacity)return false;
        }

        return true;
    }
}