Add seed qns, fix minor bug in code exe

Author: guanquann

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/seed.ts

@@ -1,3 +1,5 @@
+/* eslint-disable */
+
 import { exit } from "process";
 import connectDB from "../config/db";
 import Question from "../models/Question";
@@ -38,7 +40,7 @@ export async function seedQuestions() {
     {
       title: "Two Sum",
       description:
-        "Given an array of integers `nums` and an integer `target`, return indices of the two numbers in a list such that they add up to `target`. You may assume that each input would have **exactly one solution**, and you may not use the same element twice. You can return the answer in any order.",
+        "Given an array of integers `nums` (line 1) and an integer `target` (line 2), return indices of the two numbers in a list such that they add up to `target`. You may assume that each input would have **exactly one solution**, and you may not use the same element twice. The list should be returned in sorted order.",
       complexity: "Easy",
       category: ["Arrays"],
       testcaseInputFileUrl: "./src/scripts/testcases/twoSumInput.txt",
@@ -67,16 +69,7 @@ export async function seedQuestions() {
         "Each test case consists of two lines:\n" +
         "- The first line contains the elements of `nums1`, a sorted array of integers.\n" +
         "- The second line contains the elements of `nums2`, another sorted array of integers.\n\n" +
-        "Test cases are separated by a double newline. For example, an input file with two test cases could look like:\n" +
-        "```\n" +
-        "1 3\n2\n\n1 2\n3 4\n" +
-        "```\n\n" +
-        "### Output\n" +
-        "For each test case, output a single line containing the median of the two sorted arrays. Results should be separated by a double newline.\n\n" +
-        "The corresponding output file for the example above would be:\n" +
-        "```\n" +
-        "2.0\n\n2.5\n" +
-        "```\n\n" +
+        "For each test case, output a single line containing the median of the two sorted arrays.\n\n" +
         "### Explanation\n" +
         "- **Test Case 1**: `nums1 = [1, 3]` and `nums2 = [2]` have a combined sorted array `[1, 2, 3]`, with median `2.0`.\n" +
         "- **Test Case 2**: `nums1 = [1, 2]` and `nums2 = [3, 4]` have a combined sorted array `[1, 2, 3, 4]`, with median `2.5`.",
@@ -91,6 +84,24 @@ export async function seedQuestions() {
       javaTemplate: `import java.util.*;\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        List<Integer> nums1 = new ArrayList<>();\n        List<Integer> nums2 = new ArrayList<>();\n        boolean isNums2 = false;\n        while (scanner.hasNextLine()) {\n            String line = scanner.nextLine().trim();\n            if (line.isEmpty()) {\n                isNums2 = !isNums2;\n                continue;\n            }\n            List<Integer> nums = isNums2 ? nums2 : nums1;\n            for (String num : line.split(" ")) {\n                nums.add(Integer.parseInt(num));\n            }\n        }\n        System.out.println(solution(nums1.stream().mapToInt(i -> i).toArray(), nums2.stream().mapToInt(i -> i).toArray()));\n    }\n\n    // Write your code here\n    public static double solution(int[] nums1, int[] nums2) {\n        // Implement your solution here\n        return 0.0;\n    }\n}`,
       cTemplate: `#include <stdio.h>\n#include <stdlib.h>\n\n// Function to implement\ndouble solution(int* nums1, int nums1Size, int* nums2, int nums2Size) {\n    // Implement your solution here\n    return 0.0;\n}\n\n// Please do not modify the main function\nint main() {\n    int nums1[100], nums2[100], n1 = 0, n2 = 0;\n    char line[1000];\n    while (fgets(line, sizeof(line), stdin)) {\n        if (line[0] == '\\n') break;\n        char* token = strtok(line, \" \");\n        while (token) {\n            nums1[n1++] = atoi(token);\n            token = strtok(NULL, \" \");\n        }\n    }\n    while (fgets(line, sizeof(line), stdin)) {\n        if (line[0] == '\\n') break;\n        char* token = strtok(line, \" \");\n        while (token) {\n            nums2[n2++] = atoi(token);\n            token = strtok(NULL, \" \");\n        }\n    }\n    printf(\"%.1f\\n\", solution(nums1, n1, nums2, n2));\n    return 0;\n}`,
     },
+    {
+      title: "Longest Palindromic Substring",
+      description:
+        "Given a string `s`, return the **longest palindromic substring** in `s`.\n\n" +
+        "For each test case, output a single line containing the longest palindromic substring in `s`.\n\n" +
+        "### Explanation\n" +
+        "- **Test Case 1**: For input `babad`, one of the longest palindromic substrings is `bab`.\n" +
+        "- **Test Case 2**: For input `cbbd`, the longest palindromic substring is `bb`.",
+      complexity: "Medium",
+      category: ["Strings", "Dynamic Programming"],
+      testcaseInputFileUrl:
+        "./src/scripts/testcases/longestPalindromicSubstringInput.txt",
+      testcaseOutputFileUrl:
+        "./src/scripts/testcases/longestPalindromicSubstringOutput.txt",
+      pythonTemplate: `# Please do not modify the main function\ndef main():\n\ts = input().strip()\n\tprint(solution(s))\n\n\n# Write your code here\ndef solution(s):\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 s = scanner.nextLine().trim();\n        System.out.println(solution(s));\n    }\n\n    // Write your code here\n    public static String solution(String s) {\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* s) {\n    // Implement your solution here\n    return "";\n}\n\n// Please do not modify the main function\nint main() {\n    char s[1000];\n    fgets(s, sizeof(s), stdin);\n    s[strcspn(s, "\\n")] = 0; // Remove newline\n    printf("%s\\n", solution(s));\n    return 0;\n}`,
+    },
   ];
 
   try {

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

@@ -0,0 +1,3 @@
+babad
+
+cbbd

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

@@ -0,0 +1,3 @@
+bab
+
+bb

frontend/src/contexts/CollabContext.tsx

@@ -83,8 +83,8 @@ const CollabProvider: React.FC<{ children?: React.ReactNode }> = (props) => {
       for (let i = 0; i < res.data.data.length; i++) {
         if (!res.data.data[i].isMatch) {
           isMatch = false;
+          break;
         }
-        break;
       }
 
       if (isMatch) {