Print all the perfect squares in a range i.e. a and b are the lower and upper bounds respectively. So print all the perfect squares between them and both are inclusive. Examples: Input: a = 1, b = 10 Output: 1, 4, 9 Input: a = 10, b = 100 Output: 16, 25, 36, 49, 64, 81, 100… Read More »
Given first N natural numbers. Our task is to check whether is it possible to split the numbers in two sets such that absolute difference of the sum of numbers in the two sets is equal to M and their gcd(greatest common divisor) is 1. Examples: Input : 5 7 Output : Yes Here,N=5 and M=7 Total sum… Read More »
Given an array of unique integers, print the array in such a way that the first element is first maximum and second element is first minimum and so on. We have to Rearrange an array in maximum minimum form using Two Pointer Technique. Examples: Input : arr[] = {7, 1, 2, 3, 4, 5, 6} Output : 7… Read More »
LRU cache implementation: Here we have two methods get and set which are defined as follows: get(x) : If the key x exists in the cache, returns its value and update reference position in the list. Else returns -1. set(x,y) : Inserts the value if the key x is not already present. If the cache reaches its capacity… Read More »
Given N and M, distribute first N natural numbers in two sets such that the absolute sum of the numbers in the two sets is equal to M. If possible, print the sum of the numbers in the two sets separated by a space, otherwise, print “Not Possible“. Examples: Input : 7 4 Output : 16 12 Explanation… Read More »
A sequence, whose nth term is defined by: Tn = (n)2 – (n – 1)2. The task is to calculate the sum of first n term of the sequence i.e find Sn where, Sn = T1 + T2 + ….. + Tn-1 + Tn Examples: Input : n = 2 Output : 4 T1 = 12 – 02… Read More »
Given an array of positive integers we have to find number of pair of elements whose difference is smaller than average difference. Average difference is defined as (max(A)-min(A))/(n-1), where A is the array and max(A),min(A) is the maximum and minimum element of the array. Examples: Input : {9,3,10,2,3} Output : 2 Input : {7,9,5,3,1} Output : 0 RECOMMENDED: Characteristics or… Read More »
Given a matrix mat[][] of size M x N integers where M is the number of rows and N is the number of columns and a number K. The task is to sort the Kth column of the matrix. Where K <= N. Example: Input: mat[3][3] = {{ 9, 3, 4}, { 5, 2, 7}, { 3, 1,… Read More »
Given heights of n rectangles and two positive integers x and y. You start moving from the rectangle at 0th index. In one move you can perform one of the following operations: If h[ i-1 ] <= h[ i ], move from i-1 to i rectangle If h[ i-1 ] > h[ i ], move from i-1 to… Read More »
Given a number num (0 < num < 108), the task is to sort the digits of the number such that even indices are in ascending order and odd indices in descending order. Examples: Input: num = 1423 Output: 4132 Explanation: Sort number num in ascending order: num = 1234 Replace even indices in ascensing order: *1*2 And… Read More »
