Solution import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.

Solution import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.

Solution /* Solution to HackerRank: Divisible Sum Pairs * URL: https://www.

Solution /* Solution to HackerRank: The Time in Words * URL: https://www.

Solution Use BigInteger to calculate the sum and print first 10 characters by converting to string.

Solution 2 to the power 1000 will be a huge number hence consider using BigInteger.

Solution Diameter of a binary tree is maximum of diameter of current node, its left and right child.

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 .