Given a list of system packages, some packages cannot be installed until the other packages are installed. Provide a valid sequence to install all of the packages.
e.g.
a relies on b
b relies on c
then a valid sequence is [c, b, a]

public List installPackages(List packages) {
    if(packages == null || packages.isEmpty()) return new LinkedList();

    int n = packages.size();
    int[] parentsCount = new int[n];

    for(Node package: packages) {
    	for(Node child: package.children) {   
    		parentsCount[child.label]  ;
    	}
    }


    List sequence = new LinkedList<>(); //output to return
    for(Node package: packages) {
    	dfs(sequence, parentsCount, package);
    }

    return sequence;
}

private void dfs(List sequence, int[] parentsCount, Node package) {
    if(parentsCount[package.label] == 0) {      
   	sequence.add(package.label);             //install package
    	parentsCount[package.label] --;        
    	for(Node child: package.children) {
    		parentsCount[child.label]-- ;  
    		dfs(sequence, parentsCount, child);
    	}
    }
}