Sollicitatievraag bij Palo Alto Networks

Usual resume related question and coding on python first round - square a sorted array and return a sorted array second round - 1) Maximum element in a window of size k in linear time (leetcode hard) 2) reverse a link list and delete node in BST 3) Verify if a tree is a BST