Problem Set - OpenJudge

	ID	Problem
	42523	C1303 Count the Number of Words
	42534	C1304 Prefix Sum Grid Queries
	42545	C1305 Maximize Non-Overlapping Events Scheduling
	42556	C1306 Matrix Search in a Sorted Matrix
	42567	C1307 Minimum Dissatisfaction Score
	42578	C1308 Minimize Groups of Runners
	42589	C1309 Maximum Number of Non-Overlapping Workshops
	42601	C1310 Maximize Strength with One Skip
	42612	C1311 Palindrome Rearrangement with Optional Removal
	42623	C1312 Task Scheduling with Dependencies
	42634	C1313 Dynamic Array Operations
	42645	C1314 Permutation of Substring
	42656	C1315 Minimum Operations to Equalize Array Elements
	42667	C1316 Finding Common Friends
	42678	C1317 Maximum Apples Collection
	42689	C1318 Minimum Removals for Non-Decreasing Sequence
	42700	C1319 Maximum Consecutive Non-Overlapping Events
	42712	C1320 Count Greater Nodes in Subtree
	42723	C1321 Alternating Sequence Number
	42734	C1322 Rotate Matrix 90° Clockwise
	42745	C1323 Invert Range
	42756	C1324 Calculate Minimum Flight Hours
	42767	C1325 Maximum KxK Submatrix Sum
	42778	C1326 Zigzag Level Order Traversal of a Binary Tree
	42789	C1327 Custom String Operations
	42800	C1328 Max Distance Day
	42811	C1329 Palindromic String Checker
	42823	C1330 Sum of Divisible Numbers
	42834	C1331 Move Zeros to the End
	42845	C1332 Unique Characters Check
	42856	C1333 Secure Network Pairing
	42867	C1334 Sort Array with Limited Operations
	42878	C1335 Exact Leg Count Problem
	42889	C1336 Jump Game
	42900	C1337 Single Number
	42911	C1338 Skip One Level Game Strategy
	42922	C1339 Count Unobstructed West Views
	42934	C1340 The Alternating Guessing Game
	42945	C1341 Nearest Prime Challenge
	42956	C1342 Reverse Words in a String
	42967	C1343 Unique Robot Paths
	42978	C1344 Super Symmetry Checker
	42989	C1345 Minimum Operations to Balance Parentheses
	43000	C1346 Gift Codes Generation
	43011	C1347 Counting Special Substrings
	43022	C1348 Tribonacci Sequence
	43033	C1349 Athlete Race Time Tracker
	43045	C1350 Even Sum Odd Count Product
	43056	C1351 Maximum Complete Teams
	43067	C1352 Counting Safe Strings
	43078	C1353 Robot Task Scheduler
	43089	C1354 Trapping Rain Water
	43100	C1355 Rotate Array to the Left
	43111	C1356 Reverse Words in a String
	43122	C1357 Most Frequent Shape
	43133	C1358 Sum of Numbers in a String
	43144	C1359 Minimum Production Hours
	43156	C1360 Lucky Permutations
	43167	C1361 Minimum Jumps to Reach End
	43178	C1362 Maximum Sum Subgrid
	43189	C1363 Count Substrings Starting and Ending with One
	43200	C1364 Most Recent Files Extraction
	43211	C1365 Maximum Non-Attacking Knights
	43222	C1366 Above the Average
	43233	C1367 Single Number Finder
	43244	C1368 Smallest Integer with Given Digit Product
	43255	C1369 Subset Sum Determination
	43267	C1370 Anagram Checker
	43278	C1371 Pair with Exact Difference
	43289	C1372 Two Sum Problem
	43300	C1373 Subarray Reversal Sorting
	43311	C1374 Highest Value Numeric Substring
	43322	C1375 Remove K Digits
	43333	C1376 Longest Even Character Substring
	43344	C1377 Uniform Grid Conversion
	43355	C1378 Maximum Path Sum in a Grid
	43366	C1379 Minimum Subarray Sum Difference
	43378	C1380 Minimum Fibonacci Sum
	43389	C1381 Maximum Length Zero Sum Subarray
	43400	C1382 Coin Splitting
	43411	C1383 Maximum Non-overlapping Meetings
	43422	C1384 Count the Number of Islands
	43433	C1385 Robot Return to Origin
	43444	C1386 Determine the Final Lock State
	43455	C1387 Longest Magical Sequence
	43466	C1388 Counting Inversions
	43477	C1389 Find Maximum Depth and Maximum Values at Each Depth
	43489	C1390 Balanced Parentheses with Minimum Swaps
	43500	C1391 Maximum Magical Energy
	43511	C1392 Calculate Total Earnings
	43522	C1393 Sum of Prime Numbers in Range
	43533	C1394 Count Distinct Items in To-Do List
	43544	C1395 Tree Diameter
	43555	C1396 Trapping Rain Water
	43566	C1397 Sort Genres by Frequency
	43577	C1398 Modular Exponentiation
	43588	C1399 Ball Passing Game
	43601	C1400 Matrix Pathfinding with Directional Movement
	43612	C1401 Distinct Paths in a Grid with Obstacles
	43623	C1402 Longest Palindromic Subsequence

Pick a problem randomly based on the current filter.