LeetCode #376: Wiggle Subsequence

LeetCode Question - 376. Wiggle Subsequence 🧠 About the Series Problem-solving is a key skill set for any tech-related stuff you might be working on. When it comes to developers it's one of the most crucial skills which is needed in almost any day-to-day code you might be writing. So, this series of blogs is all about practicing Daily LeetCode Challenges & Problem-solving. 🚀 Earlier in this series: LeetCode #1465: Maximum Area of Cake After Cuts . Problem Statement Wiggle Subsequence A wiggle sequence is a sequence where the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with one element and a sequence with two non-equal elements are trivially wiggle sequences. For example, [1, 7, 4, 9, 2, 5] is a wiggle sequence because the differences (6, -3, 5, -7, 3) alternate between positive and negative. In contrast, [1, 4, 7, 2, 5] and [1, 7, 4, 5, 5] are not wiggle sequ