Add YT link

Author: andrei-punko

README.md

@@ -248,6 +248,7 @@ they contain enough code which describes implementation in a natural way.
 | Декодирование шифра Цезаря                                                                       | [Youtube](https://youtu.be/pjQ9sYo5bVE) | [Code](src/main/java/by/andd3dfx/string/CaesarCipher.java)                                                                                                                          |
 | Прохождение теста подтверждения практического навыка "продвинутый" по Java на hh.ru              | [Youtube](https://youtu.be/ce3g0nIJl24) | -                                                                                                                                                                                   |
 | Поиск НОК для набора чисел                                                                       | [Youtube](https://youtu.be/jR0Ei_3O7EM) | [Code](src/main/java/by/andd3dfx/numeric/LeastCommonMultiple.java)                                                                                                                  |
+| Число Фробениуса и задача Чикена МакНаггетса                                                     | [Youtube](https://youtu.be/itBWtCwWUG4) | [Code](src/main/java/by/andd3dfx/numeric/FrobeniusCoinProblem.java)                                                                                                                 |
 
 ## Materials & notes
 

src/main/java/by/andd3dfx/numeric/FrobeniusCoinProblem.java

@@ -3,9 +3,13 @@
 import by.andd3dfx.dynamic.ChangeWithMinNumberOfCoins;
 
 /**
- * See <a href="https://en.wikipedia.org/wiki/Coin_problem">article</a> in wiki
- * <p>
+ * <pre>
  * Find the largest monetary amount that cannot be obtained using only coins of specified denominations.
+ *
+ * See <a href="https://en.wikipedia.org/wiki/Coin_problem">article</a> in wiki
+ * </pre>
+ *
+ * @see <a href="https://youtu.be/itBWtCwWUG4">Video solution</a>
  */
 public class FrobeniusCoinProblem {