Practice. Submit. Improve.

Problem Library

371 coding challenges available

0/371Solved

StatusTitleAcceptanceDifficultySave

○ 341.Exact Minimum-Cost FlowMin-Cost Max-Flow · Residual Graphs — Easy

○ 342.Nearest Active Tree NodeCentroid Decomposition · Dynamic Queries — Easy

○ 343.K-th Distinct SubstringLexicographic DP · Strings — Easy

○ 344.Offline Dynamic BipartitenessOffline Dynamic Graphs · Rollback DSU — Easy

○ 345.Count Spanning TreesGraphs · Kirchhoff's Matrix-Tree Theorem — Easy

○ 346.Dynamic Palindrome InspectorDynamic Strings · Fenwick Tree — Easy

○ 347.Minimum XOR Perfect MatchingBitmask Dynamic Programming · Matching — Easy

○ 348.Distinct Values With UpdatesFrequency Counting · Mo's Algorithm With Modifications — Easy

○ 349.Maximum Median in an Odd-Length RangeBinary Search on Answer · Prefix Sums — Easy

○ 350.Minimum Terminal Connection NetworkDijkstra · Graphs — Easy

○ 351.Maximum Subarray on a Tree PathHeavy-Light Decomposition · Segment Tree — Easy

○ 352.Range K-th Value QueriesCoordinate Compression · Persistent Segment Tree — Easy

○ 353.Minimum Health With One ShieldDynamic Programming · Grid — Hard

○ 354.Common Segment With Limited MismatchesDiagonal Processing · Sliding Window — Hard

○ 355.Minimum Palindrome CutsDynamic Programming · Palindromes — Hard

○ 356.Grid Paths With One Wall RemovalDynamic Programming · Grid 100% Hard

○ 357.Shortest Powerful SegmentArrays · Monotonic Deque — Hard

○ 358.Exact Non-Adjacent SelectionArrays · Dynamic Programming — Hard

○ 359.Cheapest Route With One Half-Price EdgeDijkstra · Graphs — Medium

○ 360.K Closest Sorted ValuesArrays · Binary Search — Medium