Why??
Because I wanted
Notes To Self
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.
LeetCode 2611. Mice and Cheese
2611. Mice and Cheese There are two mice and n different types of cheese, each type of cheese should be eaten by exactly one mouse. A point of the cheese with index i (0-indexed) is: reward1[...
LeetCode 2426. Number of Pairs Satisfying Inequality
2426. Number of Pairs Satisfying Inequality You are given two 0-indexed integer arrays nums1 and nums2, each of size n, and an integer diff. Find the number of pairs (i, j) such that: 0 <= ...