You are provided with an array of size 8*N and you are provided a permutation of 8*N consecutive integers comprising of all the elements from ‘a’ to ‘a + 7*N ‘. Your task is to minimize the difference of the sum of the squares of the elements at even positions and the odd positions and print the permutation.… Read More »
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 »
In dart programming, Lists are used for the collection of data. We declare just variables instead of declaring a separate variable for each value of the collection. Lists are indexable so that we access the values using index ( starts from 0 ). In this article, we will see how to compare two Lists in the dart. For… 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 »
Given two numbers n and m, generate all distinct subsequences of length m using numbers from 1 to n. You may repeat a number. INPUT: n=5, groups=3 OUTPUT: 1,1,3 1,2,2 1,3,1 2,1,2 2,2,1 3,1,1 INPUT: n=7, groups=3 OUTPUT: 1,1,5 1,2,4 1,3,3 1,4,2 1,5,1 2,1,4 2,2,3 2,3,2 2,4,1 3,1,3 3,2,2 3,3,1 4,1,2 4,2,1 5,1,1 APPROACH: We need to generate… 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 statement(string), the task is to check if that string contains any word which contains ‘a’ in it then print that word otherwise print no any word containing ‘a’ in the inputed string. Examples : Input: “W3Colleges provides excellent tutorials” Output: tutorials Input: “Python is fun” Output: no any word containing ‘a’ in the inputed string Input:… 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 »
