알고리즘 읽기 노트

Valid Parentheses

Valid Parentheses checks whether every opening bracket is closed by the matching bracket in the correct nesting order. A stack models that nesting naturally.

유형알고리즘카테고리Classic Problems깊이초급일반적인 복잡도Varies by implementation / input constraints

짧은 면접 답변

이 멘탈 모델부터 시작하세요

Valid Parentheses checks whether every opening bracket is closed by the matching bracket in the correct nesting order. A stack models that nesting naturally.

간단한 설명

불필요한 전문용어 없이 동작 방식 이해하기

Push opening brackets.

For each closing bracket, pop and verify that it matches. At the end the stack must be empty.

실행

알고리즘을 연속된 의사결정으로 읽기

Restate constraints and edge cases.

Identify the pattern and invariant.

Walk through a small example before coding.

기억해 둘 작은 예제

Read a tiny input by hand and write down the state after every important operation. For Valid Parentheses, the goal is to make the invariant visible rather than to memorize code.

읽기 쉬운 JavaScript 구현JavaScript

function isValid(input) {
  const match = { ")": "(", "]": "[", "}": "{" };
  const stack = [];
  for (const ch of input) {
    if ("([{ ".includes(ch) && ch !== " ") stack.push(ch);
    else if (match[ch] && stack.pop() !== match[ch]) return false;
  }
  return stack.length === 0;
}

이 코드를 읽는 방법

문법을 외우지 마세요. 각 줄에서 바뀌는 상태를 따라가고 위에서 설명한 불변식과 연결하세요.

복잡도

Varies by implementation / input constraints

Do not quote this complexity mechanically. Ask which operation or input dimension it describes, then derive the cost from the loops, recursion depth, data-structure operations and any preprocessing assumptions.

언제 사용하는가

적합한 경우

Use the recognized pattern when its invariant matches the problem constraints.

흔한 실수

보통 어디에서 문제가 생기는가

Jumping to code before defining the invariant.
Optimizing before producing a correct baseline.

면접에서 설명하는 방법

전문적인 답변 구조

This is a classic example of choosing a data structure from the problem's structure: nested last-opened-first-closed behavior directly implies a stack.

문제→핵심 아이디어→불변식 / 상태→Big-O→트레이드오프

빠른 면접 체크

What problem does Valid Parentheses solve?

Valid Parentheses checks whether every opening bracket is closed by the matching bracket in the correct nesting order. A stack models that nesting naturally.

복잡도에 대해 무엇을 언급해야 하나요?

Its typical cost here is Varies by implementation / input constraints, but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

가장 흔한 실수는 무엇인가요?

Jumping to code before defining the invariant.

계속 읽기Problem patternsEdge casesComplexity trade-offs

function isValid(input) { const match = { ")": "(", "]": "[", "}": "{" }; const stack = []; for (const ch of input) { if ("([{ ".includes(ch) && ch !== " ") stack.push(ch); else if (match[ch] && stack.pop() !== match[ch]) return false; } return stack.length === 0; }