Merge pull request #100 from guanquann/questionSeed

Seed question with test cases and code template + bug fix

Author: feliciagan

backend/code-execution-service/src/controllers/codeExecutionControllers.ts

@@ -79,11 +79,16 @@ export const executeCode = async (req: Request, res: Response) => {
           stdout = "";
         }
 
-        // Extract the last line as the result value
-        // and the rest as stdout
-        const lines = stdout.trim().split("\n");
-        const resultValue = lines.pop() || "";
-        stdout = lines.join("\n");
+        let resultValue = "";
+        if (restofResult.stderr) {
+          resultValue = "";
+          stdout = stdout.trim();
+        } else {
+          // Extract the last line as the result value and the rest as stdout only if there is no error
+          const lines = stdout.trim().split("\n");
+          resultValue = lines.pop() || "";
+          stdout = lines.join("\n");
+        }
 
         return {
           ...restofResult,

backend/question-service/src/scripts/README.md

@@ -0,0 +1,6 @@
+# Question Service Seed
+
+Questions, test cases, code templates, and solutions are generated using ChatGPT.
+
+Disclaimer: They may not be fully accurate.
+

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

@@ -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/addBinary.py

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

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

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

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

@@ -0,0 +1,55 @@
+# 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):
+    result = []
+
+    def inorder(node):
+        if not node:
+            return
+        inorder(node.left)
+        result.append(node.val)
+        inorder(node.right)
+
+    inorder(root)
+    return result
+
+
+# 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/binaryTreeInorderTraversal.py

@@ -0,0 +1,3 @@
+1 null 2 3
+
+1 2 3 4 5 null 8 null null 6 7 9

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

@@ -0,0 +1,3 @@
+1 3 2
+
+4 2 6 5 7 1 3 9 8

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

@@ -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()