org/study_deck_02/dsa/2-d-dynamic-programming/1911-maximum-alternating-subsequence-sum.org

* TODO 1911. Maximum Alternating Subsequence Sum :medium:
#+PROPERTY: STUDY_DECK_02
:PROPERTIES:
:NEETCODE: [[../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]
:END:

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python

#+end_src

** TODO C++
#+begin_src cpp

#+end_src
Add solution notes scaffold and sub-heading format 2026-06-01 02:33:30 +08:00			`* TODO 1911. Maximum Alternating Subsequence Sum :medium:`
refactor: move DSA notes to org/study_deck_02/ 2026-06-01 16:12:21 +08:00			`#+PROPERTY: STUDY_DECK_02`
Add solution notes scaffold and sub-heading format 2026-06-01 02:33:30 +08:00			`:PROPERTIES:`
refactor: move DSA notes to org/study_deck_02/ 2026-06-01 16:12:21 +08:00			`:NEETCODE: [[../../roadmap.org::*1911. Maximum Alternating Subsequence Sum][Roadmap]]`
Add solution notes scaffold and sub-heading format 2026-06-01 02:33:30 +08:00			`:END:`

Add TODO checkboxes to Python/C++ sub-headings 2026-06-01 02:39:53 +08:00			`** TODO Approach`
			`Write your approach here.`

			`** TODO Python`
			`#+begin_src python`

			`#+end_src`

			`** TODO C++`
Add solution notes scaffold and sub-heading format 2026-06-01 02:33:30 +08:00			`#+begin_src cpp`

			`#+end_src`