DSA LEARNING GAMES

GAME 01

The Algorithm Speed Arena

Fight enemies representing different time complexities from O(1) to O(N!)

O(1) O(N) O(N²)

GAME 02

Constant Kingdom

Master O(1) operations: array access, swaps, and arithmetic

O(1) arr[i]

GAME 03

Linear Road Runner

Walk through N tiles and visualize O(N) linear time

O(N) Linear

GAME 04

The Duel of Searches

Linear Knight vs Binary Ninja - watch searches compete!

O(N) O(log N)

GAME 05

N × N Battlefield

Explore nested loops on an N×N grid arena

O(N²) O(N³)

GAME 06

Divide & Conquer Castle

Map halves each step - experience O(log N)

O(log N) Divide

GAME 07

Time Complexity Classifier

Classify code snippets by their time complexity

Quiz Analysis

GAME 08

Recursion Complexity Visualizer

See recursion trees expand and predict complexity

T(n) Tree

GAME 09

Best/Average/Worst Case Arena

Compare algorithm performance across different inputs

Best Worst

GAME 10

Space Complexity Explorer

Manage memory gems for variables and recursion

Space Memory

GAME 11

Big-O, Θ, Ω Explanation Game

Drag curves into upper, exact, and lower bounds

O Θ Ω

GAME 12

Complexity Guessing Tournament

Fast-paced battles guessing code complexity

Speed Quiz

GAME 13

GCD Gladiator Arena

Fight sequences computing GCD via Euclid's algorithm

GCD Euclid

GAME 14

The Common Multiple Forge

Craft LCM using multiplication and GCD extraction

LCM Forge

GAME 15

Prime Guardian Gate

Check primality by testing divisibility to √N

Prime √N

GAME 16

Prime Castle Sieve Defense

Sieve of Eratosthenes as a tower defense game

Sieve Eratosthenes

GAME 17

Divisor Dungeon

Find all factors of N and collect gems

Factors √N

GAME 18

Coprime Matchmaking Temple

Match coprime pairs where GCD = 1

Coprime GCD=1

GAME 19

Magical Mod Arena

Binary exponentiation with modulo operations

a^b mod m Fast

GAME 20

Prime Range Radar

Count primes in a range using sieve precomputation

Range Query

GAME 21

Factor Tree Garden

Grow prime factorization trees

Factor Tree

GAME 22

Array GCD Arena

Compute running GCD over an array

Array GCD

GAME 23

Modulo Mage School

Cast modular arithmetic spells

mod Spells

GAME 24

Perfect Shield Forge

Check if numbers are perfect (sum of divisors = N)

Perfect Divisors

GAME 25

Bit Playground

Master AND, OR, XOR, NOT, and shifts

AND OR XOR

GAME 26

Odd-Even Gate

Use (n & 1) to detect odd/even

n & 1 LSB

GAME 27

Bit-Pop Arena

Count set bits with Brian Kernighan's algorithm

popcount Kernighan

GAME 28

Bit Upgrade Forge

Turn ON the ith bit: n | (1 << i)

Set Bit OR

GAME 29

Bit Shutdown Panel

Turn OFF the ith bit: n & ~(1 << i)

Clear Bit AND

GAME 30

Bit Switch Chamber

Toggle ith bit: n ^ (1 << i)

Toggle XOR

GAME 31

Bit Detector

Check if ith bit is set: n & (1 << i)

Check Detect

GAME 32

Brian's Blade

Remove lowest set bit: n & (n-1)

n & (n-1) Slice

GAME 33

Power Rune Test

Check power of 2: n & (n-1) == 0

2^k Power

GAME 34

XOR Swap Lab

Swap numbers without temp variable using XOR

Swap XOR

GAME 35

XOR Detective

Find single non-duplicate by XORing all elements

Unique XOR

GAME 36

Bitmask Dungeon Explorer

Generate all subsets using bitmasks

Subsets 2^n

GAME 37

Bit Mirror Palace

Reverse bits of a 32-bit number

Reverse Mirror

GAME 38

Gray Spiral Arena

Generate Gray code: G(i) = i ^ (i >> 1)

Gray XOR

GAME 39

DP-on-Bits Academy

Learn bitmask DP for subset problems

DP Mask

GAME 40

Bit Reader Machine

Read kth bit: (n >> k) & 1

kth Bit Read