Loading
4 posts about competitive programming Java by 1 contributor.
Know competitive programming Java? Share what you know with developers who are learning it.
Learn how to find the number from 1 to n with the maximum digit sum using a digit-based optimization approach, efficient candidate generation, and Java.
Learn how to solve the cafe computer allocation problem in Java using a three-state tracking approach to correctly count customers rejected when no computer is available.
Learn how to find the maximum all-1s rectangle in a binary matrix when columns can be swapped, using histogram heights, column rearrangement, counting sort, and an O(n × (n + m)) Java solution.
Learn how to solve the minimum moves array sorting problem in Java using a position array and the longest consecutive increasing sequence with O(n) time complexity.
Publish an article in this category and earn +1,000 SHARP when it is approved.
Write an article
