1167_Minimum_Cost_to_Connect_Sticks

Author: Partho Biswas

README.md

@@ -322,6 +322,7 @@ I have solved quite a number of problems from several topics. See the below tabl
 |15| **[378. Kth Smallest Element in a Sorted Matrix](https://tinyurl.com/shz4289)** | [Python](https://tinyurl.com/wu6rdaw/378_Kth_Smallest_Element_in_a_Sorted_Matrix.py)| [educative.io](https://tinyurl.com/scbjgjd) | Hard | 📌 TODO: Check again the Binary Search approach. Very important |
 |16| **[632. Smallest Range Covering Elements from K Lists](https://tinyurl.com/v3fshwo)** | [Python](https://tinyurl.com/wu6rdaw/632_Smallest_Range_Covering_Elements_from_K_Lists.py)| [educative.io](https://tinyurl.com/ubfua7f) | Hard | 📌 TODO: Check again. Very important |
 |17| **[846. Hand of Straights](https://tinyurl.com/y2hfqqsv)** | [Python](https://tinyurl.com/wu6rdaw/846_Hand_of_Straights.py)| **[Art 1](https://tinyurl.com/w8pkf55)** | Medium | 📌 TODO: Check again. Very important |
+|18| **[1167. Minimum Cost to Connect Sticks](https://tinyurl.com/y8s5s8pq)** | [Python](https://tinyurl.com/wu6rdaw/1167_Minimum_Cost_to_Connect_Sticks.py)|  | Medium |  |
 
 </p>
 </details>

leetcode.com/python/1167_Minimum_Cost_to_Connect_Sticks.py

@@ -0,0 +1,40 @@
+import heapq
+
+class Solution(object):
+    def connectSticks(self, sticks):
+        """
+        :type sticks: List[int]
+        :rtype: int
+        """
+        sticksHeap = list(sticks)
+        heapq.heapify(sticksHeap)
+        minCost = 0
+        while len(sticksHeap) > 1:
+            firstNum = heapq.heappop(sticksHeap)
+            secondNum = heapq.heappop(sticksHeap)
+            minCost += firstNum
+            minCost += secondNum
+            sumNum = firstNum + secondNum
+            heapq.heappush(sticksHeap, sumNum)
+        return minCost
+
+
+"""
+Example 1
+sticks = [2,4,3]
+
+Step 1:
+cost -> 2+3 = 5
+result -> [5,4]
+
+Step 2:
+cost -> 5+4 = 9
+result -> [9]
+
+FINAL COST =5 + 9 = 14
+
+2,4=6
+>6,3=9
+
+6+9=15
+"""