1000 - 1099
Solutions categorised by Problem IDs
997 - Find the Town JudgeIdentify the town judge by counting incoming and outgoing trust relationships for each person.1000 - Minimum Cost to Merge StonesMinimize the cost of merging consecutive stone piles by choosing merge boundaries with interval dynamic programming.1004 - Max Consecutive Ones IIIFind the longest run of ones after flipping at most k zeroes by maintaining a sliding window.1011 - Capacity To Ship Packages Within D DaysFind the minimum shipping capacity that meets the day limit by binary searching capacities and testing each load schedule.1019 - Next Greater Node In Linked ListFind the next larger value after each linked-list node by resolving earlier nodes with a monotonic stack.1029 - Two City SchedulingSplit travelers evenly between two cities at minimum cost by sorting the differences between their fares.1043 - Partition Array for Maximum SumMaximize the array sum after partitioning by choosing block lengths and scoring each block by its maximum value.1046 - Last Stone WeightSimulate stone collisions with a max-heap that repeatedly removes the two heaviest stones.1047 - Remove All Adjacent Duplicates In StringRemove adjacent equal pairs repeatedly by using a stack to expose new pairs as earlier ones disappear.1061 - Lexicographically Smallest Equivalent StringFind the smallest equivalent string by grouping interchangeable letters and selecting the smallest representative.1066 - Campus Bikes IIAssign bikes to workers with minimum total distance by recording used bikes in a bit mask during dynamic programming.1071 - Greatest Common Divisor of StringsFind the largest repeating string unit shared by two strings using compatibility checks and the greatest common divisor of their lengths.