var arr = '';
process.stdin.on('data',function(chunk){
arr += chunk;
});
process.stdin.on('end',function(){
arr = arr.split('\n');
let test_case = parseInt(arr[0]),stack,i=1,status=[],stack_val=[],ss;
while(i<=test_case){
ss = arr[i];
if(ss == 'MIN'){
if(stack_val.length > 0){
status.sort(function(a,b){ return a-b; });
console.log(status[0]);
}else console.log("EMPTY");
}else if(ss == 'POP'){
if(stack_val.length > 0){
stack_val.pop();
status = Array.from(stack_val);
}else console.log("EMPTY");
}else{
stack_val.push(arr[i].split(' ')[1]);
status = Array.from(stack_val);
}
i++;
}
});
I have written this minstack problem in node.js, but I am getting a “time limit exceeded” error. Can anyone help me out with this?