## Number of ways to select exactly K even numbers from given Array

Given an array arr[] of n integers and an integer K, the task is to find the number of ways to select exactly K even… Read More »

- Must do Math for Competitive Programming
- Array of Vectors in C++ STL
- Breadth First Search without using Queue
- Minimize the maximum difference between adjacent elements in an array
- Shortest Path Faster Algorithm
- Basic Algorithm Techniques Not Taught in Academics
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Check if a string is a scrambled form of another string
- Role of SemiColon in various Programming Languages
- Word Break Problem | DP-32 | Set - 2
- Count the number of ways to construct the target string
- Median of an unsorted array using Quick Select Algorithm
- Sum of GCD of all possible sequences
- Extended Knapsack Problem
- Maximum number of unique values in the array after performing given operations
- Kth most frequent Character in a given String
- Count of substrings of length K with exactly K distinct characters
- Maximum LCM among all pairs (i, j) from the given Array
- Longest common subarray in the given two arrays
- Count of subarrays which start and end with the same element
- Huffman Coding using Priority Queue
- 0/1 Knapsack Problem to print all possible solutions
- Flood Fill Algorithm
- Find if there is a path between two vertices in an undirected graph
- Find lexicographically smallest string in at most one swaps
- Finding Median of unsorted Array in linear time using C++ STL
- Shortest path in a directed graph by Dijkstra’s algorithm
- What is a Webcrawler and where is it used?
- Operator Overloading '<<' and '>>' operator in a linked list class
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?

Given an array arr[] of n integers and an integer K, the task is to find the number of ways to select exactly K even… Read More »

Given two strings str1 and str2 of given lengths N and M respectively, each representing a large number, the task is to subtract one from… Read More »

Given an integer N, the task is to find the maximum possible GCD among all pair of integers with product N.Examples: Input: N=12 Output: 2 Explanation: All possible… Read More »

Given an integer N greater than 2, the task is to find an element M such that GCD(N, M) is maximum. Examples: Input: N =… Read More »

Given a sorted array arr[], the task is to calculate the number of missing numbers between the first and last element of the sorted array.… Read More »

Given an integer N, the task is to construct a matrix of size N2 using positive and negative integers and excluding 0, such that the… Read More »

Given a number N, we need to find the Fibonacci Series up to the N term. The Fibonacci series is a series of elements where,… Read More »

Given an array arr[] which denotes the integer coefficients of the polynomial, the task is to find the content of polynomial. Content of polynomials with… Read More »

Given an integer X, the task is to find two integers A and B such that sum of these two numbers is X and the… Read More »

Given a string array arr[] as input, the task is to print the words sorted by number of distinct characters that occur in the word,… Read More »

Given a binary tree, the task is to find the total count of set bits in the node values of all the root to leaf… Read More »

Given a Undirected Weighted Tree having N nodes and E edges. Given Q queries, with each query indicating a starting node. The task is to… Read More »

Given an array arr[], and queries Q[][] of the form (l, r, val), the task for each query is to update all the elements in… Read More »

Given a weighted, directed graph G, an array V[] consisting of vertices, the task is to find the Minimum Cost Path passing through all the… Read More »

Given an integer array A[ ] of size N, the task is to find a subsequence of size B such that the minimum difference between… Read More »