Spontaneous Codeforces problem solving

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

КОМЕНТАРІ • 12

  • @alvinpiter9884
    @alvinpiter9884 4 роки тому +7

    Content like this is very cool. It's like walking into a dark forest (hard problems) and you being the flashlight (live editorial). Keep up the good work, Errichto!

  • @nikhiljha2998
    @nikhiljha2998 4 роки тому +2

    Please make video on this month's codechef long challenge.

  • @ritwizsinha1261
    @ritwizsinha1261 4 роки тому

    Finally some good ol' codeforces

  • @ranjanchaudhary4175
    @ranjanchaudhary4175 4 роки тому +1

    Hey, errichto can we use the following dp for problem C, dp[l][r] represents the number of ways to build the string T[l....r]?

    • @Errichto2
      @Errichto2  4 роки тому

      Didn't I use the same? One difference being that it's ok to be on the right from T.

  • @snehasishsamanta1319
    @snehasishsamanta1319 4 роки тому

    Sir, regarding problems related to trees or graphs which is better - arrays(or vectors) or dynamic memory allocation for implementation.

  • @manmeetsingh1194
    @manmeetsingh1194 4 роки тому

    Can you mention in the comment which topics questions you have covered?

  • @suravijayasree9258
    @suravijayasree9258 4 роки тому

    can u tell me how to solve the c programming code in easy methods and can u suggest me

  • @sahilsharma2952
    @sahilsharma2952 4 роки тому

    Please solve CodeJam Round 1C

  • @onurislak
    @onurislak 4 роки тому

    hi kamil,what is your goal,do you want to work in big companies such as amazon,intel,google?

    • @Errichto2
      @Errichto2  4 роки тому +1

      live a happy life, I guess :D
      I don't see why I would start working for a big company now, read more here github.com/Errichto/youtube/wiki/FAQ

  • @shivanksinghal4352
    @shivanksinghal4352 4 роки тому

    please make video on datastructure like dsu, fenwick tree complex problems.