Challenges

Beginner journey

Very easy + easy · Your dashboard follows this path. Browse any difficulty in Challenges.

LET’S GET YOU STARTED

Add Two Counts

Return the sum of two supplied whole numbers.

Start a challenge 5 XP · 3 min

Your growing collection

Every solved challenge is a little win.

0 / 200 solved

0% of the selected library completed

FIND YOUR FLOW

Choose your challenge

Start small. Follow your curiosity.

Browse any difficulty. Very easy and easy challenges are free; medium and hard challenges require Pro to play.

200 challenges to discover
Easy

Build it yourself

Count Disagreeing Character Positions

Count positional differences without stopping at the first mismatch.

Comparing aligned text

6 min12 languages
Easy

Build it yourself

Find the First Purchase Over Budget

Search for a boundary in a running total rather than in one item alone.

Searching accumulated state

6 min12 languages
Easy

Build it yourself

Check Whether Enough Scores Pass

Track successes until a required number has been reached.

Combining a count with a quota

6 min12 languages
Easy

Build it yourself

Validate a Simple Identifier

Combine character categories with a stricter rule for the first position.

Position-dependent text validation

6 min13 languages
Easy

Build it yourself

Combine Squared Signal Strengths

Return the sum of the square of every item.

Transform before accumulating

6 min12 languages
Easy

Build it yourself

Travel through Recorded Positions

Start at position 0 and visit each listed position in order. Return the total distance traveled.

Remember the previous position

6 min12 languages
Easy

Build it yourself

Add the Matching Addresses

Return the sum of zero-based indices whose items equal target.

Indices as contributions

6 min12 languages
Easy

Build it yourself

Total Only the Selected Interval

Add items from start inclusive to stop exclusive. Inputs satisfy 0 <= start <= stop <= list length.

Half-open intervals

6 min12 languages
Easy

Build it yourself

Copy a Selected Interval

Return the items from start inclusive to stop exclusive, in order. 0 <= start <= stop <= list length.

Bounded collection

6 min12 languages
Easy

Build it yourself

Remove a Selected Interval

Return every item outside [start, stop), keeping order. 0 <= start <= stop <= list length.

Complement of a range

6 min12 languages
Easy

Build it yourself

Keep the Latest Readings

Return the last amount items in order. If amount exceeds the list length, keep all items. amount is 0 to 20.

Length-relative start

6 min12 languages
Easy

Build it yourself

Keep the Interior

Return every item except the first and last. Lists shorter than three items produce an empty list.

Excluding endpoints

6 min12 languages
Easy

Build it yourself

Exchange the Two End Readings

Swap the first and last items, leaving every interior item unchanged. Empty and one-item lists stay unchanged.

Position-dependent source selection

6 min12 languages
Easy

Build it yourself

Deal into Two Position Piles

Return items at even indices first, then items at odd indices. Preserve order within each group.

Stable position partition

6 min12 languages
Easy

Build it yourself

Count the Matching Tail

Count consecutive copies of target at the end of the list. Stop at the first different value when reading backward.

Reverse-position scan

6 min12 languages
Easy

Build it yourself

Find a Requested Occurrence

Return the index of the requested occurrence of target, counting occurrences from 1; return -1 if absent. occurrence is 1 to 20.

Count before selecting

6 min12 languages
Easy

Build it yourself

Find an Admissible Reading

Return the first index whose value is between low and high inclusive, or -1. low <= high.

Two-sided selection

6 min12 languages
Easy

Build it yourself

The Closest Reading

Return the index of the value closest to target; ties choose the earliest index. Empty input returns -1.

Distance comparison

6 min12 languages
Easy

Build it yourself

The Smallest Usable Amount

Return the smallest strictly positive item, or 0 if no item is positive.

Conditional minimum

6 min12 languages
Easy

Build it yourself

The Best Affordable Price

Return the largest price no greater than budget, or -1 if none qualifies. Prices and budget are nonnegative.

Filtered maximum

6 min12 languages
Easy

Build it yourself

The Runner-Up Value

Return the second-largest distinct value, or -1 if fewer than two distinct values exist. Items are nonnegative.

Two distinct best values

6 min12 languages
Easy

Build it yourself

Where the Lowest Reading Appeared

Return the first index containing the minimum value. Empty input returns -1.

Value and position

6 min12 languages
Easy

Build it yourself

Locate the Biggest Change

Return the right-hand index of the largest absolute change between neighbors; ties choose earliest. Fewer than two items returns -1.

Choosing by neighbor difference

6 min12 languages
Easy

Build it yourself

When the Total Reaches Its Target

Return the first index where the running total reaches or exceeds target, or -1 if never reached. Items are nonnegative and target is positive.

Search over accumulated state

6 min12 languages