Robert uerobert
uerobert
/ learning_resources.txt
Created
May 20, 2013 07:39
— forked from nathansmith/web-design-development-learning-resources.md
This file contains hidden or 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
| Resources for learning web design & front-end development: | |
| ================================================================================ | |
| **ONLINE** | |
| Design | |
| > http://52weeksofux.com | |
| > http://thedesigncubicle.com |
uerobert
/ gist:5425483
Created
April 20, 2013 10:09
— forked from shripadk/gist:652819
This file contains hidden or 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
| ### | |
| Module dependencies | |
| ### | |
| require.paths.unshift "#{__dirname}/lib/support/express-csrf/" | |
| require.paths.unshift "#{__dirname}/lib/support/node_hash/lib/" | |
| express = require 'express' | |
| app = module.exports = express.createServer() | |
| RedisStore = require 'connect-redis' |
uerobert
/ min_segtree_query.cpp
Last active
December 15, 2015 11:19
— forked from utkarshl/min_segtree_query.cpp
This file contains hidden or 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
| struct node{ | |
| int val; | |
| void split(node& l, node& r){} | |
| void merge(node& a, node& b) | |
| { | |
| val = min( a.val, b.val ); | |
| } | |
| }tree[1<<(n+1)]; | |
| node range_query(int root, int left_most_leaf, int right_most_leaf, int u, int v) | |
| { |