{"id":20377632,"url":"https://github.com/483759/algorithmsolutionstorage","last_synced_at":"2025-03-04T21:44:32.258Z","repository":{"id":111919604,"uuid":"181476485","full_name":"483759/AlgorithmSolutionStorage","owner":"483759","description":"Problem Solving, 자료구조, 알고리즘 공부 내용 정리","archived":false,"fork":false,"pushed_at":"2022-06-04T09:26:03.000Z","size":483398,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-01-15T07:14:51.135Z","etag":null,"topics":["algorithm","data-structures","problem-solving"],"latest_commit_sha":null,"homepage":"https://www.acmicpc.net/user/483759","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/483759.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-04-15T11:53:09.000Z","updated_at":"2024-04-16T08:56:00.000Z","dependencies_parsed_at":"2023-04-04T08:03:13.364Z","dependency_job_id":null,"html_url":"https://github.com/483759/AlgorithmSolutionStorage","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/483759%2FAlgorithmSolutionStorage","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/483759%2FAlgorithmSolutionStorage/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/483759%2FAlgorithmSolutionStorage/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/483759%2FAlgorithmSolutionStorage/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/483759","download_url":"https://codeload.github.com/483759/AlgorithmSolutionStorage/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241928532,"owners_count":20043821,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","data-structures","problem-solving"],"created_at":"2024-11-15T01:45:53.407Z","updated_at":"2025-03-04T21:44:32.253Z","avatar_url":"https://github.com/483759.png","language":"C++","readme":"# 🔥 Algorithm Problem Solving 코드 업로드 🔥 \n\n[![Solved.ac\n프로필](http://mazassumnida.wtf/api/v2/generate_badge?boj=483759)](https://solved.ac/483759)\n\n\u003cbr\u003e\n\n## 🛠 문제풀이 언어\n\n1. C/C++\n2. Java\n3. Python\n\n\u003cbr\u003e\n\n## 📐문제 풀이 분류\n\u003cimg src=\"https://img.shields.io/badge/BFS-5468FF?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/DFS-6AA127?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Permutation-ffe01b?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Combination-6afdef?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/PowerSet-0e353d?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Stack-ff7700?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Queue-ff160b?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Tree-7e4dd2?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/Priority Queue-064f8c?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/BruteForce-199900?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/List-fece00?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Greedy-ffa200?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/BackTracking-e10098?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Graph-0078d4?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Prim-36566f?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/Kruskal-b366f6?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/MST-f9ab00?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Dijkstra-00b2ff?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/DP-003b57?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/BitMask-007722?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/Strongly Connected Component-5468FF?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Disjoint Set-6AA127?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e\n\u003cimg src=\"https://img.shields.io/badge/Floyd Washall-064f8c?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \u003cimg src=\"https://img.shields.io/badge/Topological Sort-199900?style=flat-square\u0026logo=\u0026logoColor=white\"/\u003e\u003c/a\u003e \n\n\u003cbr\u003e\n\n# 📚 자료구조, 알고리즘 분야별 정리\n\n    ✏ 자료구조 및 알고리즘 개념/원리/증명/활용에 대해 직접 공부하고 정리한 블로그 포스팅 입니다 ❗\n\n\u003cbr\u003e\n\n### 목차\n\n  * [자료구조](#----)\n    + [Array and List](#array-and-list)\n    + [Tree](#tree)\n    + [Stack](#stack)\n    + [Graph](#graph)\n    + [Heap](#heap)\n    + [Union-Find](#union-find)\n    + [Hash](#hash)\n  * [알고리즘](#----)\n    + [Time Complexity and Big-Oh Notation](#time-complexity-and-big-oh-notation)\n    + [Recursion](#recursion)\n    + [Sort](#sort)\n    + [Graph](#graph-1)\n    + [Divide and Conquer](#divide-and-conquer)\n    + [Dynamic Programming](#dynamic-programming)\n    + [Operating System Algorithm](#operating-system-algorithm)\n    + [Etc](#etc)\n\n\u003cbr\u003e\n\n## ✅ 자료구조\n\n### Array and List\n1. [% 연산을 이용한 Circular Array 구현 및 응용](https://2jinishappy.tistory.com/149?category=920680) \u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456078-7cbf7146-8870-4bc2-8f0c-1d8cab83ae27.png\" width=\"400\" /\u003e\n\n2. [Array와 Linked List의 차이점](https://2jinishappy.tistory.com/150?category=920680) \u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456099-95846635-c564-40fd-88cd-15aeee2bbb41.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Tree\n1. [Computer Science에서의 Tree란](https://2jinishappy.tistory.com/164?category=920680) \u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456164-10682f03-8f09-4507-9dfd-fcb5a4a44825.png\" width=\"400\" /\u003e\n\n2. [Full, Perfect, Complete ? 이진트리의 형태](https://2jinishappy.tistory.com/136?category=920680) \u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456181-457de979-79a2-4403-afb4-afd5bc46f25d.png\" width=\"400\" /\u003e\n\n3. [모든 정점을 최소 비용으로 연결하는 MST - Minimum Spanning Tre](https://2jinishappy.tistory.com/114?category=920680) \u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456225-e3ee0647-2775-4f4b-a2a4-e02593b0b6a5.png\" width=\"400\" /\u003e\n\n4. [BST(Binary Search Tree)와 Find/Insert/Delete?](https://2jinishappy.tistory.com/100?category=920680) \u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456207-3db24bfd-6a36-4c11-bbdd-aab11ebf59cf.png\" width=\"400\" /\u003e\n\n4. [Color를 이용해서 Self-Balancing을 구현하는 Red-Black Tree](https://2jinishappy.tistory.com/318?category=920680) \u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/134552720-0d719bab-f1ef-4ab7-9a0c-9239acf6f094.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Stack\n\n1. [ADT Stack의 정의와 연산 구현 (create, push, pop, top, empty)](https://2jinishappy.tistory.com/134?category=920680)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456440-24ae3be3-cd32-42c1-81b5-00af11165695.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Queue\n\n1. [두 개의 Stack으로 Queue 자료구조를 구현해봅시다](https://2jinishappy.tistory.com/304?category=920680)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/134552471-332cdbb3-1c84-45c9-b564-dad62328bdee.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Graph\n\n1. [사이클이 없는 방향 그래프 DAG - Directed Acyclic Graph](https://2jinishappy.tistory.com/225?category=920680)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456478-4f1744a4-a34f-4b94-9497-860fdc8a26d1.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Heap\n\n1. [자료구조 Heap(힙)이란? 기본 연산과 HeapSort, Heapify에 대해](https://2jinishappy.tistory.com/102?category=920680)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456495-caaef2d4-1ad1-4b48-80f3-af663f136982.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Union-Find\n\n1. [서로소 집합을 관리하는 Disjoint Set(Union Find)](https://2jinishappy.tistory.com/175?category=920680)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456514-b9d2ad2b-bec9-48f4-8b18-2d831e07fe9d.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Hash\n\n1. [빠른 데이터 검색을 위한 Hashing과 Hash Table](https://2jinishappy.tistory.com/230?category=920680)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456659-8274b2bf-6437-4a07-a425-55d9b6695e69.png\" width=\"400\" /\u003e\n\n2. [Hash Table에서의 Collision Handling - Linear Probing, Separate Chaining](https://2jinishappy.tistory.com/231?category=920680)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456688-b220b84f-49c3-4bf7-b373-e4e3372e6d47.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n## ✅ 알고리즘\n\n\u003cbr\u003e\n\n### Time Complexity and Big-Oh Notation\n1. [시간복잡도 Big-O(빅 오) 표기법](https://2jinishappy.tistory.com/122?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456866-8c6332e2-abe4-44da-a6a7-947c422905ad.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Recursion\n1. [재귀 구현에서 Recursion과 Iteration의 차이점](https://2jinishappy.tistory.com/132?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456881-e3bb904f-3ed6-4ebb-b965-b491545bab1b.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Sort\n1. [Sort Algorithm(Bubble/Insert/Selection/Merge/Quick)과 시간복잡도](https://2jinishappy.tistory.com/166?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456911-392c6502-8df6-4f0a-9f49-746d99b20d42.png\" width=\"400\" /\u003e\n\n2. [Quick Sort 정의, 알고리즘 및 코드에 대해](https://2jinishappy.tistory.com/75?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456919-2a2b8608-5f55-404e-a71d-6b56817a1e12.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Graph\n1. [무방향그래프에서의 Cut Vertex와 Biconnected Components](https://2jinishappy.tistory.com/169?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129456999-90bd5d3e-aca4-4341-9903-a639ce3abdcc.png\" width=\"400\" /\u003e\n\n2. [방향 그래프에서 사이클의 집합 Strongly Connected Component](https://2jinishappy.tistory.com/229?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457018-065e0fb0-4ba9-45cb-9f4f-0a521e4f3c4a.png\" width=\"400\" /\u003e\n\n3. [그래프의 Vertex를 정렬하는 Topological Sort - Kahn's Algorithm](https://2jinishappy.tistory.com/161?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457026-19ef7128-76ca-4585-b6f7-8ec037228805.png\" width=\"400\" /\u003e\n\n4. [Connected Graph에서 MST를 생성하는 Kruskal's Algorithm(Greedy, Union Find)](https://2jinishappy.tistory.com/174?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457038-436b5366-4f70-4196-8141-01832197a384.png\" width=\"400\" /\u003e\n\n5. [Connected Graph에서 MST를 생성하는 Prim's Algorithm(Greedy, Priority Queue)](https://2jinishappy.tistory.com/176?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457047-914a7d3d-70c6-48a9-a807-8bc8475c977e.png\" width=\"400\" /\u003e\n\n6. [Edge-Weighted Graph에서의 최단경로를 찾는 Dijkstra Algorithm](https://2jinishappy.tistory.com/178?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457055-5dddd180-15e1-4fa5-96ba-598c00a47ec7.png\" width=\"400\" /\u003e\n\n7. [Weighted Graph에서 최단거리를 찾는 Bellman-Ford Algorithm](https://2jinishappy.tistory.com/184?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457065-b1c9e2e8-ab5d-4d48-a080-9a2fab61b554.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Divide and Conquer\n1. [Divide-and-Conquer 알고리즘과 Master Theorem](https://2jinishappy.tistory.com/96?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457092-61edecf4-2e54-4edc-b516-23a122b5e3f9.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Dynamic Programming\n1. [Dynamic Programming 문제를 위한 다섯 가지 단계](https://2jinishappy.tistory.com/273?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457152-6a272484-d2c6-4579-afe5-3a49d31f0617.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Operating System Algorithm\n1. [LRU(Least Recently Used Algorithm) Algorithm이란? Python 구현](https://2jinishappy.tistory.com/154?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457231-9db23fb5-2255-42ce-a66d-ccf6abeae3e3.png\" width=\"400\" /\u003e\n\n\u003cbr\u003e\n\n### Etc\n1. [Loop-Invariant in Iteration](https://2jinishappy.tistory.com/188?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457197-16b495af-767d-45b7-b9f4-c2409c04b5cf.png\" width=\"400\" /\u003e\n\n2. [Quick Select를 O(n)에 구현 가능한 Median of Medians 알고리즘](https://2jinishappy.tistory.com/127?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457267-89760fdf-a855-4075-8549-1b3437de1a58.png\" width=\"400\" /\u003e\n\n3. [Array의 k번째 작은 element 찾기 - QuickSelect 알고리즘](https://2jinishappy.tistory.com/124?category=903864)\u003cbr\u003e\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457279-6f5318a8-acf1-4006-81bd-6a172aeab12d.png\" width=\"400\" /\u003e\n\n4. [Kadane's Algorithm(카다네 알고리즘) SubArray 최대합 구하기](https://2jinishappy.tistory.com/120?category=903864)\n\u003cimg src=\"https://user-images.githubusercontent.com/30489264/129457295-73c22087-3ec4-4223-bf50-f81b6acaa140.png\" width=\"400\" /\u003e\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F483759%2Falgorithmsolutionstorage","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F483759%2Falgorithmsolutionstorage","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F483759%2Falgorithmsolutionstorage/lists"}