Stealth Interview
  • Features
  • Pricing
  • Blog
  • Login
  • Sign up

Leetcode #1651: Hopper Company Queries III

In this guide, we solve Leetcode #1651 Hopper Company Queries III in Python and focus on the core idea that makes the solution efficient.

You will see the intuition, the step-by-step method, and a clean Python implementation you can use in interviews.

Leetcode

Problem Statement

Table: Drivers +-------------+---------+ | Column Name | Type | +-------------+---------+ | driver_id | int | | join_date | date | +-------------+---------+ driver_id is the column with unique values for this table. Each row of this table contains the driver's ID and the date they joined the Hopper company.

Quick Facts

  • Difficulty: Hard
  • Premium: Yes
  • Tags: Database

Intuition

The task is relational in nature, which maps cleanly to DataFrame operations in Python.

By treating tables as DataFrames, joins and group-bys become concise and readable.

Approach

Load the inputs as DataFrames and apply the appropriate merge, filter, or group-by.

Select or rename the columns to match the required output.

Steps:

  • Load inputs as DataFrames.
  • Apply merge/groupby/filter operations.
  • Select the output columns.

Example

+-------------+---------+ | Column Name | Type | +-------------+---------+ | driver_id | int | | join_date | date | +-------------+---------+ driver_id is the column with unique values for this table. Each row of this table contains the driver's ID and the date they joined the Hopper company.

Python Solution

import duckdb import pandas as pd def solution(drivers: pd.DataFrame, rides: pd.DataFrame, accepted_rides: pd.DataFrame) -> pd.DataFrame: con = duckdb.connect() con.register("Drivers", drivers) con.register("Rides", rides) con.register("AcceptedRides", accepted_rides) return con.execute("""WITH RECURSIVE Months AS ( SELECT 1 AS month UNION ALL SELECT month + 1 FROM Months WHERE month < 12 ), Ride AS ( SELECT month, SUM(IFNULL(ride_distance, 0)) AS ride_distance, SUM(IFNULL(ride_duration, 0)) AS ride_duration FROM Months AS m LEFT JOIN Rides AS r ON month = MONTH(requested_at) AND YEAR(requested_at) = 2020 LEFT JOIN AcceptedRides AS a ON r.ride_id = a.ride_id GROUP BY month ) SELECT month, ROUND( AVG(ride_distance) OVER (ROWS BETWEEN CURRENT ROW AND 2 FOLLOWING), 2 ) AS average_ride_distance, ROUND( AVG(ride_duration) OVER (ROWS BETWEEN CURRENT ROW AND 2 FOLLOWING), 2 ) AS average_ride_duration FROM Ride ORDER BY month LIMIT 10;""").df()

Complexity

The time complexity is O(n log n) (typical). The space complexity is O(n).

Edge Cases and Pitfalls

Watch for boundary values, empty inputs, and duplicate values where applicable. If the problem involves ordering or constraints, confirm the invariant is preserved at every step.

Summary

This Python solution focuses on the essential structure of the problem and keeps the implementation interview-friendly while meeting the constraints.


Ace your next coding interview

We're here to help you ace your next coding interview.

Subscribe
Stealth Interview
© 2026 Stealth Interview®Stealth Interview is a registered trademark. All rights reserved.
Product
  • Blog
  • Pricing
Company
  • Terms of Service
  • Privacy Policy