feat(content): more test cases

backend/data/questions/longest-increasing-subsequence.yaml

@@ -11,6 +11,26 @@ patterns:
   - dynamic-programming
   - binary-search
 
+function_signature: "def length_of_lis(nums: list[int]) -> int:"
+
+test_cases:
+  visible:
+    - input: { nums: [10, 9, 2, 5, 3, 7, 101, 18] }
+      expected: 4
+    - input: { nums: [0, 1, 0, 3, 2, 3] }
+      expected: 4
+    - input: { nums: [7, 7, 7, 7, 7, 7, 7] }
+      expected: 1
+  hidden:
+    - input: { nums: [1] }
+      expected: 1
+    - input: { nums: [1, 2, 3, 4, 5] }
+      expected: 5
+    - input: { nums: [5, 4, 3, 2, 1] }
+      expected: 1
+    - input: { nums: [4, 10, 4, 3, 8, 9] }
+      expected: 3
+
 description: |
   Given an integer array `nums`, return *the length of the longest **strictly increasing subsequence***.