Problem Set - OpenJudge

	ID	Problem
	29026	K5116 Case-Sensitive Word Replacement
	29037	K5121 Shortest Subarray with Maximum Equal to k
	29048	K5126 Four Sum Problem
	29059	K5131 Graph Connectivity Under Edge Removal
	29070	K5136 Final Position of a Robot
	29081	K5141 Minimum Books Removal
	29092	K5146 Compute Total Active Time
	29103	K5151 Employee Bonus Calculation
	29114	K5156 Calculate Working Time in Minutes
	29126	K5161 Minimum Jump Game
	29137	K5166 Object in Room Description
	29148	K5171 Apply Commands on Grid
	29159	K5176 Largest Rectangle in Histogram
	29170	K5181 Rearrange Array by Even-Odd Partition
	29181	K5186 Longest Word Finder
	29192	K5191 Unique Paths in a Grid
	29203	K5196 Maximizing Developer Productivity
	29214	K5201 Subarray Sum Divisibility
	29225	K5206 Galactic Carrier Route Optimization
	29237	K5211 Reorganize String
	29248	K5216 Final Price with Prime Discount
	29259	K5221 Flatten Nested JSON
	29270	K5226 Most Frequent Letter in Words
	29281	K5231 Maximum Values at Each Level of a Binary Tree
	29292	K5236 Symmetrical Substring Count
	29303	K5241 Maximum Sum After Operation
	29314	K5246 Balanced String Checker
	29325	K5251 Can Form Palindrome?
	29336	K5256 Longest Balanced Parentheses Substring
	29348	K5261 Lexicographically Smallest Substring
	29359	K5266 Remove Duplicate Nodes from a Linked List
	29370	K5271 Minimum Crossing Time
	29381	K5276 Reorganize String
	29392	K5281 Maximum Consecutive Wins
	29403	K5286 Shortest Path in a Maze
	29414	K5291 Unique Number Permutations
	29425	K5296 Is Subsequence
	29436	K5301 Longest Consecutive Subsequence
	29447	K5306 Workshop Conflict Checker
	29459	K5311 Maximum of Two Integers
	29470	K5316 Minimum Spanning Tree using Kruskal's Algorithm
	29481	K5321 Longest Consecutive Sequence
	29492	K5326 Closest Element Finder
	29503	K5331 Check for Duplicates in an Array
	29514	K5336 Maximum Coins Collection in a Grid
	29525	K5341 Filter Words by Length
	29536	K5346 Minimum Chocolate Difference
	29547	K5351 Lexicographically Smallest String
	29558	K5356 Expression Evaluation
	29570	K5361 Evaluate Equations
	29581	K5366 Prime Number Filter
	29592	K5371 Beautify Flower Beds
	29603	K5376 Maximum Subarray Sum
	29614	K5381 Minimum Moves in a Grid
	29625	K5386 Distinct Palindromic Substrings
	29636	K5391 Check if an Integer is a Palindrome
	29647	K5396 Task Scheduler
	29658	K5401 Keyword-Based Tweet Classification
	29669	K5406 Total Matches in a Tournament
	29681	K5411 Taco Stone Game Winner
	29692	K5416 Longest Symmetric Subsequence
	29703	K5421 Minimal Moves to Almost Palindrome
	29714	K5426 Maximum Sum of Non-Adjacent Numbers
	29725	K5431 Minimum Operations to Empty a String
	29736	K5436 Contiguous Subsequence Divisibility
	29747	K5441 Snowball Fight Winner
	29758	K5446 Sum of Divisors in Range
	29769	K5451 Pascal's Triangle Generator
	29780	K5456 Generate a Good Sequence
	29792	K5461 Optimal Stock Value
	29803	K5466 Smallest Prime in a Range
	29814	K5471 Trapping Rain Water
	29825	K5476 Maximum Trade Profit
	29836	K5481 Merge Two Sorted Arrays
	29847	K5486 Maximum Price Change
	29858	K5491 Bitonic Sequence Checker
	29869	K5496 Sum of Corresponding Elements in Tuples
	29880	K5501 Product Array Puzzle
	29891	K5506 Taco Game Winner
	29903	K5511 Count Unique Pairs
	29914	K5516 Minimum Energy Path
	29925	K5521 Minimum Bucket Filling Steps
	29936	K5526 Letter Combinations of a Phone Number
	29947	K5531 Find Pairs with Given Sum
	29958	K5536 Find the First Duplicate Index
	29969	K5541 Word Break Problem
	29980	K5546 Employee Project Assignment
	29991	K5551 Maximum Mood Score
	30002	K5556 Employee Qualification Check
	30014	K5561 Flatten Binary Tree to Linked List
	30025	K5566 Taco Combination Count
	30036	K5571 Next Lexicographical Permutation
	30047	K5576 Find Unique Substrings
	30058	K5581 Merchant's Maximum Value
	30069	K5586 Maximum Minimum Subtree After Node Removal
	30080	K5591 Beaver Sequence Generation
	30091	K5596 Maximum Absolute Difference Pairs
	30103	K5601 Interval Conflict Checker
	30114	K5606 Lexicographically Smallest Unique Subsequence
	30126	K5611 Minimum Numbers to Add for GCD One

Pick a problem randomly based on the current filter.