알고리즘

function solution(fees, records) { var h,f,m,fe = fees; var incar = new Map(); var outcar = new Map(); var cararr = \[]; for (let key i

function solution(number, k) { var x = number.length - k; var stack = \[]; for(let i=0; i<number.length;i++){ var comp = numberi;

function solution(expression) { var result = \[]; var arr = \[ '\*','+','-', '\*','-','+', '+','\*','-',

function solution(files) { var z= files.sort((a,b)=>{ var ahead,anumber,atail =a.toUpperCase().split(/(0-9{1,})/); var bhead,bnumber,bta

https://programmers.co.kr/learn/courses/30/lessons/43165function solution(numbers, target) { var answer=0; function dfs(count,val){ if

function solution(n) { n= n.toString(3).split(''); while(n.indexOf('0')>-1){ var index = n.indexOf('0'); nindex-1 = String(nindex-1 -

function solution(line) { var arr =\[]; var arrx = \[]; var arry = \[]; for(let i = 0; i<line.length; i++ ){ for(let j= i+1; j<

function solution(n){}

function solution(numbers) { var answer=\[]; for(let i=0; i <numbers.length; i++){ var x = gg(numbersi); answer.push(x); } fu

var arr1 = \[]; var arr2 = \[]; var max = 0; var min = 0; str1 = str1.toUpperCase(); str2 = str2.toUpperCase(); for(let i=0;i<

function solution(n, k) { var result = 0; var arr =n.toString(k).split(/0{1,}/); for(let i=0;i<arr.length; i++){ result += gg(arri);

최초 코드 75 시간초과수정코드 신고당한 사람을 기준으로 정리