feat(content): function signatures + test cases

backend/data/questions/lru-cache.yaml

@@ -9,6 +9,44 @@ categories:
 patterns:
   - linkedlist-reversal
 
+function_signature: "class LRUCache: def __init__(self, capacity: int); def get(self, key: int) -> int; def put(self, key: int, value: int) -> None"
+
+test_cases:
+  visible:
+    - input:
+        operations: ["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"]
+        arguments: [[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]]
+      expected: [null, null, null, 1, null, -1, null, -1, 3, 4]
+    - input:
+        operations: ["LRUCache", "put", "get"]
+        arguments: [[1], [1, 100], [1]]
+      expected: [null, null, 100]
+  hidden:
+    - input:
+        operations: ["LRUCache", "get"]
+        arguments: [[1], [1]]
+      expected: [null, -1]
+    - input:
+        operations: ["LRUCache", "put", "put", "put", "get", "get"]
+        arguments: [[2], [1, 1], [2, 2], [3, 3], [1], [3]]
+      expected: [null, null, null, null, -1, 3]
+    - input:
+        operations: ["LRUCache", "put", "get", "put", "get"]
+        arguments: [[1], [1, 10], [1], [2, 20], [1]]
+      expected: [null, null, 10, null, -1]
+    - input:
+        operations: ["LRUCache", "put", "put", "get", "put", "put", "get"]
+        arguments: [[2], [2, 1], [2, 2], [2], [1, 1], [4, 1], [2]]
+      expected: [null, null, null, 2, null, null, -1]
+    - input:
+        operations: ["LRUCache", "put", "put", "put", "put", "get", "get", "get", "get"]
+        arguments: [[3], [1, 1], [2, 2], [3, 3], [4, 4], [1], [2], [3], [4]]
+      expected: [null, null, null, null, null, -1, 2, 3, 4]
+    - input:
+        operations: ["LRUCache", "put", "put", "get", "put", "get", "get"]
+        arguments: [[2], [1, 1], [2, 2], [1], [3, 3], [2], [1]]
+      expected: [null, null, null, 1, null, -1, 1]
+
 description: |
   Design a data structure that follows the constraints of a **Least Recently Used (LRU) cache**.