feat(rust, python): enable min-max skipping for binary in parquet, enable min-max skipping for is_in exprs #6036 ...

# 1) O(N) solution is possible using stacks; avoid DP for this problem # 2) Think about how to identify the largest window a number is the minimum for (e.g. for the sequence 11 2 3 14 5 2 11 12 we ...