feat(content): function signatures + test cases

backend/data/questions/132-pattern.yaml

@@ -9,6 +9,30 @@ categories:
 patterns:
   - monotonic-stack
 
+function_signature: "def find132pattern(nums: list[int]) -> bool:"
+
+test_cases:
+  visible:
+    - input: { nums: [1, 2, 3, 4] }
+      expected: false
+    - input: { nums: [3, 1, 4, 2] }
+      expected: true
+    - input: { nums: [-1, 3, 2, 0] }
+      expected: true
+  hidden:
+    - input: { nums: [1, 2] }
+      expected: false
+    - input: { nums: [3, 5, 0, 3, 4] }
+      expected: true
+    - input: { nums: [1, 0, 1, -4, -3] }
+      expected: false
+    - input: { nums: [1, 2, 2, 2] }
+      expected: false
+    - input: { nums: [-2, 1, 2, -2, 1, 2] }
+      expected: true
+    - input: { nums: [1, 3, 2, 4, 5, 6, 7, 8, 9, 10] }
+      expected: true
+
 description: |
   Given an array of `n` integers `nums`, a **132 pattern** is a subsequence of three integers `nums[i]`, `nums[j]` and `nums[k]` such that `i < j < k` and `nums[i] < nums[k] < nums[j]`.