Problem 1963. Grid traversal

Created by Zikobrelli
Appears in Basics - Rounding

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Given a line defined by (x1,y1) & (x2,y2),return the number of squares that the line crosses on the grid (a square is 1x1).

Coming next: return the number of squares for any geometrical shape

Solve

Solution Stats

96 Solutions
27 Solvers

Last Solution submitted on Jun 25, 2025

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Michael Ryan on 1 Nov 2013

Bug: The order of the arguments in the starting function definition is x1, x2, y1, y2, whereas the the order in the test cases is x1, y1, x2, y2.

Rafael S.T. Vieira on 11 Oct 2020

Technically, this problem is actually requesting the number of unique intersections minus one. For instance in the first case of the test suite, the line crosses the point (5,3) which is shared by four squares, but we count only two, which is the expected behaviour when crossing an edge, but not a vertex: https://imgur.com/a/wCQ6SNG

Solution Comments

Show comments

FEATURED DISCUSSION

Why should you share code?

In a discussion on LInkedin about my recent blog post, Do these...

Mike Croucher in General

View Post

Problem Recent Solvers27

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1963. Grid traversal

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Why should you share code?

Problem Recent Solvers27

Suggested Problems

More from this Author12

Problem Tags

Community Treasure Hunt

Problem 1963. Grid traversal

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Why should you share code?

Problem Recent Solvers27

Suggested Problems

More from this Author12

Problem Tags

Community Treasure Hunt

Players