lostmarinero

# ReqCheck-Extractor

This is the original ReqCheck-Extractor Project, developed by the Code for America's 2016 Kansas City, Missouri (KCMO) Fellowship Team in collaraboration with the KCMO Health Department.

A special thank you to the staff at the [Kansas City Health Department](http://kcmo.gov/health/clinic-services/) for their help developing it.

This project is a script for extracting data from a database, transforming it, and sending it to a website running [Project ReqCheck](https://github.com/KCMOHealthDepartment/reqcheck).

## How It Works
This is a project, written in Python, that can be bundled into a Microsoft Batch File (*.bat).

lostmarinero

# ReqCheck-Extractor

This is the original ReqCheck-Extractor Project, developed by the Code for America's 2016 Kansas City, Missouri (KCMO) Fellowship Team in collaraboration with the KCMO Health Department.

A special thank you to the staff at the [Kansas City Health Department](http://kcmo.gov/health/clinic-services/) for their help developing it.

This project is a script for extracting data from a database, transforming it, and sending it to a website running [Project ReqCheck](https://github.com/KCMOHealthDepartment/reqcheck).

## How It Works
This is a project, written in Python, that can be bundled into a Microsoft Batch File (*.bat).

lostmarinero

from operator import (
    add,
    sub,
    mul,
    div,
    mod,
    pow
)

lostmarinero

import csv

def convert_to_lowercase(input_word):
    return input_word[0].lower() + input_word[1:]

def convert_to_python_style(input_word):
    return '_'.join(
        [
         convert_to_lowercase(individual_word)

lostmarinero

# Flights, Ruby
#
# Express the following table as a static structure, 
# and write a function, find_routes(source, destination) that 
# efficiently outputs all possible routes.
#
# Source  | Dest
# ~~~~~~    ~~~~
# Seattle | LA
# LA      | Florida

lostmarinero

# 6 points for a "touch-down"
# 3 points for a "field-goal"
# 1 point for an "extra-point"; can only be rewarded after a touch-down. Mutually-exclusive with "two-point conversion"
# 2 points for a "two-point conversion"; can only be rewarded after a touch-down. Mutually-exclusive with "extra-point"

class Scoring

  attr_reader :max_number_each, :scoring_values
  attr_accessor :score, :counter

lostmarinero

# Given a deck of n unique cards, cut the deck c cards from the top and perform a perfect shuffle. 
# A perfect shuffle is where you put down the bottom card from the top portion of the deck followed by the bottom card from the bottom portion of the deck.
# This is repeated until one portion is used up. The remaining cards go on top.
# We want an algorithm that will determine the number of perfect shuffles that will need to happen before the deck returns to its original order. This can be done in any language.
# A successful solution will solve the problem for 1002 cards and a cut size of 101 in under a second even on a slow machine.


class Shuffler

  attr_reader :initial_cards, :cut, :top_cut, :top, :bottom, :extra

lostmarinero

def problem_1(input_string)
  arr = input_string.split(" ")
  arr.reverse!
  arr.join(" ")
end

puts "#############################"

lostmarinero

Questions THEIR LIFE EXPERIENCES

-Pick an experience from your own life and explain how it has influenced your development as a person.

- Describe your most meaningful achievement that has made a difference in your community

- What have you learned from someone who is very different from you? 

- tell me in 200 words how you would utilize your experience at dev bootcamp to give back to individual from your community that are interested in a development bootcamp?