File tree 1 file changed +5
-14
lines changed
1 file changed +5
-14
lines changed Original file line number Diff line number Diff line change 14
14
1 . [ hash] ( ./hash )
15
15
1 . [ graph] ( ./graph )
16
16
17
-
18
- -----------------------
19
17
## 실전
20
18
1 . [ brute force] ( ./brute_force )
21
19
1 . [ simulation] ( ./simulation )
22
- 1 . DP
23
- 1 . 탐욕법
24
- 1 . 분할 정복
20
+ 1 . [ two pointers, sliding window] ( ./two_pointers_sliding_window )
21
+ 1 . dynamic programming(DP)
25
22
1 . binary search
23
+ 1 . shortest path
24
+ 1 . union-find
26
25
1 . topological sort
27
- 1 . KMP
28
-
29
-
30
- ## coding convention
31
- - 우선순위는 가독성, 성능, 짧은 코드 순으로 한다.
32
- - 42 seoul의 norminette 준수를 기본으로 한다.
33
- - 1파일 5함수 제한은 제외한다.
34
- - 함수 25줄 제한은 최대한 지키고 30줄까지 인정한다.
26
+ 1 . trie
35
27
36
28
## contribution & feedback
37
29
[ nadarm] ( https://github.com/nadarm )
38
30
, [ 365kim] ( https://github.com/365kim )
39
- , [ nr8121] ( https://github.com/nr8121 )
40
31
, [ robolovo] ( https://github.com/robolovo )
41
32
, [ exgs] ( https://github.com/exgs )
You can’t perform that action at this time.
0 commit comments