Actually, I was going to learn DP, and hence expecting to solve some beginner level problems, please help me, a list or any link with a collection of problems would be helpful.
Thanks.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 14.11.2024 19:55:46 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
I'm also a beginner, so I'm listing out some easiest problems.(From the easiest to the not so easy ones)
Shortest path in a Directed Acyclic Graph.
Longest Increasing Subsequences.
Knapsack problem.
I'm not an expert in both DP and English, but I'd like to help a little.
Hope not so many downvotes (QAQ)
Work through the LeetCode Archive of DP problems for the Easy and Medium level. They are classic ideas.