Alex Ermashev esase

esase / majority_element.js

Created April 22, 2022 05:14

Majority element [https://leetcode.com/problems/majority-element]

	/**
	* @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) {

esase / number_of_1_bits.js

Created April 18, 2022 04:43

Number of 1 bits [https://leetcode.com/problems/number-of-1-bits]

	var hammingWeight = function(n) {
	let bitsCount = 0;

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

	n = n >> 1;
	}

esase / maximum_depth_of_binary_tree.js

Created April 17, 2022 10:18

Maximum depth of binary tree [https://leetcode.com/problems/maximum-depth-of-binary-tree]

	/**
	* 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

esase / symmetric_tree.js

Created April 17, 2022 09:54

Symmetric tree [https://leetcode.com/problems/symmetric-tree]

	/**
	* 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

esase / min_stack.js

Created April 17, 2022 07:30

Min stack [https://leetcode.com/problems/min-stack]

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

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

esase / swap_two_vars.js

Created April 15, 2022 04:13

Swap two variables using XOR

esase / single_number.js

Created April 14, 2022 16:32

Single number [https://leetcode.com/problems/single-number]

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

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

esase / valid_palindrome.js

Created April 7, 2022 05:41

Valid palindrome [https://leetcode.com/problems/valid-palindrome]

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

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

esase / same_tree.js

Created April 6, 2022 12:31

Same tree [https://leetcode.com/problems/same-tree]

	/**
	* 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

esase / binary_tree_inorder_traversal.js

Created April 6, 2022 05:05

Binary tree inorder traversal [https://leetcode.com/problems/binary-tree-inorder-traversal/]

	/**
	* 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