Dataford
Top 50
Topic
~15h total · Updated weekly · Last refresh Jul 24

Top 50 Math Interview Questions

The most frequently asked Math questions across all roles and companies, ranked by real interview frequency. Updated weekly.

Start practicing free →
Binary Search Implementation and Complexity
Easy

Explain how binary search works on a sorted array and why its time complexity is O(log n).

MathArraysSearching
Recently asked
BuckIdexcelHsbc
Explain Time Complexity of Array Search
Easy

Explain how to analyze the time complexity of a common array search solution and justify the Big O result.

MathArraysSearching
Recently asked
OpenTextCadenceAbhibus
Compare Common Sorting Complexities
Easy

Explain the time complexity of common sorting algorithms and when each is appropriate.

MathArraysSorting
Recently asked
BMC SoftwareOracleNorthwestern University
Compute Nth Fibonacci Number
Easy

Compute the nth Fibonacci number using an iterative dynamic programming approach with O(n) time and O(1) space.

RecursionMathDynamic Programming
Recently asked
FlowcodeExperianAqr Capital Management
Compare TCP and UDP Protocols
Easy

Explain how TCP and UDP differ in reliability, ordering, connection setup, and common use cases.

MathGraphs
Recently asked
Trip GroupColruyt GroupAqr
Sorting Algorithm Complexity Comparison
Easy

Explain and compare the time and space complexities of common sorting algorithms and when each is appropriate.

MathArraysSorting
Recently asked
DeloittePluralsightSumitomo mitsui financial group
More Coding questions with a free account

Sign up to see every question

Create a free account to unlock this list and practice real interview questions.

Get my prep plan

Open any question for its full solution and discussion.

Browse all questions →