Add 662 and intuit screen

Author: CharryWu

2024/intuit/screen.py

@@ -0,0 +1,10 @@
+# Leetcode 1. Two Sum
+# Follow up: 167. Two Sum II - Input Array Is Sorted
+
+# Resume deepdive
+
+# What's the difference between "==" and "==="?
+# React vs. Vue
+# How to share states between two components? Promote state to parent component, useContext/useReducer
+# How many React hooks do you know?
+# What does useMemo hook do?

2024/tiktok/July-interview.py

@@ -1,7 +1,8 @@
 
 
-# There are N buckets of apples. We would like to collect K apples from a row of continuous buckets.
-#  Write a function that returns the first buckets combo that would fulfil the requirement.
+# There are N buckets of apples. Each bucket contains a certain amount of apples designated by an integer buckets[i].
+# We would like to collect K apples from a row of continuous buckets.
+# Write a function that returns the first buckets combo that would fulfil the requirement.
 #  If there is no valid buckets, return []
 # Example 1:
 # Apples in buckets: [2, 3, 4, 5, 6, 2, 3]
@@ -48,7 +49,7 @@ def solution(k, buckets):
 # How to implement a triangle down arrow CSS? Use border
 # What is the box model in CSS?
 # Use JS to sort a list of version number: ["1.21.0","1.2.1","1.2.0","1.1.1","1.1.0","1.0.1","1.0.0"]. The version number could contain invalid characters
-
+# Generate Subset
 # Final round (HM)
 class Solution:
     def dailyTemperatures(self, temperatures: List[int]) -> List[int]:

binary-tree/traversal-preorder-inorder-postorder/662. Maximum Width of Binary Tree.py

@@ -0,0 +1,35 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def widthOfBinaryTree(self, root: Optional[TreeNode]) -> int:
+        """
+        Using recursive dfs method, label each node using heap index (so that null node still occupies one position)
+        Have a global hashmap storing level => (leftmost pos, rightmost pos)
+        result is max(rightmost - leftmost) + 1, since the level width includes both leftmost node and rightmost node
+        e.g.
+        1  <-- root
+        2 3  <-- second level
+        4 5 6 7  <-- third level
+        """
+        levelinfo = {}
+        res = float('-inf')
+
+        def dfs(node, level, pos):
+            nonlocal res, levelinfo
+            if not node:
+                return
+            if level not in levelinfo:
+                levelinfo[level] = [pos, pos]
+
+            levelinfo[level][0] = min(levelinfo[level][0], pos)
+            levelinfo[level][1] = max(levelinfo[level][1], pos)
+            res = max(res, levelinfo[level][1]-levelinfo[level][0])
+
+            dfs(node.left, level+1, pos*2+1)
+            dfs(node.right, level+1, pos*2+2)
+        dfs(root, 0, 0)
+        return res+1