## Check if each element of the given array is the product of exactly K prime numbers

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

- How can one become good at Data structures and Algorithms easily?
- Cracking Technical Interviews
- Print the nodes of binary tree as they become the leaf node
- Reach the numbers by making jumps of two given lengths
- Dijkstra's shortest path with minimum edges
- Shannon-Fano Algorithm for Data Compression
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- How to write a Pseudo Code?
- Sort the array of strings according to alphabetical order defined by another string
- Longest subsequence such that adjacent elements have at least one common digit
- Code Optimization Technique (logical AND and logical OR)
- Iterative Letter Combinations of a Phone Number
- Check if it is possible to reach a number by making jumps of two given length
- Sum of similarities of string with all of its suffixes
- Dividing a Large file into Separate Modules in C/C++, Java and Python
- Smallest Pair Sum in an array
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Find the number in a range having maximum product of the digits
- Ternary Search
- Count pairs in array whose sum is divisible by K
- Length of the longest alternating subarray
- Smallest power of 2 which is greater than or equal to sum of array elements
- Largest perfect square number in an Array
- Travelling Salesman Problem implementation using BackTracking
- Count common characters in two strings
- Count distinct substrings that contain some characters at most k times
- Number of array elements derivable from D after performing certain operations
- Find alphabet in a Matrix which has maximum number of stars around it
- Array Manipulation and Sum
- Choose atleast two elements from array such that their GCD is 1 and cost is minimum

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

Given a number n. You are required to find ( Fib(n) ^ Fib(n) ) % 10^9 + 7, where Fib(n) is the nth fibonacci number.… Read More »

Given an array ‘arr’ consisting of integers, the task is to find the number of subsets such that their sum is equal to zero. Empty… Read More »

Given an array arr[] of length N, the task is to find the sum of the maximum elements of every possible sub-array of the array.… Read More »

Given an integer array of N elements. The task is to find the number of ways to split the array into two equal sum sub-arrays… Read More »

Given an array which is an original arithmetic progression with one element changed. The task is to make it an arithmetic progression again. If there… Read More »

Given an array arr[] of N integers, you can select some indexes such that every selected index has exactly one other selected index adjacent to… Read More »

Given an array arr[] of N integers and an integer X, the task is to find the maximum possible sub-array sum after applying at most… Read More »

Given a tree, and the weights of all the nodes, the task is to count the nodes whose weights are divisible by x. Examples: Input:… Read More »

Given an array sequence [A1, A2 …An], the task is to find the maximum possible sum of increasing subsequence S of length k such that… Read More »

Given three array A[], B[] and C[] of N integers each. The task is to find the count of triplets (A[i], B[j], C[k]) such that… Read More »

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights are… Read More »

Given two integers N and K, the task is to find N distinct integers whose bit-wise OR is equal to K. If there does not… Read More »

Given two linked list of the same size, the task is to create a new linked list using those linked lists. The condition is that… Read More »

A certain number of men can do a certain piece of work in D days. If there were m more men engaged in the work… Read More »