function printHeap(heap, index, level) {
    if (index >= heap.length) {
        return;
    }
    console.log("  ".repeat(level) + heap[index]);
    printHeap(heap, 2 * index + 1, level + 1);
    printHeap(heap, 2 * index + 2, level + 1);
}

//You can call this function by passing in the heap array and the index of the root node, which is typically 0, and level = 0.

let heap = [3, 8, 7, 15, 17, 30, 35, 2, 4, 5, 9];
printHeap(heap,0,0)

const mongoose = require('mongoose')

const UserSchema = new mongoose.Schema({
	username: {
	type: String,
	required: true
	},
	email: {
	type: String,
	unique: true,
	required: true
	},
	password: {
	type: String,
	required: true
	},
	date: {
	type: Date,
	default: Date.now
	}
})

module.exports = User = mongoose.model('user', UserSchema)

questions = Array.from(document.querySelectorAll(".multiple-choice-question"));
async function hackRadio(question){
	if(question.querySelector(".question-chevron").getAttribute("aria-label") == "Question completed") return;
	let answerChoices = question.querySelectorAll(".zb-radio-button");
	async function guess(answerChoice){
		answerChoice.querySelector("label").click();
	}
	let pause = 0;
	for(let answerChoice of answerChoices){
		setTimeout(()=>{guess(answerChoice)},pause);	//No need to check given that it will record the correct answer anyways.
		pause += 1000;
	}
}
for(let question of questions){
	hackRadio(question);
}
questions = Array.from(document.querySelectorAll(".short-answer-question"));
async function hackShortAnswer(question){
	if(question.querySelector(".question-chevron").getAttribute("aria-label") == "Question completed") return;
	question.querySelector("textarea").value = question.querySelector(".forfeit-answer").textContent;
	//question.querySelector(".check-button").click(); They are smart bastards
}
for(let question of questions){
	const showAnswerButton = question.querySelector(".show-answer-button");
	showAnswerButton.click();
	showAnswerButton.click();
	hackShortAnswer(question);
}

// There are n rings and each ring is either red, green, or blue. The rings are distributed across ten rods labeled from 0 to 9.

// You are given a string rings of length 2n that describes the n rings that are placed onto the rods. Every two characters in rings forms a color-position pair that is used to describe each ring where:

// The first character of the ith pair denotes the ith ring's color ('R', 'G', 'B').
// The second character of the ith pair denotes the rod that the ith ring is placed on ('0' to '9').
// For example, "R3G2B1" describes n == 3 rings: a red ring placed onto the rod labeled 3, a green ring placed onto the rod labeled 2, and a blue ring placed onto the rod labeled 1.

// Return the number of rods that have all three colors of rings on them.


let rings = "B0B6G0R6R0R6G9";
var countPoints = function(rings) {
    
    let sum = 0;
    
	// Always 10 Rods
    for (let i = 0; i < 10; i++) {
        if (rings.includes(`B${i}`) && rings.includes(`G${i}`) && rings.includes(`R${i}`)) {
            sum+=1;
        }
    }
    
    return sum;
    
};

console.log(countPoints(rings));

const hammingDistance = (num1, num2) =>
  ((num1 ^ num2).toString(2).match(/1/g) || '').length;
  
hammingDistance(2, 3); // 1

const powerset = arr =>
  arr.reduce((a, v) => a.concat(a.map(r => r.concat(v))), [[]]);
  
powerset([1, 2]); // [[], [1], [2], [1, 2]]