Learn to think like a programmer. Develop your problem-solving skills with essential data structures and algorithms.
From beginner to job-ready. Explore our curated career paths designed to help you succeed in the tech industry.
Learn to think like a programmer. Develop your problem-solving skills with essential data structures and algorithms.
From beginner to job-ready. Explore our curated career paths designed to help you succeed in the tech industry.
Learn to think like a programmer. Develop your problem-solving skills with essential data structures and algorithms.
From beginner to job-ready. Explore our curated career paths designed to help you succeed in the tech industry.
Learn to think like a programmer. Develop your problem-solving skills with essential data structures and algorithms.
From beginner to job-ready. Explore our curated career paths designed to help you succeed in the tech industry.
Diamond League
JapanRatings System Update
(2025-04-09 22:30:00)Ratings System Update
(2022-12-20 00:00:00)None
None
Pie Tasting, An Interesting Sequence, Even Subset Xor, Convert Strings by Flips, Equal Card Game, Merging Binary Strings, Elections in Chefland, Equal LIS, Convert Strings by Flips 2
Palindromes Not Allowed, Mean Maximization, Subsegment Divisibility , Mask Policy, Merged LIS, Hungry Ashish, Boring Trip, Prime Graph, Beautiful Permutation, Erase All But One
Subarray permutations, Prefix Zeros, Circular Permutation Recovery, Permutation XOR Sum, Permutation Deletion
Xor Becoming Uncanny, Perfect Permutation, PerMEXuation , Mango Market, Slingshot
Permutation Xor, Chef Cooks Permutation, Visit Them All, Magnet Sort
Secret Tree, Dragonado And XOR, Oh I Dont Care, Alternating Divisibility
Sussy Rooks, Key-bored, Winter, Adjacency Love, Separate Them All
Chef Goes Shopping, Sorted Distances, Sequence Cost
Split Powers Of 2, Different Subarrays Rearrange, Triple Inversions
Balanced 0-1 Tree, Equal After And, Rearrange Ranges
Permutation Segments, Throw and Take, Simple XOR, Prefix Suffix Distinct, Split AND Sum
The Lost Array, Max Shift After XOR, XOR Times 2 Is Sum, Minimum Xor On Segment, SPLIT With XOR Not X
Tree Interval Queries, Inversions Retrieval, Binary String Happiness, Consecutive XOR, Largest Family
Sort the Array, Tree Coloring, Subtract 12 Operation, Mex On Subtrees, MEX Permutation Difference
Increasing Addition, Adjacent Pairs
Take Not Less, Alice Potter and OWL, Alice Potter and Wingardium Leviosa, Alice Potter And Dumbledore Army
Least Size, Minimum Operation, Sum Over All Arrays, String Game , Prefix Max, Largest Y
Mex Segments, Construct String, Order by XOR, Saber Slays, Rotate to Minimum, Restoration
Thank U, Next, Why Try, Positions, NASA, Greedy, Bloodline, Motive
Prime Permutation, Stamps 100, Concussive Sequence, Combinatorics Is Fun, Interesting Swap, Ant
Codechef Copy, Spiritual Chef, All New CodeChef, Maximum Deliciousness, I Can Use Both Hands!
Count Distinct Arrays, Counting Is Fun, Maximise The Minimum, Minimise Maximum Subarray Sum, Make All Equal, Score Sum, Maximum Score , Trees Are Fun
Delete The Array, Subtraction Sequence I, Subtraction Sequence II, Greedy LIS Algorithm, Binary Grid Forces, Make All Zero, Counting Is Fun
ABC Conjecture 3, Powered Parameters, Too Far For Comfort, Too Far For Comfort (Easy Version)
A power B mod C , TRIPLE PRIMES, K Subarray Products, Prefix Suffix Inequality, Cyclopian Edges, Breezy Mode Problem, Distinct Substring
Lucky Matrix, Split Permutation, Trick Or Treat, Break The String, Tree Removal
Possible Contender, Central Cutting, Amphibian Escape, Color Difference, Perfect Prefixes
Counting Is Fun, Sort Lexicographically , Find P, Minimise Inversions, Largest K
Beautiful Array, Make Bob Win , Querified, Token Passing on Tree, Square String
Bouncing Ball, Permutation Construction
Equal Pairs (Hard), Min Ops (Hard), Tree Requirements (Hard), Tree Requirements (Easy), Not Equal On Tree, Replacing Game
Alien Operation, Completion (Hard), Maximize Hamming Distance, Completion (Easy), Anti-Palindrome Queries
Min Max Paths, Tree Cut Xor, Count Winning Subarrays, GCD and XOR, Triangle Count (Hard), Triangle Count (Easy)
Numismatics, GCD to 1 (Hard), Replace With First, Replace With First Literally, Prefix Suffix Min Max, Array Concatanation
Keep Magnets Separated, Expected Value Problem, Balance Difficulties, Interval Cliques, Partition Score
Small, Smaller, Smallest, MEXtreme Divisibility, Normal is Good, Unmedian
Crafty Coloring (Hard), Crafty Coloring (Easy), Glass Bridge (Hard), Super Hero, Random Nim, Glass Bridge (Easy), Chess Colouring, Elections
Palindrome Love, Modindrome, Unstable Elections, Buying Order (Easy), Buying Order (Hard)
Quick Exit (Counting), Min-Max Game, Red-Blue Sort, The XOR Machine, One To Three, Quick Exit
GCD Partition, No Two Alike, Binary Removals, Xoperations, Equate XOR, Chef Loves Maths
Advitiya Security Vault, Strange Nim Game, Prefix OR, White Wall, Volcanic Eruption, Pair Making Problem
Cool Subsequences, Postman and LLM, Modular Minimization, Introverts, Cool Checker, Min-Max Product Partition, Time Penalty, Overwrite
GCD Add Size, Meximal Sum, Mystic Slimes, Lexicographic Detective, Graph Monsters
Smoothly Increasing , Colosseum, Big Difference, Count Disjoint Arrays, Reduce to Palindrome, Minimum Colours (Hard)
Random Input Problem, Balls and Boxes, Shall we play a game, Huh, Easy, Counting Problem
Costly Swapping, The Best Matrix, Tree Colouring (Hard), Tree Operations (Easy), Tree Operations (Hard), Flip Prefix
Swap Permutation 1, Swap Permutation 2, Pivotal Reversal, Arbitrary Shuffling, Complete MST, S to T
Second MEX, Subtree XOR Counting, Adjacent OR, Front or Back, Double or Append
Double Shuffle, Range Maximum Deconstruction (Hard), GCD Summation, Asymmetric Cookies, Double Shuffle (Hard), Array Deletion Game, Range Maximum Deconstruction (Easy)
Lighthouses, MEX and XOR 2, XOR with Add X, Distinct Arrays , Segment Tree Reconstruction, Mod and Make Y
Anti-Subarray Sum, Minimize Tree GCD (Hard), Major Infection, OR What, Minimize Tree GCD, Distinct Representations
GCD and XOR 2 (Easy), GCD and XOR 2 (Hard), Swaps in a String, K Boxes, Inversion Queries, Yet Another Monsters Problem
Number Walks, Blocks in a String, Sortable Subarrays (Hard), Create Binary String, Avoid Primes, Sortable Subarrays (Easy)
GCD Equals Mex, Parry It! (Hard), Subsequence Sort, 1-2 Reorder, Min-Max Deletion
We use cookies to improve your experience and for analytical purposes. Read our Privacy Policy and Terms to know more. You consent to our cookies if you continue to use our website.