Dale B Halling dbhalling

## gist:b1d400be90340e71142d889781d2b62c
t = [5, -2, 3, 8, 6]
#t = [-5, -5, -5, -42, 6, 12]


def winter(t)
	length = t.count
 	lengthsummer = length/2
 	lengthwinter = length - lengthsummer

 	twinter = t.take(lengthwinter)

## gist:1a7c058c92cfb3586f6929d4c327ca62
# chess game  Rook on an infinte Cheesboard.  Find the minium number of steps to the final position

finalposition = [5,-77]


def rook(finalposition)
	start = [0,0]
	finalposition[0] = finalposition[0].abs
	finalposition[1] = finalposition[1].abs

## gist:ae5d52b57b7355d1f9dd7d6747ecfa8e
#frog jump
#array a is a set of stones in a river and the value is when stone is above the waterline in time
#d is how many stones the frog can jump

#a = [1,-1,0,2,3,5]
a = [1, 2, 3]

#d = 3
d = 1

## gist:39b9d15c3990a2ea48f03607846d3c90
<html>
<div id="btc">
</div>

<script>
var ws = new WebSocket("wss://api.bitfinex.com/ws")

ws.onopen = function(){
	ws.send(JSON.stringify({"event":"subscribe", "channel":"ticker", "pair":"BTCUSD"}))

## #codality22 Fish a = [4, 3, 2, 1, 5] b = [0, 1, 0, 0, 0] def solution(a, b) numberoffish = a.count fishup = b.index(1) numberupstream = b.count(1) numberdownstream = b.count(0) collisions = 0 #(numberoffish - 1) - fishup - (numberupst
#codality22 Fish

a = [4, 3, 2, 1, 5]
b = [0, 1, 0, 0, 0]


def solution(a, b)
  numberoffish = a.count

  fishup = b.index(1)

## ThePowerSum
#ThePowerSum

x = 100
n = 3.0

def solution(x, n)
	answer = 0

	power = 1/n

## gist:53eb4622de95dbee99aee99d31918b8e
#CamelCase

s = "saveChangesInTheEditor"

def solution(s)


	sa = s.chars
	sa.keep_if {|v| v =~ /[ABCDEFGHIJKLMNOPQRSTUWXYZ]/}
	count = sa.count + 1

## gist:82820813c9687655f307b18b13e00c96
#Time Conversion  Technical Exam 2

#puts "Please enter the standard time including the seconds in this format XX:XX:XXAM"
#st = gets.chomp.to_s

st = "12:00:45AM"
#st = "01:12:15PM"
#st = "12:00:00AM"

def solution(st)

## Citrusbyte
#Citrus


a = [[1,2,[3]],4]

aflat = []

def flatten(a)
    astring = a.to_s
    test = astring.delete "["

## gist:8670b4d5ce19b8270ed1495cb98cd140
#Codility CountNonDivisible 32

a = [3, 1, 2, 3, 6]


def solution(a)

#  length = a.count
  count = 0
	t = [5, -2, 3, 8, 6]
	#t = [-5, -5, -5, -42, 6, 12]


	def winter(t)
	length = t.count
	lengthsummer = length/2
	lengthwinter = length - lengthsummer

	twinter = t.take(lengthwinter)
	# chess game Rook on an infinte Cheesboard. Find the minium number of steps to the final position

	finalposition = [5,-77]


	def rook(finalposition)
	start = [0,0]
	finalposition[0] = finalposition[0].abs
	finalposition[1] = finalposition[1].abs
	#frog jump
	#array a is a set of stones in a river and the value is when stone is above the waterline in time
	#d is how many stones the frog can jump

	#a = [1,-1,0,2,3,5]
	a = [1, 2, 3]

	#d = 3
	d = 1
	<html>
	<div id="btc">
	</div>

	<script>
	var ws = new WebSocket("wss://api.bitfinex.com/ws")

	ws.onopen = function(){
	ws.send(JSON.stringify({"event":"subscribe", "channel":"ticker", "pair":"BTCUSD"}))
	#codality22 Fish

	a = [4, 3, 2, 1, 5]
	b = [0, 1, 0, 0, 0]


	def solution(a, b)
	numberoffish = a.count

	fishup = b.index(1)
	#ThePowerSum

	x = 100
	n = 3.0

	def solution(x, n)
	answer = 0

	power = 1/n
	#CamelCase

	s = "saveChangesInTheEditor"

	def solution(s)


	sa = s.chars
	sa.keep_if {\|v\| v =~ /[ABCDEFGHIJKLMNOPQRSTUWXYZ]/}
	count = sa.count + 1
	#Time Conversion Technical Exam 2

	#puts "Please enter the standard time including the seconds in this format XX:XX:XXAM"
	#st = gets.chomp.to_s

	st = "12:00:45AM"
	#st = "01:12:15PM"
	#st = "12:00:00AM"

	def solution(st)
	#Citrus


	a = [[1,2,[3]],4]

	aflat = []

	def flatten(a)
	astring = a.to_s
	test = astring.delete "["
	#Codility CountNonDivisible 32

	a = [3, 1, 2, 3, 6]



	def solution(a)

	# length = a.count
	count = 0