Category: math

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Given nums = sumRange(0, 2): 1 sumRange(2, 5): …

From this post, we know the non-deterministic approach to compute the approximation of math constant PI. The random algorithms e.g. such as xorshift need to be of high quality …

A Hash function returns a 32-bit (or sometimes 64-bit) integers for any given length of data. The function has to be as fast as possible and the collision should …

I have a C# function that generates a random upper case string of given length. It looks straightforward and the class StringBuilder is used to concatenate each random character. …

Count the number of prime numbers less than a non-negative number, n. Submit your solution to: https://leetcode.com/problems/count-primes/ Naive Solution The first solution is straightforward, a prime number is a …