Showdown 1 v 1
Invite a friend. Solve the same problem.
First correct submission wins.
Code. Conquer.
Invite friends to solve the same coding problem. First correct submission wins.
Climbing Stairs Easy
Dynamic ProgrammingMath
There are n steps to the top. Take one or two steps at a time. Return the number of distinct ways to reach the top.
n = 33class Solution:
def climbStairs(self, n):
a, b = 1, 1
for _ in range(1, n):
a, b = b, a + b
return bYYou20 / 20
JJamie14 / 20
You winFirst correct submission
Free-for-all 2–8 players
Share a challenge with the group.
Everyone writes their own solution.
Tech Stacked Coming soon
Design resilient enterprise systems. Drag blocks, connect nodes, and adapt as situations change.
Factions Coming soon
Bring your party into a match against other parties.
Codebase Clash Coming soon
Work in an existing repository. Track down a bug or build a new feature.
Odyssey Coming soon
Build an object-oriented system across multiple rounds. Extend your design as its states and requirements grow.
From invitation
to first submission.
Choose a problem, set the time,
and send the link.
Create a lobby and ready up.
Change lobby settings, invite friends, and set rules.
Battle for correctness.
The first passing submission takes it all.
YYou14 / 20
Wrong answer
JJamie20 / 20
Accepted
Jamie winsFirst correct submission
Pick a problem.
Or leave it to chance.
Filter problem selection by difficulty and topics.
Write and test your solution.
Write your solution, try your own cases, then submit when you’re ready.
class Solution:
def twoSum(self, nums, target):
seen = {}
for i, num in enumerate(nums):
seen[num] = i
if target - num in seen:
return [seen[target - num], i]2/3 cases passed
nums
[3,3]target
6Expected output
[0,1]wrong answer
Output
[0,0]Coming soon
Social Coming soon
See where you stand on leaderboards. Track your nemeses and your wins and losses against each other.
Adaptive Coming soon
Get problem recommendations based on your past performance, for competitive matches or solo practice.