LeetCode 110. Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.
Notes To Self
Sieve of Eratosthenes - Or How to Hunt Primes
Sift the Two's and Sift the Three's. The Sieve of Eratosthenes. When the multiples sublime,The numbers that remain are Prime.
LeetCode 3584 Maximum Product of First and Last Elements of a Subsequence
You are given an integer array nums and an integer m. Return the maximum product of the first and last elements of any subsequence of nums of size m.
Every composite integer has a divisor less than or equal to its square root. But why?
For any composit integer, it has always a divisor less than or equal to its square root.
Short Logic 1 - Word logic
Which one does not belong?
Existence proof - A simple yet an interesting problem
Show that a solution exist for this easy problem :)
Markdown Guide
Examples of text, typography, math equations, diagrams, flowcharts, pictures, videos, and more.
LeetCode 124. Binary Tree Maximum Path Sum
124. Binary Tree Maximum Path Sum A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequen...
LeetCode 1559. Detect Cycles in 2D Grid
1559. Detect Cycles in 2D Grid Given a 2D array of characters grid of size m x n, you need to find if there exists any cycle consisting of the same value in grid. A cycle is a path of length 4 or...
LeetCode 421. Maximum XOR of Two Numbers in an Array
Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.