8000 Divisible sum pairs · Issue #32 · sapanz/Hackerrank-Problem-Solving-Python-Solutions · GitHub
[go: up one dir, main page]

Skip to content
Divisible sum pairs #32
Open
Open
@n-freman

Description

@n-freman

your code will give IndexError

because when it reaches i == len(ar)-1 it tries to get ar[j] where j == i + 1 == len(ar)

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions

      0