feat(content): hidden test cases

2025-08-06 23:21:42 +01:00
parent 89b5dd1457
commit 6bed0a6787
134 changed files with 2075 additions and 0 deletions
--- a/backend/data/questions/lowest-common-ancestor-of-a-binary-search-tree.yaml
+++ b/backend/data/questions/lowest-common-ancestor-of-a-binary-search-tree.yaml
@@ -26,6 +26,12 @@ test_cases:
      expected: 8
    - input: { root: [3, 1, 4, null, 2], p: 1, q: 4 }
      expected: 3
+    - input: { root: [6, 2, 8, 0, 4, 7, 9, null, null, 3, 5], p: 0, q: 5 }
+      expected: 2
+    - input: { root: [5, 3, 6, 2, 4], p: 2, q: 4 }
+      expected: 3
+    - input: { root: [2, 1, 3], p: 1, q: 3 }
+      expected: 2

 description: |
  Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.