korniichuk

korniichuk

#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# Name: draw
# Version: 0.1a1
# Owner: Ruslan Korniichuk
# Maintainer(s):

import random

people = ['1', '2', '3', '4', '5', '6', '7', '8', '9']  # TODO

korniichuk

korniichuk

korniichuk

korniichuk

korniichuk

# SSH over AWS Systems Manager Session Manager
host i-* mi-*
    ProxyCommand sh -c "aws ssm start-session --target %h --document-name AWS-StartSSHSession --parameters 'portNumber=%p'"

korniichuk

# Version: 0.1a1

import gzip

import pandas as pd
import s3fs


src = 's3://bucket/file.gz'

korniichuk

A non-empty zero-indexed array A consisting of N integers is given. A pit in this aray is any triplet of integers (P, Q, R) such that:

• 0 <= P < Q < R < N;
• sequence [A[P], A[P+1], ... , A[Q]] is strictly decreasing, i.e. A[P] > A[P+1] > ... > A[Q];
• sequence A[P+1], ... , A[R] is strictly increasing, i.e. A[Q] < A[Q+1] < ... < A[R].

The depth of a pit(P, Q, R) is the number min{A[P] - A[Q], A[R] - A[Q]}.

For example, consider array A consisting of 10 elements such that:

A[0] = 0

korniichuk

def func(a, b):
    result = []
    x, y = 0, 0
    while (x < len(a)) and (y < len(b)):
        if a[x] > b[y]:
            y += 1
        elif b[y] > a[x]:
            x += 1
        else:
            result.append(a[x])