Code Challenge of the Day — Count two-sum pairs (medium)

작성자

카테고리:

← 피드로
DEV Community · I Want To Learn Programming · 2026-06-27 개발(SW)

I Want To Learn Programming

I Want To Learn Programming

Posted on Jun 27 • Edited on Jul 15

#challenge #python #beginners #programming

Picks up where Two-sum indices left off.

Same setup as two-sum, but count how many index pairs (i<j) sum to target.
Write count_pairs(nums, target).

Starter:

def count_pairs(nums, target):
    # TODO
    pass

Enter fullscreen mode Exit fullscreen mode

Solve it interactively in your browser (no setup), check your answer instantly, and keep your daily streak going on IWTLP: https://iwtlp.com/challenge

Top comments (0)

Subscribe

pic

Create template

Templates let you quickly answer FAQs or store snippets for re-use.

Dismiss

Code of ConductReport abuse

Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment’s permalink.

Hide child comments as well

For further actions, you may consider blocking this person and/or reporting abuse

원문에서 계속 ↗

코멘트

답글 남기기

이메일 주소는 공개되지 않습니다. 필수 필드는 *로 표시됩니다