upd

org/study_deck_02/dsa/greedy/0978-longest-turbulent-subarray.org

@@ -60,13 +60,13 @@ Output: 1
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 978 :lc-lang python3
 class Solution:
     def maxTurbulenceSize(self, arr: List[int]) -> int:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 978
 class Solution {
 public:
     int maxTurbulenceSize(vector<int>& arr) {