Challenges
Beginner journey
Very easy + easy · Your dashboard follows this path. Browse any difficulty in Challenges.
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
Browse any difficulty. Very easy and easy challenges are free; medium and hard challenges require Pro to play.
Build it yourself
Combine Matching Positions
The lists have equal length. Return a list containing first[i] + second[i] at each index.
Aligned numeric transformation
Build it yourself
What Remains after Each Item
For each position, return the sum of all items strictly after it. The final output item is always zero.
Total followed by subtraction
Build it yourself
Summarize Three Signs
Return [negative count, zero count, positive count]. Every input item belongs to exactly one category.
Independent category counters
Build it yourself
Count Readings above the Baseline
Treat the first item as a fixed baseline. Count later items strictly above that baseline. Empty input returns zero.
Input-derived comparison value
Build it yourself
Count Odd and Even Items
Return [even count, odd count]. Negative integers are classified by whether their remainder after division by 2 is zero.
Remainder categories
Build it yourself
Summarize an Allowed Range
Return [count below low, count inside inclusive low..high, count above high]. low <= high.
Three-way numeric classification
Exact-count predicate
Build it yourself
Do Positive Signals Win
Return true if more than half the items are strictly positive. An empty list returns false.
Strict-majority predicate
Build it yourself
Balance the Two Signs
Return true when there are equally many strictly positive and strictly negative items. Ignore zero items.
Equality of category counts
Build it yourself
Count Signals in Alternating Slots
Count strictly positive items at odd zero-based indices.
Combining value and position
Build it yourself
Count Readings near a Target
Count items whose absolute difference from target is at most tolerance. tolerance is nonnegative.
Distance-band counting
Build it yourself
How Much Exceeds the Limit
For each item above limit, add only item - limit. Return the total excess; items at or below limit contribute zero.
Conditional excess accumulation
Build it yourself
Track a Bounded Reservoir
Start with initial water, apply each signed change in order, and clamp the water to 0..capacity after every change. Return final water. 0 <= initial <= capacity <= 100.
Clamp after every event
Build it yourself
Follow Left and Right Commands
message contains only L, R and S. Start at position 0; L moves left by one, R moves right by one, and S stays. Return the final position.
Text-driven state updates
Build it yourself
The Furthest Point Visited
message contains only L and R. Start at 0 and move one step per command. Return the greatest distance from 0 reached at any time.
Current state and best distance
Build it yourself
Find the First Deficit
Start balance at initial and apply the signed changes in numbers. Return the first index that makes balance negative, or -1 if none does. initial is nonnegative.
State violation position
Build it yourself
Record the Account after Each Change
Start at initial and apply each signed change. Return the balance after every change; do not include the starting balance by itself.
Expose intermediate states
Build it yourself
Choose Purchases in Arrival Order
Prices are nonnegative. Visit prices in order: buy an item if its price is at most the remaining budget, otherwise skip it. Return the purchased indices. budget is nonnegative.
Greedy selection with a budget
Build it yourself
A Daily Spending Allowance
Each day spend up to the requested nonnegative amount, limited by current funds, then add refill and cap funds at capacity. Return final funds. 0 <= initial <= capacity; refill is nonnegative.
Order of periodic events
Build it yourself
Count Thermostat Changes
A heater begins off. Turn it on when a reading is below low, and turn it off when a reading is above high. At or between the bounds, keep its state. Return the number of switches. low < high.
Two-threshold state transitions
Build it yourself
Serve Customers with Change
Each item costs 5. Customers pay either 5 or 10 in the given order. Start with no cash and return true if every customer can receive exact change immediately.
Resource-dependent validation
Build it yourself
Score Alternating Turns
Two players alternate turns, starting with player one at index 0. Return [player one total, player two total]. Scores may be negative.
Two independent accumulators
Build it yourself
Compare Two Measurement Profiles
The lists have equal length. Return the sum of squared differences (first[i] - second[i]) squared.
Aligned differences and reduction
Build it yourself
Read between the Outer Marks
Return the text strictly between the first and last occurrence of marker. marker has one character. Fewer than two occurrences returns empty text.
First and last delimiter