freecodecamp Caesars Cipher Project Solution

caesars-cipher-rot13

//'A'.charCodeAt() === 65
// 'N'.charCodeAt() === 78

#Solution No.1
    function rot13(str) {
      let result  = ''; 
      for(let i = 0; i < str.length; i++) {
        let char = str[i];
        if(/[A-Z]/.test(char)) {
          let value = char.charCodeAt();  
          
          // if value < 78, move forward by 13 
          // else move backward by 13 
          value = value < 78 ? (value + 13): (value -13) 
         
          result += String.fromCharCode(value);
        } else {
          result += char; 
        }
      }
      return result;
    }

#Solution No.2: 
    function rot13(str) {
      let result  = ''; 
      for(let i = 0; i < str.length; i++) {
        let char = str[i];
        if(/[A-Z]/.test(char)) {
          const value = (char.charCodeAt()- 65 + 13) % 26 + 65; 
        } else {
          result += char; 
        }
      }
      return result;
    }


Problem Link:
https://www.freecodecamp.org/learn/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/caesars-cipher