Time Complexity

Solution Reference: https://programmers.co.kr/questions/17409 Task https://programmers.co.kr/learn/courses/30/lessons/12973 Given a string of characters, if two of the same alphabet in a row is to be deleted until there is none left, check if this possible with the given string. Solution function solution(s) { // Split string into array let arr = s.split(''); // Set temporary stack array let temp = []; // If string length is odd number, return 0 if (arr.