Curated Algorithms & System Design

Coding Problem Repository

Solve industry-tested coding challenges, practice algorithm patterns, and level up your developer rank with instant XP rewards.

Daily Challenge• +25 XP Bonus

Implement Debounce Function

Solve
Total Bank
10

Available challenges

Solved
6
Easy10 XP
3

Foundational DSA

Medium20-25 XP
4

Interview Core

Hard40 XP
2

Complex Optimization

Expert50 XP
1

Competitive Elite

Category:

Two Sum

Easy
DSA

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.

#Array#Hash Table
+10 XP
49% passed

Valid Parentheses

Easy
DSA

Given a string s containing just the characters "(", ")", "{", "}", "[" and "]", determine if the input string is valid. An input string is valid if: 1. Open brackets must be closed by the same type of brackets. 2. Open brackets must be closed in the correct order. 3. Every close bracket has a corresponding open bracket of the same type.

#String#Stack
+10 XP
40% passed

Merge Two Sorted Lists

Easy
DSA

You are given the heads of two sorted linked lists list1 and list2. Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list.

#Linked List#Recursion
+10 XP
62% passed

Maximum Subarray (Kadane)

Medium
DSA

Given an integer array nums, find the subarray with the largest sum, and return its sum.

#Array#Dynamic Programming#Divide and Conquer
+20 XP
50% passed

Binary Tree Level Order Traversal

Medium
DSA

Given the root of a binary tree, return the level order traversal of its nodes values (i.e. from left to right, level by level).

#Tree#BFS#Binary Tree
+20 XP
64% passed

Implement Debounce Function

Medium
JAVASCRIPT

Implement a debounce function in JavaScript/TypeScript that limits the rate at which a function can fire. The debounced function should delay invoking func until after wait milliseconds have elapsed since the last time the debounced function was invoked.

#JavaScript#Closures#Timers#Async
+25 XP
55% passed

Design Scalable Rate Limiter

Hard
SYSTEM_DESIGN
SYSTEM DESIGN

Design a distributed rate limiter that handles 50,000 requests/sec with Token Bucket or Sliding Window Log algorithms in Redis. Specify data structures, failure modes, race condition mitigations, and latency trade-offs.

#Redis#Distributed Systems#Concurrency#APIs
+40 XP
35% passed

LRU Cache Implementation

Hard
DSA

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class with get and put methods. Both operations must run in O(1) time complexity.

#Hash Table#Linked List#Design
+40 XP
38% passed

Median of Two Sorted Arrays

Expert
DSA

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

#Binary Search#Divide and Conquer#Array
+50 XP
29% passed

Custom Promise.allSettled Polyfill

Medium
JAVASCRIPT

Implement a polyfill for Promise.allSettled without using the native Promise.allSettled implementation. Ensure all settled promises are correctly categorized with status and value/reason.

#JavaScript#Promises#Async/Await
+25 XP
58% passed
Day 45 Streak Resets in 14h

Implement Debounce Function

Build a resilient rate limiter in TypeScript with closure timer states. Essential for frontend performance.

Bonus Reward+25 XP & Streak Freeze
Start Challenge

Your Practice Progress

Solved Challenges6 / 10 (60%)
Easy (3/3)100%
Medium (2/4)50%
Hard (0/2)0%
Rank TierARCHITECT (Rank #1)
Weekly Arena

Bi-Weekly Speed Contest #42

4 algorithmic challenges in 90 minutes. Win XP boosts, badges, and leaderboard glory.

Saturday • 8:00 PM UTC
1.2k Registered