My software development journey
Given a number expressed in base, exponent form (ab) where a is arbitrary big number For example contains 100 digits, We have to write a program to find the last digit in it’s expanded form. Eg: 45712 has a last digit of 1 Since the range of numbers is huge, it is impossible to expand…
Given a number of unit squares (1 x 1). How many different rectangles can be formed with them? For example let us consider 4 units. We can form 5 different rectangles like the following. Two rectangles are considered same if they are oriented in a different way but same dimensions. Basically we have to arrange…
Most of the popular programming languages like C/C++, Java, C# provide primitive data types (int, long) to hold values up to only a specific range. A 64-bit integer can store only store numbers in the range of -264 to 263-1. This can store numbers containing roughly 19-20 digits.What if we have to deal with even…
This problem looks easy to solve for small numbers. Simply calculate the factorial and count how many zeroes are present at the end! But the factorial grows big very fast even for small numbers which cannot fit into standard data types. (20! = 2432902008176640000. Cannot fit into a long variable also). In summary this is…
This is a problem from CodeChef. Follow this link if you want to try this problem on your own. Given a permutation of numbers from 1 to N. You can walk through the permutation to find cycles in it.Here is how you can do it. Consider the permutation {3, 5, 2, 1, 4, 6} Start…
This problem is from Codeforces. If you want to solve this problem on your own, follow this link. Here is the simplified problem statement. Given a list of scores of contestants in a competition, arranged in decreasing order. We have to calculate the number of people qualified for the next round.This is determined as follows,…
This problem is from code forces. If you want to try this problem, follow this link. Here is the simplified problem statement. Given a group of N friends, each one has given a gift to other friend or themselves. An input array is given which indicates from whom each one has received their gifts. We…
Consider the following two problems appeared in two different competitions, which underlies the same pattern. Given a number of chocolates (N). For each of M wrappers, we will get a chocolate free. How can one have the maximum number of chocolates by following an optimum strategy? Given a number of candles (N) each of them…
This problem is from a recent contest on Hackerrank. If you want to solve this problem on your own, Click on this link.Here is the problem statement:Given array of size N, we have to find all the subsets of size > 2 of this array. Apply AND (bitwise &) on all the subsets. Print the…
This problem is from SPOJ. Give it a try by following this link! The simplified problem statement is as follows. You need to collect some stamps from friends. Suppose you have n friends and each of them have some stamps with them {s1, s2, … sn}. The problem is to find if we can…