Yòmá's Notes

  • About
  • 🗺️ - Computer Science
    • 1 Foundations & Theory
      • 🗺️ - Algorithms
        • 🗺️ - PS
          • boj
            • 11660
              • 11660
            • 14626
              • 14626
            • 18111
              • 18111
          • README
        • math
          • % in cpp, python
          • gcd, lcm
          • 소수 판별법
        • Named Algorithms
          • Bellman-Ford Algorithm
          • Dijkstra's Algorithm
          • Eulerian Path
          • Floyd-Warshall Algorithm
          • Hierholzer's algorithm
          • Imos Algorithm
          • Knuth–Morris–Pratt Algorithm
          • Kruskal's Algorithm
          • Prim's Algorithm
          • Rabin Karp Algorithm
        • 0-1 BFS
        • Back Tracking
        • BFS
        • Binary Search
        • Bitmask
        • Combination
        • DFS
        • DP
        • DP with Bitmask
        • DP 유형
        • Graph
        • Greedy
        • Hash
        • Heap Sort, Heapify
        • Minimum Spanning Tree (MST) - 최소 신장 트리
        • Permutation
        • Prefix Sum Array
        • PS Site
        • Quick Sort
        • Strongly Connected Component
        • Subset
        • Terms
        • Time Complexity
        • Tips
        • Topological Sorting
        • Traveling Salesman Problem
        • Tree
        • Two Pointers
        • Union-Find
      • Data Structures
        • Fenwick tree (index tree)
      • Game Theory
        • Nim
      • Theory of Computation
        • 32bit vs 64bit
        • context switching
        • CPU 스케줄링
        • critical section
        • frame
        • OS Lecture
        • page
        • page fault
        • PCB
        • Single source of truth
        • Thrashing
        • 메모리 할당
        • 프로세스의 상태
    • 4 Data & Storage
      • DB
    • 5 Software Development
      • Programming Language
        • 🗺️ - JavaScript
          • AJAX
          • Arguments
          • Asynchronous JS
          • Callback Hell
          • Class
          • Closure Trap
          • Closures
          • Data type
          • Deep Copy
          • Destructuring
          • event loop
          • Execution Context
          • Function
          • Generator
          • Hoisting
          • Module
          • Nullish coalescing operator
          • Promises
          • Prototype OOP
          • Scope
          • Shallow Copy
          • Spread syntax
          • Standard built-in objects
          • This
          • Variable Lifecycle
          • 데이터 메모리 할당
          • 불변성
          • 컴파일링
          • 함수형 패러다임
        • Python
          • Python
        • TypeScript
          • Interface vs type
      • Git
    • 6 AI & Data Science
      • AI Tools
      • Blog & Community
      • Lecture
      • LLM Utility
      • Prompt
    • 7 Applications Development
      • 🗺️ - Frontend
        • React
          • Custom hook
          • forwardRef
          • Fragment
          • Hook debug
          • Hook 사용 규칙
          • Key prop의 중요성
          • Props
          • React
          • React Framework
          • react life cycle method
          • React Test
          • rendering trigger
          • Rerendering
          • Side effect
          • State batch
          • State 변경감지
          • useRef
          • 단일 데이터 관리
          • 리액트 애플리케이션 디버깅
          • 메모이제이션
          • 불필요한 폴백 방지
          • 상태 관리 라이브러리
          • 엄격 모드
        • Style
          • CSS
            • CSS
            • css selectors
            • css selectors priority
            • flex - display
            • position property
            • SCSS
          • ui kit
        • Terms
          • Composition
          • cookie, session storage, local storage
          • CORS
          • DOM API
          • DOM, BOM, CSSOM
          • ErrorBoundary
          • Event bubbling, capturing
          • Event delegation
          • Headless UI 만들기
          • Hydrate, Rehydrate
          • Isomorphic, Universal JS
          • lazy load custom
          • MVVM
          • Prefetch, Split Code
          • Preflight
          • React Component
          • react Fiber
          • Rendering Pipeline
          • Request Race Condition
          • SSG, SSR, ISR
          • Static Optimization
          • Suspense
          • Suspense for Data Fetching
          • TDD in react
          • Untitled
          • UseDebounce
          • useEffect 개발모드에서 두번 실행되는 이유
          • useTransition
          • 관심사 분리
          • 관심사 분리시 주의할 점
          • 대수적 효과
          • 렌더 프롭
          • 마운트, 언마운트 판별 custom hook
          • 비동기 파이프라인 패턴
          • 서버 상태 관리
          • 전역, ATOM 상태 필요성
          • 제어가 되는 컴포넌트
          • 컴포넌트
          • 컴포넌트 prop 직접 조작, 조회
          • 특정 라우트에서 Layout 적용하기 - 미들웨어 처럼 사용
          • 폼 최적화는 어떻게 해야할까
          • 프론트에서 리팩토링
        • Markdown slide
        • Util Site
      • Oline IDE
      • Tracking, Monitoring, Test System
      • vscode Snippet
    • 9 Practical Topics
      • Fallacies of distributed computing
      • Latency Numbers Every Programmer Should Know
      • 코드 분석 그래프
    • 10 Workflow
      • Collaboration Tool
    • 99 MISC
      • Big Tech Stacks
      • Challenging projects every programmer should try
      • Decoder
      • Docs, Wiki
      • Git, Github
      • IT Books
      • Lecture
      • Open Source
      • Productivity Tools
      • Tech Blog
      • Vi, Vim
      • 히치하이커를 위한 안내서
  • 🗺️ - Note Taking
    • ANTINET
    • markdown을 이용한 노트와 태스크 그리고 일정 관리
    • Workflow of GTD
    • Workflow of My Note Taking
    • Workflow of Zettelkasten
    • 내 노트 정리 방법
    • 노트 정리 방법론
    • 노트의 단계별 정리 및 취합
    • 노트의 단계별 학습 및 요약
    • 노트의 물리적 정리는 내용적 정리보다 후순위다
    • 정리용 DB는 내용과 속성이 분리되어야 한다
    • 제텔카스텐식 메모의 종류와 그 흐름
    • 주기적 반복 학습
    • 지식 노트와 아이디어 노트는 정리법이 달라야한다
  • 🗺️ - Philosophy
    • 🗺️ - Philosophy of Mind
      • Map of Philosophy
      • 거대 언어 모델과 언어 철학
    • z-index
      • 🗺️ - Guideline
    Home

    ❯

    🗺️ Computer Science

    ❯

    1 Foundations & Theory

    ❯

    🗺️ Algorithms

    🗺️ - Algorithms

    Jun 02, 20251 min read

    • cs
    • algorithm
    • sql
    • moc
    • PS Site
    • Tips
    • Terms
    • Time Complexity

    • Combination
    • Permutation
    • Subset
    • Two Pointers
    • Prefix Sum Array
    • Hash
    • Graph
      • Eulerian Path
      • Tree
        • Minimum Spanning Tree (MST) - 최소 신장 트리
      • BFS
      • DFS
        • Back Tracking
      • Dijkstra’s Algorithm
      • Bellman-Ford Algorithm
      • Floyd-Warshall Algorithm
      • Topological Sorting
    • Union-Find
    • Greedy
    • DP
      • DP 유형
    • Heap Sort, Heapify

    📁 Folders

    • 🗺️ - PS

      May 19, 2025

      • moc
      • ps/boj/bronze
      • ps/boj/silver
      • ps/boj/gold
      • ps/boj/platinum
      • ps/boj/diamond
      • ps/boj/ruby
      • ps/boj/unrated
      • ps/boj/unknown
    • math

      Jul 02, 2025

      • Named Algorithms

        Jul 03, 2025


        📎 All Notes

        • 0-1 BFS

          May 07, 2025

          • Back Tracking

            May 06, 2025

            • BFS

              Apr 03, 2025

              • Binary Search

                May 01, 2025

                • Bitmask

                  Jun 09, 2025

                  • Combination

                    Jun 09, 2025

                    • DFS

                      Jun 02, 2025

                      • DP

                        May 23, 2025

                        • DP with Bitmask

                          May 18, 2025

                          • DP 유형

                            May 05, 2025

                            • Graph

                              Jun 02, 2025

                              • Greedy

                                May 18, 2025

                                • Hash

                                  May 15, 2025

                                  • Heap Sort, Heapify

                                    May 16, 2025

                                    • Minimum Spanning Tree (MST) - 최소 신장 트리

                                      May 06, 2025

                                      • Permutation

                                        Jun 09, 2025

                                        • Prefix Sum Array

                                          Jun 02, 2025

                                          • PS Site

                                            May 19, 2025

                                            • Quick Sort

                                              May 01, 2025

                                              • field/computer
                                              • format/article
                                              • context
                                            • Strongly Connected Component

                                              Jun 09, 2025

                                              • Subset

                                                Jun 02, 2025

                                                • Terms

                                                  Jun 02, 2025

                                                  • Time Complexity

                                                    May 06, 2025

                                                    • Tips

                                                      Jun 02, 2025

                                                      • Topological Sorting

                                                        Jun 09, 2025

                                                        • Traveling Salesman Problem

                                                          May 07, 2025

                                                          • Tree

                                                            Jun 02, 2025

                                                            • Two Pointers

                                                              Jun 02, 2025

                                                              • Union-Find

                                                                May 01, 2025


                                                                Backlinks

                                                                • No backlinks found

                                                                Mind Map

                                                                PS Site
                                                                Tips
                                                                Terms
                                                                Time Complexity
                                                                Combination
                                                                Permutation
                                                                Subset
                                                                Two Pointers
                                                                Prefix Sum Array
                                                                Hash
                                                                Eulerian Path
                                                                Minimum Spanning Tree (MST) - 최소 신장 트리
                                                                Tree
                                                                BFS
                                                                Back Tracking
                                                                DFS
                                                                Dijkstra's Algorithm
                                                                Bellman-Ford Algorithm
                                                                Floyd-Warshall Algorithm
                                                                Topological Sorting
                                                                Graph
                                                                Union-Find
                                                                Greedy
                                                                DP 유형
                                                                DP
                                                                Heap Sort, Heapify
                                                                - Algorithms
                                                                markmapmarkmap

                                                                Graph View

                                                                • Home
                                                                • About
                                                                • Blog source

                                                                Created by Yòmá with Quartz v4.5.0 © 2025