PJ Wickwire pajamaw

## passtoken.sol
pragma solidity ^0.4.11;

contract PassToken {
    // so in order to sell tokens for an ICO you'll need to know how many
    // to sell

    // so let's say that we want to sell 1 million tokens
    // 1 eth -> 10 tokens
    // so we'll have 100,000 eth by the end


## gist:b4b97c33d7c8601fae3fe283eabec82b
0x37e748739D4ab6915fA9C3755F23Ddf7Ee771d67

## links.md

      
              2 files
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                pajamaw
                / links.md
            
            
              Created
              September 15, 2016 17:22
                — forked from cookrn/links.md
            
              
                Ryan Dahl on Software
              
          
    Couldn't find the text of this for a while...

Original (404'ed) -- https://plus.google.com/115094562986465477143/posts/Di6RwCNKCrf
Fakeout -- http://www.dzone.com/links/rss/ryan_dahl_i_hate_almost_all_software.html
Repost -- https://plus.google.com/116904230181415286707/posts/DnAMAN5sUR8


## Alphasights_technical_challenge.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                pajamaw
                / Alphasights_technical_challenge.md
            
            
              Created
              June 9, 2016 17:28
                — forked from tadast/Alphasights_technical_challenge.md
            
              
                A technical challenge we give to our Ruby on Rails applicants in order to evaluate their coding proficiency.
Job description: http://www.alphasights.com/positions/ruby-developer-london or http://www.alphasights.com/positions/ruby-developer-new-york
              
          
    Alphasights Technical Challenge

Using Ruby on Rails we would like you to create a simple expert search tool. The application should fulfill the requirements below. The source code must be placed in a public repo on GitHub. The application should be deployable on Heroku.

I enter a name and a personal website address and a member is created.
When a member is created, all the heading (h1-h3) values are pulled in from the website to that members profile.
The website url is shortened (e.g. using http://goo.gl)
After the member has been added, I can define their friendships with other existing members. Friendships are bi-directional i.e. If David is a friend of Oliver, Oliver is always a friend of David as well.
The interface should list all members with their name, short url and the number of friends e.g. Alan http://goo.gl/3io1P (3)


## test6.rb
testing

## test5.rb
testing

## count_sentences.rb
def count_sentences
    self.scan(/[^\.!?]+[\.!?]/).map(&:strip).count
  end

## key_for_min.rb
def key_for_min_value(name_hash)
  new_name_hash = name_hash.sort_by do |key, value|
    value
  end
  just_names = new_name_hash.collect do |x,y|
    x
  end
  just_names.first
end

## benchmark.rb
Benchmark.bm do |bm|
  bm.report { first_approach }
  bm.report { alternative_approach }
end

## both.rb
def both_elements(array1)
  array2 = []
  intersection = array1 & array2
    if !intersection.empty?
      intersection[i]
    else
      nil
   end
end
	pragma solidity ^0.4.11;

	contract PassToken {
	// so in order to sell tokens for an ICO you'll need to know how many
	// to sell

	// so let's say that we want to sell 1 million tokens
	// 1 eth -> 10 tokens
	// so we'll have 100,000 eth by the end
	def count_sentences
	self.scan(/[^\.!?]+[\.!?]/).map(&:strip).count
	end
	def key_for_min_value(name_hash)
	new_name_hash = name_hash.sort_by do \|key, value\|
	value
	end
	just_names = new_name_hash.collect do \|x,y\|
	x
	end
	just_names.first
	end
	Benchmark.bm do \|bm\|
	bm.report { first_approach }
	bm.report { alternative_approach }
	end
	def both_elements(array1)
	array2 = []
	intersection = array1 & array2
	if !intersection.empty?
	intersection[i]
	else
	nil
	end
	end