diff --git a/apps/website/contents/_components/QuestionGroups.json b/apps/website/contents/_components/QuestionGroups.json
index 04b6d727..f3f1ab9c 100644
--- a/apps/website/contents/_components/QuestionGroups.json
+++ b/apps/website/contents/_components/QuestionGroups.json
@@ -105,7 +105,7 @@
       "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree",
       "duration": 20,
       "epi": 1,
-      "difficulty": "Easy",
+      "difficulty": "Medium",
       "id": 235,
       "topic": "binary-search-tree",
       "routines": []
diff --git a/apps/website/contents/best-practice-questions.md b/apps/website/contents/best-practice-questions.md
index 96eb3696..c1d38351 100644
--- a/apps/website/contents/best-practice-questions.md
+++ b/apps/website/contents/best-practice-questions.md
@@ -117,7 +117,7 @@ Week 4 builds up on knowledge from previous weeks but questions are of increased
 | Question | Difficulty | LeetCode |
 | :-- | --- | --- |
 | Subtree of Another Tree | Easy | [Link](https://leetcode.com/problems/subtree-of-another-tree/) |
-| Lowest Common Ancestor of BST | Easy | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) |
+| Lowest Common Ancestor of BST | Medium | [Link](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) |
 | Implement Trie (Prefix Tree) | Medium | [Link](https://leetcode.com/problems/implement-trie-prefix-tree/) |
 | Add and Search Word | Medium | [Link](https://leetcode.com/problems/add-and-search-word-data-structure-design/) |
 | Kth Smallest Element in a BST | Medium | [Link](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |