Coding bst
Validate BST
LC 98. Pass (low, high) bounds, not just left < node < right.
Week 3Sunday 20 SeptemberBST
Day 16: BST and recursion
0 of 4 tasks completed0%
Coding bst
Kth Smallest in BST
LC 230. Inorder. Follow-up: if the tree mutates, what do you cache?
Coding tree dp
Binary Tree Max Path Sum
LC 124. Gain you can return vs path you can keep. All-negative case.
Behavioral star
STAR — owned a technical mistake
Draft Situation/Task/Action/Result. Include what you changed in the system after.