clarketm

#!/usr/bin/env python

'''
This script will attempt to open your webbrowser,
perform OAuth 2.0 authentication and print your access token.

To install dependencies from PyPI:
  $ pip install oauth2client

Then run this script:

clarketm

# first:
lsbom -f -l -s -pf /var/db/receipts/org.nodejs.pkg.bom | while read f; do  sudo rm /usr/local/${f}; done
sudo rm -rf /usr/local/lib/node /usr/local/lib/node_modules /var/db/receipts/org.nodejs.*

# To recap, the best way (I've found) to completely uninstall node + npm is to do the following:

# go to /usr/local/lib and delete any node and node_modules
cd /usr/local/lib
sudo rm -rf node*

clarketm

grid = [['.', '.', '.', '.', '.', '.'],
        ['.', 'O', 'O', '.', '.', '.'],
        ['O', 'O', 'O', 'O', '.', '.'],
        ['O', 'O', 'O', 'O', 'O', '.'],
        ['.', 'O', 'O', 'O', 'O', 'O'],
        ['O', 'O', 'O', 'O', 'O', '.'],
        ['O', 'O', 'O', 'O', '.', '.'],
        ['.', 'O', 'O', '.', '.', '.'],
        ['.', '.', '.', '.', '.', '.']]

clarketm

function cyclicRotation(array, times) {
    var rotatedArray = array;
    
    while (times > 0) {
        var currentArray = rotatedArray.slice();
        
        for (var i = 0; i < currentArray.length; i++) {
            rotatedArray[(i+1)%currentArray.length] = currentArray[i];   
        }
        times--;

clarketm

function largestBinaryGap(num) {
  var bin = Math.abs(num).toString(2),
      finalMax = 0,
      currentMax;
  
  for (var i = 0; i < bin.length; i++) {
    currentMax = 0;
    while (bin[i] === "0") {
      ++currentMax && ++i;
    }

clarketm

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

• Stores data elements based on an sequential, most commonly 0 based, index.
• Based on tuples from set theory.

clarketm

function binarySearch(array, target) {

  var startIndex = 0,
      stopIndex = array.length - 1,
      middle,
      count = 0;

  while (startIndex < stopIndex) {
    count++;
    middle = ~~((stopIndex + startIndex) / 2);

clarketm

function findMinBinarySearch(array) {
  var left = 0, // index of first element
      right = array.length - 1, // index of last element.
      mid, // midpoint
      count = 0;

  while (array[left] > array[right]) {
    count++;
    mid = ~~((left + right) / 2); // math.floor of the midpoint
    if (array[mid] > array[right]) {

clarketm

function isRansomNotePossible(newsArticle, ransomNote) {
  let availableChars = new Map();

  for (let r of newsArticle) {
    let asciiCode = newsArticle.charCodeAt(r);
    availableChars.set(asciiCode, (availableChars.get(asciiCode) || 0) + 1);
  }

  for (let r of ransomNote) {
    let asciiCode = ransomNote.charCodeAt(r);

clarketm

function isRansomNotePossible(newsArticle, ransomNote) {
  var availableChars = {};

  for (var r = 0; r < newsArticle.length; r++) {
    var asciiCode = newsArticle.charCodeAt(r);
    availableChars[asciiCode] = (availableChars[asciiCode] || 0) + 1
  }

  for (var r = 0; r < ransomNote.length; r++) {
    var asciiCode = ransomNote.charCodeAt(r);