Algorithm Pig Latin

New to Free Code Camp?

JS Concepts

JS Language Reference

Problem Explanation:

You need to create a program that will translate from English to Pig Latin. Check the instructions for converting to Pig Latin from the initial description or the wiki page. It might not be obvious but you need to remove all the consonants up to the first vowel in the case there letter does not start with a vowel.

Hint: 1

You will probably want to use regular expressions. This will allow you to convert the words easily.

Hint: 2

If the first character is a vowel, then take that whole word and add 'way' at the end. Otherwise comes the tricky part, take the consonant(s) before the first vowel and move it to the end and add 'ay'. This is where I had trouble since it was not clear that it was not just the first consonant but all of them before the first vowel.

Hint: 3

You will need to use everything you know about string manipulation to get the last part right. However, it can be done with substr alone.

Spoiler Alert!

Solution ahead!

Code Solution:

First solution

function translate(str) {
  // Create variables to be used
  var pigLatin = '';
  var regex = /[aeiou]/gi;

  // Check if the first character is a vowel
  if (str[0].match(regex)) {
    pigLatin = str + 'way';

  } else {

    // Find how many consonants before the first vowel.
    var vowelIndice = str.indexOf(str.match(regex)[0]);

    // Take the string from the first vowel to the last char
    // then add the consonants that were previously omitted and add the ending.
    pigLatin = str.substr(vowelIndice) + str.substr(0, vowelIndice) + 'ay';
  }

  return pigLatin;
}

Second solution

function translate(str) {
  //finding all the consonants in the beginning of the str. 
  //by using && below I'm achiving a concept called Intersection of Regular Expressions
  //where your pattern finds the union of two or more RegEx rules. 
  //In Java you can achive this with RegEx special character '&&' 
  //but in Javascript you can use the following instead. 
  //Credit goes to http://stackoverflow.com/q/6595477
  var consChars = str.match(/^[a-z]/) && str.match(/[^aeiou]*/).join('');

  //if no consonants found (i.e. str starts with vowels)
  //use replace to remove consonants and construct newStr else add 'way' in the end
  if (consChars !== ''){
    newStr = str.replace(consChars, '') + consChars + "ay";
  } else {
    newStr = str + "way";
  }
  return newStr;
}

Third solution

function translate(str) {
    var strArr = [];
    var tmpChar;

    // check if the char is consonant using RegEx
    function isConsonant(char) {
        return !/[aeiou]/.test(char);
    }

    // return initial str + "way" if it starts with vowel 
    // if not - convert str to array
    if (!isConsonant(str.charAt(0)))
        return str + "way";
    else 
        strArr = str.split("");

    // push all consonats to the end of the array
    while (isConsonant(strArr[0])) {
        tmpChar = strArr.shift();
        strArr.push(tmpChar);
    }
 // convert array to string and concatenate "ay" at the end  
 return strArr.join("")+"ay";
}

translate("consonant");

Fourth Solution (recursive and declarative)

function translate(str) {
  function check(obj) {
    return ['a','i','u','e','o'].indexOf(str.charAt(obj)) == -1 ?
                                              check(obj+1) : obj;}

  return str.substr(check(0))
            .concat((check(0) === 0 ? 
                        'w' : str.substr(0, check(0))) 
                        + 'ay');
}

Code Explanation:

First-Third solution:

Read comments on code.

Fourth solution (recursive and declarative)

Let's start with a recursive function that will go checking for the first letter of the string to be in an array of vowels. In case of consonants, call itself on the next characters until finding the first vowel. It'll return the index of whatever it finds to be the last initial consonant. (i.e. Schmidtsville's would be 3).

Then we'll grab our string, remove the letters up until that index, concatenate either that same chunk of removed string or w accordingly, and then ay regardless.

Credits:

If you found this page useful, you can give thanks by copying and pasting this on the main chat: thanks @Rafase282 @sabahang @aganita @Hallaathrad for your help with Algorithm: Pig Latin

NOTE: Please add your username only if you have added any relevant main contents to the wiki page. (Please don't remove any existing usernames.)

Learn to code and help nonprofits. Join our open source community in 15 seconds at http://freecodecamp.com

Follow our Medium blog
Follow Quincy on Quora
Follow us on Twitter
Like us on Facebook

And be sure to click the "Star" button in the upper right of this page.

FreeCodeCamp/FreeCodeCamp