You have a total of n coins and you want to arrange the coins in staircase shape, where every i-th row must have exactly i coins. You want to find the total number of full staircase rows that can be formed. Example: Input : n = 7 Output : 3 We can form the staircase as follows :… Read More »
Given an array arr[] of n elements, write a function to search a given element x in arr[]. Examples: Input : arr[] = {10, 20, 80, 30, 60, 50, 110, 100, 130, 170} x = 110; Output : 6 Input : arr[] = {10, 20, 80, 30, 60, 50, 110, 100, 130, 170} x = 175; Output :… Read More »
In a country some special kinds of coins are available. The coin’s value is decided by a rule, that the values of the coins are first N positive odd numbers. As an example, if N = 3 then coins consisting values are [1,2,5]. For quality, the country decided that every people should have exactly one coin of each… Read More »
We’re given a function in the format of f(x). We have to find the minimum absolute difference between f(x) and given number k over a range (0 – 10^6). This article assumes you know the working principle of binary search. If you don’t know, please go and check out the binary search. To understand this concept, let’s assume… Read More »
Two integers n and k is given. Find number of integers i from 1 to n such than difference of i and sum of digits of i is greater than k. Examples: Input : n=12 k=1 Output : 3 Explanation : 10,11,12 satisfies the given condition 10-sod(10) = 10-1 = 9 > k 11-sod(11) = 11-2 = 9… Read More »
We have to print the pattern as given in the example below : Examples: Input : 4 Output : 1 1 12 21 123 321 12344321 123 321 12 21 1 1 Input : 5 Output : 1 1 12 21 123 321 1234 4321 1234554321 1234 4321 123 321 12 21 1 1 Approach : You can… Read More »