upd

org/study_deck_02/dsa/tries/0208-implement-trie-prefix-tree.org

@@ -49,7 +49,7 @@ trie.search("app");     // return True
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 208 :lc-lang python3
 class Trie:
 
     def __init__(self):
@@ -73,7 +73,7 @@ class Trie:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 208
 class Trie {
 public:
     Trie() {

org/study_deck_02/dsa/tries/0211-design-add-and-search-words-data-structure.org

@@ -52,7 +52,7 @@ wordDictionary.search("b.."); // return True
 Write your approach here.
 
 ** TODO Python
-#+begin_src python
+#+begin_src python :lc-problem 211 :lc-lang python3
 class WordDictionary:
 
     def __init__(self):
@@ -72,7 +72,7 @@ class WordDictionary:
 #+end_src
 
 ** TODO C++
-#+begin_src cpp
+#+begin_src cpp :lc-problem 211
 class WordDictionary {
 public:
     WordDictionary() {

org/study_deck_02/dsa/tries/0212-word-search-ii.org

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

org/study_deck_02/dsa/tries/1166-design-file-system.org

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