vnprc

"""
This is a programming exercise to print a spiral array of numbers to
the screen. The spiral starts with 0 in the middle (or upper left of
the middle square) and iterates in concentric square spiral pattern in
a clockwise direction.
"""

import sys
import math

vnprc

"""
This is a programming exercise to solve the towers of hanoi puzzle.
The physical puzzle has three pegs in a row. On the first peg is a
stack of disks of descending diameter. You are only allowed to put
a smaller disk on top of a larger disk, never the reverse. The task
is to move the entire pile from the far left peg, to the far right
peg.

This script accepts one input argument, n, for the number of disks.
"""

vnprc

"""
Programming exercise to print all the permutations of an input string.
"""

import sys

def get_permutations(string):
    permutations = []

    if len(string) == 1:

vnprc

"""
Given a list of change denominations and a target amount of money, 
calculate the number of ways to make that amount of change.
"""

def calculate_variations(total, denomination):
    """
    return all possible sequences of denomination whose sum is <= desired_sum
    """
    list = []

vnprc

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Random;
import java.util.TreeSet;

/**
 * This is a programming exercise to generate a series of random doubles between
 * 0.0 and 1.0 and return an ordered list of the count of the first digit after

vnprc

#!/bin/bash
pids="$(pidof gnome-terminal-server)"

if [ -z "$pids" ]
then
    gnome-terminal
else
    focus_window_pid="$(xdotool getwindowfocus getwindowpid)"

    if [[ $pids == *"$focus_window_pid"* ]]

vnprc

test = [5, -6, 7, 12, -3, 0, -11, -6]

def get_max_contiguous_sum(array):
	results = []
	previous_element = 0
	for element in array:
		previous_element = max(element, previous_element + element)
		results.append(previous_element)

	return max(results)

vnprc

import java.util.ArrayList;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Set;
import java.util.Stack;

public class Tree {
	

vnprc

import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;

public class TopologicalSort {

vnprc

public class FindRightNeighbor {
	
	Node root = null;
	
	public void insert(Node node) {
		if (root == null) {
			root = node;
			return;
		}