mauricioaniche

def convert_letter(letter):
    if letter == "I":
        return 1
    if letter == "V":
        return 5
    if letter == "X":
        return 10

    return -1

mauricioaniche

def convert_letter(letter):
    if letter == 'I': return 1
    if letter == 'V': return 5
    if letter == 'X': return 10
    if letter == 'L': return 50
    if letter == 'C': return 100
    if letter == 'D': return 500
    if letter == 'M': return 1000
    return -1

mauricioaniche

def bj(left, right):
    ln = left
    rn = right
    if ln > 21:
        ln = 0
    if rn > 21:
        rn = 0
    if ln > rn:
        return ln
    else:

mauricioaniche

def count(message):
    words = 0
    last = ' '
    for letter in message:
        if not letter.isalpha() and (last == 'r' or last == 's'):
            words = words + 1
        last = letter

    if last == 'x' or last == 's':
        words = words + 1

mauricioaniche

def calculate(small, big, total):
    maxBigBoxes = total // 5
    bigBoxesWeCanUse = maxBigBoxes if maxBigBoxes < big else big

    total -= (bigBoxesWeCanUse * 5)

    if(small < total):
        return(-1)
    else:
        return(total)

mauricioaniche

def find(nums):
    smallest = 9999
    largest = -9999

    for num in nums:
        if(num < smallest):
            smallest = num
        if(num > largest):
            largest = num

mauricioaniche

package perf.junit4.tests.group1;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Anderson {

    public static class Node {
        Node left;

mauricioaniche

Keybase proof

I hereby claim:

• I am mauricioaniche on github.
• I am mauricioaniche (https://keybase.io/mauricioaniche) on keybase.
• I have a public key ASCMQ2vGQIblY1E0jwKvkextVJyayZX8thmcTw1NGPUwBgo

To claim this, I am signing this object:

mauricioaniche

[Customer|-name;-address]
[Product|-name;-price]
[Inventory|-qty]
[Item|-qty;-totalPrice]
[Delivery|-date]
[Satisfaction|-stars]
[Customer]<>1..n[Order]
[Order]<>1..n[Item]
[Item]<>[Product]
[Delivery]<>1..n[Order]

mauricioaniche

package tdd;

import java.util.HashMap;
import java.util.Map;

/**
 * Created by mauricioaniche on 26/05/2017.
 */
public class RomanConverter {