POTD- 18/07/2024 | Longest Alternating Subsequence | Problem of the Day | GeeksforGeeks Practice

Welcome to the daily solving of our PROBLEM OF THE DAY with Jay Dalsaniya. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Data Structures and Algorithms but will also help you build up problem-solving skills.
So come along and solve the GFG POTD of 18thJuly 2024 with us!
💻 Try it Yourself: practice.geeks...
Find daily solutions for POTD here on our channel! Make sure you are subscribed and stay updated.
-----------------------------------------------------------------------------------------
🏆 Take part in our Weekly Coding Contests: practice.geeks...
📖 Master Competitive Programming - Complete Beginner to Advanced: practice.geeks...
-----------------------------------------------------------------------------------------
Follow us and stay updated on everything happening in the world of geeks:
📱 Twitter- / geeksforgeeks
📝 LinkedIn- / geeksforgeeks
🌐 Facebook- / geeksforgeeks.org
📷 Instagram- www.instagram....
#GFGPractice #GeeksforGeeks #ProblemofTheDay #CodingQuestions #POTD #POTD18JULY #problemsolving #practice #dsa #LongestAlternatingSubsequence #arrays #dynamicprogramming #datastructures #alogrithim #jaydalsaniya #gfgpractice

[@ashwinbalaji26]

Please explain brute force approach for the problem, then better followed by optimal. Also explain the intuition behind the optimal solution. Aditya Rajiv's explanation for this problem was easy to understand.

[@saianuragone828]

This could be a worst possible explanation of a solution, just simply dry running the working code without even giving the intuition behind it😪

[@aizad786iqbal]

you shuold not directly jump to code doing dry run, first tell how we derived the code in the first place..
you never explained why it's inc =dec+1