Solution to LeetCode: Rank Teams by Votes Solution Use a map of arrays (2 dimensional data structure) to accumulate the vote counts per position per team Sort the map based on the vote counts per position and team name /* Solution to LeetCode: Rank Teams by Votes * URL: https://leetcode.

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 /* Solution to HackerRank: Vowels in the Back * URL: https://www.

Solution /* Solution to HackerRank: Balanced Strings * URL: https://www.hackerrank.com/contests/regular-expresso/challenges/balanced-strings */ "^(ab|ba)+$" possible strings: ababab abba babaab but not: a bab abbaaba