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
| function multiples() { | |
| var sum = 0; | |
| for (var i = 0; i < 1000; i++) { | |
| if (i % 3 == 0 || i % 5 == 0) | |
| sum += i; | |
| } | |
| return sum; | |
| } |
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
| /* iterative fibonacci sequence O(n) */ | |
| function fibo(n) { | |
| var fiboArr = [0, 1]; | |
| for (var i = 1; i < n; i++) { | |
| fiboArr.push(fiboArr[i - 1] + fiboArr[i]); | |
| } | |
| return fiboArr; | |
| } | |
| function fiboSum(n) { |
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
| /* iterative fibonacci sequence O(n) */ | |
| function fibo(n) { | |
| var fiboArr = [0, 1]; | |
| for (var i = 1; i < n; i++) { | |
| fiboArr.push(fiboArr[i - 1] + fiboArr[i]); | |
| } | |
| return fiboArr; | |
| } | |
| function fiboSum(n) { |
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
| function swap(arr, a, b) { | |
| var tmp = arr[a]; | |
| arr[a] = arr[b]; | |
| arr[b] = tmp; | |
| } | |
| function sort(arr) { | |
| var i = 0; | |
| var isSorting = false; | |
| while (i < arr.length) { |
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
| use std::mem; | |
| fn main() { | |
| } | |
| fn cityhash32(mut s: &[u8], len: usize) -> u32 { // mut s: &[u8] | |
| if len <= 24 { | |
| return if len <= 12 { | |
| if len <= 4 { | |
| hash32Len0to4(s, len) |
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
| import React, { Component } from 'react'; | |
| import './App.css'; | |
| import ReactTable from './react-sample-table'; | |
| class App extends Component { | |
| render() { | |
| return ( | |
| <div className="main main-raised"> | |
| <div className="container"> | |
| <ReactTable /> |
People
:bowtie: |
๐ :smile: |
๐ :laughing: |
|---|---|---|
๐ :blush: |
๐ :smiley: |
:relaxed: |
๐ :smirk: |
๐ :heart_eyes: |
๐ :kissing_heart: |
๐ :kissing_closed_eyes: |
๐ณ :flushed: |
๐ :relieved: |
๐ :satisfied: |
๐ :grin: |
๐ :wink: |
๐ :stuck_out_tongue_winking_eye: |
๐ :stuck_out_tongue_closed_eyes: |
๐ :grinning: |
๐ :kissing: |
๐ :kissing_smiling_eyes: |
๐ :stuck_out_tongue: |
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
| var walked = []; | |
| var searchHaystack = function(haystack, needle, path, exactEquals) { | |
| //dumb truthiness handling | |
| exactEquals = exactEquals ? true : false; | |
| if(typeof haystack != "object") { | |
| console.warn("non-object haystack at " + path.join(".")); | |
| return [false, null]; |