README.md

problem-solving

problem solving with JAVA, Kotlin, Python, etc.

leetcode / dltjddhs

acmicpc.net / so3500

codeground

SW expert Academy / so3500

programmers

comment

/*
* 문제:
* link: 
* 알고리즘: 
* 풀이방법: 
* 의사코드(Pseudo Code)
*
* 시간복잡도(Time Complexity)
*  
* 공간복잡도(Space Complexity)
*   
* */

// code

---

Dynamic Programming(동적 계획법)

LIS(Longest Increasing Sequence) 최대 부분 증가 수열

Segment Tree

Greedy

BFS, DFS, Graph

Stack, Queue

Implementation, Math

Brute-Force

ETC