upd

org/study_deck_02/dsa/two-pointers/0011-container-with-most-water.org

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

org/study_deck_02/dsa/two-pointers/0015-3sum.org

@@ -53,13 +53,13 @@ Explanation: The only possible triplet sums up to 0.
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 15 :lc-lang python3
 class Solution:
     def threeSum(self, nums: list[int]) -> list[list[int]]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 15
 class Solution {
 public:
     vector<vector<int>> threeSum(vector<int>& nums) {

org/study_deck_02/dsa/two-pointers/0042-trapping-rain-water.org

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

org/study_deck_02/dsa/two-pointers/0125-valid-palindrome.org

@@ -49,13 +49,13 @@ Since an empty string reads the same forward and backward, it is a palindrome.
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 125 :lc-lang python3
 class Solution:
     def isPalindrome(self, s: str) -> bool:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 125
 class Solution {
 public:
     bool isPalindrome(string s) {

org/study_deck_02/dsa/two-pointers/0167-two-sum-ii-input-array-is-sorted.org

@@ -58,13 +58,13 @@ Explanation: The sum of -1 and 0 is -1. Therefore index1 = 1, index2 = 2. We ret
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 167 :lc-lang python3
 class Solution:
     def twoSum(self, numbers: List[int], target: int) -> List[int]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 167
 class Solution {
 public:
     vector<int> twoSum(vector<int>& numbers, int target) {

org/study_deck_02/dsa/two-pointers/0259-3sum-smaller.org

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

org/study_deck_02/dsa/two-pointers/0344-reverse-string.org

@@ -34,7 +34,7 @@ Output: ["h","a","n","n","a","H"]
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 344 :lc-lang python3
 class Solution:
     def reverseString(self, s: List[str]) -> None:
         """
@@ -43,7 +43,7 @@ class Solution:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 344
 class Solution {
 public:
     void reverseString(vector<char>& s) {