SETTER: Vedaanta TESTER: Rivu

CodeMonk (Graph Theory - Part II)

Challenge Over

OPENS AT: Mar 22, 2017, 10:30 AM

CLOSES ON: Mar 22, 2017, 01:30 PM

DURATION: 3h

WINNERS

Social Share

ABOUT CHALLENGE

Introducing HackerEarth Code Monk. The problems will be based on the basics of computer science concepts. Every week, we will release the tutorials, on which the Code Monk challenge will be based on. A week after the release of the tutorial, the Code Monk challenge will be conducted.

The aim is simple - learn the concepts, and put them to use. Do this repeatedly, and you will be well on your way to becoming a master computer programmer!

Also, top 3 newbie winners(Location details of the hacker is a must to claim the prizes) to get HackerEarth T-shirts in each Code Monk challenge!

Topic covered in this week's Code monk are as the following:

Minimum Spanning Tree
Shortest Path Algorithm
Flood-Fill Algorithm
Topological Sort

Problem Setter - Vedaanta Agarwalla
Probelm Tester - Rivu Das

GUIDELINES

  1. Before you attempt programming questions, you should choose a language from the given list.

  2. All inputs for the programming problems are from STDIN and output to STDOUT....

more

FAQs

Sample Challenge

Can I participate in a sample challenge?

Yes, we recommend that you participate in our sample challenge.

This challenge enables you to understand how to pa...

more
Notifications
View All Notifications