belowthebelt's blog

Code Monk: Minimum Spanning Tree
By belowthebelt, history, 9 years ago, In English

Hello, Codeforces community!

Firstly, I want to apologize to all of you for not posting about Code Monk previously. I realize now that it could have probably helped a lot of people who are beginners to competitive programming, but anyway, I don't think it is still late to introduce it! :)

Let me tell you about Code Monk. I was working with HackerEarth for a while in this summer, where MDCCXXIX and I came up with this idea.

The truth is that the Internet is full of learning resources for anyone who wants to become a better programmer. However, we felt, that there was no single place, where one could find information and practice as well as on the topics required to feel confident about a lot of topics. This is one of the reasons why many programmers in the pursuit of learning competitive programming attain a level of saturation after a while. They face difficulty in consuming content from different sources.

This led us to start Code Monk – a weekly series of tutorials on topics, starting from the basics of algorithm and gradually moving on to more complicated concepts. Every tutorial is followed by a short programming challenge to test your understanding!

That's how this page was created: Code Monk :) — you guys can take a look at whatever topics have been covered already on this page directly. I know, the categories are not very well arranged as of now. There's a lot to be done on that page. Don't worry, the changes will keep happening!

--

But, here I want to invite you guys to the contest which begins in an hour. (Sorry for such a short notice!) The contest is based on Minimum Spanning Trees. The link to the contest: Code Monk: Minimum Spanning Tree

The setter and the translator of the contest is: shef_2318 and the tester and the editorialist is: I_love_Tanya_Romanova. They've worked extremely hard on making this contest a unique experience for people who want to strengthen their concepts of Minimum Spanning Trees.

Good luck to everyone, and have fun! :)

PS: Feedback / ideas / criticism — everything is welcome.

  • Vote: I like it
  • +44
  • Vote: I do not like it

Comments Comments (10)
| Write comment?
»
9 years ago, # |
  Vote: I like it +3 Vote: I do not like it

"Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!"

What mean of "newbie" in HackerEarth ?

→ Reply
  • »
    »
    9 years ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    In Codeforces terms, someone who's still in Division 2, I would say. Because he/she would have a lot to learn and improve in terms of algorithmic and implementation skills!

    → Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

May I know what will be the next topic ? I mean what will be after MST ? How one would know that

→ Reply
»
9 years ago, # |
  Vote: I like it -8 Vote: I do not like it

Hey, please tell me, am I considered to be a newbie and is there at least one guy from top3 who is not a newbie? (just asking :D)

→ Reply
  • »
    »
    9 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You are from div1 :D(ooppss)

    → Reply
    • »
      »
      »
      9 years ago, # ^ |
      ← Rev. 2   Vote: I like it -8 Vote: I do not like it

      Is HackerEarth's understanding of newbie somehow related to Codeforces? I hope this is not exactly how it works. What makes me happy now is that the guys from top 2 are red so if I am considered to be a newbie, I must get a T-shirt so I will lose nothing since being considered as a newbie doesn't depend on me :D

      → Reply
»
9 years ago, # |
  Vote: I like it +9 Vote: I do not like it

This is great !!! :) as i'm new and learning algorithms for a few months, i can now learn a new algorithm every week and also solve related problem there :) thanks belowthebelt and MDCCXXIX :)

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

do write the name of the winners. I finished 28th >.<

→ Reply