Upload 200

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-199-green.svg)](#index)
+[![Solved](https://img.shields.io/badge/solved-200-green.svg)](#index)
 <!-- markdownlint-enable MD041 -->
 
 # SQL Everyday
@@ -233,6 +233,7 @@ Because this project necessitated a framework to enable consistent daily practic
 | 197   | [Get Highest Answer Rate Question](https://leetcode.com/problems/get-highest-answer-rate-question/)                                                               | [Solution](solutions/197_get_highest_answer_rate_question.md)                           | LeetCode    | Medium       |                                                                     |
 | 198   | [Count Student Number in Departments](https://leetcode.com/problems/count-student-number-in-departments/description/)                                             | [Solution](solutions/198_count_student_number_in_departments.md)                        | LeetCode    | Medium       |                                                                     |
 | 199   | [Tree Node](https://leetcode.com/problems/tree-node/description/)                                                                                                 | [Solution](solutions/199_tree_node.md)                                                  | LeetCode    | Medium       |                                                                     |
+| 200   | [Shortest Distance in a Plane](https://leetcode.com/problems/shortest-distance-in-a-plane/description/)                                                           | [Solution](solutions/200_shortest_distance_in_a_plane.md)                               | LeetCode    | Medium       | `CROSS JOIN`                                                        |
 <!-- Index End - WARNING: Do not delete or modify this markdown comment. -->
 <!--- cSpell:enable --->
 

solutions/200_shortest_distance_in_a_plane.md

@@ -0,0 +1,69 @@
+# SQL Everyday \#200
+
+## Shortest Distance in a Plane
+
+Site: LeetCode\
+Difficulty per Site: Medium
+
+## Problem
+
+The distance between two points `p1(x1, y1)` and `p2(x2, y2)` is `sqrt((x2 - x1)2 + (y2 - y1)2)`.
+
+Write a solution to report the shortest distance between any two points from the `Point2D` table. Round the distance to **two decimal points**. [[Full Description](https://leetcode.com/problems/shortest-distance-in-a-plane/description/)]
+
+## Submitted Solution
+
+```sql
+-- Submitted Solution
+WITH cte AS (
+    SELECT
+        -- p1.x AS x_1
+        -- ,p1.y AS y_1
+        -- ,p2.x AS x_2
+        -- ,p2.y AS y_2
+        ROUND(SQRT( (p2.x - p1.x)^2 + (p2.y - p1.y)^2 )::numeric, 2) AS distances
+    FROM Point2D as p1
+    CROSS JOIN Point2D AS p2
+)
+SELECT
+    MIN(distances) AS shortest
+FROM cte
+WHERE distances > 0
+;
+```
+
+## Site Solution
+
+```sql
+-- LeetCode Solution 
+-- Approach 1: Using SQRT, POW() functions and math knowledge
+ELECT
+    ROUND(SQRT(MIN((POW(p1.x - p2.x, 2) + POW(p1.y - p2.y, 2)))), 2) AS shortest
+FROM
+    point_2d p1
+        JOIN
+    point_2d p2 ON p1.x != p2.x OR p1.y != p2.y
+;
+
+-- Approach 2: Optimize to avoid reduplicate calculations
+SELECT
+    ROUND(SQRT(MIN((POW(p1.x - p2.x, 2) + POW(p1.y - p2.y, 2)))),2) AS shortest
+FROM
+    point_2d p1
+        JOIN
+    point_2d p2 ON (p1.x <= p2.x AND p1.y < p2.y)
+        OR (p1.x <= p2.x AND p1.y > p2.y)
+        OR (p1.x < p2.x AND p1.y = p2.y)
+;
+```
+
+## Notes
+
+TBD
+
+## NB
+
+`CROSS JOIN`
+
+Go to [Index](../?tab=readme-ov-file#index)\
+Go to [Overview](../?tab=readme-ov-file)