asankulov-kylych_Backend20120Hour20Test20Pre-screen

solution.js

(function main() {
  const origArr = [
    'AMOR', 'XISELA', 'JAMON', 'ROMA', 'OMAR', 'MORA', 'ESPONJA', 
    'RAMO', 'JAPONES', 'ARMO', 'MOJAN', 'MARO', 'ORAM', 'MONJA', 'ALEXIS'
  ];
  groupSimilarWordsAndPrintThem(origArr);
  
  const str = 'foo(foo(bar(str))(opg))blim';
  removeParenthesesAndReverseTheWordsInsideThem(str);
}());

function groupSimilarWordsAndPrintThem(arr) {
  const hashMap = {};
  
  for (let i = 0; i < arr.length; i++) {
    let tempStr = arr[i].split('').sort().join('');
    if (!hashMap[tempStr]) hashMap[tempStr] = arr[i];
    else hashMap[tempStr] += ` - ${arr[i]}`;
  }
  
  for (let key in hashMap) {
    console.log(hashMap[key]);
  }
}

function removeParenthesesAndReverseTheWordsInsideThem(str) {
  let res = '', stk1 = [], stk2 = [];
  for (let i = 0; i < str.length; i++) {
    if (str[i] === '(') {
      stk1.push(str[i]);
    } else if (str[i] === ')') {
      stk1.pop();
      if (stk1.length) {
        if (stk2.length) {
          stk2.push(stk2.pop().split('').reverse().join(''));
        }
      }
      else {
        while (stk2.length) {
          res += stk2.pop();
        }
      }
    } else if (stk1.length) {
      let tempStr = '';
      while (str[i] !== ')' && str[i] !== '(') {
        tempStr = str[i] + tempStr;
        i++;
      }
      i--;
      stk2.push(tempStr);
    } else {
      res += str[i];
    }
  }
  
  console.log(res);
}