futureperfect

#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>

void die(const char *message)
{
  if(errno) {
    perror(message);
  } else {

futureperfect

;; Author: Erik Hollembeak
;;

(defun test-gamegrid-nonsense ()
  "Test out using gamegrid for rendering 2D ASCII world"
	(require 'cl)
	(require 'gamegrid)
	(loop for x from 33 to 57 do
		(gamegrid-init-buffer 24 24 x)
		(sit-for 0.4)))

futureperfect

public class FindInBST {

    public static Node<T> findValueInBST(T value, Node<T> root) {
        checkNotNull(value);
                
        //terminating condition
        if (root == null) {
            return null;
        }
        

futureperfect

//Find mode in sorted array

    /*
      What types? Let's assume int for now.
      Bounds on underlying data? No bounds beyond underlying int type
      Know anything about the distribution. Nope. Anything and everything, but the array is monotonically increasing.
      What bounds on array size? Let's not concern ourselves. Sufficiently
      small that we can work with the array in memory.
    */

futureperfect

package io.tense.interview.arrays;

import static com.google.common.base.Preconditions.checkNotNull;

public class CircularArrays {

    /**
     * Tests for the the complete "circularity" of an array of integers where
     * traversal is performed by taking array[i] and summing the index i and
     * value stored in the array to derive a new index.

futureperfect

futureperfect

# Histogram filter for 2D discrete world
# author: Erik Hollembeak

colors = [['red', 'green', 'green', 'red', 'red'],
          ['red', 'red', 'green', 'red', 'red'],
          ['red', 'red', 'green', 'green', 'red'],
          ['red', 'red', 'red', 'red', 'red']]

measurements = ['green', 'green', 'green', 'green', 'green']

futureperfect

(defun divisible-by (number list)
  "return true if divisible by an element in the list"
  (loop for i in list
       thereis (= (mod number i) 0)))

(defun prime-list-generator (current max-value prime-list)
  "business end of p10"
  (if (= current max-value)
      prime-list
      (if (divisible-by current prime-list)

futureperfect

;(compile-file "euler.lisp")

(defun fib (n)
  (if (or (= n 0)
	  (= n 1))
      1
      (+ (fib (- n 1))
	 (fib (- n 2)))))

(defun square (number)

futureperfect

#!/usr/bin/env python
# encoding: utf-8
"""
garbageDetector.py

Created by Erik Hollembeak on 2009-09-28.
Copyright (c) 2009 Vocalocity. All rights reserved.
"""

import sys