Greedy Algorithms - Wiggle Subsequence
What is the output of the optimal wiggle subsequence algorithm for the input nums = [5]?
What is the output of the optimal wiggle subsequence algorithm for the input nums = [5]?
medium🧾 Code Trace Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Check input length
Input has one element, so loop does not run.Step 2: Return initial count
Count initialized to 1, returned as is.Final Answer:
Option A -> Option AQuick Check:
Single element subsequence length is 1 [OK]
Quick Trick: Single element input -> output 1 [OK]
Common Mistakes:
MISTAKES- Returning 0 for single element
- Index errors on loop
Trap Explanation:
PITFALL- Candidates may forget base case or mishandle empty/single inputs.
Interviewer Note:
CONTEXT- Tests handling of edge cases and base conditions in code.
Master "Wiggle Subsequence" in Greedy Algorithms
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Greedy Algorithms Quizzes