text: //?  FREQUENCY COUNTER
  
  //*  Given two strings, write a function to determine if the second string is an anagram of the first. An anagram is a word, phrase, or name formed by rearranging the letters of another, such as cinema, formed from iceman. Use the frequency counter approach to solve this.
  
  
  function validAnagram(str1, str2){
      // TODO: Edge case of str1 and str2 not being the same length
  
      // TODO: Create frequency counters to keep track of each characters in both strings
  
      // TODO: loop over the letters in str1
      for() {
          
          // TODO: Increase the counter of the current char in str1 in the loop
  
      }
  
      // TODO: loop over the letters in str2
      for() {
  
          // TODO: Increase the counter of the current char in str2 in the loop
  
      }
  
      // TODO: Loop over the frequency counter keys to see each key value
      for () {
          
          // TODO: check to see if there are any missing characters in either frequency counters, 
          if () {
  
              // TODO: if so return false
  
          }
          
          // TODO: check to see if there are the same amount of characters in both strings
          if () {
  
              // TODO: if not return false
  
          }
          
          
      }
  
      // TODO: if we make it this far, what do we return?
      
  }
  