Round 1: HackerRank
1)Given a singlyLinkedList with binary digits n each node. Find decimal value of the binary string generated by combining all nodes.
Example: input: 1->0->1->1->0 output: 22
2) Given ‘n’ consecutive number from 1. Given value k, find maximum sum generated from the consecutive numbers such that their intermediate sum should not be k, and values are summed from the left to right.1<n<10^9 & 1<k<10^5.