I joined and she asked below coding questions.
1) Given the root of a binary tree, flatten the tree into a "linked list":
The "linked list" should use the same TreeNode class where the right child pointer points to the next node in the list and the left child pointer is always null.
The "linked list" should be in the same order as a pre-order traversal of the binary tree.
Example 1:
Input: root = [1,2,5,3,4,null,6]
Output: [1,null,2,null,3,null,4,null,5,null,6]
Example 2:
Input: root = []
Output: []
Example 3:
Input: root = [0]
Output: [0]
-----------------------
2) You are given a list of integers and an integer k. Find all contiguous subarrays of size k and return the subarray which has the highest maximum value among them.
✅ Input:
A list of integers i = [1, 2, 3, 4, 5]
An integer k = 3
✅ Output:
A subarray of size k with the highest maximum value:
3,4,5
