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 »
Given a number N, the task is to check if N is a dodecahedral Number – Dodecahedral Number belongs to a figurate number and represents it dodecahedron. The first few dodecahedral numbers are 1, 20, 84, 220, 455, 816, 1330 … Examples: Input: N = 20 Output: Yes Explanation: 20 is the second dodecahedral number Input: N =… Read More »
Given a positive integers N, the task is to find the smallest N digit number divisible by N. Examples: Input: N = 4 Output: 1000 Explanation: 1000 is the smallest 4-digit number divisible by 4. Input: N = 5 Output: 10000 Explanation: 10000 is the smallest 5-digit number divisible by 5. Approach: A series will be formed like… Read More »
Given an array arr[] of integer elements, the task is to find the length of the largest sub-array of arr[] such that all the elements of the sub-array are Fibonacci numbers. Examples: Input: arr[] = { 4, 2, 3, 4, 5, 8, 11 } Output: 2 Explanation: Maximum length sub-array with all elements as Fibonacci number is {2,… Read More »
Given an array containing n numbers. The problem is to find the length of the longest zigZag subarray such that every element in the subarray should be in form a < b > c < d > e < f.. Time Complexity should be O(n). Examples: Input : arr[] = {1, 5, 0, 4, 3} Output : 5… Read More »
Given a binary matrix of order m*n, the task is to find the distance of nearest 1 for each 0 in the matrix and print final distance matrix. From any cell (i,j), we can move only in four directions up, down, left and right. Note: Distance from one cell to immediate another cell is always incremented by 1.… Read More »
Given a positive integer N, the task is to check whether the given number N is Even or Odd. Examples: Input : N = 10 Output : Even Input : N = 5 Output : Odd Method 1: An even number is an integer which is “evenly divisible” by 2. This means that if the integer is divided… Read More »
