app.js

// Important Note - No Built-in functions to be used
// Progression 1: Names and Input

// 1.1 Create a variable `ProGrad-1` with the driver's name.
// 1.2 Print `"The driver's name is XXXX"`.
// 1.3 Create a variable `ProGrad-2` with the navigator's name.
// 1.4 Print `"The navigator's name is YYYY"`.

var ProGrad_1 = "HARIPRIYA";
console.log(`"The dirver's name is ` + ProGrad_1 + `"`);
var ProGrad_2 = "ShaikMahammadMusayyeb";
console.log(`"The navigators's name is ` + ProGrad_2 + `"`);

// Progression 2: Control Statements - 1
// 2.1. Depending on which name is longer, print:
// - The driver has the longest name, it has XX characters. or
// - It seems that the navigator has the longest name, it has XX characters. or
// - Wow, you both have equally long names, XX characters!.
if (ProGrad_1.length > ProGrad_2.length) {
  console.log(
    "The driver has the longest name, it has " +
    ProGrad_1.length +
    " characters."
  );
} else if (ProGrad_1.length < ProGrad_2.length) {
  console.log(
    "It seems that the navigator has the longest name, it has " +
    ProGrad_2.length +
    " characters."
  );
} else {
  console.log(
    "Wow, you both have equally long names, " +
    ProGrad_2.length +
    " characters."
  );
}

// 2.2. Check if the string contains vowels or not.
// - If it contains vowels, print the number of name, and also print the vowel letters along with the vowel characters. or
// - print no vowels
var proGrad_2 = ProGrad_2.toLowerCase();
for (
  var length = proGrad_2.length, position = 0; length >= 0; length--, position++
) {
  switch (proGrad_2[position]) {
    case "a":
      console.log("Found " + proGrad_2[position] + " at position " + position);
      break;
    case "e":
      console.log("Found " + proGrad_2[position] + " at position " + position);
      break;
    case "i":
      console.log("Found " + proGrad_2[position] + " at position " + position);
      break;
    case "o":
      console.log("Found " + proGrad_2[position] + " at position " + position);
      break;
    case "u":
      console.log("Found " + proGrad_2[position] + " at position " + position);
      break;
  }
}

// 2.3. Check if the string contains uppercase and lowercase characters Xx
// - Print the number of upper case characters
// - Print the number of lower case characters

var proGrad = "CapitaliZed ChaRaCtErS";
var length = proGrad.length;
var position = 0,
  capsCount = 0,
  smallCount = 0;
proGrad = proGrad.trim();
console.log(proGrad);
while (length >= 0) {
  if (proGrad.charCodeAt(position) > 64 && proGrad.charCodeAt(position) <= 90) {
    console.log(proGrad[position]);
    capsCount++;
  } else {
    smallCount++;
  }
  length--;
  position++;
}
console.log("Nunber of Upper Case Letters are " + capsCount);
console.log("Nunber of Lower Case Letters are " + smallCount);

// Progression 3: Control Statements - 2
// 3.1 Print all the characters of the driver's name, separated by a space and in capitals i.e. "ProGrad"

var test = '';

for (var i = 0; i < ProGrad_1.length; i++) {
  test += ProGrad_1.charAt(i) + ' ';
}
test = test.toUpperCase();
console.log(test);

// 3.2 Print all the characters of the navigator's name, in reverse order. i.e. "darGorP"
for (var length = ProGrad_2.length; length >= 0; length--) {
  console.log(ProGrad_2[length]);
}
// 3.3 Merge both the characters such that driver is followed by Navigator like "ProGrad FACEPrep"
// - Now bring the FACEPrep to the start and send ProGrad to the back like "FACEPrep ProGrad"
console.log(ProGrad_1 + " " + ProGrad_2);
console.log(ProGrad_2 + " " + ProGrad_1);
// 3.3 Depending on the lexicographic order of the strings, print:
// - The driver's name goes first.
// - Yo, the navigator goes first definitely.
// - What?! You both have the same name?
if (ProGrad_1.localeCompare(ProGrad_2) == -1 || ProGrad_1.localeCompare(ProGrad_2) == -2)
  console.log(`${ProGrad_1} comes first`);
else if (ProGrad_1.localeCompare(ProGrad_2) == 1 || ProGrad_1.localeCompare(ProGrad_2) == 2)
  console.log(`${ProGrad_2} comes first`);
else
  console.log(" What?! You both have the same name?")
// Bonus Time!
// Bonus 1:
// Go to lorem ipsum generator and:
// Generate 3 paragraphs. Store the text in a variable type of string.
// Make your program count the number of words in the string.
// Make your program count the number of times the Latin word et appears.
// Bonus 2:
// Create a new variable phraseToCheck and have it contain some string value. Write a code that will check if the value we assigned to this variable is a Palindrome. Here are some examples of palindromes:

// "A man, a plan, a canal, Panama!"
// "Amor, Roma"
// "race car"
// "stack cats"
// "step on no pets"
// "taco cat"
// "put it up"
// "Was it a car or a cat I saw?" and "No 'x' in Nixon".

// Hint: If you use Google to help you to find solution to this iteration, you might run into some solutions that use advanced string or array methods (such as join(), reverse(), etc.). However, try to apply the knowledge you currently have since you can build pretty nice solution with just using for loop, if-else statements with some break and continue... Just sayin'