1900 - 1999
Solutions categorised by Problem IDs
1903 - Largest Odd Number in StringFind the largest odd-valued substring of a decimal string by locating its rightmost odd digit.1913 - Maximum Product Difference Between Two PairsMaximize the product difference between two pairs by choosing the two largest and two smallest array values.1916 - Count Ways to Build Rooms in an Ant ColonyCount valid orders for building rooms by combining independent subtree orderings while respecting parent dependencies.1922 - Count Good NumbersCount valid digit strings by separating even-index and odd-index choices and raising their counts to the required powers.1926 - Nearest Exit from Entrance in MazeFind the nearest maze exit with breadth-first search from the entrance, excluding the entrance itself as an exit.1929 - Concatenation of ArrayConstruct an array's concatenation by placing each element at its corresponding position in both halves of the result.1980 - Find Unique Binary StringFind a binary string absent from the input by storing the existing strings and checking candidate values.1992 - Find All Groups of FarmlandLocate rectangular farmland groups by traversing connected cells and recording the corners of each group.1996 - The Number of Weak Characters in the GameCount characters dominated in both attack and defense by organizing attack values and tracking stronger opponents' defenses.
