Analyzing the Impact of Vehicle Weight on Fuel Economy

The goal of the analysis is to examine the relationship between the weight of cars and their fuel efficiency, measured in miles per gallon (MPG), using data from the Auto MPG dataset. Specifically, the task is to visually explore how the weight of a car might influence its fuel efficiency. The dataset contains several features such as car weight, engine displacement, horsepower, and more. 

### Analysis Solution:

To address this problem, a **scatter plot** is used to visualize the relationship between the weight of the car (as the independent variable on the x-axis) and the fuel efficiency (MPG) as the dependent variable on the y-axis. A joint plot is a useful visualization tool because it combines both the scatter plot and additional univariate distributions (marginal histograms) to show the spread of the data points along both axes.

- **Scatter Plot**: The scatter plot displays individual data points for each car, with its weight on the x-axis and MPG on the y-axis. This visual representation helps identify trends and correlations. For example, it may show if heavier cars tend to have lower fuel efficiency.

  

- **Marginal Histograms**: The plot includes histograms along the top and right margins to show the distribution of the weight and MPG variables individually. This gives insight into the overall distribution of each variable.

  

- **Contextual Information**: To make the plot more informative, a brief contextual description is added below the plot, explaining the relationship and the dataset.

### Conclusion:

From the plot, we can observe if there is a noticeable pattern or trend between car weight and fuel efficiency. Typically, one might expect a negative correlation, where heavier cars have lower MPG. This kind of analysis helps understand the dynamics between the car's weight and its fuel efficiency, which is essential for making decisions related to automotive design, environmental concerns, and consumer choices based on fuel economy.

Minimum Number of Refills for a Car Journey

You are driving to a destination that is a certain distance away, and your car has a limited fuel tank capacity. Along the way, there are gas stations at specific distances from your starting point. The task is to determine the **minimum number of refills** you will need to reach the destination, if possible, based on the given car fuel capacity and the locations of the gas stations.

### Inputs:

1. **Distance to destination** (`dist`): The total distance you need to travel.

2. **Fuel tank capacity** (`miles`): The maximum number of miles your car can travel on a full tank.

3. **Number of gas stations** (`n`): The number of gas stations along the route.

4. **Gas station locations** (`gas_stations`): A list of distances where gas stations are located from your starting point.

### Objective:

Determine the minimum number of refills required to reach the destination. If it’s not possible to reach the destination, return `-1`.

### Solution

1. **Initial Setup:**

   - You start with a full tank of gas, so the car can travel `miles` distance before needing a refill.

   - The variable `num_refill` keeps track of the total number of refills.

   - `curr_refill` tracks your current position at a gas station, and `limit` keeps track of how far you can travel with the current fuel level.

2. **Loop Until the Destination is Reachable:**

   - While the destination is beyond your current limit (i.e., `limit < dist`), you need to check whether you can reach the destination or the next gas station.

   - If you can't reach the next gas station (or there are no more stations), return `-1` to indicate that the trip is impossible.

3. **Find the Furthest Reachable Gas Station:**

   - The algorithm moves to the furthest reachable gas station that is within the current fuel limit.

   - It iterates through the list of gas stations and moves `curr_refill` to the furthest station within range.

   

4. **Refill at the Furthest Station:**

   - After finding the furthest gas station within reach, refill the tank, increase the refill count, and update the `limit` to reflect how far you can now travel after refilling.

5. **Continue Until the Destination is Reachable:**

   - The loop continues, finding the next furthest reachable station and refilling until you can reach the destination.

6. **Return the Number of Refills:**

   - If you reach the destination, return the number of refills made during the journey.

### Step-by-Step Breakdown

1. **Check Feasibility**:

   - Start with a full tank, and as long as the destination cannot be reached with the current fuel (`limit < dist`), look for gas stations within range.

2. **Handle Edge Cases**:

   - If the gas station is too far away from the current limit or there are no more gas stations within reach, return `-1` to indicate that the destination is unreachable.

3. **Optimize Refills**:

   - Always stop at the furthest reachable gas station to minimize the number of refills. This prevents unnecessary stops at closer stations.

### Example Walkthrough:

#### Test Case 1:

- **Input:** `car_fueling(950, 400, 4, [200, 375, 550, 750])`

  - **Explanation:**

    - Start with a full tank (can travel 400 miles).

    - Reach the first station at 200 miles, but continue to the furthest station at 375 miles.

    - Refill at 375 miles and continue.

    - Reach the next station at 550 miles but continue to the furthest one at 750 miles.

    - Refill at 750 miles and then reach the destination at 950 miles.

  - **Result:** 2 refills are needed.

#### Test Case 2:

- **Input:** `car_fueling(10, 3, 4, [1, 2, 5, 9])`

  - **Explanation:**

    - Start with a full tank (can travel 3 miles).

    - The first station is at 1 mile, but you cannot reach the next station at 5 miles with the current fuel capacity.

  - **Result:** The trip is impossible, so return `-1`.