Pablo Gamito PabiGamito

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                PabiGamito
                / keybase.md
            
            
              Created
              September 10, 2019 19:32
            
          
    Keybase proof

I hereby claim:

I am pabigamito on github.
I am pabi (https://keybase.io/pabi) on keybase.
I have a public key ASDh38i3ZfipoIAj3yf2A-ADRX8eBCTMOoNu2hh31h-tjgo

To claim this, I am signing this object:

  
## ContractA.sol
pragma solidity ^0.4.22;

import "./IContractB.sol";

contract ContractA {
    IContractB internal CONTRACTB;

    constructor (address _address) public {
        CONTRACTB = IContractB(_address);
    }

## .tum.conf
set-option -g mouse on

## haskell-fibonacci-1.hs
-- Exponential complexity
-- NOTE: This should never be used it is extraordinarily slow
fib :: Int -> Integer
fib 0 = 0
fib 1 = 1
fib n = fib (n - 1) + fib (n - 2)

-- > fib 8
-- > [0, 1, 1, 2, 3, 5, 8, 13]

## The Stolen Breakfast Drone Problem.rb
# PROBLEM #
# ####### #

# Your company delivers breakfast via autonomous quadcopter drones. And something mysterious has happened.
# Each breakfast delivery is assigned a unique ID, a positive integer. When one of the company's 100 drones takes off with a delivery, the delivery's ID is added to a list, delivery_id_confirmations. When the drone comes back and lands, the ID is again added to the same list.

# After breakfast this morning there were only 99 drones on the tarmac. One of the drones never made it back from a delivery. We suspect a secret agent from Amazon placed an order and stole one of our patented drones. To track them down, we need to find their delivery ID.

# Given the list of IDs, which contains many duplicate integers and one unique integer, find the unique integer.

## The Cake Thief Problem.rb
# ####### #
# PROBLEM #
# ####### #

# You are a renowned thief who has recently switched from stealing precious metals to stealing cakes because of the insane profit margins. You end up hitting the jackpot, breaking into the world's largest privately owned stock of cakes—the vault of the Queen of England. While Queen Elizabeth has a limited number of types of cake, she has an unlimited supply of each type.

# Each type of cake has a weight and a value, stored in a tuple with two indices:
# An integer representing the weight of the cake in kilograms
# An integer representing the monetary value of the cake in British pounds
# For example:

## Dividers Finder.rb
def find_divider(n, i=1, dividers=[])
	if i < n/2
		if n/i == (n/i).to_i
			if !dividers.include? i
				dividers << i
			end
			if !dividers.include? (n/i).to_i
				dividers << (n/i).to_i
			end
		end

## longest-palindrome.rb
arr = ["madam", "nurses","Racecar", "not a palindrome", "a random string", "Dennis, And Edna Sinned"]

# Find the Palindromes in the array
palindromes = []
arr.each do |str|
  parsed_str = str.downcase.gsub(/[^a-z^A-Z]/, "");

  is_palindrome = true
  i = 0
  (parsed_str.length/2).times do

## okcoin_websocket.rb
require 'websocket-client-simple'
require 'zlib'

WSURL = 'wss://real.okcoin.com:10440/websocket/okcoinapi'

def inflate(deflated_string)
  zstream = Zlib::Inflate.new(-Zlib::MAX_WBITS)
  buf = zstream.inflate(deflated_string)
  zstream.finish
  zstream.close
	pragma solidity ^0.4.22;

	import "./IContractB.sol";

	contract ContractA {
	IContractB internal CONTRACTB;

	constructor (address _address) public {
	CONTRACTB = IContractB(_address);
	}
	-- Exponential complexity
	-- NOTE: This should never be used it is extraordinarily slow
	fib :: Int -> Integer
	fib 0 = 0
	fib 1 = 1
	fib n = fib (n - 1) + fib (n - 2)

	-- > fib 8
	-- > [0, 1, 1, 2, 3, 5, 8, 13]
	# PROBLEM #
	# ####### #

	# Your company delivers breakfast via autonomous quadcopter drones. And something mysterious has happened.
	# Each breakfast delivery is assigned a unique ID, a positive integer. When one of the company's 100 drones takes off with a delivery, the delivery's ID is added to a list, delivery_id_confirmations. When the drone comes back and lands, the ID is again added to the same list.

	# After breakfast this morning there were only 99 drones on the tarmac. One of the drones never made it back from a delivery. We suspect a secret agent from Amazon placed an order and stole one of our patented drones. To track them down, we need to find their delivery ID.

	# Given the list of IDs, which contains many duplicate integers and one unique integer, find the unique integer.
	def find_divider(n, i=1, dividers=[])
	if i < n/2
	if n/i == (n/i).to_i
	if !dividers.include? i
	dividers << i
	end
	if !dividers.include? (n/i).to_i
	dividers << (n/i).to_i
	end
	end
	arr = ["madam", "nurses","Racecar", "not a palindrome", "a random string", "Dennis, And Edna Sinned"]

	# Find the Palindromes in the array
	palindromes = []
	arr.each do \|str\|
	parsed_str = str.downcase.gsub(/[^a-z^A-Z]/, "");

	is_palindrome = true
	i = 0
	(parsed_str.length/2).times do
	require 'websocket-client-simple'
	require 'zlib'

	WSURL = 'wss://real.okcoin.com:10440/websocket/okcoinapi'

	def inflate(deflated_string)
	zstream = Zlib::Inflate.new(-Zlib::MAX_WBITS)
	buf = zstream.inflate(deflated_string)
	zstream.finish
	zstream.close