Problem Set - OpenJudge

	ID	Problem
	26091	K37957 Second Largest Unique Integer
	26093	K37962 Minimum Partition Difference
	26094	K37967 Group Students by Grades
	26095	K37972 Taco Relay Station Communication
	26096	K37977 Maximum Items Carry Problem
	26097	K37982 Word Frequency Counter
	26098	K37987 Max Problems in a Row
	26099	K37992 Nth Smallest Distinct Number
	26100	K37997 Evaluating Arithmetic Expressions
	26101	K38002 Fair Team Split
	26102	K38007 Longest Increasing Subsequence
	26104	K38012 Caesar Cipher Decryption
	26105	K38017 Maximum Bond Strength
	26106	K38022 Minimal Keys to Open Chests
	26107	K38027 Polygon Descriptor
	26108	K38032 Maximum Train Scheduling on Limited Tracks
	26109	K38037 Maximum Subarray Sum
	26110	K38042 Range Increment Operations
	26111	K38047 Compute Factorial
	26112	K38052 Light Arrangement
	26113	K38057 Complete String Deletion
	26115	K38062 Roman Numerals to Integer
	26116	K38067 Sort Odd Numbers
	26117	K38072 Locker Security System
	26118	K38077 Trapping Rain Water
	26119	K38082 Anagram Checker
	26120	K38087 Maximum Subarray Sum
	26121	K38092 Inventory Management System
	26122	K38097 Path Sum Queries in a Tree
	26124	K38102 Sum of Square Roots of Digits
	26125	K38107 Palindrome Rearrangement with One Deletion and One Swap
	26127	K38112 Unique Encoded Outputs Count
	26128	K38117 Combination Sum II
	26129	K38122 Merge and Sort Sorted Arrays
	26130	K38127 Container With Most Water
	26131	K38132 Dynamic Participant Manager
	26132	K38137 Count Groups
	26133	K38142 Minimum Power Difference Partition
	26134	K38147 Reverse and Swap Case
	26135	K38152 Symmetric Binary Tree Check
	26136	K38157 Count Unique Normalized Names
	26138	K38162 Unique Characters Check
	26139	K38167 Balanced Parentheses Checker
	26140	K38172 Largest BST Subtree in a Binary Tree
	26141	K38177 Odd Sum Subsequences Count
	26142	K38182 Taco's Diamond Collection
	26143	K38187 Counting Rearrangeable Subarrays
	26144	K38192 Asterisk Pattern Generation
	26145	K38197 Taco Truck Problem
	26146	K38202 Concatenating 2x2 Arrays
	26147	K38207 Minimum Operations to Equalize Array Elements
	26149	K38212 Unique Paths with Obstacles
	26150	K38217 Remove Invalid Parentheses
	26151	K38222 Counting Friend Groups
	26152	K38227 Maximum Meetings Scheduling
	26153	K38232 Deepest Leaves Sum in a Binary Tree
	26154	K38237 Rearrange Array to Avoid Arithmetic Sequences
	26155	K38242 Maximum Revenue Calculation
	26156	K38247 Distinct Regions in a Maze
	26157	K38252 Maximum Absolute Difference
	26158	K38257 Largest Rectangle with Uniform Heights
	26160	K38262 Shield Activation Maximum Strength
	26161	K38267 Minimum House Restoration Cost
	26162	K38272 Minimum Grass Cells Mowed
	26163	K38277 Equalizing Pollution Levels
	26164	K38282 Calculate Similarity Scores
	26165	K38287 Taco Sales Summary
	26166	K38292 Longest Common Subsequence for Multiple Strings
	26167	K38297 Find the N-th Digit of Pi
	26168	K38302 Maximize Delivery Weight
	26169	K38307 Maximizing Gold Coins in the Magical Forest
	26171	K38312 Longest Non-Decreasing Subarray
	26172	K38317 Error Summary Generator
	26173	K38322 Range Sum Queries
	26174	K38327 Inventory Management System
	26175	K38332 Smallest Sum Subarray
	26176	K38337 Unique Deck Configurations
	26177	K38342 Separate Even Numbers and Odd Indexes
	26178	K38347 Minimum Cost to Form a Tree
	26179	K38352 Password Validation Challenge
	26180	K38357 Most Frequent Words
	26182	K38362 Stable Microorganism Growth
	26183	K38367 Calculate Total Water
	26184	K38372 Valid Garlands
	26185	K38377 Coin Change
	26186	K38382 Unique Characters Checker
	26187	K38387 Busiest Minute
	26188	K38392 Sum of Multiples
	26189	K38397 Minimum Late Packages
	26190	K38402 Longest Wave
	26191	K38407 Count Primes in Range
	26193	K38412 Bubble Sort Implementation
	26194	K38417 Path Finding in a Maze
	26195	K38422 Minimum Operations to Equalize Array
	26196	K38427 Minimum Flips to Achieve a Uniform Binary Matrix
	26197	K38432 Longest Divisible Subsequence
	26198	K38437 Product Except Self
	26199	K38442 Highest Scoring Word
	26200	K38447 Maximum Non-Overlapping Events
	26201	K38452 Maximum Consecutive Ones

Pick a problem randomly based on the current filter.