Complated daily question and addition mediums

Author: Zanger67

README.md

@@ -0,0 +1,8 @@
+class Solution:
+    def edgeScore(self, edges: List[int]) -> int:
+        nodeSums = defaultdict(int)
+
+        for i, targetEdge in enumerate(edges) :
+            nodeSums[targetEdge] += i
+
+        return max(nodeSums.keys(), key=lambda x : (nodeSums[x], -x))

my-submissions/m2374 v1 defaultdict.py

@@ -0,0 +1,8 @@
+class Solution:
+    def edgeScore(self, edges: List[int]) -> int:
+        nodeSums = [0] * len(edges)
+
+        for i, targetEdge in enumerate(edges) :
+            nodeSums[targetEdge] += i
+
+        return max([i for i in range(len(edges))], key=lambda x: (nodeSums[x], -x))

my-submissions/m2374 v2 array.py

@@ -0,0 +1,13 @@
+class Solution:
+    def edgeScore(self, edges: List[int]) -> int:
+        nodeSums = [0] * len(edges)
+
+        maxx = 0
+        indx = 0
+        for i, targetEdge in enumerate(edges) :
+            nodeSums[targetEdge] += i
+            if maxx < nodeSums[targetEdge] or (maxx == nodeSums[targetEdge] and indx > targetEdge):
+                maxx = nodeSums[targetEdge]
+                indx = targetEdge
+        
+        return indx

my-submissions/m2374 v3 one-pass max.py

@@ -0,0 +1,14 @@
+class Solution:
+    def frequencySort(self, s: str) -> str:
+        cnt = Counter(s)
+
+        output = [(-1 * freq, val) for val, freq in cnt.items()]
+        heapq.heapify(output)
+
+        actualOutput = []
+
+        while output :
+            freq, val = heapq.heappop(output)
+            actualOutput.extend([val] * (freq * -1))
+        
+        return ''.join(actualOutput)

my-submissions/m451.py

@@ -0,0 +1,16 @@
+class Solution:
+    def maxProfitAssignment(self, difficulty: List[int], profit: List[int], worker: List[int]) -> int:
+        heap = [(-profit[i], difficulty[i]) for i in range(len(difficulty))]
+        heapq.heapify(heap)
+
+        worker.sort()
+
+        output = 0
+        while worker and heap:
+            if worker[-1] >= heap[0][1] :
+                output += -heap[0][0]
+                worker.pop()
+            else :
+                heapq.heappop(heap)
+
+        return output