Problem Set - OpenJudge

	ID	Problem
	29424	K52957 University Application Status Checker
	29426	K52962 Maximizing Utilized Skills in Project Scheduling
	29427	K52967 Project Management Tool: Dependency Order
	29428	K52972 Find the Chosen Chocolates
	29429	K52977 Distinct Subarray Check
	29430	K52982 Minimum Items After Merge
	29431	K52987 Can Form Palindrome
	29432	K52992 Decode Ways
	29433	K52997 Circular Subarray Maximum Sum
	29434	K53002 Minimum Total Travel Cost
	29435	K53007 Taco Group Division
	29437	K53012 Count Distinct Islands
	29438	K53017 Maximum Path Sum in a Binary Tree
	29439	K53022 Unique Combination Sum II
	29440	K53027 Smallest Remaining Element
	29441	K53032 Minimum Operations to Transform the Grid
	29442	K53037 Third Friend Sum
	29443	K53042 Bottom-Up Level Order Traversal of a Binary Tree
	29444	K53047 Maximal Rectangle of Dots
	29445	K53052 Balanced Parentheses Checker
	29446	K53057 Pair with Sum
	29448	K53062 Maximum Snack Count
	29449	K53067 K-Frequent Characters Count
	29450	K53072 Reverse Words in a Sentence
	29451	K53077 Find the Dominant Integer
	29452	K53082 Extract Prime Numbers
	29453	K53087 Minimum Path Sum
	29454	K53092 Sort Meal Kits by Timestamps
	29455	K53097 Strong Password Checker
	29457	K53102 Digital Root Sum
	29458	K53107 Scoreboard Operations
	29460	K53112 Song Collection Management
	29461	K53117 Sum of Even Numbers in Multiple Lists
	29462	K53122 Fully Connected Communication Network
	29463	K53127 Valid Game Setup
	29464	K53132 Count Even Sum Pairs
	29465	K53137 Shortest Path via Dijkstra's Algorithm
	29466	K53142 Unique Paths in a Grid with Obstacles
	29467	K53147 Combination Sum II
	29468	K53152 Distinct Costume Color Schemes
	29469	K53157 Robot Pathfinding with Teleporters
	29471	K53162 Maximum Subarray Sum
	29472	K53167 DNS Record Validator
	29473	K53172 Matrix Rotation
	29474	K53177 Optimal Task Partition
	29475	K53182 Continuous Subarray Multiple Sum
	29476	K53187 Maximizing Consecutive Available Books
	29477	K53192 Palindrome Checker with Filter
	29478	K53197 Single Number
	29479	K53202 0/1 Knapsack Problem
	29480	K53207 Coin Change Sum Match
	29482	K53212 Contiguous Subarray Sum Problem
	29483	K53217 Minimum Steps to Target
	29484	K53222 Longest Increasing Consecutive Subsequence
	29485	K53227 Conditional Product-Sum
	29486	K53232 Minimum Adjacent Swaps to Sort Array
	29487	K53237 Smallest Missing Positive Integer
	29488	K53242 Spiral Order Matrix Traversal
	29489	K53247 Correct Positions
	29490	K53252 Unique Grid Paths
	29491	K53257 Minimum Absolute Difference
	29493	K53262 Power of Two Checker
	29494	K53267 Zero Sum Subarray
	29495	K53272 Longest Palindromic Substring Length
	29496	K53277 Categorize Prices
	29497	K53282 Count Distinct Substrings
	29498	K53287 Minimum Cost to Connect Agents
	29499	K53292 Binary Tree Query Processor
	29500	K53297 Two Sum Indices
	29501	K53302 Sum of Path Products in a Binary Tree with Depth Limit
	29502	K53307 Taco Grid Paths
	29504	K53312 Find the Missing Number in a Sequence
	29505	K53317 Geometric Progression Rearrangement
	29506	K53322 Minimal Moves in a Grid
	29507	K53327 Minimum Operations to Palindrome
	29508	K53332 Palindrome Permutation Checker
	29509	K53337 Sum of Multiples of 3
	29510	K53342 Longest Substring with At Most k Distinct Characters
	29511	K53347 Worker Schedule Adjustment
	29512	K53352 Segment Tree Range Queries
	29513	K53357 Shortest Path in a Grid
	29515	K53362 Minimum Operations to Beautiful String
	29516	K53367 Smallest Absolute Difference
	29517	K53372 Permutation Palindrome
	29518	K53377 Minimum Bridges to Cross
	29519	K53382 Permutation Order
	29520	K53387 Minimum Groups Formation
	29521	K53392 Knapsack Treasure Hunt
	29522	K53397 Distinct Paths in a Grid
	29523	K53402 Pair Sum Existence Problem
	29524	K53407 Taco Grid Paths
	29526	K53412 Minimum Substring Concatenation
	29527	K53417 Top K Frequent Elements
	29528	K53422 Typed Correctly?
	29529	K53427 Counting Connected Components
	29530	K53432 Factorial Calculation
	29531	K53437 Maximize Sequence Value
	29532	K53442 Contest Score Management System
	29533	K53447 Minimum New Connections
	29534	K53452 Balanced Binary Tree Check

Pick a problem randomly based on the current filter.