Problem Set - OpenJudge

	ID	Problem
	31757	K63457 Longest Palindromic Substring
	31759	K63462 House Repair Scheduling
	31760	K63467 Building Height Queries
	31761	K63472 Maximum Difference in Array
	31762	K63477 Magic Jumps: Maximization of Target Cell Value
	31763	K63482 Island Hopper
	31764	K63487 Sequence Modification
	31765	K63492 Subarray with Given Sum
	31766	K63497 Longest Substring Without Repeating Characters
	31767	K63502 Origins of Rumors
	31768	K63507 Remove Duplicate Characters
	31770	K63512 Identifying the Most Congested Stop
	31771	K63517 Transform an Array into a Zebra Pattern
	31772	K63522 Card Game Winner
	31773	K63527 Unique Elements and Frequencies
	31774	K63532 Distinct Characters Query
	31775	K63537 Minimum Cuts for Palindrome Partitioning
	31776	K63542 Detect Repeated Subsequence in Genetic Sequence
	31777	K63547 Reversal Segment to Sort Books
	31778	K63552 Find the Largest Element in a Sorted 'Mountain' Matrix
	31779	K63557 Minimum Moves in a Hexagonal Grid
	31781	K63562 Product Except Self
	31782	K63567 Minimum Brightness Difference
	31783	K63572 Date Format Converter
	31784	K63577 Shortest Path in a Grid
	31785	K63582 Longest Arithmetic Subsequence Length
	31786	K63587 Longest Substring with Two Distinct Characters
	31787	K63592 Check Mathematical Expressions
	31788	K63597 Longest Consecutive Sequence Range
	31790	K63602 K-th Smallest Element
	31791	K63607 Original Sequence Verification
	31793	K63612 Maximum Gold Collection in a Cave
	31794	K63617 Word Length Dictionary
	31795	K63622 Trapping Rain Water
	31796	K63627 Array Update and Query
	31797	K63632 Minimum Energy Path Grid Problem
	31798	K63637 Minimum Rounds to Disseminate Information
	31799	K63642 Taco Subarray Sum Queries
	31800	K63647 Minimum Completion Time with Two Processors
	31801	K63652 Smallest Non-Negative Card Values
	31802	K63657 Maximizing Employee Resource Allocation
	31804	K63662 Fibonacci Number and Cumulative Sum
	31805	K63667 The Painting Thief
	31806	K63672 RGB Filter Application
	31807	K63677 Maze Escape with One Wall Break
	31808	K63682 Distinct Islands Counting
	31809	K63687 Disappearing Numbers Process
	31810	K63692 Check if a String is Balanced
	31811	K63697 Taco Permutations
	31812	K63702 Digit Square Sum Sequence
	31813	K63707 Weighted Tree Queries
	31815	K63712 Product Array Except Self
	31816	K63717 Maximum Non-Overlapping Intervals
	31817	K63722 Calculate Power Value of an Array
	31818	K63727 Remove Adjacent Duplicate Letters
	31819	K63732 Unique Pair Sum Finder
	31820	K63737 Circular RGB Sequence
	31821	K63742 Maximum Stock Profit
	31822	K63747 Find the M-th Smallest Element in Merged Sorted Arrays
	31823	K63752 Maximum in Subarray Query
	31824	K63757 Minimum Absolute Difference
	31826	K63762 Maximum Coin Collection in a Grid
	31827	K63767 Tree Planting in a Grid
	31828	K63772 Bipartite Graph Check
	31829	K63777 Minimum Water Bucket Operations
	31830	K63782 Hybrid Sorting Algorithm
	31831	K63787 Segment Tree: Range Maximum Query and Update
	31832	K63792 Longest Subsequence with Minimum Index Gap
	31833	K63797 Can Form Palindrome
	31834	K63802 Equalizing Tokens
	31835	K63807 Taco: Odd Sum Pair Problem
	31837	K63812 Triangle Triplet Check
	31838	K63817 Prize Distribution Problem
	31839	K63822 Difficulty Determination Based on Problem ID
	31840	K63827 Longest Contiguous Subarray with Limited Difference
	31841	K63832 Taco Transaction Cost Calculator
	31842	K63837 Taco: Broadcast Signal
	31843	K63842 Maximum Length Subarray with Limited Plant Types
	31844	K63847 Rotate String
	31845	K63852 Equalization Operations
	31846	K63857 Longest Increasing Arithmetic Subsequence
	31848	K63862 Depot Vehicle Movement Query
	31849	K63867 Checkpoint Transition Time
	31850	K63872 Minimum Operations to Palindrome
	31851	K63877 Longest Consecutive Sequence
	31852	K63882 Minimum Operations to Equalize Array Elements
	31853	K63887 Digit and Letter Split
	31854	K63892 Largest Square Subgrid of 1's
	31855	K63897 Filter Prime Numbers
	31856	K63902 Maximum Segment Score with One Deletion
	31857	K63907 Merge Sorted Arrays
	31859	K63912 Sum of Adjacent Node Values
	31860	K63917 Largest Rectangle in a Histogram
	31861	K63922 Assign Discounts to Customers
	31862	K63927 Sum of Even Numbers in Subarray
	31863	K63932 Maximum Contestants Assignment
	31864	K63937 Unique Grid Paths
	31865	K63942 Constructing the Shortest Palindrome
	31866	K63947 Horizontally Symmetric Grid
	31867	K63952 Next Lexicographical Permutation

Pick a problem randomly based on the current filter.