Dale B Halling dbhalling

## gist:61776b49658485e75df90aa2d9671da4
#codility1

puts "Enter and integer"
n = gets().chomp.to_i

def bitgap(n)
	b = n.to_s(2)
	bits = n.bit_length
	leastbit = b[bits - 1].to_i

## 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:9c97c618b4510c4e195ab9e46bb9e8d0
#codility2 Odd Occurrences in an Array

#a = [9, 3, 9, 3, 9, 7, 9]
a = [1, 3, 1, 3, 4, 4, 14]

def oddone(a)
	a.sort!
	i = 0

	while

## gist:67b20f755f24e6efb42c22fe085f0d0d
#Codility array rotation


a = [3, 8, 9, 7, 6]

puts "Enter rotation number"
k = gets.chomp.to_i


# k is the number of indices to shift the array

## 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"}))

## gist:2ac3eeb254ee2140c2b97c5043754bdf
#codility PermMissingElem

a = [2, 3, 1, 5]


def solution(a)
	b = []
	b = a.sort
	count = b.count

## gist:24194825d48fa67d992cbaf79a0450b3
codility 5 frogJump

#x is the starting position of the frog
x = 10

#y is the ending position of the frog
y = 111

#d is the number of positions the frog can jump
d = 30

## gist:d1079b291adf0777072d9a62699027fc
#codility6 TapeEquilibrium

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

puts "The array is #{a}"

def solution(a)
	count = a.count
	sum = 0
	#codility1

	puts "Enter and integer"
	n = gets().chomp.to_i

	def bitgap(n)
	b = n.to_s(2)
	bits = n.bit_length
	leastbit = b[bits - 1].to_i
	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
	#codility2 Odd Occurrences in an Array

	#a = [9, 3, 9, 3, 9, 7, 9]
	a = [1, 3, 1, 3, 4, 4, 14]

	def oddone(a)
	a.sort!
	i = 0

	while
	#Codility array rotation


	a = [3, 8, 9, 7, 6]

	puts "Enter rotation number"
	k = gets.chomp.to_i


	# k is the number of indices to shift the array
	<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"}))
	#codility PermMissingElem

	a = [2, 3, 1, 5]



	def solution(a)
	b = []
	b = a.sort
	count = b.count
	codility 5 frogJump

	#x is the starting position of the frog
	x = 10

	#y is the ending position of the frog
	y = 111

	#d is the number of positions the frog can jump
	d = 30
	#codility6 TapeEquilibrium

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

	puts "The array is #{a}"

	def solution(a)
	count = a.count
	sum = 0