1100 - 1199
Solutions categorised by Problem IDs
1123 - Lowest Common Ancestor of Deepest LeavesLocate the lowest common ancestor of the deepest leaves by comparing subtree depths during depth-first traversal.1125 - Smallest Sufficient TeamSelect the smallest team covering all required skills by representing skill sets as bit masks in dynamic programming.1135 - Connecting Cities With Minimum CostConnect all cities at minimum cost by sorting roads by cost and building a minimum spanning tree with Kruskal's algorithm.1137 - N-th Tribonacci NumberCompute Tribonacci numbers by adding the three preceding terms, with the option to store just those three values.1140 - Stone Game IIMaximize the stones taken under optimal play by tracking the current pile position and the limit on the next move.1143 - Longest Common SubsequenceFind the longest common subsequence by comparing prefixes and deciding how to handle matching or differing characters.1147 - Longest Chunked Palindrome DecompositionMaximize the number of mirrored chunks by greedily matching the shortest equal prefix and suffix.1155 - Number of Dice Rolls With Target SumCount dice outcomes reaching a target by combining results for one fewer die across the possible face values.1162 - As Far from Land as PossibleFind the water cell farthest from land by expanding a breadth-first search from land cells.1168 - Optimize Water Distribution in a VillageMinimize water supply costs by modeling wells and pipes as edges in a minimum spanning tree.
