Pointer Find Pair Sum MEDIUM Pointers Searching 25 XP 0 solved
Mobile coding works. A laptop is faster for long sessions.

Problem

Given an array and a target value S, determine whether any two distinct elements sum to S.

Input format

Input input.txt

- First line: integers N and S (1 ≤ N ≤ 100) - Second line: N space-separated integers

Output format

Output output.txt

- "YES" if such a pair exists, otherwise "NO"

Example

input
5 9
2 4 3 5 7
output
YES

Ready to solve this challenge?

Create a free account to write code, submit solutions, and track your progress.

⌨️ Keyboard Shortcuts

Code Editor
Run Code
Ctrl Enter
Submit Code
Ctrl Shift Enter
Format Code
Shift Alt F
Toggle Comment
Ctrl /
Undo
Ctrl Z
Redo
Ctrl Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc

🔍 Interactive Debugger

0 / 0

Analyzing your code...

📦 Variables

No variables yet

📚 Call Stack
main() line 1
📤 Output
We use cookies

Essential cookies are always active. You can choose to enable preference and analytics cookies. Learn more