title: Check Whether Given Degrees Vertices Represent Graph Tree
signature: fun checkWhetherGivenDegreesVerticesRepresentGraphTree(degree: ArrayList<Int>, n: Int): Boolean {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Boolean, expected:Boolean):Boolean{
    return actual.equals(expected)
  }
  fun driver(degree: ArrayList<Int>, n: Int, expected:Boolean):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(degree, n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(arrayListOf(2, 3, 1, 1, 1), 5, true)
      println("TEST-0...${result}")
      
      result = driver(arrayListOf(2, 2, 1, 1, 2), 5, true)
      println("TEST-1...${result}")
      
      result = driver(arrayListOf(2, 2, 1, 1, 1), 5, false)
      println("TEST-2...${result}")
      
      result = driver(arrayListOf(0, 0, 0, 3, 3, 4), 6, true)
      println("TEST-3...${result}")
      
      result = driver(arrayListOf(-10, 12, 2), 3, true)
      println("TEST-4...${result}")
      
      result = driver(arrayListOf(1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0), 19, false)
      println("TEST-5...${result}")
      
      result = driver(arrayListOf(1, 6, 10, 13, 15, 17, 18, 23, 26, 28, 30, 32, 32, 33, 36, 39, 39, 41, 43, 50, 50, 51, 53, 54, 59, 59, 63, 63, 63, 66, 66, 71, 71, 74, 78, 89, 89, 93), 30, false)
      println("TEST-6...${result}")
      
      result = driver(arrayListOf(66, -96, -14, 74, -20), 4, false)
      println("TEST-7...${result}")
      
      result = driver(arrayListOf(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), 31, false)
      println("TEST-8...${result}")
      
      result = driver(arrayListOf(97, 73, 87, 45, 64, 30, 53, 50, 62, 42, 28, 58, 31, 90), 10, false)
      println("TEST-9...${result}")
      
          
  }
  
  main()
source_py: def check_whether_given_degrees_vertices_represent_graph_tree(degree, n):
      deg_sum = sum(degree)
      if ((2 * (n - 1)) == deg_sum):
          return True
      else:
          return False
source_cpp: bool check_whether_given_degrees_vertices_represent_graph_tree(vector<int> degree, int n) {
    int deg_sum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) deg_sum += degree [ i ];
    return ( 2 * ( n - 1 ) == deg_sum );
  }