Problem Set - OpenJudge

	ID	Problem
	46494	C3103 Meeting Slot Scheduler
	46495	C3104 Capitalize Sentence
	46496	C3105 Smallest Subarray with Given Sum
	46497	C3106 Stack Operations on a Constrained Capacity Stack
	46498	C3107 Maximum Congestion Bridge
	46499	C3108 Smallest Integer with a Given Digit Sum
	46500	C3109 Hourglass Pattern
	46502	C3110 Next Prime Number
	46503	C3111 Bishop Moves Calculation
	46504	C3112 Popularity Score Calculation
	46505	C3113 Rearrange String to Avoid Adjacent Duplicates
	46506	C3114 Taco Balloon Game Rounds
	46507	C3115 Patrol Route Validation
	46508	C3116 Taco Land: Largest Empty Plot
	46509	C3117 Forming a Nearly Palindrome
	46510	C3118 Matrix Operations: Sum, Product, and Cumulative Sum
	46511	C3119 Taco Subset Sum Problem
	46513	C3120 Taco Stamp Albums
	46514	C3121 Car Rental Suggestion
	46515	C3122 Counting Words with All Vowels
	46516	C3123 Total Distance Covered
	46517	C3124 Unique Sorted List
	46518	C3125 Custom Diagonal Array
	46519	C3126 Maximum Diagonal Sum
	46520	C3127 Warehouse Knapsack Optimization
	46521	C3128 Assembly Process Memory Check
	46522	C3129 Sentence with Highest Word Count
	46524	C3130 Maximum Product of Two Numbers
	46525	C3131 Triplet Sum Problem: Find Three Numbers That Sum to Target
	46526	C3132 Find All Prime Numbers Up To n
	46527	C3133 Move Negatives to End
	46528	C3134 Determine the Election Winner
	46529	C3135 Farm Grid Operations
	46530	C3136 Trapping Rainwater
	46531	C3137 Find Pairs with a Given Sum
	46532	C3138 Lexicographically Smallest Palindrome
	46533	C3139 Max Performances
	46535	C3140 Minimum Unique Items Needed
	46536	C3141 Maximum Length Subarray with Near Elements
	46537	C3142 Longest Unique Substring Length
	46538	C3143 Dual Robots Maze Escape
	46539	C3144 Rearrange to Palindrome
	46540	C3145 Path with Sum
	46541	C3146 Equal Subset Partition
	46542	C3147 Auction Winners
	46543	C3148 Minimum Transformation Steps
	46544	C3149 Sum of Primes Below N
	46546	C3150 Exactly One Swap Transformation
	46547	C3151 Reverse Integer
	46548	C3152 Minimized Sum Starting Times
	46549	C3153 Budget Allocation
	46550	C3154 Counting Branches in Alice's Tree
	46551	C3155 Longest Palindrome Formation
	46552	C3156 Count Elements with Frequency At Least K
	46553	C3157 Group Words by Length
	46554	C3158 Marathon Route Towns
	46555	C3159 Prime Permutation
	46557	C3160 Supply Distribution Problem
	46558	C3161 Minimal Operations on Binary Strings
	46559	C3162 Minimum Moves to Target
	46560	C3163 Lexicographical Rearrangement
	46561	C3164 Find the Unique Number
	46562	C3165 GCD with Iterative Debugging
	46563	C3166 Minimum Path Sum in a Grid
	46564	C3167 Maximum Sum Submatrix
	46565	C3168 First Peak Element
	46566	C3169 Palindrome Checker
	46568	C3170 Counting Pairs with Given Difference
	46569	C3171 Taco Books Selection
	46570	C3172 Hamiltonian Cycle Detection in a Directed Graph
	46571	C3173 Longest Uniform Substring
	46572	C3174 Reverse Integer Without String Conversion
	46573	C3175 Counting Paths in a Grid
	46574	C3176 Price Tracker and Query Handler
	46575	C3177 Magazine Word Formation
	46576	C3178 Path Existence in a Binary Grid
	46577	C3179 Find Substring Concatenation Indices
	46579	C3180 Total Sales Calculation for Common Products
	46580	C3181 Minimum Edit Operations for String Transformation
	46581	C3182 Sequence Operations Transformation
	46582	C3183 Final Robot Position
	46583	C3184 Fenwick Tree Operations
	46584	C3185 Player Score Tracker
	46585	C3186 Longest Substring Without Repeating Characters
	46586	C3187 Minimize Water Level Difference
	46587	C3188 Shortest Unsorted Continuous Subarray
	46588	C3189 Substring Concatenation Finder
	46590	C3190 Minimum Hours to Cover Forest
	46591	C3191 Lexicographical Bounds
	46592	C3192 Unique Characters Frequency
	46593	C3193 Malfunction Checker Based on Distinct Substrings
	46594	C3194 Minimum Contiguous Substring Removal
	46595	C3195 Finding Large Files in a File System
	46596	C3196 Largest Connected Component in a Network
	46597	C3197 Count Special Contiguous Subsequences
	46598	C3198 Conditional Sorting
	46599	C3199 Minimum Removals to Make Array Simple
	46602	C3200 Largest Uniform Flower Square
	46603	C3201 Toggle Case
	46604	C3202 Shortest Unsorted Subarray

Pick a problem randomly based on the current filter.