Skip to content

Instantly share code, notes, and snippets.

@silverjam
silverjam / AddHeaderNumbers.js
Last active September 28, 2016 19:25
Google apps script to add header numbers to a document
var state = {
headerLevel1: 0,
headerLevel2: 0,
headerLevel3: 0,
}
var private = {
getSectionNumber: function (paragraph)
{
if ( paragraph.getHeading() == DocumentApp.ParagraphHeading.HEADING1 )
@silverjam
silverjam / intents.json
Created August 10, 2016 18:12
Alexa Lambda Arduino
{
"intents": [
{
"intent": "YourDino"
},
{
"intent": "HasTeradactyl"
}
]
}

Keybase proof

I hereby claim:

  • I am silverjam on github.
  • I am silverjam (https://keybase.io/silverjam) on keybase.
  • I have a public key whose fingerprint is 419A 9B7C 828C 5976 E6E5 8479 5D43 186D E68D C7DD

To claim this, I am signing this object:

import java.util.*;
public class HasUniqueChars
{
public static boolean hasUniqueChars(String toTest)
{
char charArray[] = toTest.toCharArray();
Arrays.sort(charArray);
for (int x = 1; x < charArray.length; x++)
@silverjam
silverjam / MaxNodesInLevel.java
Created February 9, 2013 05:25
Given a binary tree return the level with maximum number of nodes.
import java.util.*;
import java.lang.*;
class Main
{
public static void countLevels(Integer tree[], int index, int levels[], int level)
{
if ( index >= tree.length )
return;
@silverjam
silverjam / DfsAndBfs.java
Created February 9, 2013 04:57
(1) Implement a breadth first search non-recursively (2) Implement a depth first search non-recursively (3) Implement a breadth first search recursively (4) Implement a depth first search recursively
import java.util.*;
class Node
{
public Integer value;
public int index;
public int level;
public Node(int index, int value, int level)
import java.util.*;
class Main
{
public static void sumsTo(int nums[], int sum)
{
HashMap<Integer, Integer> hash = new HashMap<Integer, Integer>();
for(int num : nums)
hash.put(num, 1);
@silverjam
silverjam / TreeTraversal.pde
Last active December 12, 2015 05:08
TreeTraversal
static final float CANVAS_X = 900;
static float CANVAS_Y = 0; // compute me later
class Node
{
Integer value;
int level;
int levelOffset;
int index;
// Answering the "how many squares" problem (my answer = 40):
//
// http://media-geeks.com/special-features/how-many-squares-indeed/
//
// HasCanvas:
//
// http://hascanvas.com/Counting-Squares
//
// GIF outptu:
//
#include <cstdio>
struct klass1
{
bool operator!() { return false; }
};
struct klass2
{
klass1 operator!() { return klass1(); }