How to get started with the problems on grid walk?

I am new to competitive programming, I started solving the questions from the easy sections(From maximum number of submissions). I solved some of the questions but I always get stuck into the problems of grid walking, I always end up giving up on them. How do I get familiar with such problems.

And please refer me to some good and basic problems on grid walking, and also some source to form the base to solve such problems.

Thanks in advance.

  1. https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-graphs-and-their-data-structures-section-2/

This will give you basic idea of grid floodfill algorithm.

  1. Solve these problems on SPOJ

    http://www.spoj.com/problems/ROADNET/

    http://www.spoj.com/problems/HERDING/

    http://www.spoj.com/problems/KOZE/

    http://www.spoj.com/problems/MAKEMAZE/

    http://www.spoj.com/problems/NATALIAG/

  2. Now proceed as per your wish. You can explore more algorithms and practice more harder questions

EDIT:

More problems:

A_W_S_N

AVMG1

AVMG2

is it good to solve questions from maximum no, if submissions.







sole these :slight_smile:
and get some good tutorials on topcoder
Happy coding:)

3 Likes

Yes …

Yes… Its absolutely good. Solving easy problems first helps to build up your morale.

1 Like

Thanks, buddy.

@arpit728

Here is a blog specifically for problems based on grids !

Problems :

  1. http://codeforces.com/problemset/problem/429/B(medium)

  2. https://www.codechef.com/ACMKOL15/problems/KOL15B(easy)

  3. https://www.codechef.com/problems/CD1IT4

Most of the problems involving grids are either dynamic programming problems or are based on graphs(BFS, DFS, shortest paths, minimum spanning trees etc). Just search for these tags for more problems on codechef,codeforces,spoj .

1 Like