Math & Geometry

Problems that lean on a specific mathematical insight — number theory, combinatorics, or coordinate geometry — rather than a general algorithmic pattern.

Overview Q&A MCQ

Q1.What is the time complexity of the Sieve of Eratosthenes for finding all primes up to n?

Q2.What does the greatest common divisor (GCD) of two numbers represent?

Q3.What is the time complexity of the Euclidean algorithm for computing GCD(a, b)?

Q4.What does the cross product of two 2D vectors tell you, which is commonly used in geometry problems like determining turn direction?