Problems
Pick a problem and write your solution in the built-in editor. The judge runs it against real test cases while you watch, and the wider archive is open to read whenever you like.
Total results1,803 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| Make Rounddog HappyCount subarrays whose elements are all distinct and whose maximum minus length is at most k, for arrays up to 300,000 with values bounded by n. | Hard9 | Divide and conquerTwo pointers+2 | No attempts yet | 2s | 512 MB | Judgeable |
| OR and QueriesProcess range bitwise-OR updates on an array and count how many positions in a range currently equal a fixed K. | Hard9 | Segment treeBit manipulation+2 | No attempts yet | 1.5s | 256 MB | Judgeable |
| AtomsMaintain a sequence of charges under range add updates, and after restricting to a query segment, report the longest run of consecutive positions where each next charge exceeds the previous by exactly one. | Hard9 | Segment treeDynamic programming+2 | No attempts yet | 2s | 512 MB | Judgeable |