Skip to content

Commit 72d4d90

Browse files
committed
auto - update readme file
1 parent dc18966 commit 72d4d90

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

README.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -52,9 +52,9 @@
5252

5353
| 이름 | 태그 | 풀이 | 완료 | 난이도 |
5454
| ------------------------------------------------------------------------------------- | -------------------------------------- | -------------------------------------------------------------------------- | ---- | ------ |
55-
| [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Dynamic Programming, Math, Memoization | [n-th-tribonacci-number.py](./leetcode/1137.%20N-th%20Tribonacci%20Number) | ✔️ | None |
56-
| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Dynamic Programming, Math, Memoization | [climbing-stairs.py](./leetcode/70.%20Climbing%20Stairs) | ✔️ | None |
57-
| [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | String | [zigzag-conversion.py](./leetcode/6.%20ZigZag%20Conversion) | ✔️ | None |
55+
| [1137. N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | Dynamic Programming, Math, Memoization | [n-th-tribonacci-number.py](./leetcode/1137.%20N-th%20Tribonacci%20Number) | ✔️ | Easy |
56+
| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Dynamic Programming, Math, Memoization | [climbing-stairs.py](./leetcode/70.%20Climbing%20Stairs) | ✔️ | Easy |
57+
| [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | String | [zigzag-conversion.py](./leetcode/6.%20ZigZag%20Conversion) | ✔️ | Medium |
5858

5959

6060
---

0 commit comments

Comments
 (0)