ambergkim

function mutation(arr) {
  firstWord = arr[0].toLowerCase();
  secondWord = arr[1].toLowerCase().slice('');
  lettersFound = 0;
  for(i=0; i<secondWord.length; i++){
    indexSearch = secondWord[i];
    indexSearchResult = firstWord.indexOf(indexSearch, 0);
    if(indexSearchResult == -1) {
       return false;
       } else {

ambergkim

function bouncer(arr) {
  filteredArr = arr.filter(Boolean);
  return filteredArr;
}

bouncer([7, "ate", "", false, 9]);

ambergkim

Amber Kim

Software Developer, Web Designer

Redmond, WA | (561) 271-6997

[email protected] | https://www.linkedin.com/in/ambergkim/

https://ambergkim.github.io/ | https://github.com/ambergkim

Founder of Amber Kim Design & Full Stack Software Developer with a background in Web Design & marketing. Passionate about maximizing user experience, manageability, and minimizing code & system complexity.

ambergkim

// *******************
// callback version
// *******************

function getDataCallback(data) {
  // do something with the new data data
}

function getData(callback) {
  // getting the data

ambergkim

// Roman Numerals
// I, II, III, IV, V, VI, VII, VIII, IX, X
// X, XX, XX, XL, L, LX, LXX, LXXX, XC, C
// C, CC, CCC, CD, D, DC, DCC, DCCC, CM, M

// EXAMPLES:
// 2018: MM X VIII
// 199: C XC IX

// Input: Integer

ambergkim

// Inputs: int, divideByInt
// Output: Int

// Sets

// Current Set

// Loop through int
  // if current < divide
    // current ++

ambergkim

// Input: str
// Output: true or false

// Example: madam -> 5 length, odd
// Example: wowwow -> 6 length, even
// Example: hello -> fail, odd
// Example: hi -> fail, even

// isPalindrome(str)
  // midpoint str/2 ceil -1

ambergkim

// Input: int, divInt
// Output: int

// helper
  // return whole sets & remainder
  // input: int, divInt
  // output: [sets, remainder]

// main
  // fin str

ambergkim

// only list duplicates once
// return array of duplicates

// helper findInstances(array)
  // obj
  // loop through array
    // if no key in obj, create key
  // return obj

// main findSimilar(arr1, arr2) 

ambergkim

// O(N)

function remDupes(arr) {
  // have we seen this?
  let hash = [];

  // pointer 1
  p = -1;

  // establish i as pointer 2