More answers

Author: guanquann

backend/question-service/src/scripts/seed.ts

@@ -54,7 +54,7 @@ export async function seedQuestions() {
       description:
         "Given a string `s`, find the length of the **longest substring** without repeating characters.",
       complexity: "Medium",
-      category: ["Strings"],
+      category: ["Strings", "Algorithms"],
       testcaseInputFileUrl: "./src/scripts/testcases/longestSubstringInput.txt",
       testcaseOutputFileUrl:
         "./src/scripts/testcases/longestSubstringOutput.txt",
@@ -151,6 +151,45 @@ export async function seedQuestions() {
       javaTemplate: `import java.util.Scanner;\n\npublic class Main {\n    // Please do not modify the main function\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        int x = scanner.nextInt();\n        System.out.println(solution(x));\n    }\n\n    // Write your code here\n    public static int solution(int x) {\n        // Implement your solution here\n        return 0;\n    }\n}`,
       cTemplate: `#include <stdio.h>\n#include <limits.h>\n\n// Function to implement\nint solution(int x) {\n    // Implement your solution here\n    return 0;\n}\n\n// Please do not modify the main function\nint main() {\n    int x;\n    scanf("%d", &x);\n    printf("%d\\n", solution(x));\n    return 0;\n}`,
     },
+    {
+      title: "Add Binary",
+      description:
+        "Given two binary strings `a` and `b`, return their sum as a binary string.\n\n" +
+        "Each test case consists of two lines:\n" +
+        "- The first line contains the binary string `a`.\n" +
+        "- The second line contains the binary string `b`.\n\n" +
+        "### Explanation\n" +
+        '- **Test Case 1**: `a = "11"` and `b = "1"`, the sum is `"100"`.\n' +
+        '- **Test Case 2**: `a = "1010"` and `b = "1011"`, the sum is `"10101"`.',
+      complexity: "Easy",
+      category: ["Data Structures", "Strings"],
+      testcaseInputFileUrl: "./src/scripts/testcases/addBinaryInput.txt",
+      testcaseOutputFileUrl: "./src/scripts/testcases/addBinaryOutput.txt",
+      pythonTemplate: `# Please do not modify the main function\ndef main():\n\ta = input().strip()\n\tb = input().strip()\n\tprint(solution(a, b))\n\n\n# Write your code here\ndef solution(a, b):\n\t# Implement your solution here\n\treturn ""\n\n\nif __name__ == "__main__":\n\tmain()\n`,
+      javaTemplate: `import java.util.Scanner;\n\npublic class Main {\n    // Please do not modify the main function\n    public static void main(String[] args) {\n        Scanner scanner = new Scanner(System.in);\n        String a = scanner.nextLine().trim();\n        String b = scanner.nextLine().trim();\n        System.out.println(solution(a, b));\n    }\n\n    // Write your code here\n    public static String solution(String a, String b) {\n        // Implement your solution here\n        return "";\n    }\n}`,
+      cTemplate: `#include <stdio.h>\n#include <string.h>\n\n// Function to implement\nconst char* solution(const char* a, const char* b) {\n    // Implement your solution here\n    return "";\n}\n\n// Please do not modify the main function\nint main() {\n    char a[1000], b[1000];\n    fgets(a, sizeof(a), stdin);\n    fgets(b, sizeof(b), stdin);\n    // Remove newline from input if exists\n    a[strcspn(a, "\\n")] = 0;\n    b[strcspn(b, "\\n")] = 0;\n    printf("%s\\n", solution(a, b));\n    return 0;\n}`,
+    },
+    {
+      title: "Binary Tree Maximum Path Sum",
+      description:
+        "Given the `root` of a binary tree, return the **maximum path sum** of any **non-empty path**.\n\n" +
+        "A path in a binary tree is defined as a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them.\n" +
+        "A node can only appear once in the path, and the path does not necessarily need to pass through the root.\n\n" +
+        "### Explanation\n" +
+        "- ![image](https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg)\n" +
+        "- **Test Case 1**: Given the tree `[1, 2, 3]`, the maximum path sum is `6` (2 → 1 → 3).\n\n\n" +
+        "- ![image](https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg)\n" +
+        "- **Test Case 2**: Given the tree `[-10, 9, 20, null, null, 15, 7]`, the maximum path sum is `42` (15 → 20 → 7).",
+      complexity: "Hard",
+      category: ["Tree", "Dynamic Programming", "Recursion"],
+      testcaseInputFileUrl:
+        "./src/scripts/testcases/binaryTreeMaxPathSumInput.txt",
+      testcaseOutputFileUrl:
+        "./src/scripts/testcases/binaryTreeMaxPathSumOutput.txt",
+      pythonTemplate: `# Definition for a binary tree node.\nclass TreeNode:\n\tdef __init__(self, val=0, left=None, right=None):\n\t\tself.val = val\n\t\tself.left = left\n\t\tself.right = right\n\n# Please do not modify the main function\ndef main():\n\troot = deserialize(input().strip())\n\tprint(solution(root))\n\n\n# Write your code here\ndef solution(root):\n\t# Implement your solution here\n\treturn 0\n\n\n# Helper function to deserialize input\n\ndef deserialize(data):\n\t# Implement a function to build a tree from input\n\treturn None\n\n\nif __name__ == "__main__":\n\tmain()\n`,
+      javaTemplate: `import java.util.*;\n\nclass TreeNode {\n\tint val;\n\tTreeNode left;\n\tTreeNode right;\n\tTreeNode(int val) { this.val = val; }\n\tTreeNode(int val, TreeNode left, TreeNode right) {\n\t\tthis.val = val;\n\t\tthis.left = left;\n\t\tthis.right = right;\n\t}\n}\n\npublic class Main {\n\t// Please do not modify the main function\n\tpublic static void main(String[] args) {\n\t\tTreeNode root = deserialize(new Scanner(System.in).nextLine().trim());\n\t\tSystem.out.println(solution(root));\n\t}\n\n\t// Write your code here\n\tpublic static int solution(TreeNode root) {\n\t\t// Implement your solution here\n\t\treturn 0;\n\t}\n\n\t// Helper function to deserialize input\n\tpublic static TreeNode deserialize(String data) {\n\t\t// Implement a function to build a tree from input\n\t\treturn null;\n\t}\n}`,
+      cTemplate: `#include <stdio.h>\n#include <stdlib.h>\n\nstruct TreeNode {\n\tint val;\n\tstruct TreeNode *left;\n\tstruct TreeNode *right;\n};\n\n// Function to implement\nint solution(struct TreeNode* root) {\n\t// Implement your solution here\n\treturn 0;\n}\n\n// Please do not modify the main function\nint main() {\n\t// Implement tree deserialization if needed\n\treturn 0;\n}`,
+    },
   ];
 
   try {

backend/question-service/src/scripts/testcases/addBinary.py

@@ -0,0 +1,34 @@
+# Please do not modify the main function
+def main():
+    a = input().strip()
+    b = input().strip()
+    print(solution(a, b))
+
+
+# Write your code here
+def solution(a, b):
+    # Make sure a is the longer string
+    if len(b) > len(a):
+        a, b = b, a
+
+    # Initialize result and carry
+    result = []
+    carry = 0
+    b = b.zfill(len(a))  # Pad the shorter string with leading zeros
+
+    # Add binary numbers from the end to the start
+    for i in range(len(a) - 1, -1, -1):
+        sum = int(a[i]) + int(b[i]) + carry
+        result.append(str(sum % 2))  # Append the current binary digit
+        carry = sum // 2  # Calculate the carry
+
+    # If there’s a carry left after the final addition, add it
+    if carry:
+        result.append("1")
+
+    # Join and reverse result since we appended in reverse order
+    return "".join(result[::-1])
+
+
+if __name__ == "__main__":
+    main()

backend/question-service/src/scripts/testcases/addBinaryInput.txt

@@ -0,0 +1,5 @@
+11
+1
+
+1010
+1011

backend/question-service/src/scripts/testcases/addBinaryOutput.txt

@@ -0,0 +1,3 @@
+100
+
+10101

backend/question-service/src/scripts/testcases/binaryTreeMaxPathSum.py

@@ -0,0 +1,65 @@
+# 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
+
+
+# Please do not modify the main function
+def main():
+    root = deserialize(input().strip())
+    print(solution(root))
+
+
+# Write your code here
+def solution(root):
+    def max_gain(node):
+        nonlocal max_sum
+        if not node:
+            return 0
+
+        # Recursively calculate the maximum path sum of left and right subtrees
+        left_gain = max(max_gain(node.left), 0)  # Ignore negative paths
+        right_gain = max(max_gain(node.right), 0)  # Ignore negative paths
+
+        # Current node max path sum includes both left and right contributions
+        current_path_sum = node.val + left_gain + right_gain
+
+        # Update the maximum path sum found so far
+        max_sum = max(max_sum, current_path_sum)
+
+        # Return the max gain if we continue the same path with this node
+        return node.val + max(left_gain, right_gain)
+
+    max_sum = float("-inf")
+    max_gain(root)
+    return max_sum
+
+
+# Helper function to deserialize input in space-separated format
+def deserialize(data):
+    if not data:
+        return None
+
+    nodes = data.split()
+    root = TreeNode(int(nodes[0]))
+    queue = [root]
+    i = 1
+
+    while queue and i < len(nodes):
+        node = queue.pop(0)
+        if nodes[i] != "null":
+            node.left = TreeNode(int(nodes[i]))
+            queue.append(node.left)
+        i += 1
+        if i < len(nodes) and nodes[i] != "null":
+            node.right = TreeNode(int(nodes[i]))
+            queue.append(node.right)
+        i += 1
+
+    return root
+
+
+if __name__ == "__main__":
+    main()

backend/question-service/src/scripts/testcases/binaryTreeMaxPathSumInput.txt

@@ -0,0 +1,3 @@
+1 2 3
+
+-10 9 20 null null 15 7

backend/question-service/src/scripts/testcases/binaryTreeMaxPathSumOutput.txt

@@ -0,0 +1,3 @@
+6
+
+42