Subsequence Sum K

CodeChefOpen on judge ↗

You are given an array $nums$ of integers and an integer $k$.\ Your task is to determine whether there exists **any subsequence** of $nums$ whose sum of elements is exactly equal to $k$. If such a subsequence exists, print **"Yes"**, otherwise print **"No"**. A **subsequence** is formed by choosing **some elements from the array while keeping their original order**, but **not necessarily taking

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI