upd

org/study_deck_02/dsa/backtracking/0017-letter-combinations-of-a-phone-number.org

@@ -36,13 +36,13 @@ Output: ["a","b","c"]
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 17 :lc-lang python3
 class Solution:
     def letterCombinations(self, digits: str) -> List[str]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 17
 class Solution {
 public:
     vector<string> letterCombinations(string digits) {

org/study_deck_02/dsa/backtracking/0022-generate-parentheses.org

@@ -30,13 +30,13 @@ Output: ["()"]
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 22 :lc-lang python3
 class Solution:
     def generateParenthesis(self, n: int) -> List[str]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 22
 class Solution {
 public:
     vector<string> generateParenthesis(int n) {

org/study_deck_02/dsa/backtracking/0039-combination-sum.org

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

org/study_deck_02/dsa/backtracking/0040-combination-sum-ii.org

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

org/study_deck_02/dsa/backtracking/0046-permutations.org

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

org/study_deck_02/dsa/backtracking/0051-n-queens.org

@@ -37,13 +37,13 @@ Output: [["Q"]]
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 51 :lc-lang python3
 class Solution:
     def solveNQueens(self, n: int) -> List[List[str]]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 51
 class Solution {
 public:
     vector<vector<string>> solveNQueens(int n) {

org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org

@@ -35,13 +35,13 @@ Output: 1
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 52 :lc-lang python3
 class Solution:
     def totalNQueens(self, n: int) -> int:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 52
 class Solution {
 public:
     int totalNQueens(int n) {

org/study_deck_02/dsa/backtracking/0077-combinations.org

@@ -39,13 +39,13 @@ Explanation: There is 1 choose 1 = 1 total combination.
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 77 :lc-lang python3
 class Solution:
     def combine(self, n: int, k: int) -> List[List[int]]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 77
 class Solution {
 public:
     vector<vector<int>> combine(int n, int k) {

org/study_deck_02/dsa/backtracking/0078-subsets.org

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

org/study_deck_02/dsa/backtracking/0079-word-search.org

@@ -53,13 +53,13 @@ Output: false
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 79 :lc-lang python3
 class Solution:
     def exist(self, board: List[List[str]], word: str) -> bool:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 79
 class Solution {
 public:
     bool exist(vector<vector<char>>& board, string word) {

org/study_deck_02/dsa/backtracking/0090-subsets-ii.org

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

org/study_deck_02/dsa/backtracking/0131-palindrome-partitioning.org

@@ -32,13 +32,13 @@ Output: [["a"]]
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 131 :lc-lang python3
 class Solution:
     def partition(self, s: str) -> List[List[str]]:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 131
 class Solution {
 public:
     vector<vector<string>> partition(string s) {

org/study_deck_02/dsa/backtracking/0351-android-unlock-patterns.org

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

org/study_deck_02/dsa/backtracking/1079-letter-tile-possibilities.org

@@ -46,13 +46,13 @@ Output: 1
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 1079 :lc-lang python3
 class Solution:
     def numTilePossibilities(self, tiles: str) -> int:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 1079
 class Solution {
 public:
     int numTilePossibilities(string tiles) {

org/study_deck_02/dsa/backtracking/1863-sum-of-all-subsets-xor-total.org

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