Luke-Rogerson

const _ = require('lodash');

function highestWordCount (str) {

let resultArray = str.replace(/[.,\/#!$%\^&\*;:{}=\-_`~()0-9]/g, "").split(' ');

let words = {};

for (word of resultArray) {
  let counter = 0;

Luke-Rogerson

const _ = require('lodash');

function highestWordCount (str) {

let resultArray = str.replace(/[.,\/#!$%\^&\*;:{}=\-_`~()0-9]/g, "").split(' ');

let words = {};

for (word of resultArray) {
  let counter = 0;

Luke-Rogerson

function insertionSort (arr) {

  let temp = [];

  for (let i = 1; i < arr.length; i++) {
    for (let j = 0; j < i; j++) {
     // console.log(arr[j]);
      if (arr[i] < arr[j]) {
        temp[0] = arr[i];
        arr[i] = arr[j]; 

Luke-Rogerson

// An implementation of a basic insertion sort.

function insertionSort(arr) {

  let temp = [];

  for (let i = 1; i < arr.length; i++) {
    for (let j = 0; j < i; j++) {
      // console.log(arr[j]);
      if (arr[i] < arr[j]) {

Luke-Rogerson

// A simple selection sort algorithm
function selectionSort (arr) {

let minIndex = 0;
let temp = 0;

for (let i = 0; i < arr.length; i++) {
  minIndex = i;

  for (let j = i + 1; j < arr.length; j++) {

Luke-Rogerson

// A simple selection sort algorithm
function selectionSort(arr) {

  let minIndex = 0;
  let temp = 0;

  for (let i = 0; i < arr.length; i++) {
    minIndex = i;

    for (let j = i + 1; j < arr.length; j++) {

Luke-Rogerson

// --- Directions
// Given a string, return true if the string is a palindrome
// or false if it is not.  Palindromes are strings that
// form the same word if it is reversed. *Do* include spaces
// and punctuation in determining if the string is a palindrome.
// --- Examples:
//   palindrome("abba") === true
//   palindrome("abcdefg") === false

function palindrome(str) {

Luke-Rogerson

// Given a string, return the character that is most
// commonly used in the string.
// --- Examples
// maxChar("abcccccccd") === "c"
// maxChar("apple 1231111") === "1"

function maxChar(str) {

  const charMap = {};
  

Luke-Rogerson

// --- Directions
// Given an array and chunk size, divide the array into many subarrays
// where each subarray is of length size
// --- Examples
// chunk([1, 2, 3, 4], 2) --> [[ 1, 2], [3, 4]]
// chunk([1, 2, 3, 4, 5], 2) --> [[ 1, 2], [3, 4], [5]]
// chunk([1, 2, 3, 4, 5, 6, 7, 8], 3) --> [[ 1, 2, 3], [4, 5, 6], [7, 8]]
// chunk([1, 2, 3, 4, 5], 4) --> [[ 1, 2, 3, 4], [5]]
// chunk([1, 2, 3, 4, 5], 10) --> [[ 1, 2, 3, 4, 5]]

Luke-Rogerson

function anagrams(stringA, stringB) {
  return cleanString(stringA) === cleanString(stringB);
}

function cleanString(str) {
  return str
    .replace(/[^\w]/g, '')
    .toLowerCase()
    .split('')
    .sort()