LeetCode 1321: Restaurant Growth Solution
Master LeetCode problem 1321 (Restaurant Growth), 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.
1321. Restaurant Growth
Problem Explanation
Explanation:
To solve this problem, we need to calculate the moving average of the amount paid by customers in a seven-day window for each date. We can achieve this by using a sliding window approach.
- We will iterate over the Customer table ordered by visited_on.
- For each customer visit, we will add the amount to the sum of the current window.
- If the window size exceeds 7 days, we will subtract the amount from the customer visit that falls outside the 7-day window.
- We will calculate the moving average by dividing the sum of the window by 7.
- We will round the average to two decimal places.
Time Complexity: O(n) where n is the number of customer visits. Space Complexity: O(1) since we are using a constant amount of extra space.
:
Solution Code
# Write your Java solution hereTry It Yourself
Loading code editor...
Related LeetCode Problems
Frequently Asked Questions
How to solve LeetCode 1321 (Restaurant Growth)?
This page provides optimized solutions for LeetCode problem 1321 (Restaurant Growth) 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 1321 (Restaurant Growth)?
The time complexity for LeetCode 1321 (Restaurant Growth) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.
Can I run code for LeetCode 1321 on DevExCode?
Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1321 in Java, C++, or Python.