BBischof

license: gpl-3.0

BBischof

BBischof

BBischof

BBischof

experiment_name=$1
pip_reqs_file=$2
mkdir $experiment_name
cd $experiment_name
cp $pip_reqs_file .
venv_name="venv_"$experiment_name
virtualenv -p python $venv_name
source $venv_name/bin/activate
pip install -r ../$pip_reqs_file
pip install ipykernel

BBischof

your_dict = {}
for i in some_iterator:
    your_dict[i] = new_value if i not in your_dict else your_dict[i]+new_value
  
'''a version with the new value coming from a new dict'''
your_dict = {}
for i in some_iterator:
    your_dict[i] = new_values[i] if i not in your_dict else your_dict[i]+new_values[i]
  
'''a kinda dumb example; letter frequencies'''

BBischof

DevOps Coding Challenge (Allot at least 2 hours)

s3 manipulation

• Clone the read-only bucket https://s3-us-west-2.amazonaws.com/bbc-devops-challenge/, and its contents into your personal s3 account. Read through each JSON file located on this your copy of this bucket. If the key "bump_waste_threshold" is not present in any .json files, add this key with a default value of '.23' and replace the old file.

Directory microservice

Generate a web application in a framework of your choice that does the following:

• Connects to the s3 bucket cloned above, and stores a text representation of the subdirectories of the bucket in Redis (or a similar key-value store). This text representation should match the output format of the unix command tree. Additionally, store the json files as the values with keys given by their paths from the root of this bucket.
• Serves the plain text of the directory tree from the root path of the application.
• All non-root paths must return a sample of poetry(any

BBischof

Engineering Manager Challenge (Allot at least 2 hours)

Note: Don’t feel constrained by the time limits.

Consider the following scenario:

You have 2 scheduled roasts of Hayes Valley Espresso totaling 50lbs. (For simplicity, assume that all batches are maximum of 30lbs for physical reasons).

Roast A, 20lbs available. 
Roast B, 30lbs available. 

BBischof

number_list=["one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen", "twenty", "twenty-one", "twenty-two", "twenty-three", "twenty-four", "twenty-five", "twenty-six", "twenty-seven", "twenty-eight", "twenty-nine", "thirty", "thirty-one", "thirty-two", "thirty-three", "thirty-four", "thirty-five", "thirty-six", "thirty-seven", "thirty-eight", "thirty-nine", "forty", "forty-one", "forty-two", "forty-three", "forty-four", "forty-five", "forty-six", "forty-seven", "forty-eight", "forty-nine", "fifty", "fifty-one", "fifty-two", "fifty-three", "fifty-four", "fifty-five", "fifty-six", "fifty-seven", "fifty-eight", "fifty-nine", "sixty", "sixty-one", "sixty-two", "sixty-three", "sixty-four", "sixty-five", "sixty-six", "sixty-seven", "sixty-eight", "sixty-nine", "seventy", "seventy-one", "seventy-two", "seventy-three", "seventy-four", "seventy-five", "seventy-six", "seventy-seven", "seventy-eig

BBischof

def recurse(remaining_steps, delimiter='"-"', reference_cell="A2"):
    if remaining_steps==0:
        return 'SEARCH('+delimiter+','+reference_cell+')+1'
    else:
        return 'SEARCH('+delimiter+','+reference_cell+','+recurse(remaining_steps-1, delimiter, reference_cell)+')+1'

def build(i, delimiter='"-"', reference_cell="A2"):
    if i<0:
        raise ValueError
    elif i==0: