Find Pair with Sum Problem

Find Pair with Sum Problem — ExecCode Easy DSA Practice

Solve the Find Pair with Sum problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Find Pair with Sum. Your task is to in Find Pair with Sum, the goal is to transform, count, or select values according to the exact rule. A sequence of values is given, and order matters. n, nums line, target. Return Yes or No.

Examples

Input {"nums": [1, 4, 2, 10, 5], "target": 7}; Output Yes. Input {"nums": [1, 4, 2, 10, 5], "target": 100}; Output No. Input {"nums": [1, 2, 3, 4, 5], "target": 9}; Output Yes

Constraints

Unsorted array allowed

Practice Find Pair with Sum free on ExecCode. Browse DSA problems, topic map, and placement guides.