{
"name": "your-mom",
"version": "1.1.1",
"description": "y u do dis ;_; a golf lang",
"main": "lib/yourmom.js",
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1",
"prepublish": "./node_modules/.bin/babel src -d lib --minified",
"start": "node ./lib/yourmom.js",
"build": "./node_modules/.bin/babel src -d lib"
},
"repository": {
"type": "git",
"url": "git+github.com/tuxcrafting/your-mom.git";
},
"author": "TuxCrafting",
"license": "UNLICENSED",
Stock Time Machine
You've gained access to a dataset, tomorrowStocks, which contains the stock prices from your favorite business on the NASDAQ. This dataset is a container indexed by minutes past opening. Each index contains the price of the stock at that time.
// Assume the stock market opens...
Python (52 bytes)
print sum(ord(c) for c in 'Happy new year to you!')
Updated for 2015 thanks to @Frg:
print sum(ord(c) for c in 'A Happy New Year to You!')
Mouse over to see 2016 version:
Hello, i think in this challenge, because it must be difficult to solve with few code, because the walker path.
What do you think?
The objective is to draw a chessboard in art ascii with size through two arguments (height,width) and a start (x,y) and end (x,y) point for a subject walking on the...
Many of you have likely seen the Connect 9 dots with 4 lines puzzle. My problem is similar, but more generic.
Given an $N\times N$ square of points, what is the minimum number of lines needed to connect all of the points?
Lines must make a path (the endpoints of each of the lines must connect...
