ohmslaw

import java.util.*;

class Main {
    public static void main(String[] args) {
        // Assume we are provided a list of already sorted values (size between 10-10000)
        List<Integer> existingItems = generateRandomList(1000);
        Collections.sort(existingItems);

        // Assume you would be given items to add to the list (size between 1-5)
        List<Integer> newItems = generateRandomList(3);

ohmslaw

### Keybase proof

I hereby claim:

  * I am ohmslaw on github.
  * I am scispear (https://keybase.io/scispear) on keybase.
  * I have a public key whose fingerprint is 2C86 4B1E 2428 4E5A 6DCC  0256 D35D A147 B2EB C041

To claim this, I am signing this object:

ohmslaw

/**
 * Simple Text: Write a method in which provided two strings, it returns a string between them.  Additionally, a 
 * percentage will be provided to allow us to fine-tune the outcome.
 * 
 * Nerd Text: Given two strings A & B where 'a' <= A <= B <= 'z' and a skew N where 0 <= N <= 1.  Write a method that 
 * returns a value X where A <= X <= B relative to N. The intent of the skew is to dictate where X should fall between 
 * A & B.  Meaning X will not always be exactly halfway between.
 * 
 * Caveats: