- Find others interested in development (Seth)
- Answer questions about software (Luis)
- How to communicate with developers
- Product coming to market, need help upgrading software
- Understanding how to measure cost of development jobs
- What’s involved in maintaining software and cultivating happy customers (after launch)
- What does the community have to offer, technology specific
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function inheritPrototype(childObject, parentObject) { | |
var copyOfParent = Object.create(parentObject.prototype); | |
copyOfParent.constructor = childObject; | |
childObject.prototype = copyOfParent; | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env ruby | |
# Coding challenge : Armstrong Numbers | |
# | |
# Write a program using any language or technique that can accept two positive | |
# integers defining a range (such as 0 and 100 for the range 0 <= x <= 100) and | |
# will print all Armstrong Numbers in that range. | |
# | |
# An Armstrong Number is fully defined at | |
# http://en.wikipedia.org/wiki/Narcissistic_number |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env ruby | |
# Maximum Subarray | |
# Using any language or technique, write a program that meets the following criteria: | |
# Given an array containing positive and negative integers, return the maximum sum that | |
# can be generated from any contiguous set. | |
# For example in the following array: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env node | |
// This one does not give correct output for 900 10000, trying | |
// to figure out why. | |
var low = process.argv[2] | |
, high = process.argv[3] | |
, max = 0, count, num; | |
for (num = low; low < high; low++) { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
'use strict'; | |
angular.module( 'catalogApp' ) | |
.controller( 'CatalogCtrl', [ '$scope', '$timeout', 'Session', '$location', 'Catalogs', | |
function( $scope, $timeout, Session, $location, Catalogs ) { | |
//if (!Session.user) $location.path('/login'); | |
Session.user = { | |
"defaultCatalog": 0 | |
}; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env node | |
var str = process.argv[2].toString(); | |
var palindromeCheck = function(str) { | |
var palindrome = true, | |
chars = {}, | |
allowance = false; | |
if (str.length % 2 === 1) allowance = true; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env node | |
// http://upfrontwichita.com/challenges/3 | |
/** | |
* fizzBuzz | |
*/ | |
var fizzBuzz = function(low, high) { | |
var result = []; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var fizzBuzz = require('../fizzbuzz') | |
, should = require('chai').should(); | |
describe('FizzBuzz Challenge', function() { | |
it('should print "fizz" for multiples of 3', function() { | |
fizzBuzz(3)[0].should.equal('fizz'); | |
fizzBuzz(9)[0].should.equal('fizz'); | |
fizzBuzz(333)[0].should.equal('fizz'); | |
}); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env node | |
// http://upfrontwichita.com/challenges/3 | |
/** | |
* fizzBuzz | |
*/ | |
var fizzBuzz = function(low, high) { | |
var result = []; |
OlderNewer