More questions and answers

Author: guanquann

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

@@ -130,6 +130,27 @@ 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        String s = scanner.nextLine().trim();\n        int numRows = Integer.parseInt(scanner.nextLine().trim());\n        System.out.println(solution(s, numRows));\n    }\n\n    // Write your code here\n    public static String solution(String s, int numRows) {\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, int numRows) {\n    // Implement your solution here\n    return "";\n}\n\n// Please do not modify the main function\nint main() {\n    char s[1000];\n    int numRows;\n    fgets(s, sizeof(s), stdin);\n    s[strcspn(s, "\\n")] = 0; // Remove newline\n    scanf("%d", &numRows);\n    printf("%s\\n", solution(s, numRows));\n    return 0;\n}`,
     },
+    {
+      title: "Reverse Integer",
+      description:
+        "Given a signed 32-bit integer `x`, return `x` with its digits reversed.\n\n" +
+        "If reversing `x` causes the value to go outside the signed 32-bit integer range `[-2^31, 2^31 - 1]`, then return 0.\n\n" +
+        "### Input\n" +
+        "Each test case consists of a single integer `x`.\n\n" +
+        "### Output\n" +
+        "For each test case, output a single integer which is the reversed integer, or 0 if the result overflows.\n\n" +
+        "### Explanation\n" +
+        "- **Test Case 1**: `x = 123` reverses to `321`.\n" +
+        "- **Test Case 2**: `x = -123` reverses to `-321`.\n" +
+        "- **Test Case 3**: `x = 120` reverses to `21`.\n",
+      complexity: "Easy",
+      category: ["Strings"],
+      testcaseInputFileUrl: "./src/scripts/testcases/reverseIntegerInput.txt",
+      testcaseOutputFileUrl: "./src/scripts/testcases/reverseIntegerOutput.txt",
+      pythonTemplate: `# Please do not modify the main function\ndef main():\n\tx = int(input().strip())\n\tprint(solution(x))\n\n\n# Write your code here\ndef solution(x):\n\t# Implement your solution here\n\treturn 0\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        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}`,
+    },
   ];
 
   try {

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

@@ -0,0 +1,34 @@
+# Please do not modify the main function
+def main():
+    s = input().strip()
+    print(solution(s))
+
+
+# Write your code here
+def solution(s):
+    # Helper function to expand around the center and find palindromic substrings
+    def expand_around_center(left, right):
+        while left >= 0 and right < len(s) and s[left] == s[right]:
+            left -= 1
+            right += 1
+        # Return the longest palindrome substring from the current center
+        return s[left + 1 : right]
+
+    longest_palindrome = ""
+
+    for i in range(len(s)):
+        # Check for odd-length palindromes
+        odd_palindrome = expand_around_center(i, i)
+        # Check for even-length palindromes
+        even_palindrome = expand_around_center(i, i + 1)
+
+        # Update the longest palindrome if a longer one is found
+        longest_palindrome = max(
+            longest_palindrome, odd_palindrome, even_palindrome, key=len
+        )
+
+    return longest_palindrome
+
+
+if __name__ == "__main__":
+    main()

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

@@ -0,0 +1,26 @@
+# Please do not modify the main function
+def main():
+    s = input().strip()
+    print(solution(s))
+
+
+# Write your code here
+def solution(s):
+    char_map = {}
+    max_len = 0
+    start = 0
+
+    for i, char in enumerate(s):
+        # If the character is already in the substring, update the start position
+        if char in char_map and char_map[char] >= start:
+            start = char_map[char] + 1
+        # Update the character's latest position
+        char_map[char] = i
+        # Update the max length if the current substring length is greater
+        max_len = max(max_len, i - start + 1)
+
+    return max_len
+
+
+if __name__ == "__main__":
+    main()

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

@@ -0,0 +1,27 @@
+# Please do not modify the main function
+def main():
+    import sys
+
+    input = sys.stdin.read().strip().split("\n\n")
+    for case in input:
+        lines = case.split("\n")
+        nums1 = list(map(int, lines[0].split()))
+        nums2 = list(map(int, lines[1].split()))
+        print(f"{solution(nums1, nums2):.1f}")
+
+
+# Write your code here
+def solution(nums1, nums2):
+    # Merge the two sorted arrays
+    merged = sorted(nums1 + nums2)
+    n = len(merged)
+
+    # Calculate the median
+    if n % 2 == 1:  # Odd number of elements
+        return merged[n // 2]
+    else:  # Even number of elements
+        return (merged[n // 2 - 1] + merged[n // 2]) / 2
+
+
+if __name__ == "__main__":
+    main()

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

@@ -0,0 +1,27 @@
+# Please do not modify the main function
+def main():
+    x = int(input().strip())
+    print(solution(x))
+
+
+# Write your code here
+def solution(x):
+    # Define the 32-bit integer boundaries
+    INT_MIN, INT_MAX = -(2**31), 2**31 - 1
+
+    # Check if x is negative and handle reversal accordingly
+    sign = -1 if x < 0 else 1
+    x *= sign
+
+    # Reverse the integer by converting to string, reversing, and converting back to int
+    reversed_x = int(str(x)[::-1]) * sign
+
+    # Check for overflow
+    if reversed_x < INT_MIN or reversed_x > INT_MAX:
+        return 0
+
+    return reversed_x
+
+
+if __name__ == "__main__":
+    main()

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

@@ -0,0 +1,5 @@
+123
+
+-123
+
+120

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

@@ -0,0 +1,5 @@
+321
+
+-321
+
+21