CONCEPTS USED: Greedy algorithm. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT(SIMPLIFIED): Now Arnab is given a fraction N/D. He is asked to divide the fraction in sum of unique unit fractions where...
CONCEPTS USED: Binary Search DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array H of lengths of Magical Ropes and array R of the rate by which rope increases daily, print...
Concepts Used Strings, Hash Table Difficulty Level Hard Problem Statement (Simplified): Find the total number of children standing on each square after 10100 rotations by every individual child. Each child...