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 »
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 »
In this article, we will discuss about Hexahectagon number. According to definition of Hexahectagon number: A Hexahectagon number is class of figurate number. It has 600 – sided polygon called Hexahectagon. The N-th Hexahectagon number count’s the 600 number of dots and all others dots are surrounding with a common sharing corner and make a pattern. The first… Read More »
Given an integer array arr[] and an integer K (greater than 0), the task is to count the subarray whose elements sum up to a multiple of K, else print -1. A number x is a multiple of K if there exists an integer y such that x = y*k. Remember 0 is also a multiple of K.… Read More »
Given a square matrix of n order in which two positions are filled. Fill two more positions such that a rectangle is formed by joining all points. Examples: Input: n=4 Matrix[][]= 1 0 0 1 0 0 0 0 0 0 0 0 Output: Matrix[][]= 1 0 0 1 1 0 0 1 0 0 0 0 Input:… Read More »
Given an integer array nums, return the sum of floor(nums[i] / nums[j]) for all pairs of indices 0 <= i, j < nums.length in the array. The floor() function returns the integer part of the division. Examples: Input: nums = [2,5,9] Output: 10 Explanation: floor(2 / 5) = floor(2 / 9) = floor(5 / 9) = 0 floor(2… Read More »
Design the pattern as represented in the famous snake and ladders game. Your task is to print the pattern as represented in snake and ladders game for a given integer input N, where N denotes the number of rows and columns of the pattern array. Note: N given will be always even. Examples: Input: N=4 Output: 7 8… Read More »
