Problem Set - OpenJudge

	ID	Problem
	24517	K1616 Recursive Adjacent Duplicate Removal
	24528	K1621 Longest Palindromic Substring
	24539	K1626 Divide Crates for Minimal Weight Difference
	24550	K1631 Arithmetic Progression Rearrangement
	24558	K1636 Missing Number Finder
	24559	K1641 Second Smallest Number
	24560	K1646 Maximum Product of Two
	24562	K1651 Subsequence Verification
	24563	K1656 Maximum Altitude Difference
	24565	K1661 Team Building Group Assignment
	24566	K1666 Longest Palindromic Subsequence of Integer Digits
	24567	K1671 Sudoku Solver (Taco Edition)
	24568	K1676 Matrix Pathfinding
	24569	K1681 Maze Diameter
	24570	K1686 Non-Cyclic Group Formation
	24571	K1691 Evaluate Arithmetic Expression
	24572	K1696 Arithmetic Sequence: Find the N-th Term
	24573	K1701 Total Travel Time Calculation
	24574	K1706 Nearest Interesting Number
	24576	K1711 Pythagorean Triplet Checker
	24577	K1716 Minimum Changes to Non-decreasing Array
	24578	K1721 Good Array Challenge
	24579	K1726 Sum of Pairs
	24580	K1731 Count Total Bits
	24581	K1736 Triangular Number Series
	24582	K1741 Construct Equal Sum Sequence
	24583	K1746 Largest Possible Final Number
	24584	K1751 Unique Sorted Participant IDs
	24585	K1756 Smallest Number with Given Digit Sum
	24587	K1761 Count People With a Taller Right Neighbor
	24588	K1766 Maximum Sum Subarray Count
	24589	K1771 Binary Game Winner
	24590	K1776 Maximum Sum Subarray of Fixed Length
	24591	K1781 Pascal's Triangle Row Sum
	24592	K1786 Maximum Unique Subsequence Sum
	24593	K1791 Find the First String with Repeating Characters
	24594	K1796 Substring Existence in Sorted Substrings
	24595	K1801 Multiple Pending Friend Requests
	24596	K1806 Highest Product of Three
	24598	K1811 Minimum Operations to Remove Zeroes
	24599	K1816 Search Insert Position
	24600	K1821 Rearrange String: Letters First
	24601	K1826 Reverse Array
	24602	K1831 Catalan Numbers
	24603	K1836 Final Bacteria Count
	24604	K1841 Mountain Sequence Checker
	24605	K1846 Social Distancing in Seating Arrangements
	24606	K1851 Longest Subsequence with Limited Difference
	24607	K1856 Treasure Hunt - Knapsack Problem
	24609	K1861 Longest Mountain in Array
	24610	K1866 Find the K-th Smallest Word
	24611	K1871 Overtime Detection for Weekly Work Hours
	24612	K1876 Find the Odd Occurrence
	24613	K1881 Digit Power Sum Sequence
	24614	K1886 Minimum Packet Calculation
	24615	K1891 Minimal Stone Value
	24616	K1896 Extract Top Performers
	24617	K1901 Contains Nearby Duplicate
	24618	K1906 Rearrange Sentences
	24620	K1911 Taco Transformation
	24621	K1916 Pen Refill Counter
	24622	K1921 Minimum Deletions for Odd Character Counts
	24623	K1926 Two Sum Problem
	24624	K1931 Max Calories Burned
	24625	K1936 Find the Smallest Colored Rectangle
	24626	K1941 Unique Substrings
	24627	K1946 Light Display Pattern
	24628	K1951 Even Sum Pairs
	24629	K1956 Rotate Matrix 90 Degrees Clockwise
	24631	K1961 Cresting Students
	24632	K1966 Check Bipartite Graph
	24633	K1971 Minimum Road Length
	24634	K1976 Minimum Removals for Increasing Sequence
	24635	K1981 Palindrome Permutation
	24636	K1986 Add Binary Strings
	24637	K1991 Subsequence Sum Problem
	24638	K1996 Maximum Subarray Sum
	24639	K2001 Shifted Message Decoding
	24640	K2006 Key Sentences Extraction
	24642	K2011 Binary String Ones Selection Count
	24643	K2016 Adjacent Pairs Sum
	24644	K2021 Optimized Backup Request Scheduling
	24645	K2026 Nth Ugly Number
	24646	K2031 Minimum Operations to Make All Characters Equal
	24647	K2036 Character Frequency Count
	24648	K2041 Count Successfully Placed Advertisements
	24649	K2046 Fibonacci Number Verification
	24650	K2051 City Exploration
	24651	K2056 Count Vowels in Strings
	24653	K2061 Minimum Meeting Rooms
	24654	K2066 Filtering Items by Criteria
	24655	K2071 Gem Collector
	24656	K2076 Decode Ways
	24657	K2081 Maximum Distinct Bird Species
	24658	K2086 Validate Reference Codes
	24659	K2091 Maximum Subarray Score
	24660	K2096 Longest Contiguous Subarray with One Removal
	24662	K2101 Shortest Path in a Grid
	24663	K2106 Array Intersection
	24665	K2111 Minimum Edit Operations

Pick a problem randomly based on the current filter.