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) {