2000+ DP #6 | 1870E - Another MEX Problem | Solving Dynamic Programming Codeforces Problems

Поділитися
Вставка
  • Опубліковано 7 лис 2024

КОМЕНТАРІ • 7

  • @mostafasazid
    @mostafasazid 2 місяці тому

    Wow helpful...plz regularly add more prblm..dsu on tree.. Tough One

  • @HarshKumar-xw5nn
    @HarshKumar-xw5nn 4 місяці тому

    Really amazing explanation sir ❤

  • @Shanky_17
    @Shanky_17 2 місяці тому

    Hi shayan, thanks very much for this video !!
    Also could you recommend some problems for trying out more ?? for people who have solve cses + atcoder dp set
    For particularly me, I am stuck with the 1600-1800 range of dp problems. (I have tried with adding tags but there are less problems)

  • @vishalmishra-ue4te
    @vishalmishra-ue4te 4 місяці тому +1

    Awesome bro

  • @shudhanshusingh1401
    @shudhanshusingh1401 4 місяці тому

    educational round 44 problem E pencil and boxes dp problem 2000+ rated, please take this problem in your video brother

  • @fahmidzaman
    @fahmidzaman 4 місяці тому

    Shayan Bro please take a some sessions on graph and tree bfs dfs

  • @drbardhan4615
    @drbardhan4615 4 місяці тому

    Bro if you have sometime please make a solution on a leetcode question (minimum cost to merge stone), I was not able to find the state of dp, can u please give me intuition of solving it. Thnx.