title: Product Nodes K Th Level Tree Represented String
signature: function productNodesKThLevelTreeRepresentedString(tree: string, k: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(tree: string, k: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(tree, k),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver("(0(5(6()())(4()(9()())))(7(1()())(3()())))", 2, 72);
    console.log(`TEST-0...${result}`);
  
    result = driver("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", 3, 15);
    console.log(`TEST-1...${result}`);
  
    result = driver("(0(5(6()())(4()(9()())))(7(1()())(3()())))", 1, 35);
    console.log(`TEST-2...${result}`);
  
    result = driver("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", 2, 0);
    console.log(`TEST-3...${result}`);
  
    result = driver("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", 4, 1);
    console.log(`TEST-4...${result}`);
  
    result = driver("(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", 100, 1);
    console.log(`TEST-5...${result}`);
  
    result = driver("(0(5(6()())(4()(9()())))(7(1()())(3()())))", 3, 9);
    console.log(`TEST-6...${result}`);
  
    result = driver("(0(5(6()())(4()(9()())))(7(1()())(3()())))", 0, 0);
    console.log(`TEST-7...${result}`);
  
    result = driver("0010", 12, 1);
    console.log(`TEST-8...${result}`);
  
    result = driver("kjtdgmy", 97, 1);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def product_nodes_k_th_level_tree_represented_string(tree, k):
      level = (- 1)
      product = 1
      n = len(tree)
      for i in range(0, n):
          if (tree[i] == '('):
              level += 1
          elif (tree[i] == ')'):
              level -= 1
          elif (level == k):
              product *= (int(tree[i]) - int('0'))
      return product
source_cpp: int product_nodes_k_th_level_tree_represented_string(string tree, int k) {
    int level = - 1;
    int product = 1;
    int n = tree . length ( );
    for ( int i = 0;
    i < n;
    i ++ ) {
      if ( tree [ i ] == '(' ) level ++;
      else if ( tree [ i ] == ')' ) level --;
      else {
        if ( level == k ) product *= ( tree [ i ] - '0' );
      }
    }
    return product;
  }