no message

Author: Partho Biswas

README.md

@@ -859,6 +859,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |03| [Find_Loop](algoexpert.io/questions/Find_Loop.md) | [Python](algoexpert.io/python/Find_Loop.py)|
 |04| [Reverse_Linked_List](algoexpert.io/questions/Reverse_Linked_List.md) | [Python](algoexpert.io/python/Reverse_Linked_List.py)|
 |05| [LRU_Cache](algoexpert.io/questions/LRU_Cache.md) | [Python](algoexpert.io/python/LRU_Cache.py)|
+|06| [Merge_Linked_List](algoexpert.io/questions/Merge_Linked_List.md) | [Python](algoexpert.io/python/Merge_Linked_List.py)|
 
 </p>
 </details>

algoexpert.io/python/Depth_First_Search.py

@@ -1,19 +1,16 @@
-
 class Node:
-
     def __init__(self, name):
         self.children = []
         self.name = name
 
-    def add_child(self, name):
+    def addChild(self, name):
         self.children.append(Node(name))
         return self
 
-    # O(v + e) time | O(v) space
-    def depth_first_search(self, array):
+    def depthFirstSearch(self, array):
         array.append(self.name)
         for child in self.children:
-            child.depth_first_search(array)
+            child.depthFirstSearch(array)
         return array
 
 

algoexpert.io/python/Merge_Linked_List.py

@@ -0,0 +1,26 @@
+# This is an input class. Do not edit.
+class LinkedList:
+    def __init__(self, value):
+        self.value = value
+        self.next = None
+
+
+def mergeLinkedLists(headOne, headTwo):
+    p1, p2 = headOne, headTwo
+    p1Prev = None
+    while p1 and p2:
+        if p1.value < p2.value:
+            p1Prev = p1
+            p1 = p1.next
+        else:
+            if p1Prev:
+                p1Prev.next = p2
+            p1Prev = p2
+            p2 = p2.next
+            p1Prev.next = p1
+    if not p1:
+        p1Prev.next = p2
+    return headOne if headOne.value < headTwo.value else headTwo
+
+
+

algoexpert.io/python/Min_Heap_Construction.py

@@ -2,7 +2,6 @@
 
 
 class MinHeap:
-
     def __init__(self, array):
         self.heap = self.build_heap(array)
 

algoexpert.io/python/Water_Area.py

@@ -17,4 +17,27 @@ def waterArea(heights):
         else:
             maxes[i] = 0
         rightMax = max(rightMax, height)
+    return sum(maxes)
+
+
+def waterArea(heights):
+    leftMaxHeights = [0 for _ in heights]
+    currentLeftMax = 0
+    for i in range(len(heights)):
+        height = heights[i]
+        leftMaxHeights[i] = currentLeftMax
+        currentLeftMax = max(currentLeftMax, height)
+
+    rightMaxHeights = [0 for _ in heights]
+    currentRightMax = 0
+    for i in reversed(range(len(heights))):
+        height = heights[i]
+        rightMaxHeights[i] = currentRightMax
+        currentRightMax = max(currentRightMax, height)
+
+    maxes = [0 for _ in heights]
+    for i in range(len(heights)):
+        minHeight = min(leftMaxHeights[i], rightMaxHeights[i])
+        if minHeight > heights[i]:
+            maxes[i] = minHeight - heights[i]
     return sum(maxes)