Jason Seegmiller itzjonas

## oneliners.js
// Remove any duplicates from an array of primitives
const unique = [...new Set(arr)];

// Sleep in async functions.  Use: await sleep(2000)
const sleep = (ms) => (new Promise(resolve => setTimeout(resolve, ms)));

// Type this in your code to break chrome debugger in that line.
debugger;

// Just plain english.

## SumOfPrimes.js
import React from 'react';
import { render } from 'react-dom';

function sumOfPrimes(e) {
    e.preventDefault();

    const num = document.getElementById('num').value;

    if(num > 100000) {
        document.getElementById('answer').innerHTML = 'ERROR: exceeds CodeSandbox infinite loop failsafe.';

## StarTowerNew.js
const starTowerNew = levels => [...Array(levels)].map((v, i) => '*'.repeat(i * 2 + 1).padStart(i + levels).padEnd(levels * 2 - 1));

console.log(starTowerNew(20));

## SearchFind.html
<head>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <meta http-equiv="X-UA-Compatible" content="ie=edge">
    <title>Search &amp; Find</title>
    <link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0/css/bootstrap.min.css" integrity="sha384-Gn5384xqQ1aoWXA+058RXPxPg6fy4IWvTNh0E263XmFcJlSAwiGgFAW/dAiS6JXm" crossorigin="anonymous">
</head>
<body>
    <div id="app" />


## LinkedList.js
class LinkedList {
    constructor(...values) {
        this.head = null;
        this.length = 0;
        this.add(...values);
    }

    /**
     * Individually adds a new node to the head of the linked list.
     *
	// Remove any duplicates from an array of primitives
	const unique = [...new Set(arr)];

	// Sleep in async functions. Use: await sleep(2000)
	const sleep = (ms) => (new Promise(resolve => setTimeout(resolve, ms)));

	// Type this in your code to break chrome debugger in that line.
	debugger;

	// Just plain english.
	import React from 'react';
	import { render } from 'react-dom';

	function sumOfPrimes(e) {
	e.preventDefault();

	const num = document.getElementById('num').value;

	if(num > 100000) {
	document.getElementById('answer').innerHTML = 'ERROR: exceeds CodeSandbox infinite loop failsafe.';
	const starTowerNew = levels => [...Array(levels)].map((v, i) => ''.repeat(i 2 + 1).padStart(i + levels).padEnd(levels * 2 - 1));

	console.log(starTowerNew(20));
	<head>
	<meta charset="UTF-8">
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<meta http-equiv="X-UA-Compatible" content="ie=edge">
	<title>Search & Find</title>
	<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0/css/bootstrap.min.css" integrity="sha384-Gn5384xqQ1aoWXA+058RXPxPg6fy4IWvTNh0E263XmFcJlSAwiGgFAW/dAiS6JXm" crossorigin="anonymous">
	</head>
	<body>
	<div id="app" />
	class LinkedList {
	constructor(...values) {
	this.head = null;
	this.length = 0;
	this.add(...values);
	}

	/**
	* Individually adds a new node to the head of the linked list.
	*