🌱

Nicholas Porter porteron

🌱

Nicholas Porter

porteron / scevent.min.js

Last active September 1, 2019 15:07

Snapchat's Horrible Tracking Script - Initially found at https://sc-static.net/scevent.min.js on Aug-31-2019

	try {
	! function(u, s, e) {
	"use strict";
	var n = function() {
	function n(e) {
	return e && e.performance ? e.performance : null
	}
	var t = !1,
	r = null;
	try {

porteron / flattenJson.js

Last active July 31, 2019 01:58

Flatten json to a structure where the keys are paths to the values

porteron / shiftedBinarySearch.js

Last active July 30, 2019 05:28

A sorted array has been rotated so that the elements might appear in the order: [3 4 5 6 7 1 2]. How would we find the minimum element?

	function search(arr, start, end){
	var mid = getMidpoint(start, end);

	if(arr[mid-1] > arr[mid] && arr[mid+1] > arr[mid]){
	console.log("Found Min: "+ arr[mid], mid)
	return arr[mid];
	}

	if(arr[start] < arr[mid]){
	// is sorted

porteron / checkSubstring.js

Created July 30, 2019 05:16

Check if a string is substring of another

	function checkSubstring(substr, word){
	if(substr.length > word) return false;
	if(substr.length && !word.length) return false;

	for(let i = 0; i < word.length; i++){
	if(word[i] === substr[0]){
	if(compareStrings(word.substr(i, substr.length), substr)){
	return true;
	}
	}

porteron / permutations.js

Created July 30, 2019 05:15

Find all permutations of a string.

porteron / mergeSort.js

Created July 30, 2019 04:34

Merge Sort in JavaScript. Divide and Conquer. Recursively call mergeSort function on the subsets of the array, sort them, and merge back together.

	function mergeSort(arr){

	if(arr.length < 2){
	return arr;
	}

	// Get mid point
	var mid = Math.floor(arr.length / 2);

	var left = mergeSort(arr.slice(0, mid));

porteron / islandCount.js

Created July 30, 2019 04:31

Count the number of islands in the matrix graph. Uses Depth First Search in JavaScript.

porteron / binarySearchTree.js

Created July 30, 2019 04:29

Binary Search Tree in JavaScript. Finds path between two nodes in Binary Search Tree.

porteron / react-app-file-structure

Created March 3, 2017 04:21 — forked from ryanflorence/react-app-file-structure