Given an array with all distinct elements, you need to find the occurrence of every element among all the possible subarrays of the array. Examples: Input: arr[] = { 2 , 1 , 3 } Output: 3,4,3 Explanation : All the possible subarrays are {2},{2,1},{2,1,3},{1},{1,3},{3}. Clearly 2 occurs 3 times 1 occurs 4 times and 3 occurs 3… Read More »
Given a number n (n>=1 && n<=1018), your task is to convert it to 1 in minimum operation and constant space and time complexity. In one operation you can either – Subtract 1 from n if n>1. (or) Divide n by one of its proper divisor. Examples:- Input: n=2 Output: 1 2–>1. first move:- subtract 1 from n… Read More »
Considering a clique of n vertices. Determine if it is possible to divide the set of vertices into two equal halves such that there is an edge between any two vertices of the two halves. A clique is a graph with an edge between any two distinct vertices. Examples: Input : 5 Output : NO Input : 2… Read More »
Given a number N, the task is to find Nth triacontakaihenagonal number. A triacontakaihenagonal number is class of figurate number. It has 31 – sided polygon called triacontakaihenagon. The N-th triacontakaihenagonal number count’s the 31 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first few triacontakaihenagonol numbers… Read More »
Given an integer N, the task is to check if it is a Tetracontagon number or not. Tetracontagon number is class of figurate number. It has 40 – sided polygon called tetracontagon. The N-th tetracontagon number count’s the 40 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The… Read More »
Given the Numerator and Denominator of N Rational Numbers, the task is to find the maximum Rational Number from the array. Examples: Input: N = 2 num[] = { 3, 3 } den[] = { 2, 4 } Output: 3 / 2 Input: N = 2 num[] = { 100, 300 } den[] = { 100, 400 }… Read More »
Given an integer N, the task is to check if it is a pentacontagon number or not. Pentacontagon number is class of figurate number. It has 50 – sided polygon called pentacontagon. The N-th pentacontagon number count’s the 50 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The… Read More »
Given an integer N, the task is to check if it is a Triacontakaidigon number or not. Triacontakaidigon number is class of figurate number. It has 32 – sided polygon called Triacontakaidigon. The N-th triacontakaidigon number count’s the 32 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The… Read More »
Given an integer N, the task is to check if it is a hexacontagon number or not. Hexacontagon number is class of figurate number. It has 60 – sided polygon called hexacontagon. The N-th hexacontagon number count’s the 60 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The… Read More »
Given an integer array and a positive integer k, count all distinct pairs with product equal to k. Examples: Input: arr[] = {2, 6, 4, 3, 1}, k = 12 Output: Count of pairs with the given product is 1 (2, 6) = 2 * 6 = 12 = k Input: arr[] = {3, 5, 9, 1, 15,… Read More »
