kitchen list
kitchen create
kitchen login <InstanceName>
def mugizi_sorter(fancy_list, *args): | |
for i in range(len(fancy_list)-1,0,-1): | |
for j in range(i): | |
if fancy_list[j]>fancy_list[j+1]: | |
temp = fancy_list[j] | |
fancy_list[j] = fancy_list[j+1] | |
fancy_list[j+1] = temp | |
[ fancy_list.append(fancy_name) for fancy_name in args] | |
Visit my blog or connect with me on Twitter
git init
or
I hereby claim:
- I am mugizico on github.
- I am mugizico (https://keybase.io/mugizico) on keybase.
- I have a public key ASByd05_02uy1IvcR-0PNKXk29qOAku4T27XnEam4LoFOwo
To claim this, I am signing this object:
pa11y-crawl was not running as desired on computer.
- Running 'pa11y-crawl -v' yields
cat: no package.json file or directory found
solution: none figured out so far still a work in progress
- Running 'pa11y-crawl -d /path/to/dir' loops you back to the
Usage: pa11y-crawl [options] <URL> Options:….
message
solution: make sure to provide a third argument like so pa11y-crawl -d /path/to/dir whatever
for e.g pa11y-crawl -d _site 18fsite
the last argument is because the command is set to show the help if there’s no non-option arguments (which is what the url would be, in most cases)
/* | |
* Example Arr1 = {2,3,7,9,20,35} ; Arr2 = { 3,9,21,35,89,100,200}, Intersection = {3,9,35} | |
* Assumptions: | |
* Both Arrays are sorted | |
* Both Arrays contain at least one element | |
* Arr2 >> Arr1 | |
* n is Arr1.length, m is Arr2.length | |
* Possible Solutions: | |
* (1) Brute-force : run O(nm) - inefficient | |
* (2)HashSet/Map : O(n+m) runtime, O(k) additional space k = size of hashset/map |
function query() { | |
var | |
// HN is done with very unsemantic classes. | |
job_list = Array.prototype.slice.call(document.querySelectorAll('.c5a,.cae,.c00,.c9c,.cdd,.c73,.c88')), | |
query_list = Array.prototype.slice.call(arguments), | |
shown = 0, total = job_list.length; | |
// Traverses up the dom stack trying to find a match of a specific class | |
function up_to(node, klass) { | |
if (node.className === klass) { |
From Wikipedia:
Epicyclic gearing or planetary gearing is a gear system consisting of one or more outer gears, or planet gears, revolving about a central, or sun gear. … Epicyclic gearing systems also incorporate the use of an outer ring gear or annulus, which meshes with the planet gears.
Use the menu in the top-left to change the frame of reference, fixing the specified gear in-place.
/* | |
*You have an array of integers, | |
*and for each index you want to find the product of every | |
*integer except the integer at that index | |
* | |
*Bruteforce Approach: | |
*0(n^2) go through every index and multiply with every nested_index except when index = nested_index | |
* [Better] Greedy Approach: | |
* 0(n) time and space: go through greedly twice | |
* once to multiply before index integers and second for after index integers |
Command.add = function(done){ | |
var str = this.getOperationData() | |
var c = Contact.createContact(str) | |
Contact.saveContact = function (err , c){ | |
if(err) { return done(err)} |