Solution /* Solution to HackerRank: Winning Tic Tac Toe * URL: https://www.

Solution Iterate through each city and check if it is already under range of previous tower.

Solution Sort the array of numbers Find the minimum difference between ith and (i+K-1)th element in each iteration.

Solution Iterate the sides in descending order Check if sides make a triangle by checking if sum of two sides is greater than third side .

Solution Parse input and build the tree by maintaining an index HashMap.

Solution #1 Keep indexes of all numbers in a HashMap. Check if current maximum number is already at desired index i.

Solution Iterate through each house in a sorted order. Check if current house is in range of last transmitter.

Solution #1 Keep prices and corresponding index in a HashMap. Sort the prices array in ascending order so that combination of minimum difference can be found by comparing adjacent prices.

Solution Start iterating numbers from b to a because combination of larger numbers are more likely to be indivisible.

Solution Iterate from 2 to the given number. Consider odd numbers only except 2.