freeCodeCamp algorithm challenges

Quick solutions to the JavaScript algorithm challenges in the freeCodeCamp curriculum.
    function convertToF(celsius) {
      let fahrenheit = celsius * 9/5 + 32;
      return fahrenheit;
    }
    
    console.log(convertToF(-30));
    
    /*
    
    convertToF(0) should return a number
    convertToF(-30) should return a value of -22
    convertToF(-10) should return a value of 14
    convertToF(0) should return a value of 32
    convertToF(20) should return a value of 68
    function reverseString(str) {
      return str.split("").reverse().join("");
    }
    
    console.log(reverseString("Greetings from Earth"));
    
    /*
    reverseString("hello") should return a string.
    reverseString("hello") should become "olleh".
    reverseString("Howdy") should become "ydwoH".
    reverseString("Greetings from Earth") should return "htraE morf sgniteerG".
    */
    function factorialize(num) {
        if (num === 0) { return 1;}
        return num * factorialize(num-1);
        /* 
        5*4*3*2*1*1
        */
    }
    
    console.log(factorialize(5));
    
    /*
    Factorials are often represented with the shorthand notation n!
    For example: 5! = 1 * 2 * 3 * 4 * 5 = 120
    
    function findLongestWordLength(str) {
      var words = str.split(" ");
      var maxLength = 0;
      for(var i = 0; i < words.length; i++) {
        if(words[i].length > maxLength) {
          maxLength = words[i].length;
        }
      }
      return maxLength;
    }
    
    console.log(findLongestWordLength("What if we try a super-long word such as otorhinolaryngology"));
    
    /*