upd

org/study_deck_02/dsa/intervals/0056-merge-intervals.org

@@ -48,13 +48,13 @@ Explanation: Intervals [1,4] and [4,7] are considered overlapping.
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 56 :lc-lang python3
 class Solution:
     def merge(self, intervals: List[List[int]]) -> List[List[int]]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 56
 class Solution {
 public:
     vector<vector<int>> merge(vector<vector<int>>& intervals) {

org/study_deck_02/dsa/intervals/0057-insert-interval.org

@@ -49,13 +49,13 @@ Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 57 :lc-lang python3
 class Solution:
     def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 57
 class Solution {
 public:
     vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {

org/study_deck_02/dsa/intervals/0252-meeting-rooms.org

@@ -8,11 +8,11 @@
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 252 :lc-lang python3
 
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 252
 
 #+end_src

org/study_deck_02/dsa/intervals/0253-meeting-rooms-ii.org

@@ -8,11 +8,11 @@
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 253 :lc-lang python3
 
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 253
 
 #+end_src

org/study_deck_02/dsa/intervals/0435-non-overlapping-intervals.org

@@ -50,13 +50,13 @@ Explanation: You don't need to remove any of the intervals since they're
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 435 :lc-lang python3
 class Solution:
     def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 435
 class Solution {
 public:
     int eraseOverlapIntervals(vector<vector<int>>& intervals) {

org/study_deck_02/dsa/intervals/0986-interval-list-intersections.org

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

org/study_deck_02/dsa/intervals/1851-minimum-interval-to-include-each-query.org

@@ -54,13 +54,13 @@ Explanation: The queries are processed as follows:
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 1851 :lc-lang python3
 class Solution:
     def minInterval(self, intervals: List[List[int]], queries: List[int]) -> List[int]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 1851
 class Solution {
 public:
     vector<int> minInterval(vector<vector<int>>& intervals, vector<int>& queries) {