DIY: Validate the Binary Search Tree

Problem statement

For this challenge, you are given an integer array. You have to implement the InorderBST() function to validate whether the given integer array represents the in-order traversal of a valid binary search tree.

Constraints

• Nodes count of the binary search tree in the range [1, $10^4$

...