Updated project

Author: jasonsutter87

Chap_1_Arrays_and_Strings/.DS_Store

@@ -0,0 +1,9 @@
+def is_unique(string)
+	unique = ""
+	string.chars do |char|
+		if unique.include?(char) == false
+			unique << char
+		end
+	end
+	string.length == unique.length ? true : false
+end

Chap_1_Arrays_and_Strings/Q1_01_Is_Unique.rb

@@ -0,0 +1,11 @@
+def check_permutation(s1="", s2="")
+	if s1 == s2
+		true
+	else
+		if s1.split("").sort == s2.split("").sort
+			true
+		else
+			false
+		end
+	end
+end

Chap_1_Arrays_and_Strings/Q1_02_Check_Permutation.rb

@@ -0,0 +1,7 @@
+def urlify(string)
+	if string.include?(' ') == true
+		string.gsub!(' ', '%20')
+	else
+		string
+	end
+end

Chap_1_Arrays_and_Strings/Q1_03_URLify.rb

@@ -0,0 +1,23 @@
+def one_array(s1, s2)
+	if s1 == s2
+		true
+	else
+		if s1.length > s2.length + 1 || s1.length < s2.length - 1
+			false
+		else
+			count = 0
+			s2.chars.each do |char|
+				if s1.include?(char) != true
+					count += 1
+				end
+			end
+
+			if count > 1
+				false
+			else
+				true
+			end
+
+		end
+	end
+end

Chap_1_Arrays_and_Strings/Q1_05_One_Array.rb

@@ -0,0 +1,27 @@
+def string_compression(string)
+	container = [
+		[]
+	]
+	word = string.split('')
+
+	word.each do |letter|
+		if container[-1] == []
+			container[-1] << letter
+		elsif container[-1][0] == letter
+			container[-1] << letter
+		else
+			container << Array.new
+			container[-1] << letter
+		end
+	end
+	compressed = ""
+	container.length.times do |count|
+		compressed = compressed + container[count][0]+container[count].length.to_s
+	end
+
+	if string.length <=  compressed.length
+		string
+	else
+		compressed
+	end
+end

Chap_1_Arrays_and_Strings/Q1_06_String_Compression.rb

@@ -0,0 +1,7 @@
+def rotate_matrix(array)
+	array_flipped = []
+	array.transpose.each do |row|
+		array_flipped << row.reverse
+	end
+	array_flipped
+end

Chap_1_Arrays_and_Strings/Q1_07_Rotate_Matrix.rb

@@ -0,0 +1,23 @@
+def zero_matrix(matrix)
+	zero = nil
+	matrix.length.times do |row|
+		if matrix[row].include?(0)
+			matrix[row].each_with_index do |zeros, idx|
+				if zeros == 0
+					zero = idx
+				else
+					matrix[row][idx] = 0
+				end
+			end
+		end
+	end
+	matrix = matrix.transpose
+	matrix.length.times do |row|
+		if zero == row
+			matrix[row].each_with_index do |zeros, idx|
+				matrix[row][idx] = 0
+			end
+		end
+	end
+	matrix = matrix.transpose
+end

Chap_1_Arrays_and_Strings/Q1_08_Zero_Matrix.rb

@@ -0,0 +1,17 @@
+def string_rotation(s1, s2)
+	matching = false
+	if s1.length == s2.length
+		count =  0
+		until count == s1.length
+			splitted = s1.split('')
+			s1 = splitted.push(splitted.shift).join
+			if s1 == s2
+				matching = true
+			end
+			count += 1
+		end
+	else
+		false
+	end
+	matching
+end

Chap_1_Arrays_and_Strings/Q1_09_String_Rotation.rb

@@ -0,0 +1,24 @@
+require_relative('../Is_Unique')
+
+describe 'detects if characters are unique in a word' do
+	let(:word1) {"jason"}
+	let(:word2) {"banana"}
+	let(:word3) {"cool"}
+	let(:word4) {"cat"}
+
+	it 'Should return true, since nothing repeats' do
+		expect(is_unique(word1)).to eq(true)
+	end
+
+	it 'Should return true, since nothing repeats' do
+		expect(is_unique(word4)).to eq(true)
+	end
+
+	it 'Should return false, since there repeating characters' do
+		expect(is_unique(word2)).to eq(false)
+	end
+
+	it 'Should return false, since there repeating characters' do
+		expect(is_unique(word3)).to eq(false)
+	end
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_01_Is_Unique_Spec.rb

@@ -0,0 +1,26 @@
+require_relative('../Check_Permutation')
+
+describe 'check if two words are permutations of each other' do
+	let(:lemon) {'lemon'}
+	let(:melon) {'melon'}
+	let(:jason) {'jason'}
+	let(:horse) {'horse'}
+
+	it 'should true for being a permutation' do
+		expect(check_permutation(lemon, melon)).to eq(true)
+	end
+
+
+	it 'should true for being a permutation' do
+		expect(check_permutation(melon, lemon)).to eq(true)
+	end
+
+
+	it 'should false for not being a permutation' do
+		expect(check_permutation(jason, horse)).to eq(false)
+	end
+
+	it 'can handle no input' do
+		expect(check_permutation()).to eq(true)
+	end
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_02_Check_Permutation_Spec.rb

@@ -0,0 +1,17 @@
+require_relative('../URLify')
+
+describe '' do
+	let(:string){"Jason Loves TDD"}
+	let(:url) {"Jason%20Loves%20TDD"}
+	let(:name){"jason"}
+
+
+
+	it 'it should convert convert the string if it contains spaces' do
+		expect(urlify(string)).to eq(url)
+	end
+
+	it 'it should output the word if it does not contain spaces' do
+		expect(urlify(name)).to eq(name)
+	end
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_03_URLify_Spec.rb

@@ -0,0 +1,28 @@
+require_relative('../One_Array')
+
+describe 'Checks if two words are one edit away' do
+	let(:pale) {'pale'}
+	let(:ple) {'ple'}
+	let(:cake) {'cake'}
+	let(:bake) {'bake'}
+	let(:cat) {'cat'}
+	let(:dog) {'dog'}
+	let(:cakess) {'cakess'}
+
+	it 'it will return true if 1 edit away' do
+		expect(one_array(pale, ple)).to eq(true)
+	end
+
+	it 'it will return true if 1 edit away' do
+		expect(one_array(cake, bake)).to eq(true)
+	end
+
+	it 'it will return false due to over 1 edit away' do
+		expect(one_array(cat, dog)).to eq(false)
+	end
+
+	it 'it will return false due to over 1 edit away' do
+		expect(one_array(cake, cakess)).to eq(false)
+	end
+
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_05_One_Array_Spec.rb

@@ -0,0 +1,15 @@
+require_relative('../String_Compression')
+
+describe 'string compression' do
+	let(:aabcccccaaa){'aabcccccaaa'}
+	let(:a2b1c5a3){'a2b1c5a3'}
+	let(:abcc){'abcc'}
+
+	it 'it should compress the word down ' do
+		expect(string_compression(aabcccccaaa)).to eq(a2b1c5a3)
+	end
+
+	it 'it does not compress the word down that are smaller than compress version' do
+		expect(string_compression(abcc)).to eq(abcc)
+	end
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_06_String_Compression_Spec.rb

@@ -0,0 +1,16 @@
+require_relative('../Rotate_Matrix')
+
+describe 'turn an array 90 degrees to the right' do
+	let(:portrait){[["a", "b", "c"],
+				    ["d", "e", "f"],
+				    ["g", "h", "i"]]}
+
+	let(:portrait_90cc){[["g", "d", "a"],
+					    ["h", "e", "b"],
+					    ["i", "f", "c"]]}
+
+
+	it 'it will return a new array that has been rotated' do
+		expect(rotate_matrix(portrait)).to eq(portrait_90cc)
+	end
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_07_Rotate_Matrix_Spec.rb

@@ -0,0 +1,10 @@
+require_relative('../Zero_Matrix')
+
+describe 'it will zero out rows and col' do
+	let(:matrix){[[1, 0, 3], [4, 5, 6], [7, 8, 9]]}
+	let(:zeros){[[0, 0, 0], [4, 0, 6], [7, 0, 9]]}
+
+	it 'return a new matrix with 0s replacing the row and col that the 0 was in' do
+		expect(zero_matrix(matrix)).to eq(zeros)
+	end
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_08_Zero_Matrix_Spec.rb

@@ -0,0 +1,22 @@
+require_relative('../String_Rotation')
+
+describe 'checks 2 strings if they are rotations of each other' do
+	let(:waterbottle){'waterbottle'}
+	let(:erbottlewat){'erbottlewat'}
+	let(:jason){'jason'}
+	let(:not_jason){'pizza&tacos'}
+	let(:trees){'trees'}
+	let(:fishs){'fishs'}
+
+	it 'it will return true if s1 is a rotation of s2' do
+		expect(string_rotation(waterbottle, erbottlewat)).to be(true)
+	end
+
+	it 'it will return false if s1 is not a rotation of s2' do
+		expect(string_rotation(jason, not_jason)).to be(false)
+	end
+
+	it 'it will return false if s1 is not a rotation of s2' do
+		expect(string_rotation(trees, fishs)).to be(false)
+	end
+end

Chap_1_Arrays_and_Strings/array_and_string_spec/Q1_09_String_Rotation_Spec.rb

@@ -0,0 +1,34 @@
+class Node
+	attr_accessor :value, :next_node
+	def initialize(value, next_node)
+		@value = value
+		@next_node = next_node
+	end
+end
+
+class LinkedList
+	def self.delete_node(head_node, node_num)
+		count = 0
+		node = head_node
+		until count == node_num
+			previous = node
+			node = head_node.next_node
+			next_node = node.next_node
+			count += 1
+		end
+		previous.next_node = next_node
+		head_node
+	end
+end
+
+#create the linked list
+node4 = Node.new("D", nil)
+node3 = Node.new("C", node4)
+node2 = Node.new("B", node3)
+node1 = Node.new("A", node2)
+
+#show orginal linked list
+p node1
+
+#Show updated linked list after deleted middle node
+p delete = LinkedList.delete_node(node1, 1)

Chap_2_Listed_Lists/.DS_Store

@@ -0,0 +1,17 @@
+def three_in_one(array)
+	three_stacks = [
+		num_stack = [],
+		string_stack = [],
+		other_stack = [],
+	]
+	until array.length == 0
+		if array[0].class == String
+			string_stack << array.shift
+		elsif array[0].class == Fixnum || array[0].class == Float
+			num_stack << array.shift
+		else
+			other_stack << array.shift
+		end
+	end
+	three_stacks
+end

Chap_2_Listed_Lists/Q2_03_Delete_Middle_Node.rb

@@ -0,0 +1,20 @@
+def higest_num_stack(stack)
+	return stack[0] if stack.length == 1
+	temp_queue = []
+	smallest = stack.min
+
+
+	until stack.length == 0
+		temp_queue << stack.pop
+	end
+
+	until smallest == temp_queue.last
+		temp_queue.push(temp_queue.shift)
+	end
+
+
+	stack = temp_queue
+	stack.pop
+
+	higest_num_stack(stack)
+end