Problem Set - OpenJudge

	ID	Problem
	31248	K6116 Longest Contiguous Subarray with Zero Sum
	31259	K6121 Recursive List Reversal
	31270	K6126 Encrypting Messages with a Shift Cipher
	31281	K6131 Rearrange Words by Length
	31292	K6136 Minimum Cost to Determine Candy Ranks
	31303	K6141 Shortest Path Queries in Directed Graphs
	31314	K6146 Inventory Management
	31325	K6151 Eulerian Cycle Trail Check
	31336	K6156 Minimum Trees to Visit
	31348	K6161 Consecutive Sequence Reordering
	31359	K6166 Wedding Seating Arrangement
	31370	K6171 Lychrel Number Detection
	31381	K6176 Sorted Marbles
	31392	K6181 Smallest Supersequence Length
	31403	K6186 Optimal Capital
	31414	K6191 Custom Fibonacci-Like Sequence
	31425	K6196 ID Validation: Check for Uppercase and Digit
	31436	K6201 Contiguous Subarray with Exact Sum
	31447	K6206 Smallest Absolute Difference
	31459	K6211 Can Prepare Recipes
	31470	K6216 Lexicographically Smallest String
	31481	K6221 Maximum Submatrix Sum
	31492	K6226 Food Basket Preparation
	31503	K6231 Maximum Score in Rounds
	31514	K6236 Minimum Drone Trips
	31525	K6241 Determine the Winner
	31536	K6246 Construct Binary Tree from Preorder and Inorder Traversal
	31547	K6251 Counting Islands
	31558	K6256 Top-K Posts Ranking
	31570	K6261 Minimum Operations to Make All Elements Equal
	31581	K6266 Number of Passes in a Circular Ball Game
	31592	K6271 Count Unique Pairs with Given Difference
	31603	K6276 Lexicographically Smallest Sorted Array for Minimal Absolute Differences
	31614	K6281 Constructing Equal Sum Matrices
	31625	K6286 Farthest Reachable Point
	31636	K6291 String Compression
	31647	K6296 Minimum Reverse Operations
	31658	K6301 Longest Monotonically Increasing Sequence in a Grid
	31669	K6306 Unique Character Checker
	31681	K6311 Reverse Each Word in a Sentence
	31692	K6316 Maximum Trail Steepness
	31703	K6321 Longest Sales Streak Analysis
	31714	K6326 Maximum Subgrid Sum
	31725	K6331 Average Waiting Time
	31736	K6336 Restore String
	31747	K6341 Minimum Cost to Connect All Departments
	31758	K6346 Rotate Array In-Place
	31769	K6351 Counting Diagonal Intersections
	31780	K6356 K Most Frequent Elements
	31792	K6361 Evaluate Arithmetic Expressions
	31803	K6366 Lexicographically Sorted Permutations
	31814	K6371 Minimize Contest Balance
	31825	K6376 Book Sales Report
	31836	K6381 First Missing Positive
	31847	K6386 Unique User IDs Filter
	31858	K6391 Longest Increasing Subsequence
	31869	K6396 Maximum Balanced Substrings
	31880	K6401 Happy Number Checker
	31891	K6406 Reverse Only Letters in a String
	31903	K6411 Minimize Absolute Difference
	31914	K6416 Find Peaks in an Array
	31925	K6421 Pattern Indices Finder
	31936	K6426 Balanced Binary Tree
	31947	K6431 Generate Palindromic Sequence
	31958	K6436 Reordering to Form an Arithmetic Progression
	31969	K6441 Count Ways to Achieve Target Balance
	31980	K6446 Generate Special Number Sequence
	31991	K6451 Exact Weight Path in an Undirected Graph
	32002	K6456 Maximize Single Service Allocation
	32014	K6461 Process Bank Transactions
	32025	K6466 Alien Dictionary
	32036	K6471 Smallest Prime Palindrome
	32047	K6476 Maximum Sum After Operations
	32058	K6481 Count Palindromic Substrings
	32069	K6486 Anagram Checker
	32080	K6491 Bitwise AND Pair Existence
	32091	K6496 Unique Subarrays
	32102	K6501 Maximum Coins Collection
	32113	K6506 Highest Grade Student
	32125	K6511 Maximum Sum Subarray of Size K
	32136	K6516 Sum of Squares
	32147	K6521 Array Query Processing using Segment Tree
	32158	K6526 Maximum Subarray Sum
	32169	K6531 Reverse Words in a String
	32180	K6536 First Unique Character Index
	32191	K6541 Maximum Sum of Non-Adjacent Elements
	32202	K6546 Distinct Paths in a Grid with Obstacles
	32213	K6551 Custom Word Sorting
	32224	K6556 Longest Repeated Substring
	32236	K6561 Longest Even-Length Palindrome Construction
	32247	K6566 Maximize Productivity
	32258	K6571 Remove Duplicates from Sorted Array
	32269	K6576 Pangram Checker
	32280	K6581 Minimal Candies Distribution
	32291	K6586 Minimum Coins and Ways
	32302	K6591 Minimum Meeting Rooms
	32313	K6596 Max Difference With Condition
	32325	K6601 String Compression
	32336	K6606 Exploring Unique Cities with Train Routes
	32348	K6611 Unique Paths II with Obstacles

Pick a problem randomly based on the current filter.