Problem Set - OpenJudge

	ID	Problem
	36201	K83457 Task Manager
	36203	K83462 Turtle Position Calculation
	36204	K83467 Construct a Valid Taco String
	36205	K83472 Minimum Toll Fee
	36206	K83477 Maximum Different Color Pairs
	36207	K83482 Alien Matrix Construction
	36208	K83487 Maximum Rectangle of Weeds
	36209	K83492 Maximum Crystals
	36210	K83497 Palindromic Array Check
	36211	K83502 Trapping Rain Water
	36212	K83507 Rearranging Robots
	36214	K83512 Fishing Rod Weights
	36215	K83517 Reverse Vowels in a String
	36216	K83522 Longest Arithmetic Subsequence in First N Natural Numbers
	36217	K83527 Counting Unique Non-Empty Subsets
	36218	K83532 Path Sum Queries on a Tree
	36219	K83537 Code Review Paths
	36220	K83542 Minimum Farcoins
	36221	K83547 Most Frequent Item
	36222	K83552 Matrix Operations: Transpose and Multiplication
	36223	K83557 Remove Duplicate Characters
	36225	K83562 Maximum Product Pair
	36226	K83567 Maximum Sum Submatrix with Row Rearrangement
	36227	K83572 Can Form Palindrome
	36228	K83577 Max Achievable Score
	36229	K83582 Repeat String
	36230	K83587 Fixing Broken Lights
	36231	K83592 Final Robot Position
	36232	K83597 Book Placement on Shelves
	36234	K83602 Maximum Availability Count
	36235	K83607 Maximum Chocolates Stolen
	36237	K83612 Maximum Package Delivery Time
	36238	K83617 Valid Parentheses Checker
	36239	K83622 Maximum Elixir Potency
	36240	K83627 Two Sum Problem
	36241	K83632 Equal Subset Sum Partition
	36242	K83637 Maximum Sum Subarray Length
	36243	K83642 Count Safe Paths in a Grid
	36244	K83647 Pair Sum Existence
	36245	K83652 Three Equal Sum Split
	36246	K83657 Longest Palindromic Substring
	36248	K83662 Minimum Insertions to Form a Palindrome
	36249	K83667 Sequence Construction Under Conditions
	36250	K83672 String Compression
	36251	K83677 Remove Customer from Queue
	36252	K83682 Maximize Array Sum After Flipping Operations
	36253	K83687 Maximum Non-Adjacent Sum
	36254	K83692 Maximum Consecutive Ones in Binary
	36255	K83697 Longest Palindromic Subsequence
	36256	K83702 Counting Binary Search Trees (Catalan Numbers)
	36257	K83707 Minimum Hits to Defeat Monsters
	36259	K83712 Closest Pair in a Sorted Array
	36260	K83717 Library Report
	36261	K83722 Minimal Tree Distance
	36262	K83727 Happy Number Checker
	36263	K83732 Aesthetic Garden
	36264	K83737 Rotation Check
	36265	K83742 Sum of Standalone Integers in a String
	36266	K83747 Prime Number Checker
	36267	K83752 Maximum Treasure Collection
	36268	K83757 Maximum Sum of Left and Right Maximums
	36270	K83762 Make Array Elements Unique
	36271	K83767 Two Sum Problem
	36272	K83772 Convex Polygon Checker
	36273	K83777 Shortest Path in a Grid
	36274	K83782 Parking Bicycles in Racks
	36275	K83787 Make Array Elements Equal
	36276	K83792 Count Paths in a Grid
	36277	K83797 Tree Diameter
	36278	K83802 Arithmetic Expression Validation
	36279	K83807 Group Anagrams
	36281	K83812 Most Frequent Word
	36282	K83817 Minimum Steps in a Maze
	36283	K83822 Minimum Swaps to Make Arrays Identical
	36284	K83827 Count Anagram Groups
	36285	K83832 Net Balance Calculation
	36286	K83837 Timetable Arrangements
	36287	K83842 Alphabet Shift by Two Positions
	36288	K83847 Prime Factors Count
	36289	K83852 Minimum Activation Cost
	36290	K83857 Minimum Insertions to Form a Palindrome
	36292	K83862 Calculate Tax Credits
	36293	K83867 Isomorphic Strings
	36294	K83872 Maximum Subarray Sum
	36295	K83877 Longest Unique Substring
	36296	K83882 Magic Square Completion Checker
	36297	K83887 Find Plateaus in a Sequence
	36298	K83892 Maximum Flower Bloom Days
	36299	K83897 Find the Mode
	36300	K83902 Subarray Sum Equals Target
	36301	K83907 Divisible Path Sum
	36303	K83912 Longest Unimodal Subarray
	36304	K83917 Aesthetic Stamp Arrangement
	36305	K83922 Maximum Frequency Difference
	36306	K83927 Comparing Numbers in Scientific Notation
	36307	K83932 Determine the Winner from Recent Activities
	36308	K83937 Min Moves to Palindrome
	36309	K83942 Check Pattern in String
	36310	K83947 Construct String from Dictionary Words
	36311	K83952 Maze Navigation: Iron Man's Odyssey

Pick a problem randomly based on the current filter.