Fix typo

Author: iamminji

README.md

@@ -210,7 +210,7 @@
 | [1014](https://leetcode.com/problems/best-sightseeing-pair/)                             | Best Sightseeing Pair                 | medium       | [python](🤔medium/1014.Best-Sightseeing-Pair/best_sightseeing_pair.py)        |           |
 | [1019](https://leetcode.com/problems/next-greater-node-in-linked-list/)                             | Next Greater Node In Linked List                 | medium       | [python](🤔medium/1019.Next-Greater-Node-In-Linked-List/next_greater_node_in_linked_list.py)        |           |
 | [1025](https://leetcode.com/problems/divisor-game/)                             | Divisor Game   | easy       | [python](🙂easy/1025.Divisor-Game/divisor_game.py)        |           |
-| [1027](https://leetcode.com/problems/longest-arithmetic-sequence/)                             | Longest Arithmetic Sequence   | meidum       | [python](🤔medium/1027.Longest-Arithmetic0Sequence/longest_arithmetic_sequence.py)        |           |
+| [1027](https://leetcode.com/problems/longest-arithmetic-sequence/)                             | Longest Arithmetic Sequence   | meidum       | [python](🤔medium/1027.Longest-Arithmetic_Sequence/longest_arithmetic_sequence.py)        |           |
 | [1114](https://leetcode.com/problems/print-in-order/)                             | Print in Order                 | easy       | [python](🙂easy/1114.Print-in-Order/print_in_order.py)        |           |
 | [1122](https://leetcode.com/problems/relative-sort-array/)                             | Relative Sort Array                 | easy       | [python](🙂easy/1122.Relative-Sort-Array/relative_sort_array.py)        |           |
 | [1128](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)                             | Number of Equivalent Domino Pairs                 | easy       | [python](🙂easy/1128.Number-of-Equivalent-Domino-Pairs/number_of_equivalent_domino_pairs.py)        |           |

challenge/2020/july/Flatten_a_Multilevel_Doubly_Linked_List.md

@@ -1,7 +1,7 @@
 ## 문제
 
 doubly linked list 를 flatten 하게 만드는 문제다.
-다만 일만 linked list 랑 다르게 child 가 있고, 이 child 의 우선순위가 더 높아야 한다(?) 는 것이다.
+다만 일반 linked list 랑 다르게 child 가 있고, 이 child 의 우선순위가 더 높아야 한다(?) 는 것이다.
 
 ### 솔루션
 child 가 먼저 선행 되어야 하기 때문에 depth 를 두고, queue 를 heap 으로 써서(child 를 queue 에서 먼저 꺼내려고) bfs 로 풀었다.