Practice. Submit. Improve.

Problem Library

371 coding challenges available

0/371Solved

StatusTitleAcceptanceDifficultySave

○ 321.Connected Tree Selection With Exact ColorsConnected Subgraphs · Knapsack — Easy

○ 322.K-th Lexicographic Route String in a DAGDAG · Lexicographic DP — Easy

○ 323.Dynamic Manhattan Diameter in a RangeBitmask Transforms · Computational Geometry 100% Easy

○ 324.Closest Equal Labels on a Tree PathHeavy-Light Decomposition · Label Compression — Easy

○ 325.Versioned Range MajorityPersistent Segment Tree · Randomized Verification — Easy

○ 326.Maximum Ones With Exactly K IslandsDynamic Programming · Run Counting — Hard

○ 327.Two Separated Half-Price CouponsCoupons · Dijkstra — Hard

○ 328.Tree Path Maximum Segment After One SwapDynamic Programming · Maximum Subarray — Hard

○ 329.Palindrome Partition With One Free BlockDynamic Programming · Palindromes — Hard

○ 330.One-Reversal Route in a Forward DAGDAG · Graphs — Hard

○ 331.Grid Paths With a Turn QuotaDirection State · Dynamic Programming — Medium

○ 332.Alternating Source MergeDynamic Programming · Sequence Merging — Medium

○ 333.Circular Segment With One MuteCircular Arrays · Dynamic Programming — Medium

○ 334.Sorted Cluster EqualizationMedian · Prefix Sums — Medium

○ 335.Bounded Distinct Load WindowHashing · Sliding Window — Medium

○ 336.Parity Boundary ScoreArrays · Implementation — Easy

○ 337.Earliest Neutral PrefixImplementation · Prefix Sums — Easy

○ 338.Two-Row Zigzag TraceArrays · Matrix Traversal — Easy

○ 339.Circular Bridge RemovalsArrays · Circular Arrays — Easy

○ 340.Echo Distance TotalArrays · Hashing — Easy