feat(content): more test cases

backend/data/questions/network-delay-time.yaml

@@ -10,6 +10,26 @@ patterns:
   - bfs
   - heap
 
+function_signature: "def network_delay_time(times: list[list[int]], n: int, k: int) -> int:"
+
+test_cases:
+  visible:
+    - input: { times: [[2, 1, 1], [2, 3, 1], [3, 4, 1]], n: 4, k: 2 }
+      expected: 2
+    - input: { times: [[1, 2, 1]], n: 2, k: 1 }
+      expected: 1
+    - input: { times: [[1, 2, 1]], n: 2, k: 2 }
+      expected: -1
+  hidden:
+    - input: { times: [[1, 2, 1], [2, 3, 2], [1, 3, 4]], n: 3, k: 1 }
+      expected: 3
+    - input: { times: [[1, 2, 1], [2, 1, 3]], n: 2, k: 2 }
+      expected: 3
+    - input: { times: [[1, 2, 1], [2, 3, 7], [1, 3, 4], [2, 1, 2]], n: 3, k: 1 }
+      expected: 4
+    - input: { times: [[3, 5, 78], [2, 1, 1], [1, 3, 0], [4, 3, 59], [5, 3, 85], [5, 2, 22], [2, 4, 23], [1, 4, 43], [4, 5, 75], [5, 1, 15], [1, 5, 91], [4, 1, 16], [3, 2, 98], [3, 4, 22], [5, 4, 31], [1, 2, 0], [2, 5, 4], [4, 2, 51], [3, 1, 36], [2, 3, 59]], n: 5, k: 5 }
+      expected: 31
+
 description: |
   You are given a network of `n` nodes, labeled from `1` to `n`. You are also given `times`, a list of travel times as directed edges `times[i] = (u_i, v_i, w_i)`, where `u_i` is the source node, `v_i` is the target node, and `w_i` is the time it takes for a signal to travel from source to target.