Skip to content

Instantly share code, notes, and snippets.

Arabinda Dora nullv01d

Block or report user

Report or block nullv01d

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
nullv01d / extract.js
Created May 3, 2020
Extract Chrome tabs from Android
View extract.js
* @author nullv01d
* Purpose: Extract Google Chrome tabs from an Android device
* Tested on: Google Chrome 81 on Computer
* Steps:
* 1. Enable USB debugging on your Android device and connect it with the computer
* 2. Open Google Chrome on the computer and goto chrome://inspect/#devices
* 3. Make sure "Discover USB devices" is enabled
* 4. The Android device's name and Chrome tabs' names and links should appear
* 5. Open a Chrome DevTools Console and run the code below
View es6kata-40.js
// 40: iterator - one example usage. Build an iterable and use it with some built-in ES6 constructs.
// To do: make all tests pass, leave the assert lines unchanged!
// Consumable users:
// - `consumableUser` contains a consumable user,
// - `anyLeft` tells if there is any user left that can be consumed.
class ConsumableUsers {
constructor() {
this.users = ['Alice', 'Bob'];
nullv01d / Gulpfile.js
Created Jul 29, 2016 — forked from Hendrixer/Gulpfile.js
Gulpfile with Livereload, Nodemon, and other features
View Gulpfile.js
var gulp = require('gulp'),
concat = require('gulp-concat'),
plumber = require('gulp-plumber'),
server = require('tiny-lr')(),
refresh = require('gulp-livereload'),
mocha = require('gulp-mocha'),
stylus = require('gulp-stylus'),
notify = require('gulp-notify'),
nodemon = require('gulp-nodemon'),
jshint = require('gulp-jshint'),
nullv01d /
Last active Oct 3, 2015 — forked from m00nlight/gist:a076d3995406ca92acd6
Python merge sort in place, so space complexity is O(1)
import random
def merge_sort(xs):
"""Inplace merge sort of array without recursive. The basic idea
is to avoid the recursive call while using iterative solution.
The algorithm first merge chunk of length of 2, then merge chunks
of length 4, then 8, 16, .... , until 2^k where 2^k is large than
the length of the array
You can’t perform that action at this time.