https://github.com/483759/algorithmsolutionstorage
Problem Solving, 자료구조, 알고리즘 공부 내용 정리
https://github.com/483759/algorithmsolutionstorage
algorithm data-structures problem-solving
Last synced: 4 months ago
JSON representation
Problem Solving, 자료구조, 알고리즘 공부 내용 정리
- Host: GitHub
- URL: https://github.com/483759/algorithmsolutionstorage
- Owner: 483759
- Created: 2019-04-15T11:53:09.000Z (about 6 years ago)
- Default Branch: master
- Last Pushed: 2022-06-04T09:26:03.000Z (about 3 years ago)
- Last Synced: 2025-01-15T07:14:51.135Z (6 months ago)
- Topics: algorithm, data-structures, problem-solving
- Language: C++
- Homepage: https://www.acmicpc.net/user/483759
- Size: 461 MB
- Stars: 1
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 🔥 Algorithm Problem Solving 코드 업로드 🔥
[](https://solved.ac/483759)
## 🛠 문제풀이 언어
1. C/C++
2. Java
3. Python
## 📐문제 풀이 분류
# 📚 자료구조, 알고리즘 분야별 정리
✏ 자료구조 및 알고리즘 개념/원리/증명/활용에 대해 직접 공부하고 정리한 블로그 포스팅 입니다 ❗
### 목차
* [자료구조](#----)
+ [Array and List](#array-and-list)
+ [Tree](#tree)
+ [Stack](#stack)
+ [Graph](#graph)
+ [Heap](#heap)
+ [Union-Find](#union-find)
+ [Hash](#hash)
* [알고리즘](#----)
+ [Time Complexity and Big-Oh Notation](#time-complexity-and-big-oh-notation)
+ [Recursion](#recursion)
+ [Sort](#sort)
+ [Graph](#graph-1)
+ [Divide and Conquer](#divide-and-conquer)
+ [Dynamic Programming](#dynamic-programming)
+ [Operating System Algorithm](#operating-system-algorithm)
+ [Etc](#etc)
## ✅ 자료구조
### Array and List
1. [% 연산을 이용한 Circular Array 구현 및 응용](https://2jinishappy.tistory.com/149?category=920680)
2. [Array와 Linked List의 차이점](https://2jinishappy.tistory.com/150?category=920680)
### Tree
1. [Computer Science에서의 Tree란](https://2jinishappy.tistory.com/164?category=920680)
2. [Full, Perfect, Complete ? 이진트리의 형태](https://2jinishappy.tistory.com/136?category=920680)
3. [모든 정점을 최소 비용으로 연결하는 MST - Minimum Spanning Tre](https://2jinishappy.tistory.com/114?category=920680)
4. [BST(Binary Search Tree)와 Find/Insert/Delete?](https://2jinishappy.tistory.com/100?category=920680)
4. [Color를 이용해서 Self-Balancing을 구현하는 Red-Black Tree](https://2jinishappy.tistory.com/318?category=920680)
### Stack
1. [ADT Stack의 정의와 연산 구현 (create, push, pop, top, empty)](https://2jinishappy.tistory.com/134?category=920680)
### Queue
1. [두 개의 Stack으로 Queue 자료구조를 구현해봅시다](https://2jinishappy.tistory.com/304?category=920680)
### Graph
1. [사이클이 없는 방향 그래프 DAG - Directed Acyclic Graph](https://2jinishappy.tistory.com/225?category=920680)
### Heap
1. [자료구조 Heap(힙)이란? 기본 연산과 HeapSort, Heapify에 대해](https://2jinishappy.tistory.com/102?category=920680)
### Union-Find
1. [서로소 집합을 관리하는 Disjoint Set(Union Find)](https://2jinishappy.tistory.com/175?category=920680)
### Hash
1. [빠른 데이터 검색을 위한 Hashing과 Hash Table](https://2jinishappy.tistory.com/230?category=920680)
2. [Hash Table에서의 Collision Handling - Linear Probing, Separate Chaining](https://2jinishappy.tistory.com/231?category=920680)
## ✅ 알고리즘
### Time Complexity and Big-Oh Notation
1. [시간복잡도 Big-O(빅 오) 표기법](https://2jinishappy.tistory.com/122?category=903864)
### Recursion
1. [재귀 구현에서 Recursion과 Iteration의 차이점](https://2jinishappy.tistory.com/132?category=903864)
### Sort
1. [Sort Algorithm(Bubble/Insert/Selection/Merge/Quick)과 시간복잡도](https://2jinishappy.tistory.com/166?category=903864)
2. [Quick Sort 정의, 알고리즘 및 코드에 대해](https://2jinishappy.tistory.com/75?category=903864)
### Graph
1. [무방향그래프에서의 Cut Vertex와 Biconnected Components](https://2jinishappy.tistory.com/169?category=903864)
2. [방향 그래프에서 사이클의 집합 Strongly Connected Component](https://2jinishappy.tistory.com/229?category=903864)
3. [그래프의 Vertex를 정렬하는 Topological Sort - Kahn's Algorithm](https://2jinishappy.tistory.com/161?category=903864)
4. [Connected Graph에서 MST를 생성하는 Kruskal's Algorithm(Greedy, Union Find)](https://2jinishappy.tistory.com/174?category=903864)
5. [Connected Graph에서 MST를 생성하는 Prim's Algorithm(Greedy, Priority Queue)](https://2jinishappy.tistory.com/176?category=903864)
6. [Edge-Weighted Graph에서의 최단경로를 찾는 Dijkstra Algorithm](https://2jinishappy.tistory.com/178?category=903864)
7. [Weighted Graph에서 최단거리를 찾는 Bellman-Ford Algorithm](https://2jinishappy.tistory.com/184?category=903864)
### Divide and Conquer
1. [Divide-and-Conquer 알고리즘과 Master Theorem](https://2jinishappy.tistory.com/96?category=903864)
### Dynamic Programming
1. [Dynamic Programming 문제를 위한 다섯 가지 단계](https://2jinishappy.tistory.com/273?category=903864)
### Operating System Algorithm
1. [LRU(Least Recently Used Algorithm) Algorithm이란? Python 구현](https://2jinishappy.tistory.com/154?category=903864)
### Etc
1. [Loop-Invariant in Iteration](https://2jinishappy.tistory.com/188?category=903864)
2. [Quick Select를 O(n)에 구현 가능한 Median of Medians 알고리즘](https://2jinishappy.tistory.com/127?category=903864)
3. [Array의 k번째 작은 element 찾기 - QuickSelect 알고리즘](https://2jinishappy.tistory.com/124?category=903864)
4. [Kadane's Algorithm(카다네 알고리즘) SubArray 최대합 구하기](https://2jinishappy.tistory.com/120?category=903864)
