Skip to content

Tag Archives: Maths

Given an array of points points[] in a cartesian coordinate system, the task is to find the count of the squares that are parallel to… Read More
Fast Walsh Hadamard Transform, is an Hadamard ordered efficient algorithm to compute the Walsh Hadamard transform (WHT). Normal WHT computation has N = 2m complexity… Read More
Inverse Fast Fourier transform (IDFT) is an algorithm to undoes the process of DFT. It is also known as backward Fourier transform. It converts a… Read More
Inverse Number Theoretic Transform is a Fast Fourier transform theorem generalization. It is obtained by the replacement of e^(-2piik/N) with an nth primitive unity root.… Read More
Number Theoretic Transform is a Fast Fourier transform theorem generalization. It is obtained by the replacement of e^(-2piik/N) with an nth primitive unity root. So… Read More
It is an algorithm which plays a very important role in the computation of the Discrete Fourier Transform of a sequence. It converts a space… Read More
Given two arrays A and B of size N. Array A is in increasing order and B is in decreasing order. Both arrays are the… Read More

Start Your Coding Journey Now!