1276_Number_of_Burgers_with_No_Waste_of_Ingredients

Author: partho-maple

README.md

@@ -835,6 +835,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |12| **[398. Random Pick Index](https://tinyurl.com/ydf3t2ke)** | [Python](https://tinyurl.com/wu6rdaw/398_Random_Pick_Index.py)| **[Video 1](https://tinyurl.com/ycjk3gk6)**,  [Art 1](https://tinyurl.com/ych82hfp), [Art 2](https://tinyurl.com/y8hogyty), [Art 3](https://tinyurl.com/y7slu8x2), [Art 4](https://tinyurl.com/y896sqmt), [Art 5](https://tinyurl.com/yafb3esf) | Medium (Really!!??) | 📌 **Reservoir sampling**, What's the point of asking this into an interview!!?? |
 |13| **[319. Bulb Switcher](https://tinyurl.com/ycygg2ju)** | [Python](https://tinyurl.com/wu6rdaw/319_Bulb_Switcher.py)| [Art 1](https://tinyurl.com/y886rzfe), [Art 2](https://tinyurl.com/y9n7vo2x), [Art 3](https://tinyurl.com/ya3fookw) | Medium (Really!!??) | Are you fucking kidding me!! We are programmers, not math wizard. |
 |14| **[1344. Angle Between Hands of a Clock](https://tinyurl.com/yy3g8mg6)** | [Python](https://tinyurl.com/wu6rdaw/1344_Angle_Between_Hands_of_a_Clock.py), [Swift](https://tinyurl.com/wuja3c4/1344_Angle_Between_Hands_of_a_Clock.swift)| --- | Medium | FB really likes to ask tricky question. |
+|15| **[1276. Number of Burgers with No Waste of Ingredients](https://tinyurl.com/y4dl7mne)** | [Python](https://tinyurl.com/wu6rdaw/1276_Number_of_Burgers_with_No_Waste_of_Ingredients.py), [Swift](https://tinyurl.com/wuja3c4/1276_Number_of_Burgers_with_No_Waste_of_Ingredients.swift)| [Art 1](https://tinyurl.com/y2u668aa), [Art 2](https://tinyurl.com/y2u9nvre), [Art 3](https://tinyurl.com/yxdzbp9s) | Medium | Pure math |
 
 </p>
 </details>

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/1276_Number_of_Burgers_with_No_Waste_of_Ingredients.swift

@@ -0,0 +1,30 @@
+// TLE
+ class Solution {
+     func numOfBurgers(_ tomatoSlices: Int, _ cheeseSlices: Int) -> [Int] {
+         let maxJumbo = min(tomatoSlices/4, cheeseSlices)
+         for jumboCount in 0...maxJumbo {
+             let remainingTomatos = tomatoSlices - jumboCount*4
+             let remainingCheese = cheeseSlices - jumboCount*1
+             if remainingTomatos % 2 == 0 && remainingTomatos / 2 == remainingCheese {
+                 return [jumboCount, remainingTomatos / 2]
+             }
+         }
+         return []
+     }
+ }
+
+class Solution {
+    func numOfBurgers(_ tomatoSlices: Int, _ cheeseSlices: Int) -> [Int] {
+        if tomatoSlices == 0 && cheeseSlices == 0 {
+            return [0,0]
+        }
+        
+        let small = ((4 * cheeseSlices) - tomatoSlices)/2
+        let jumbo = cheeseSlices - small
+        if small > 0 && jumbo > 0 {
+            return [jumbo, small]
+        } else {
+            return []
+        }
+    }
+}