Upload 185

Author: ggeerraarrdd

README.md

@@ -1,6 +1,6 @@
 <!-- markdownlint-disable MD041 -->
 [![eevveerryyddaayy release](https://img.shields.io/badge/eevveerryyddaayy-v1.3.0-blue.svg)](https://github.com/ggeerraarrdd/eevveerryyddaayy/)
-[![Solved](https://img.shields.io/badge/solved-184-green.svg)](#index)
+[![Solved](https://img.shields.io/badge/solved-185-green.svg)](#index)
 <!-- markdownlint-enable MD041 -->
 
 # SQL Everyday
@@ -218,6 +218,7 @@ Because this project necessitated a framework to enable consistent daily practic
 | 182   | [Low-Quality Problems](https://leetcode.com/problems/low-quality-problems/description/)                                                                           | [Solution](solutions/182_low_quality_problems.md)                                       | LeetCode    | Easy         |                                                                     |
 | 183   | [Product Sales Analysis II](https://leetcode.com/problems/product-sales-analysis-ii/description/)                                                                 | [Solution](solutions/183_product_sales_analysis_ii.md)                                  | LeetCode    | Easy         |                                                                     |
 | 184   | [Project Employees II](https://leetcode.com/problems/project-employees-ii/description/)                                                                           | [Solution](solutions/184_project_employees_ii.md)                                       | LeetCode    | Easy         | Window function w/ `GROUP BY`                                       |
+| 185   | [Sales Analysis I](https://leetcode.com/problems/sales-analysis-i/description/)                                                                                   | [Solution](solutions/185_sales_analysis_i.md)                                           | LeetCode    | Easy         |                                                                     |
 <!-- Index End - WARNING: Do not delete or modify this markdown comment. -->
 <!--- cSpell:enable --->
 

solutions/185_sales_analysis_i.md

@@ -0,0 +1,78 @@
+# SQL Everyday \#185
+
+## Sales Analysis I
+
+Site: LeetCode\
+Difficulty per Site: Easy
+
+## Problem
+
+Write a solution that reports the best **seller** by total sales price, If there is a tie, report them all.
+
+Return the resulting table in **any order**. [[Full Description](https://leetcode.com/problems/sales-analysis-i/description/)]
+
+## Submitted Solution
+
+```sql
+-- Submitted Solution
+WITH cte AS (
+    SELECT
+        seller_id
+        ,RANK() OVER (ORDER BY SUM(price) DESC) AS rank_total
+    FROM Sales
+    GROUP BY seller_id
+)
+SELECT
+    seller_id
+FROM cte
+WHERE rank_total = 1
+;
+```
+
+## Site Solution
+
+```sql
+-- LeetCode Solution 
+WITH aggregated_sales AS (
+  SELECT 
+    seller_id, 
+    SUM(price) AS total_price 
+  FROM 
+    Sales 
+  GROUP BY 
+    seller_id
+) 
+SELECT 
+  seller_id 
+FROM 
+  aggregated_sales 
+WHERE 
+  total_price = (
+    SELECT 
+      MAX(total_price) 
+    FROM 
+      aggregated_sales
+  );
+
+-- Code Author: Brian
+-- https://leetcode.com/problems/sales-analysis-i/solutions/311519/mysql-solution
+SELECT seller_id
+FROM Sales
+GROUP BY seller_id
+HAVING SUM(PRICE) >= all (
+    SELECT SUM(PRICE)
+    FROM Sales
+    GROUP BY seller_id
+)
+```
+
+## Notes
+
+TBD
+
+## NB
+
+TBD
+
+Go to [Index](../?tab=readme-ov-file#index)\
+Go to [Overview](../?tab=readme-ov-file)