Added 2673

Author: trung-hn

Readme.md

@@ -695,6 +695,7 @@
 | 2487 | [Remove Nodes From Linked List](src/2487.remove-nodes-from-linked-list.py)                                                                                           | Medium | O(N)                  | O(N)           | Linked List, Stack, Recursion, Monotonic Stack                                                       |                                         |           |
 | 2498 | [Frog Jump II](src/2498.frog-jump-ii.py)                                                                                                                             | Medium | O(N)                  | O(1)           | Array, Binary Search, Greedy                                                                         |                                         |           |
 | 2517 | [Maximum Tastiness of Candy Basket](src/2517.maximum-tastiness-of-candy-basket.py)                                                                                   | Medium | O(NlogN)              | O(1)           | Array, Binary Search, Sorting                                                                        |                                         |           |
+| 2673 | [Make Costs of Paths Equal in a Binary Tree](src/2673.make-costs-of-paths-equal-in-a-binary-tree.py)                                                                 | Medium | O(N)                  | O(logN)        | Array, Dynamic Programming, Greedy, Tree, Binary Tree                                                |                                         |           |
 | 2958 | [Length of Longest Subarray With at Most K Frequency](src/2958.length-of-longest-subarray-with-at-most-k-frequency.py)                                               | Medium | O(N)                  | O(N)           | Array, Hash Table, Sliding Window                                                                    |                                         |           |
 | 2962 | [Count Subarrays Where Max Element Appears at Least K Times](src/2962.count-subarrays-where-max-element-appears-at-least-k-times.py)                                 | Medium | O(N)                  | O(N)           | Array, Sliding Window                                                                                |                                         |           |
 | 2966 | [Divide Array Into Arrays With Max Difference](src/2966.divide-array-into-arrays-with-max-difference.py)                                                             | Medium | O(NlogN)              | O(N)           | Array, Greedy, Sorting                                                                               |                                         |           |

src/2673.make-costs-of-paths-equal-in-a-binary-tree.py

@@ -0,0 +1,27 @@
+#
+# @lc app=leetcode id=2673 lang=python3
+#
+# [2673] Make Costs of Paths Equal in a Binary Tree
+#
+
+
+# @lc code=start
+# TAGS: Array, Dynamic Programming, Greedy, Tree, Binary Tree
+class Solution:
+    # Time: O(N). Space: O(logN)
+    def minIncrements(self, n: int, cost: List[int]) -> int:
+        self.counter = 0
+
+        def dfs(node=1):
+            if node > len(cost):
+                return 0
+            left = dfs(node * 2)
+            right = dfs(node * 2 + 1)
+            self.counter += abs(left - right)
+            return max(left, right) + cost[node - 1]
+
+        dfs()
+        return self.counter
+
+
+# @lc code=end