Updated difficulty of Lowest Common Ancestor of BST

pull/611/head
Tim Parsons 1 year ago
parent 0af108d24d
commit c5f395c265

@ -105,7 +105,7 @@
"url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree", "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree",
"duration": 20, "duration": 20,
"epi": 1, "epi": 1,
"difficulty": "Easy", "difficulty": "Medium",
"id": 235, "id": 235,
"topic": "binary-search-tree", "topic": "binary-search-tree",
"routines": [] "routines": []

@ -117,7 +117,7 @@ Week 4 builds up on knowledge from previous weeks but questions are of increased
| Question | Difficulty | LeetCode | | Question | Difficulty | LeetCode |
| :-- | --- | --- | | :-- | --- | --- |
| Subtree of Another Tree | Easy | [Link](https://leetcode.com/problems/subtree-of-another-tree/) | | 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/) | | 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/) | | 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/) | | Kth Smallest Element in a BST | Medium | [Link](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) |

Loading…
Cancel
Save