Problem Set - OpenJudge

	ID	Problem
	26313	K38957 Max Skill Sum in Collaborative Groups
	26315	K38962 Find Path in a Grid
	26316	K38967 Stack Operations Implementation
	26317	K38972 Shortest Gem Collection Subarray
	26318	K38977 Minimum Campus Construction Cost
	26319	K38982 Subsequence Arithmetic Progression
	26320	K38987 Total Minimum Delivery Distance
	26321	K38992 Minimum Jumps to Cross the River
	26322	K38997 Maximum Subarray Sum Query
	26323	K39002 Color Spectrum Days
	26324	K39007 Word Search in a 2D Grid
	26326	K39012 Minimum Fuel Required to Reach Destination
	26327	K39017 Maximum Non-Overlapping Tasks
	26328	K39022 Unique Palindromic Substrings
	26329	K39027 Minimize Maximum Travel Time
	26330	K39032 Water Consumption Cost Calculation
	26331	K39037 Knight Combat Queries
	26332	K39042 Minimum Steps to the Last Floor
	26333	K39047 Longest Increasing Subsequence
	26334	K39052 Image Categorization Challenge
	26335	K39057 Sort 0-1-2 Array
	26337	K39062 Count Palindromic Substrings
	26338	K39067 Count the Prime Numbers
	26339	K39072 Maximum Subarray Sum
	26340	K39077 N-th Prime Number Finder
	26341	K39082 Unique Paths in a Grid with Obstacles
	26342	K39087 Most Frequent Songs
	26343	K39092 Right Rotation String
	26344	K39097 Possible Coin Sums
	26346	K39102 Shortest Lexicographical Palindromic Subsequence
	26347	K39107 Maximum Goods Transportation
	26349	K39112 Word Ladder Transformation
	26350	K39117 Determine Segment Type
	26351	K39122 Max Books
	26352	K39127 Finding the Top Participant
	26353	K39132 Calculate Polygon Area using the Shoelace Theorem
	26354	K39137 Sequence Elements Query
	26355	K39142 Scrambled String Verification
	26356	K39147 Maximum Stock Profit
	26357	K39152 Taco Subarray Rearrangement
	26358	K39157 Rearrange Even and Odd Numbers
	26360	K39162 Unique Word Finder
	26361	K39167 Minimum Stage Scheduling
	26362	K39172 Longest Substring with At Most Two Distinct Characters
	26363	K39177 Deliver Package in a Grid City
	26364	K39182 Minimum Partition Difference
	26365	K39187 Determine the Winner
	26366	K39192 Find Name Indices
	26367	K39197 Two Sum: Find Indices with Target Sum
	26368	K39202 Caesar Cipher Encryption
	26369	K39207 Restore Arithmetic Progression
	26371	K39212 Remove Consecutive Duplicates
	26372	K39217 Unique Sequence Generator
	26373	K39222 Maximize Stock Profit
	26374	K39227 Ball Passing Strategy
	26375	K39232 Find All Ancestors in a Tree
	26376	K39237 Count Safe Zones
	26377	K39242 Count Distinct Elements and Their Occurrences
	26378	K39247 Unique Prefix Segmentation Problem
	26379	K39252 Balanced Binary Tree Rearrangement
	26380	K39257 Longest Increasing Subsequence
	26382	K39262 Rearrange Digits
	26383	K39267 Shortest Path in a Grid
	26384	K39272 Return to Origin
	26385	K39277 Sum of Digits in a String
	26386	K39282 Maximizing Non-Adjacent Tree Cuts
	26387	K39287 Rearrange String to Avoid Adjacent Duplicates
	26388	K39292 Reserve Consecutive Seats
	26389	K39297 Highest Frequency Integer
	26390	K39302 Minimizing Array Sum Difference
	26391	K39307 Finding the Next Perfect Number
	26393	K39312 Subset Sum Problem
	26394	K39317 Promotable Book Titles
	26395	K39322 Safe Drawbridge
	26396	K39327 Maximum Product of Three Numbers
	26397	K39332 Find Missing Badge IDs
	26398	K39337 Shortest Travel Time
	26399	K39342 Flood Fill Queries
	26400	K39347 City Clusters
	26401	K39352 Minimum Increasing Subsequences Partition
	26402	K39357 Maximum and Minimum Difficulty Levels
	26404	K39362 Minimum Partitions of Unique Substrings
	26405	K39367 Odd Squares Computation
	26406	K39372 Mean of Sum Along Axis 0
	26407	K39377 Longest Substring with At Most Two Distinct Characters
	26408	K39382 Perfect Square Checker
	26409	K39387 String Transformation Based on Permutation
	26410	K39392 Library Book Management
	26411	K39397 Symmetric Binary Tree
	26412	K39402 Finding Unique Pairs with a Fixed Sum
	26413	K39407 Ghost Hunters
	26415	K39412 Sequence Classification
	26416	K39417 Find Best Discounts
	26417	K39422 Maximum Energy Collection in a Grid
	26418	K39427 Drone Delivery Shortest Path
	26419	K39432 Maximum Orders in K Consecutive Days
	26420	K39437 Filter Numbers Divisible by 3
	26421	K39442 Minimum Total Bonus
	26422	K39447 Maximum Sum of Increasing Subsequence
	26423	K39452 Determine Game Winner

Pick a problem randomly based on the current filter.