@euler-edu/constant 0.0.0-stage → 7.0.1-beta0

package/lib/oj-explore/algorithms.d.ts

@@ -0,0 +1,706 @@
+export declare const algorithmCategories: {
+    readonly basic: "기초";
+    readonly search: "탐색";
+    readonly sorting: "정렬";
+    readonly greedy: "그리디";
+    readonly recursion: "재귀";
+    readonly dp: "동적 계획법";
+    readonly graph: "그래프";
+    readonly tree: "트리";
+    readonly 'data-structure': "자료구조";
+    readonly math: "수학";
+    readonly geometry: "기하학";
+    readonly string: "문자열";
+    readonly bit: "비트 연산";
+};
+export type AlgorithmCategory = keyof typeof algorithmCategories;
+declare const _default: readonly [{
+    readonly key: "basic";
+    readonly name: {
+        readonly kr: "기초 (Basic)";
+        readonly en: "Basic";
+    };
+    readonly description: {
+        readonly kr: "가장 쉬운 기초 문제들만 모았습니다.";
+        readonly en: "The easiest basic problems only";
+    };
+    readonly keywords: readonly ["basic", "기초", "입문", "beginner"];
+    readonly categories: readonly ["basic"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "sorting";
+    readonly name: {
+        readonly kr: "정렬 (Sort)";
+        readonly en: "Sort";
+    };
+    readonly description: {
+        readonly kr: "배열을 정해진 순서대로 나열하는 알고리즘입니다.";
+        readonly en: "Algorithms to arrange arrays in a specific order.";
+    };
+    readonly keywords: readonly ["sort", "정렬", "bubble sort", "merge sort", "quick sort", "counting sort"];
+    readonly categories: readonly ["sorting"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "directionCheck";
+    readonly name: {
+        readonly kr: "방향 확인 (Direction Check)";
+        readonly en: "Direction Check";
+    };
+    readonly description: {
+        readonly kr: "2차원 이상의 배열에서 방향 확인이 필요한 문제들을 모았습니다.";
+        readonly en: "Problems that require direction checking in 2D or higher arrays";
+    };
+    readonly keywords: readonly ["direction", "방향", "상하좌우", "dx dy"];
+    readonly categories: readonly ["basic", "search"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "recursion";
+    readonly name: {
+        readonly kr: "재귀호출 (Recursion)";
+        readonly en: "Recursion";
+    };
+    readonly description: {
+        readonly kr: "자기 자신을 다시 호출하는 함수 구현이 필요한 문제들을 모았습니다.";
+        readonly en: "Problems that require implementing functions that call themselves";
+    };
+    readonly keywords: readonly ["recursion", "재귀", "recursive"];
+    readonly categories: readonly ["recursion"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "divideAndConquer";
+    readonly name: {
+        readonly kr: "분할 정복 (Divide and Conquer)";
+        readonly en: "Divide and Conquer";
+    };
+    readonly description: {
+        readonly kr: "문제를 작은 부분으로 나누어 해결하는 알고리즘입니다.";
+        readonly en: "Algorithms to solve a problem by dividing it into smaller parts";
+    };
+    readonly keywords: readonly ["divide and conquer", "분할정복"];
+    readonly categories: readonly ["recursion"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "backTracking";
+    readonly name: {
+        readonly kr: "Backtracking (퇴각 검색)";
+        readonly en: "Backtracking";
+    };
+    readonly description: {
+        readonly kr: "모든 가능한 경우를 탐색하되, 조건에 맞지 않으면 되돌아가는 알고리즘입니다.";
+        readonly en: "An algorithm that explores all possible cases and backtracks when a condition is not met.";
+    };
+    readonly keywords: readonly ["backtracking", "백트래킹", "퇴각검색", "순열", "조합", "n-queens"];
+    readonly categories: readonly ["search", "recursion"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "stack";
+    readonly name: {
+        readonly kr: "스택 (Stack)";
+        readonly en: "Stack";
+    };
+    readonly description: {
+        readonly kr: "데이터를 순차적으로 쌓는 선형 자료구조로, 후입선출(LIFO, Last-In-First-Out) 알고리즘입니다.";
+        readonly en: "A linear data structure that stacks data sequentially, characterized by a Last-In-First-Out (LIFO) principle.";
+    };
+    readonly keywords: readonly ["stack", "스택", "lifo", "후입선출", "괄호", "monotonic stack"];
+    readonly categories: readonly ["data-structure"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "queue";
+    readonly name: {
+        readonly kr: "큐 (Queue)";
+        readonly en: "Queue";
+    };
+    readonly description: {
+        readonly kr: "데이터를 순서대로 처리하기 위해 사용하는 선형 자료구조로, 선입선출(FIFO, First-In-First-Out) 알고리즘입니다.";
+        readonly en: "A linear data structure used to process data in order, characterized by a First-In-First-Out (FIFO) principle.";
+    };
+    readonly keywords: readonly ["queue", "큐", "fifo", "선입선출", "deque", "덱"];
+    readonly categories: readonly ["data-structure"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "dfs";
+    readonly name: {
+        readonly kr: "DFS (깊이 우선 탐색)";
+        readonly en: "DFS (Depth-First Search)";
+    };
+    readonly description: {
+        readonly kr: "어떤 노드에서 시작해 가능한 깊이까지 탐색한 후, 다시 돌아와서 다른 방향을 탐색하는 알고리즘입니다.";
+        readonly en: "An algorithm that explores as deeply as possible from a starting node before returning and exploring other directions.";
+    };
+    readonly keywords: readonly ["dfs", "깊이우선탐색", "depth first search", "그래프 탐색"];
+    readonly categories: readonly ["search", "graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "bfs";
+    readonly name: {
+        readonly kr: "BFS (너비 우선 탐색)";
+        readonly en: "BFS (Breadth-First Search)";
+    };
+    readonly description: {
+        readonly kr: "시작 노드에서 가까운 노드부터 단계적으로 탐색하는 알고리즘입니다.";
+        readonly en: "An algorithm that explores nodes level by level, starting from the nearest node.";
+    };
+    readonly keywords: readonly ["bfs", "너비우선탐색", "breadth first search", "그래프 탐색"];
+    readonly categories: readonly ["search", "graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "bfsShortsPath";
+    readonly name: {
+        readonly kr: "BFS (최단 경로)";
+        readonly en: "Shortest Path with BFS";
+    };
+    readonly description: {
+        readonly kr: "BFS를 활용하여 가중치가 없는 그래프에서 최단 경로를 구하는 알고리즘입니다.";
+        readonly en: "An algorithm using BFS to find the shortest path in an unweighted graph.";
+    };
+    readonly keywords: readonly ["bfs", "최단경로", "최단거리", "shortest path"];
+    readonly categories: readonly ["search", "graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "floodFill";
+    readonly name: {
+        readonly kr: "플러드 필 (Flood Fill)";
+        readonly en: "Flood Fill";
+    };
+    readonly description: {
+        readonly kr: "연결된 영역을 찾아 같은 값으로 채우는 알고리즘으로, 그림판의 채우기 기능과 같은 원리입니다.";
+        readonly en: "An algorithm that finds connected regions and fills them with the same value, similar to the fill tool in paint programs.";
+    };
+    readonly keywords: readonly ["flood fill", "플러드필", "연결요소", "색칠"];
+    readonly categories: readonly ["search", "graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "greedy";
+    readonly name: {
+        readonly kr: "탐욕 알고리즘 (Greedy)";
+        readonly en: "Greedy";
+    };
+    readonly description: {
+        readonly kr: "각 단계에서 현재 가장 최선의 선택을 하는 방식으로 문제를 해결하는 알고리즘입니다.";
+        readonly en: "An algorithm that solves problems by making the locally optimal choice at each step.";
+    };
+    readonly keywords: readonly ["greedy", "그리디", "탐욕법"];
+    readonly categories: readonly ["greedy"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "scanning";
+    readonly name: {
+        readonly kr: "Scanning";
+        readonly en: "Scanning";
+    };
+    readonly description: {
+        readonly kr: "배열이나 문자열을 순차적으로 훑으며 조건을 만족하는 구간을 찾는 알고리즘입니다.";
+        readonly en: "An algorithm that sequentially scans arrays or strings to find intervals satisfying a condition.";
+    };
+    readonly keywords: readonly ["scanning", "sliding window", "슬라이딩 윈도우", "투포인터", "two pointer"];
+    readonly categories: readonly ["search", "string"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "binarySearch";
+    readonly name: {
+        readonly kr: "이진 검색 (Binary Search)";
+        readonly en: "Binary Search";
+    };
+    readonly description: {
+        readonly kr: "정렬된 배열에서 탐색 범위를 절반씩 줄여가며 원하는 값을 찾는 알고리즘입니다.";
+        readonly en: "An algorithm that finds a target value in a sorted array by halving the search range each step.";
+    };
+    readonly keywords: readonly ["binary search", "이진탐색", "이분탐색", "lower bound", "upper bound"];
+    readonly categories: readonly ["search"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "parametricSearch";
+    readonly name: {
+        readonly kr: "파라메트릭 서치 (Parametric Search)";
+        readonly en: "Parametric Search";
+    };
+    readonly description: {
+        readonly kr: "최적화 문제를 결정 문제로 변환하여 이진 탐색으로 해결하는 알고리즘입니다.";
+        readonly en: "An algorithm that converts an optimization problem into a decision problem and solves it with binary search.";
+    };
+    readonly keywords: readonly ["parametric search", "파라메트릭 서치", "이진탐색", "최적화"];
+    readonly categories: readonly ["search"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "math";
+    readonly name: {
+        readonly kr: "수학 (Math)";
+        readonly en: "Math";
+    };
+    readonly description: {
+        readonly kr: "수학적 공식이나 원리를 활용하여 문제를 해결하는 알고리즘입니다.";
+        readonly en: "Algorithms that solve problems using mathematical formulas or principles.";
+    };
+    readonly keywords: readonly ["math", "수학", "수식", "공식"];
+    readonly categories: readonly ["math"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "bruteForce";
+    readonly name: {
+        readonly kr: "브루트 포스 (Brute Force)";
+        readonly en: "Brute Force";
+    };
+    readonly description: {
+        readonly kr: "모든 경우의 수를 직접 탐색하여 답을 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the answer by directly exploring all possible cases.";
+    };
+    readonly keywords: readonly ["brute force", "브루트포스", "완전탐색"];
+    readonly categories: readonly ["search"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "rotation";
+    readonly name: {
+        readonly kr: "회전 (Rotation)";
+        readonly en: "Rotation";
+    };
+    readonly description: {
+        readonly kr: "배열이나 좌표를 일정 각도로 회전시키는 연산이 필요한 문제들을 모았습니다.";
+        readonly en: "Problems that require rotating arrays or coordinates by a given angle.";
+    };
+    readonly keywords: readonly ["rotation", "회전", "배열 회전", "좌표 회전"];
+    readonly categories: readonly ["basic", "geometry"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "eulerTour";
+    readonly name: {
+        readonly kr: "오일러 경로 (한붓그리기, Eulerian Path)";
+        readonly en: "Eulerian Path";
+    };
+    readonly description: {
+        readonly kr: "그래프의 모든 간선을 정확히 한 번씩 지나는 경로를 찾는 알고리즘입니다.";
+        readonly en: "An algorithm that finds a path traversing every edge of a graph exactly once.";
+    };
+    readonly keywords: readonly ["eulerian path", "오일러경로", "한붓그리기", "eulerian circuit"];
+    readonly categories: readonly ["graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "tsp";
+    readonly name: {
+        readonly kr: "TSP (외판원 순회 문제)";
+        readonly en: "TSP (Traveling Salesman Problem)";
+    };
+    readonly description: {
+        readonly kr: "모든 도시를 한 번씩 방문하고 출발지로 돌아오는 최단 경로를 구하는 문제입니다.";
+        readonly en: "A problem that finds the shortest route visiting every city exactly once and returning to the starting point.";
+    };
+    readonly keywords: readonly ["tsp", "traveling salesman", "외판원 순회", "hamiltonian path"];
+    readonly categories: readonly ["graph", "dp"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "carlender";
+    readonly name: {
+        readonly kr: "날짜 계산 (Carlender)";
+        readonly en: "Carlender";
+    };
+    readonly description: {
+        readonly kr: "날짜, 요일, 기간 등 달력과 관련된 계산이 필요한 문제들을 모았습니다.";
+        readonly en: "Problems that require calendar-related calculations such as dates, days of the week, and durations.";
+    };
+    readonly keywords: readonly ["calendar", "날짜", "요일", "날짜 계산"];
+    readonly categories: readonly ["basic", "math"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "lis";
+    readonly name: {
+        readonly kr: "LIS (최장 증가 부분 수열)";
+        readonly en: "LIS (Longest Increasing Subsequence)";
+    };
+    readonly description: {
+        readonly kr: "수열에서 순서를 유지하면서 값이 단조 증가하는 가장 긴 부분 수열을 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the longest subsequence in which values are strictly increasing while maintaining order.";
+    };
+    readonly keywords: readonly ["lis", "longest increasing subsequence", "최장증가부분수열"];
+    readonly categories: readonly ["dp"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "knapsack";
+    readonly name: {
+        readonly kr: "배낭 문제 (Knapsack)";
+        readonly en: "Knapsack";
+    };
+    readonly description: {
+        readonly kr: "무게 제한이 있는 배낭에 가치의 합이 최대가 되도록 물건을 선택하는 최적화 문제입니다.";
+        readonly en: "An optimization problem that selects items to maximize total value within a weight-limited knapsack.";
+    };
+    readonly keywords: readonly ["knapsack", "배낭문제", "0-1 knapsack", "dp"];
+    readonly categories: readonly ["dp"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "mincoin";
+    readonly name: {
+        readonly kr: "최소 동전 개수 (Min Coin)";
+        readonly en: "Min Coin";
+    };
+    readonly description: {
+        readonly kr: "주어진 동전 종류로 특정 금액을 만들 때 필요한 최소 동전 개수를 구하는 문제입니다.";
+        readonly en: "A problem that finds the minimum number of coins needed to make a specific amount with given coin denominations.";
+    };
+    readonly keywords: readonly ["coin change", "최소동전", "거스름돈", "dp"];
+    readonly categories: readonly ["dp"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "lcs";
+    readonly name: {
+        readonly kr: "LCS (최장 공통 부분 수열)";
+        readonly en: "LCS (Longest Common Subsequence)";
+    };
+    readonly description: {
+        readonly kr: "두 수열에서 공통으로 나타나는 가장 긴 부분 수열을 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the longest subsequence common to two sequences.";
+    };
+    readonly keywords: readonly ["lcs", "longest common subsequence", "최장공통부분수열"];
+    readonly categories: readonly ["dp"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "dijkstra";
+    readonly name: {
+        readonly kr: "다익스트라 (Dijkstra)";
+        readonly en: "Dijkstra";
+    };
+    readonly description: {
+        readonly kr: "가중치가 있는 그래프에서 단일 출발점으로부터 모든 노드까지의 최단 경로를 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the shortest path from a single source to all nodes in a weighted graph.";
+    };
+    readonly keywords: readonly ["dijkstra", "다익스트라", "최단경로", "shortest path"];
+    readonly categories: readonly ["graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "floydWarshall";
+    readonly name: {
+        readonly kr: "플로이드-워셜 (Floyd-Warshall)";
+        readonly en: "Floyd-Warshall";
+    };
+    readonly description: {
+        readonly kr: "그래프의 모든 노드 쌍 사이의 최단 경로를 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the shortest paths between all pairs of nodes in a graph.";
+    };
+    readonly keywords: readonly ["floyd-warshall", "플로이드워셜", "all pairs shortest path", "전체쌍 최단경로"];
+    readonly categories: readonly ["graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "prim";
+    readonly name: {
+        readonly kr: "MST (최소 신장 트리)";
+        readonly en: "MST (Minimum Spanning Tree)";
+    };
+    readonly description: {
+        readonly kr: "그래프의 모든 노드를 연결하면서 간선의 가중치 합이 최소인 트리를 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds a tree connecting all nodes in a graph with the minimum total edge weight.";
+    };
+    readonly keywords: readonly ["mst", "minimum spanning tree", "최소신장트리", "prim", "kruskal", "크루스칼"];
+    readonly categories: readonly ["graph", "tree"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "topologicalSort";
+    readonly name: {
+        readonly kr: "위상 정렬 (Topological Sort)";
+        readonly en: "Topological Sort";
+    };
+    readonly description: {
+        readonly kr: "방향 비순환 그래프(DAG)에서 선후 관계를 지키며 노드를 순서대로 나열하는 알고리즘입니다.";
+        readonly en: "An algorithm that orders nodes in a directed acyclic graph (DAG) while respecting dependency order.";
+    };
+    readonly keywords: readonly ["topological sort", "위상정렬", "dag", "의존성"];
+    readonly categories: readonly ["graph", "sorting"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "unionFind";
+    readonly name: {
+        readonly kr: "합집합 찾기 (Union-Find)";
+        readonly en: "Union-Find";
+    };
+    readonly description: {
+        readonly kr: "여러 노드의 집합 관계를 효율적으로 관리하고, 두 노드가 같은 집합에 속하는지 판별하는 자료구조입니다.";
+        readonly en: "A data structure that efficiently manages set membership and determines whether two nodes belong to the same set.";
+    };
+    readonly keywords: readonly ["union find", "유니온파인드", "disjoint set", "서로소집합"];
+    readonly categories: readonly ["graph", "data-structure"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "Dynamic";
+    readonly name: {
+        readonly kr: "동적 계획법 (Dynamic Programming)";
+        readonly en: "Dynamic Programming";
+    };
+    readonly description: {
+        readonly kr: "복잡한 문제를 작은 하위 문제로 나누고, 중복 계산을 방지하여 효율적으로 해결하는 알고리즘입니다.";
+        readonly en: "An algorithm that breaks complex problems into smaller subproblems and solves them efficiently by avoiding redundant calculations.";
+    };
+    readonly keywords: readonly ["dp", "dynamic programming", "동적계획법", "memoization", "메모이제이션", "점화식"];
+    readonly categories: readonly ["dp"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "numberOfTheory";
+    readonly name: {
+        readonly kr: "정수론 (Number Theory)";
+        readonly en: "Number Theory";
+    };
+    readonly description: {
+        readonly kr: "소수, 약수, 최대공약수 등 정수의 성질을 다루는 수학적 알고리즘입니다.";
+        readonly en: "Mathematical algorithms dealing with properties of integers such as primes, divisors, and GCD.";
+    };
+    readonly keywords: readonly ["number theory", "정수론", "소수", "prime", "gcd", "lcm", "sieve", "에라토스테네스"];
+    readonly categories: readonly ["math"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "priorityQueue";
+    readonly name: {
+        readonly kr: "우선순위 큐 (Priority Queue)";
+        readonly en: "Priority Queue";
+    };
+    readonly description: {
+        readonly kr: "각 원소에 우선순위를 부여하여 높은 우선순위의 원소가 먼저 처리되는 자료구조입니다.";
+        readonly en: "A data structure where each element has a priority and higher-priority elements are processed first.";
+    };
+    readonly keywords: readonly ["priority queue", "우선순위큐", "heap", "힙"];
+    readonly categories: readonly ["data-structure"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "segmentTree";
+    readonly name: {
+        readonly kr: "세그먼트 트리 (Segment Tree)";
+        readonly en: "Segment Tree";
+    };
+    readonly description: {
+        readonly kr: "배열의 구간 합, 최솟값, 최댓값 등을 효율적으로 처리하는 트리 기반 자료구조입니다.";
+        readonly en: "A tree-based data structure that efficiently handles range queries such as sum, min, and max over arrays.";
+    };
+    readonly keywords: readonly ["segment tree", "세그먼트 트리", "range query", "구간쿼리", "fenwick tree", "bit"];
+    readonly categories: readonly ["data-structure", "tree"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "networkFlow";
+    readonly name: {
+        readonly kr: "네트워크 플로우 (Network Flow)";
+        readonly en: "Network Flow";
+    };
+    readonly description: {
+        readonly kr: "소스에서 싱크까지 네트워크를 통해 흘릴 수 있는 최대 유량을 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the maximum flow that can be sent through a network from source to sink.";
+    };
+    readonly keywords: readonly ["network flow", "네트워크플로우", "max flow", "최대유량", "bipartite matching", "이분매칭"];
+    readonly categories: readonly ["graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "bitMask";
+    readonly name: {
+        readonly kr: "비트 마스크 (BitMask)";
+        readonly en: "BitMask";
+    };
+    readonly description: {
+        readonly kr: "비트 연산을 활용하여 집합, 상태 등을 효율적으로 표현하고 조작하는 기법입니다.";
+        readonly en: "A technique that uses bitwise operations to efficiently represent and manipulate sets and states.";
+    };
+    readonly keywords: readonly ["bitmask", "비트마스크", "bitwise", "비트연산", "부분집합", "상태압축"];
+    readonly categories: readonly ["math", "dp", "bit"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "geometry";
+    readonly name: {
+        readonly kr: "기하 (Geometry)";
+        readonly en: "Geometry";
+    };
+    readonly description: {
+        readonly kr: "점, 선, 다각형 등 기하학적 객체들의 관계와 성질을 다루는 알고리즘입니다.";
+        readonly en: "Algorithms dealing with the relationships and properties of geometric objects such as points, lines, and polygons.";
+    };
+    readonly keywords: readonly ["geometry", "기하", "좌표", "ccw", "교차 판별"];
+    readonly categories: readonly ["geometry"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "convexHull";
+    readonly name: {
+        readonly kr: "볼록 껍질 (Convex Hull)";
+        readonly en: "Convex Hull";
+    };
+    readonly description: {
+        readonly kr: "주어진 점들을 모두 포함하는 가장 작은 볼록 다각형을 구하는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the smallest convex polygon enclosing all given points.";
+    };
+    readonly keywords: readonly ["convex hull", "볼록껍질", "graham scan", "그라함 스캔"];
+    readonly categories: readonly ["geometry"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "bigNumber";
+    readonly name: {
+        readonly kr: "큰 수 (Big Number)";
+        readonly en: "Big Number";
+    };
+    readonly description: {
+        readonly kr: "일반 정수 자료형으로 표현할 수 없는 매우 큰 수를 다루는 알고리즘입니다.";
+        readonly en: "Algorithms for handling very large numbers that cannot be represented by standard integer types.";
+    };
+    readonly keywords: readonly ["big number", "큰 수", "arbitrary precision", "임의 정밀도"];
+    readonly categories: readonly ["math"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "bellmanFord";
+    readonly name: {
+        readonly kr: "벨만-포드 (Bellman-Ford)";
+        readonly en: "Bellman-Ford";
+    };
+    readonly description: {
+        readonly kr: "음수 가중치가 있는 그래프에서도 단일 출발점으로부터 최단 경로를 구할 수 있는 알고리즘입니다.";
+        readonly en: "An algorithm that finds the shortest path from a single source even in graphs with negative edge weights.";
+    };
+    readonly keywords: readonly ["bellman-ford", "벨만포드", "음수 간선", "negative edge", "최단경로"];
+    readonly categories: readonly ["graph"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "pattern";
+    readonly name: {
+        readonly kr: "패턴 (Pattern)";
+        readonly en: "Pattern";
+    };
+    readonly description: {
+        readonly kr: "수열, 도형 등에서 규칙적인 패턴을 발견하고 활용하여 문제를 해결하는 알고리즘입니다.";
+        readonly en: "Algorithms that solve problems by discovering and leveraging regular patterns in sequences or shapes.";
+    };
+    readonly keywords: readonly ["pattern", "패턴", "규칙", "규칙성"];
+    readonly categories: readonly ["basic", "string"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "planeSweeping";
+    readonly name: {
+        readonly kr: "Plane Sweeping";
+        readonly en: "Plane Sweeping";
+    };
+    readonly description: {
+        readonly kr: "가상의 직선을 이동시키며 기하학적 문제를 효율적으로 처리하는 알고리즘입니다.";
+        readonly en: "An algorithm that efficiently solves geometric problems by sweeping a virtual line across the plane.";
+    };
+    readonly keywords: readonly ["plane sweeping", "평면스위핑", "sweep line", "스윕라인"];
+    readonly categories: readonly ["geometry"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "dataStructure";
+    readonly name: {
+        readonly kr: "자료구조 (Data Structure)";
+        readonly en: "Data Structure";
+    };
+    readonly description: {
+        readonly kr: "데이터를 효율적으로 저장하고 관리하기 위한 구조와 관련된 문제들을 모았습니다.";
+        readonly en: "Problems related to structures for efficiently storing and managing data.";
+    };
+    readonly keywords: readonly ["data structure", "자료구조", "linked list", "tree", "graph"];
+    readonly categories: readonly ["data-structure"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "string";
+    readonly name: {
+        readonly kr: "문자열 (String)";
+        readonly en: "String";
+    };
+    readonly description: {
+        readonly kr: "문자열의 탐색, 비교, 변환 등 문자열 처리와 관련된 알고리즘입니다.";
+        readonly en: "Algorithms related to string processing such as searching, comparing, and transforming strings.";
+    };
+    readonly keywords: readonly ["string", "문자열", "kmp", "문자열 처리"];
+    readonly categories: readonly ["string"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "gets";
+    readonly name: {
+        readonly kr: "Gets";
+        readonly en: "Gets";
+    };
+    readonly description: {
+        readonly kr: "공백이나 개행이 포함된 문자열 입력을 처리하는 문제들을 모았습니다.";
+        readonly en: "Problems that involve handling string input containing spaces or newlines.";
+    };
+    readonly keywords: readonly ["gets", "입력", "공백 입력", "readline"];
+    readonly categories: readonly ["basic", "string"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "shape";
+    readonly name: {
+        readonly kr: "문자 도형 (Shape)";
+        readonly en: "Shape";
+    };
+    readonly description: {
+        readonly kr: "문자를 이용하여 특정 도형이나 패턴을 출력하는 문제들을 모았습니다.";
+        readonly en: "Problems that require printing specific shapes or patterns using characters.";
+    };
+    readonly keywords: readonly ["shape", "별찍기", "문자 도형", "pattern output"];
+    readonly categories: readonly ["basic", "string"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "set";
+    readonly name: {
+        readonly kr: "Set";
+        readonly en: "Set";
+    };
+    readonly description: {
+        readonly kr: "중복 없는 원소들의 집합 자료구조를 활용하는 문제들을 모았습니다.";
+        readonly en: "Problems that utilize the set data structure containing unique elements.";
+    };
+    readonly keywords: readonly ["set", "집합", "중복제거", "unique"];
+    readonly categories: readonly ["data-structure"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "regulation";
+    readonly name: {
+        readonly kr: "Regulation";
+    };
+    readonly description: {
+        readonly kr: "주어진 규칙이나 제약 조건에 따라 문제를 해결하는 알고리즘입니다.";
+        readonly en: "Algorithms that solve problems according to given rules or constraints.";
+    };
+    readonly keywords: readonly ["regulation", "규칙", "제약조건"];
+    readonly categories: readonly ["basic"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "convexHullTrick";
+    readonly name: {
+        readonly kr: "볼록 껍질 트릭 (Convex Hull Trick)";
+        readonly en: "Convex Hull Trick";
+    };
+    readonly description: {
+        readonly kr: "동적 계획법 점화식에서 일차 함수의 최솟값·최댓값을 볼록 껍질을 이용해 빠르게 계산하는 최적화 기법입니다.";
+        readonly en: "A DP optimization technique that uses convex hull to quickly compute the minimum or maximum of linear functions.";
+    };
+    readonly keywords: readonly ["convex hull trick", "볼록껍질 트릭", "cht", "dp 최적화"];
+    readonly categories: readonly ["dp", "geometry"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "DnCOptimization";
+    readonly name: {
+        readonly kr: "DnC 최적화 (Divide and Conquer Optimization)";
+        readonly en: "Divide and Conquer Optimization";
+    };
+    readonly description: {
+        readonly kr: "동적 계획법의 점화식에서 최적 분할점이 단조 증가하는 성질을 이용한 최적화 기법입니다.";
+        readonly en: "A DP optimization technique that exploits the monotonicity of the optimal split point in recurrence relations.";
+    };
+    readonly keywords: readonly ["divide and conquer optimization", "dnc optimization", "dp 최적화"];
+    readonly categories: readonly ["dp", "recursion"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "dijkstraHeap";
+    readonly name: {
+        readonly kr: "다익스트라 (Dijkstra + Heap)";
+        readonly en: "Dijkstra (+ Heap)";
+    };
+    readonly description: {
+        readonly kr: "우선순위 큐(힙)를 활용하여 다익스트라 알고리즘의 시간 복잡도를 개선한 구현입니다.";
+        readonly en: "An optimized implementation of Dijkstra using a priority queue (heap) to improve time complexity.";
+    };
+    readonly keywords: readonly ["dijkstra", "다익스트라", "heap", "priority queue", "최단경로"];
+    readonly categories: readonly ["graph", "data-structure"];
+    readonly parent: "algorithms";
+}, {
+    readonly key: "hash";
+    readonly name: {
+        readonly kr: "해싱 (Hash)";
+        readonly en: "Hash";
+    };
+    readonly description: {
+        readonly kr: "해시 함수를 이용하여 데이터를 빠르게 저장하고 검색하는 자료구조 기반 알고리즘입니다.";
+        readonly en: "Algorithms based on hash functions for fast data storage and retrieval.";
+    };
+    readonly keywords: readonly ["hash", "해싱", "hashmap", "해시맵", "dictionary"];
+    readonly categories: readonly ["data-structure"];
+    readonly parent: "algorithms";
+}];
+export default _default;