알고리즘 읽기 노트

Queue

A queue is FIFO: the first item that enters is the first item that leaves.

유형자료구조카테고리Data Structures깊이초급일반적인 복잡도enqueue/dequeue O(1)

짧은 면접 답변

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

A queue is FIFO: the first item that enters is the first item that leaves.

간단한 설명

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

Values enter at the rear and leave from the front.

Queues are ideal when work must be processed in arrival order.

실행

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

Identify the invariant that must always remain true.

Follow the read/update path through the structure.

After a mutation, restore the invariant before returning.

기억해 둘 작은 예제

enqueue A, B, C; dequeue returns A first.

읽기 쉬운 JavaScript 구현JavaScript

class Queue {
  #items = [];
  #head = 0;
  enqueue(value) { this.#items.push(value); }
  dequeue() {
    if (this.#head >= this.#items.length) return undefined;
    return this.#items[this.#head++];
  }
}

이 코드를 읽는 방법

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

복잡도

enqueue/dequeue O(1)

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.

언제 사용하는가

적합한 경우

BFS
Job scheduling
Request buffering

흔한 실수

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

Memorizing complexity without understanding representation.
Ignoring worst-case shape or resizing/rebalancing costs.

면접에서 설명하는 방법

전문적인 답변 구조

Mention FIFO and explain that a production JS queue should avoid repeated Array.shift() for large workloads; use a head index or deque implementation.

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

빠른 면접 체크

What problem does Queue solve?

A queue is FIFO: the first item that enters is the first item that leaves.

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

Its typical cost here is enqueue/dequeue O(1), but a complete answer should connect that cost to the representation, input constraints and the dominant operations.

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

Memorizing complexity without understanding representation.

계속 읽기DequeBFSPriority Queue

class Queue { #items = []; #head = 0; enqueue(value) { this.#items.push(value); } dequeue() { if (this.#head >= this.#items.length) return undefined; return this.#items[this.#head++]; } }