manubete

def longest_palindrome(input_string):
	# separated the string into a list made of it's characters
	# populated a dictionary with unique characters and their counts
	char_list = list(input_string)
	char_dict = dict()
	for char in char_list:
		if char not in char_dict:
			char_dict[char] = 1
		else:

manubete

require 'jwt'
require 'rainbow'

# test tools that were not as productive as interacting with CLI
#require "test/unit"
#require 'open3'

#test use cases --------------------

# 1) make sure that user_id and email are necessary fields to complete to finish loop

manubete

335  cd Documents
  336  ls
  337  cd Programming
  338  ls
  339  cd Github
  340  ls
  341  git clone --barehttps://github.com/manubete/CLI-Obstacle-Course
  342  ls
  343  git clone --bare https://github.com/manubete/CLI-Obstacle-Course
  344  ls

manubete

class BoggleBoard

  def initialize(board)
    @boggle_board = board
    @diag = []
  end
  
  def create_word(*coords)
     coords.map { |coord| @boggle_board[coord.first][coord.last] }.join("")
  end