CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- Mahmoud and a Dictionary2000Codeforcesdata structuresdfs and similardpdsu
- Make All Equal2265CodeChef
- Make It Connected1900Codeforcesdsugraphsgreedy
- Make Palindrome2391CodeChef
- Make Them Alike2245CodeChef
- Make Them Equal2000Codeforcesconstructive algorithmsgreedymath
- Make that Array!2323CodeChef
- Mango Market2393CodeChef
- Maple and Tree Beauty (Hard Version)2000Codeforcesbitmasksbrute forcedfs and similardp
- Marble Council1900Codeforcesdpmathsortings
- Marco and GCD Sequence1900Codeforcesconstructive algorithmsmath
- Mars rover2000Codeforcesdfs and similargraphsimplementationtrees
- Martian Luck2000Codeforcesmathnumber theory
- Mascot Naming1900Codeforcesbrute forcegreedyimplementationstrings
- Masha-forgetful2000Codeforcesbrute forceconstructive algorithmsdphashing
- MasterChef2369CodeChef
- Match Points2000Codeforcesbinary searchgreedysortingsternary search
- Matching vs Independent Set2000Codeforcesconstructive algorithmsgraphsgreedysortings
- Matrix2301CodeChef
- Matrix Maximum Sum2387CodeChef
- Matrix and Chef2350CodeChef
- Max Sum OR (Hard Version)2000Codeforcesbitmasksconstructive algorithmsdivide and conquergreedy
- Maxim and Array2000Codeforcesconstructive algorithmsdata structuresgreedymath
- Maxim and Matrix2000Codeforcesconstructive algorithmsdpmath
- Maxim and Restaurant1900Codeforcesdpmathprobabilities
- Maximal GCD1900Codeforcesconstructive algorithmsgreedymath
- Maximise Subsequence Value2255CodeChef
- Maximize 1s2255CodeChef
- Maximize Letter Beauty2314CodeChef
- Maximize the Remaining String2000Codeforcesbrute forcedata structuresdpgreedy
- Maximize the Tax2349CodeChef
- Maximum Balanced Circle2000Codeforcesconstructive algorithmsdpgreedytwo pointers
- Maximum K Sums2260CodeChef
- Maximum Prefix Sums1900Codeforcesconstructive algorithmsgreedyimplementationtwo pointers
- Maximum Subarray2000Codeforcesdata structuresdpgreedytwo pointers
- Maximum Subsequence Sum2388CodeChef
- Maximum Subsequence Value1900Codeforcesbrute forceconstructive algorithms
- Maximum Topological Sort2304CodeChef
- Median Rearrangement2364CodeChef
- Median String1900Codeforcesbitmasksmathnumber theorystrings
- Median on Tree2358CodeChef
- Medium Demon Problem (hard version)1900Codeforcesdfs and similardpdsugraphs
- Mega Mode2384CodeChef
- Memory for Arrays1900Codeforcesbinary searchbitmasksgreedy
- Merciless Chef2308CodeChef
- Merge Equal Elements1900Codeforcesconstructive algorithmsdata structures
- Merge Not Sort1900Codeforcesconstructive algorithmsdp
- Merging Binary Strings2318CodeChef
- Merging Two Decks2000Codeforcesconstructive algorithmsgreedy
- Messages2000Codeforcesbrute forcedpgreedyprobabilities
- Messenger Simulator2000Codeforcesdata structures
- Meteor2233CodeChef
- Microcycle1900Codeforcesdata structuresdfs and similardsugraphs
- Microtransactions (easy version)2000Codeforcesbinary searchgreedy
- Microtransactions (hard version)2000Codeforcesbinary searchgreedyimplementation
- Mike and Feet1900Codeforcesbinary searchdata structuresdpdsu
- Mike and Geometry Problem2000Codeforcescombinatoricsdata structuresdpgeometry
- Military Trainings1900Codeforces
- Min Max Equality2288CodeChef
- Min-Fund Prison (Easy)1900Codeforcesdfs and similartrees