CodeMonk: Our story

The Internet has a plethora of learning resources for anyone who wants to become a better programmer. However, there is no single place where one can find information and practice...

The Internet has a plethora of learning resources for anyone who wants to become a better programmer. However, there is no single place where one can find information and practice on the topics required to master the art of competitive programming. This is one of the reasons why many programmers in the pursuit of learning competitive programming attain a level of saturation after a while.

The difficulty that is faced in consuming content from varied sources led us to start Code Monk—a weekly series of tutorials on all the topics of computer science. The topics start from the basics of algorithms and gradually move on to more complicated concepts. Each tutorial is followed by a short programming challenge to help you test your understanding of the concepts.

This series aims to help you take your programming skills to the next level. We will provide you with learning content and room for practicing under one common platform. While the series focuses on aspiring programmers, experts can also use it to revise their concepts and improve their programming karma.

After you signup, you will receive a link to the tutorials on the weekly topics every Thursday. A practice challenge will be conducted on the subsequent Wednesday on the same topic. All the problems from the challenges will be updated with proper editorials for your reference.

The current schedule is as follows:

 

  • Week 1: Arrays & Strings (Completed)
  • Week 2: Sorting (Completed) and Searching (Completed)
  • Week 3: Stacks and Queues (Completed) and Number Theory – Part I (Completed)
  • Week 4: C++ STL (Completed)
  • Week 5: Graph Theory – Part I (2nd July)
  • Week 6: Hashing(8th July)
  • Week 7: Union Find Data Structure (15th July)
  • Week 8: Heaps, Priority Queue (22nd July)
  • Week 9: Minimum Spanning Trees (29th July)
  • Week 10: Greedy Technique (5th August)
  • Week 11: Dynamic Programming-Easy (12th August)
  • Week 12: Bit Manipulation (19th August)
  • Week 13: Computational Geometry (26th August)
  • Week 14: Binary Tree, Binary Search Tree (2nd September)
  • Week 15: Graph Theory – Part II (9th September)
  • Week 16: Number Theory Part II (PnC,Probability) (16th September)
  • Week 17: Segment Tree , RMQ, Lazy Propagation (23rd September)
  • Week 18: Binary Indexed Tree (30th September)
  • Week 19: String Algorithms (7th October)
  • Week 20: Number Theory – Part III (14th October)
  • Week 21: Tries,Suffix Tree (21st October)
  • Week 22: Suffix Array (28th October)
  •  Week 23: Dynamic Programming Part II (4th November)
  • Week 24 and later: Will be published…

There will be a common leaderboard for the complete series along with individual leaderboards for every challenge. The top 3 participants will receive t-shirts. The focus of this series is to encourage beginners and our team will manually curate the list of winners based on their profiles.

So, what are you waiting for? Start mastering the art of programming through learning and practicing today!

Update (10/12)

We have a new and improved version of CodeMonk. Read all about the changes in V2.0 this version here.

About the author

Leave a Reply

avatar
  Subscribe  
Notify of

Know what it takes to level up as a developer
in today's tech-powered world