Problem Set - OpenJudge

	ID	Problem
	36312	K83957 Minimum Difference Subarray Partition
	36314	K83962 Unique Scores
	36315	K83967 Reorder Jumbled Number Pieces
	36316	K83972 Find the Duplicate Number
	36317	K83977 Longest Palindromic Substring
	36318	K83982 Unique Permutations of a String
	36319	K83987 Sorting with Swap Threshold
	36320	K83992 Two Sum Indices Finder
	36321	K83997 Minimum Number of Teams Required for Patrol
	36322	K84002 Minimum Additional Seats
	36323	K84007 Greeting or Pass
	36325	K84012 Maximum Shelves Challenge
	36326	K84017 Highest Team Score
	36327	K84022 Hills and Valleys Count
	36328	K84027 Minimize Absolute Differences
	36329	K84032 Counting Distinct Paths with Jump Moves
	36330	K84037 Shortest Palindromic Path in a Grid
	36331	K84042 Minimum Segment Reversals
	36332	K84047 Smallest Product Number
	36333	K84052 Longest Same Value Path
	36334	K84057 Sum of Twist Numbers
	36336	K84062 Unique Paths with Obstacles
	36337	K84067 Maximum Total Platform Length
	36338	K84072 Safe Path in Hazardous Grid
	36339	K84077 Determine the Winner
	36340	K84082 Can Form Equation?
	36341	K84087 Longest Platonic Range
	36342	K84092 Overdue Books Checker
	36343	K84097 Isogram Checker
	36345	K84102 Drone Navigation on a Grid
	36346	K84107 Minimum Steps to Fill the Grid
	36348	K84112 Queue via Two Stacks
	36349	K84117 Max Boxes on a Shelf
	36350	K84122 Library Fine Calculation
	36351	K84127 Rabbit Population Growth
	36352	K84132 Count Valid Sets of Creatures
	36353	K84137 Two Sum Existence
	36354	K84142 Minimum Travel Time to Visit All Libraries
	36355	K84147 Storage System Operations
	36356	K84152 Prefix Sum Query
	36357	K84157 Min-Max Scaling
	36359	K84162 Flower Chains
	36360	K84167 Unique Adjacent Sum Circle Arrangement
	36361	K84172 Common Characters Count
	36362	K84177 Pyramid Blocks
	36363	K84182 Unique Paths with Obstacles
	36364	K84187 Maximum Coins in a Grid
	36365	K84192 Parking Lot Management
	36366	K84197 Pair Sum Query
	36367	K84202 Integer Average Rearrangement
	36368	K84207 Increasing Subarray
	36370	K84212 Heidi's Pathway Reinforcement
	36371	K84217 Determining the Highest Prize Tier
	36372	K84222 Longest Common Subsequence
	36373	K84227 Range Sum Query with Prefix Sums
	36374	K84232 Anagram Word Formation
	36375	K84237 Minimum Edit Distance
	36376	K84242 Subsets Divisible by K
	36377	K84247 Comic Book Sorting
	36378	K84252 Unique Paths in a Grid
	36379	K84257 Maximize Absolute Difference Permutation
	36381	K84262 Spreadsheet Evaluation
	36382	K84267 Cycle Detection in Directed Graph
	36383	K84272 Minimum Moves to All Ones
	36384	K84277 Array Right Shift
	36385	K84282 Longest Subarray with Sum ≤ K
	36386	K84287 Minimal Operations
	36387	K84292 Find Pair with Given Difference
	36388	K84297 Substring Pattern Finder
	36389	K84302 Minimum Path Cost
	36390	K84307 Find the Oldest Bikes
	36392	K84312 Missing Number Problem
	36393	K84317 Book Availability Checker
	36394	K84322 Longest Palindromic Substring Length
	36395	K84327 Minimum Boxes for Product Packing
	36396	K84332 Most Frequent Elements
	36397	K84337 Time Slot Categorization
	36398	K84342 Find Missing Positive Integer
	36399	K84347 Counting Arithmetic Triplets
	36400	K84352 Maximal Rectangle
	36401	K84357 Remove Zeros from a Linked List
	36403	K84362 Divisibility Sequence Generator
	36404	K84367 Shortest Path Queries in an Undirected Graph
	36405	K84372 Valid Parentheses Checker
	36406	K84377 Add Two Numbers Represented by Linked Lists
	36407	K84382 Session Manager
	36408	K84387 Road Network Safety Check
	36409	K84392 First Non-Repeating Character
	36410	K84397 Maximal Rectangle in a Binary Matrix
	36411	K84402 Pyramid Array Verification
	36412	K84407 Transpose Sentence
	36414	K84412 Minimum Time Required to Reach Destination G
	36415	K84417 Minimum Consecutive Books
	36416	K84422 Longest Valid Segment
	36417	K84427 First Non-Repeating Character
	36418	K84432 Maze Shortest Path Finder
	36419	K84437 Sort Arrays in Non-decreasing Order
	36420	K84442 Reorganize String
	36421	K84447 Split String by Asterisk
	36422	K84452 Find Maximum and Minimum Benches

Pick a problem randomly based on the current filter.