Problem Set - OpenJudge

	ID	Problem
	40301	C1103 Split List for Minimum Sum Difference
	40312	C1104 Count Character Occurrences in Substrings
	40323	C1105 Justify Text Without Breaking Words
	40334	C1106 Find the Length of the Shortest Subarray to Sort
	40345	C1107 Find the Shortest Loop on a Spaceship Path
	40356	C1108 Minimum Steps to Achieve Liquid Ratio
	40367	C1109 Taco Walls Painting
	40379	C1110 Palindromic Strings Checker
	40390	C1111 Second Highest Student
	40401	C1112 Contiguous Subarray Sum
	40412	C1113 Longest Prime Path in a Tree
	40423	C1114 Evaluating Mathematical Expressions
	40434	C1115 Maximum Fruit Pairs
	40445	C1116 Minimum Operations to Equalize Array Elements
	40456	C1117 Counting Overlapping Intervals
	40467	C1118 Longest Palindrome Construction
	40478	C1119 Majority Element Finder
	40490	C1120 Maximum Subarray Sum
	40501	C1121 Check if a Binary Tree is Superbalanced
	40512	C1122 Binary Search in Sorted Array
	40523	C1123 Counting Strictly Increasing Consecutive Subarrays
	40534	C1124 Towers with a View
	40545	C1125 Longest Path in a DAG
	40556	C1126 Maximum Equal-Length Pencils
	40567	C1127 Overlapping Intervals
	40578	C1128 Smallest Enclosing Rectangle
	40589	C1129 Prime Factorization with Frequencies
	40601	C1130 Sum of Proper Divisors and Prime Check
	40612	C1131 Count Distinct Pairs with Given Sum
	40623	C1132 Phone Number Letter Combinations
	40634	C1133 Minimum Difficulty Route
	40645	C1134 Exchange Rate Calculator
	40656	C1135 Coin Flip Outcome
	40667	C1136 Count Even Numbers in Subarrays
	40678	C1137 Substring Detection
	40689	C1138 Linked List Cycle Detection
	40700	C1139 Password Validation
	40712	C1140 Longest Palindromic Subsequence in a Binary String
	40723	C1141 Minimum Moves to Equalize Array
	40734	C1142 Longest Common Prefix
	40745	C1143 Minimum Adjacent Swaps for Non-decreasing Array
	40756	C1144 Clone a Linked List with Random Pointers
	40767	C1145 Prime Number Detection
	40778	C1146 Deepest Left Leaf Node
	40789	C1147 Sieve of Eratosthenes Prime Generator
	40800	C1148 Sum of Two Largest Integers
	40811	C1149 Find the Smallest Missing Non-negative Integer
	40823	C1150 Cell Replication Challenge
	40834	C1151 Group Anagrams
	40845	C1152 Largest Rectangle of 1's in a Binary Matrix
	40856	C1153 Count Unique Pairs
	40867	C1154 Maximum Stock Profit
	40878	C1155 Calculate the Nth Fibonacci Number
	40889	C1156 Exclusive Word List Generation
	40900	C1157 Shortest Delivery Time
	40911	C1158 K-th Reversed Sum Sequence Element
	40922	C1159 Unique Paths in a Grid
	40934	C1160 Matrix 90-Degree Counterclockwise Rotation
	40945	C1161 Largest Square of Zeros in a City Map
	40956	C1162 Maximum Possible Value
	40967	C1163 Flatten a Nested Dictionary
	40978	C1164 Traffic Light Timing
	40989	C1165 Matrix Rotation
	41000	C1166 Counting Grid Paths
	41011	C1167 Fibonacci Sum
	41022	C1168 Reorder Heights by Parity
	41033	C1169 Edge Removal for Connectivity
	41045	C1170 Dynamic Median Finder
	41056	C1171 Reach the Last Platform
	41067	C1172 Shuffle Playlist
	41078	C1173 Arithmetic Progression Rearrangement
	41089	C1174 Grid Pathfinding with Blocked Cells
	41100	C1175 Minimum Number by Deleting One Digit
	41111	C1176 First Non-Repeating Character
	41122	C1177 Plant Height Calculation
	41133	C1178 Efficient Subarray Sum Queries
	41144	C1179 Transform Sequence
	41156	C1180 Forest Drone Coverage
	41167	C1181 Nearest Treasure
	41178	C1182 Domino Tilings of an Even Grid
	41189	C1183 Largest Rectangle of Trees
	41200	C1184 Grid Filling Feasibility
	41211	C1185 Longest Increasing Streak
	41222	C1186 Shortest Path in an Undirected Graph
	41233	C1187 Traveling Salesman Problem (TSP) using Bitmask DP
	41244	C1188 Unique Paths in Obstacle Grid
	41255	C1189 Parking Slot Allocation
	41267	C1190 Reverse a String
	41278	C1191 Maze Escape
	41289	C1192 Merge Overlapping Intervals
	41300	C1193 Maximum Element Not Exceeding K
	41311	C1194 Find Pair with Given Sum
	41322	C1195 Lowest Common Ancestor in a Binary Tree
	41333	C1196 Inventory Management System
	41344	C1197 Deep Merge of Nested Dictionaries
	41355	C1198 Minimum Operations to Convert Matrices
	41366	C1199 Nodes Removal for Vine Transformation
	41379	C1200 Smallest Element After Operations
	41390	C1201 Shortest Cycle in an Undirected Graph
	41401	C1202 Minimum Number of Runes

Pick a problem randomly based on the current filter.