1600 - 1699
Solutions categorised by Problem IDs
1606 - Find Servers That Handled Most Number of RequestsFind the busiest servers using two min-heaps to track completion times and assign requests in cyclic order.1624 - Largest Substring Between Two Equal CharactersFind the longest gap between matching characters by comparing their first and last positions.1626 - Best Team With No ConflictsBuild the highest-scoring team without age conflicts by ordering players and tracking compatible score totals.1630 - Arithmetic SubarraysAnswer subarray queries asking whether the selected values can be rearranged into an arithmetic progression.1631 - Path With Minimum EffortMinimize the largest height change on a grid path by binary searching the effort limit and testing reachability.1633 - Smallest String With A Given Numeric ValueConstruct the lexicographically smallest string with a given value by assigning extra letter weight toward its right end.1639 - Number of Ways to Form a Target String Given a DictionaryCount ways to form a target by selecting letters from successive dictionary columns with dynamic programming.1657 - Determine if Two Strings Are CloseTest whether two strings are close by comparing the letters they contain and the multiset of their character frequencies.1662 - Check If Two String Arrays are EquivalentCompare two arrays of string fragments by advancing through their characters in concatenation order.1664 - Ways to Make a Fair ArrayCount removals that balance the sums at even and odd indices by accounting for the index shift after each deletion.1672 - Richest Customer WealthFind the richest customer's wealth by summing each row of account balances and taking the largest total.1679 - Max Number of K-Sum PairsMaximize disjoint pairs summing to k by matching complements with a hash map or using two pointers after sorting.1680 - Concatenation of Consecutive Binary NumbersConcatenate consecutive integers in binary by shifting the accumulated value to make room for each new number.1685 - Sum of Absolute Differences in a Sorted ArrayCompute absolute differences for every value in a sorted array by combining the sums on either side.1692 - Count Ways to Distribute CandiesCount distributions into nonempty bags by considering whether the next candy joins an existing group or starts a new one.
