Problem Set - OpenJudge

	ID	Problem
	31424	K61957 Spot The Squares
	31426	K61962 Most Frequent k-length Substring
	31427	K61967 Minimize Maximum Subarray Sum Partitioning
	31428	K61972 Find the Corresponding Closing Parenthesis
	31429	K61977 Sum of Primes
	31430	K61982 Maximum Circular Subarray Sum
	31431	K61987 Group Even and Odd Numbers
	31432	K61992 Happy String
	31433	K61997 Sum of Even Digits
	31434	K62002 Reverse Each Word in a Sentence
	31435	K62007 Maximum Difference After Removal
	31437	K62012 Convert Letter Positions to String
	31438	K62017 Shortest Paths Under Distance Constraint
	31439	K62022 Word Ladder Transformation
	31440	K62027 Longest Subarray with Positive Product
	31441	K62032 Average Temperature Calculation
	31442	K62037 Common Multiple in JUMP and STEP Sequences
	31443	K62042 Minimum Operations to Uniform Binary String
	31444	K62047 Highest Frequency Character Count
	31445	K62052 Highest Scoring Contestant
	31446	K62057 List Rotation
	31448	K62062 Matrix Transposition
	31449	K62067 Maximum Length Subarray with At Most K Distinct Integers
	31450	K62072 Counting Unique Binary Search Trees
	31451	K62077 Maximum Stock Trading Profit
	31452	K62082 Merge Two Sorted Linked Lists
	31453	K62087 Maximum Product Subarray
	31454	K62092 Maximum Subarray Sum
	31455	K62097 Trapping Rain Water
	31457	K62102 Longest Contiguous Subarray
	31458	K62107 Merge Unique Characters
	31460	K62112 Consistent Teleportation Pattern
	31461	K62117 Counting Palindromic Substrings
	31462	K62122 Minimizing the Sum of Absolute Differences
	31463	K62127 Final Coordinates After Moves
	31464	K62132 Traveling Salesman Problem
	31465	K62137 Token Distribution Problem
	31466	K62142 Sum of Absolute Differences
	31467	K62147 Smallest Missing Positive Sum
	31468	K62152 Minimum Moves to Sort Books
	31469	K62157 Maximum Sum of Increasing Subsequence
	31471	K62162 Count Unique Integers in Intervals
	31472	K62167 Maximum Non-Adjacent Sum
	31473	K62172 Unique Descending Order
	31474	K62177 Maximum Purchasable Books
	31475	K62182 Special Sort
	31476	K62187 Palindrome Index
	31477	K62192 Simplify Unix File Path
	31478	K62197 Minimum Teleportation Cost
	31479	K62202 Stick Game: Who Wins?
	31480	K62207 Prefix to Infix Expression Conversion
	31482	K62212 Longest Alphabetically Ordered Substring
	31483	K62217 Assign Problems to Teams
	31484	K62222 Equal Partition of Array
	31485	K62227 Pronic Number Checker
	31486	K62232 Find the Missing Puzzle Pieces
	31487	K62237 Calculate Total Cost for Book Purchases
	31488	K62242 Largest Contiguous Area of Land
	31489	K62247 Anagram Checker
	31490	K62252 Counting Valid Sentences
	31491	K62257 Minimum Time to Complete Tasks Without Consecutive Repetitions
	31493	K62262 Palette Combinations Calculator
	31494	K62267 Fibonacci Number
	31495	K62272 Total Bollards Calculation
	31496	K62277 Island Counting
	31497	K62282 Can Place Rectangle on Screen
	31498	K62287 Unique Value Frequencies
	31499	K62292 Minimum Stops for Collecting Snacks
	31500	K62297 Longest Increasing Path in a Directed Acyclic Graph
	31501	K62302 Wildcard Matching Problem
	31502	K62307 Maximum Non-overlapping Performances
	31504	K62312 Maximum Straight Path Sum in a Grid
	31505	K62317 Matrix Multiplication
	31506	K62322 Lexicographically Smallest String After Fixed Deletions
	31507	K62327 Rearrange to Palindrome
	31508	K62332 Unique Postal Codes
	31509	K62337 Longest Path in a DAG with Budget Constraint
	31510	K62342 Counting Valid Passwords
	31511	K62347 Dynamic Median Finder
	31512	K62352 Maximum Subarray Sum
	31513	K62357 Reverse and Lowercase Strings
	31515	K62362 Anagram Checker
	31516	K62367 Energy Consumption Statistics
	31517	K62372 Maximum Non-Adjacent Subset Sum
	31518	K62377 Unique Paths with Obstacles
	31519	K62382 Largest Reach in ByteLand
	31520	K62387 Distinct Palindromic Substrings of Length 3
	31521	K62392 Minimum Size Subarray Sum
	31522	K62397 Sum of Maximum Elements in Subarrays
	31523	K62402 Taco Subset Spiciness Challenge
	31524	K62407 Minimum Increasing Subarrays Partitioning
	31526	K62412 Library Management System
	31527	K62417 Two Sum Problem
	31528	K62422 Delivery Network Supervisors
	31529	K62427 Decompress Ranges
	31530	K62432 Minimum Operations to Clear the Conveyor Belt
	31531	K62437 Minimum Operations to Equalize Grid
	31532	K62442 Unique Pair Finder
	31533	K62447 Falling Stones
	31534	K62452 Maximum Non-Overlapping Events

Pick a problem randomly based on the current filter.