Alex Ermashev esase

## majority_element.js
/**
 * @param {number[]} nums
 * @return {number}
 */
var majorityElement = function(nums) {
    let occurrences = 1;
    let majorityNumber = nums[0];

    for (let i = 1; i < nums.length; i++) {
        if (nums[i] === majorityNumber) {

## number_of_1_bits.js
 var hammingWeight = function(n) {
    let bitsCount = 0;

    for (let i = 1; i <= 32; i++) {
        if (n & 1) {
            bitsCount++;
        }

        n = n >> 1;
    }

## maximum_depth_of_binary_tree.js
/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root

## symmetric_tree.js
/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root

## min_stack.js
var MinStack = function() {
    this.stack = []
    this.historyStack = [];
};

/**
 * @param {number} val
 * @return {void}
 */
MinStack.prototype.push = function(val) {

## swap_two_vars.js
let a = 2;
let b = 4;

a = a ^ b;
b = a ^ b;
a = a ^ b;

console.log(a, b);

## single_number.js
/**
 * @param {number[]} nums
 * @return {number}
 */
var singleNumber = function(nums) {
    let result = 0;

    for (let value of nums) {
        result ^= value;
    }

## valid_palindrome.js
/**
 * @param {string} s
 * @return {boolean}
 */
var isPalindrome = function(s) {
    s = s.replace(/[^a-z0-9/s]/gi, '').toLowerCase();

    return s.split('').reverse().join('') === s;
};

## same_tree.js
/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} p

## binary_tree_inorder_traversal.js
/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
	/**
	* @param {number[]} nums
	* @return {number}
	*/
	var majorityElement = function(nums) {
	let occurrences = 1;
	let majorityNumber = nums[0];

	for (let i = 1; i < nums.length; i++) {
	if (nums[i] === majorityNumber) {
	var hammingWeight = function(n) {
	let bitsCount = 0;

	for (let i = 1; i <= 32; i++) {
	if (n & 1) {
	bitsCount++;
	}

	n = n >> 1;
	}
	/**
	* Definition for a binary tree node.
	* function TreeNode(val, left, right) {
	* this.val = (val===undefined ? 0 : val)
	* this.left = (left===undefined ? null : left)
	* this.right = (right===undefined ? null : right)
	* }
	*/
	/**
	* @param {TreeNode} root
	var MinStack = function() {
	this.stack = []
	this.historyStack = [];
	};

	/**
	* @param {number} val
	* @return {void}
	*/
	MinStack.prototype.push = function(val) {
	let a = 2;
	let b = 4;

	a = a ^ b;
	b = a ^ b;
	a = a ^ b;

	console.log(a, b);
	/**
	* @param {number[]} nums
	* @return {number}
	*/
	var singleNumber = function(nums) {
	let result = 0;

	for (let value of nums) {
	result ^= value;
	}
	/**
	* @param {string} s
	* @return {boolean}
	*/
	var isPalindrome = function(s) {
	s = s.replace(/[^a-z0-9/s]/gi, '').toLowerCase();

	return s.split('').reverse().join('') === s;
	};