#302: add description of problem

Author: Hamid Gasmi

09-problems/lc_787_cheapest_flights_within_k_stops.py

@@ -0,0 +1,37 @@
+"""
+    1. Problem Summary / Clarifications / TDD:
+        Directed Graph(V: { Cities }, E: { Flights }, W: { Prices } )
+        K: Number max stops
+        Question: Return price of cheapest flight from city "SRC" to city "DST" with at most K stops
+
+        With Graph below, SRC: C0, DST: C2
+        Expected Results: 
+
+           2           1
+       C3 ___   C2 <----- 
+        ^    \   ^       |
+      2 |     \  | 5      --C4
+       C0 ---_> C1-----------^
+            5          1
+                                                  5       1       1
+        Expected result for K = 3: 7 (3 Stops: C0 ---> C1 ---> C4 ---> C2)
+
+                                                  2      2       1       1
+        Expected result for K = 4: 6 (4 Stops: C0 --> C3 ---> C1 ---> C4 ---> C2)
+
+    2. Intuition:
+        - Naive:
+        - We could do better:
+
+    3. Implementation
+    4. Tests:
+    5. Complexity Analysis:
+       Time Complexity:
+       Space Compexity:
+
+"""
+
+class Solution:
+    
+    def find_cheapest_price(self, cities_count: int, flights: List[List[int]], src: int, dst: int, max_stops_count: int) -> int:
+        pass