## Count of ways to select K consecutive empty cells from a given Matrix

Given a binary matrix V[][] of dimensions N * M, wherein each cell is either empty or blocked marked by a 0 and 1 respectively,… 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
- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Shortest Path Faster Algorithm
- Maximum sum path in a Matrix
- Basic Algorithm Techniques Not Taught in Academics
- Role of SemiColon in various Programming Languages
- Maximum number of unique values in the array after performing given operations
- Sum of GCD of all possible sequences
- Traveling Salesman Problem using Genetic Algorithm
- Minimum Cost Graph
- Median of an unsorted array using Quick Select Algorithm
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Word Break Problem | DP-32 | Set - 2
- Huffman Coding using Priority Queue
- Find lexicographically smallest string in at most one swaps
- Kth most frequent Character in a given String
- Operator Overloading '<<' and '>>' operator in a linked list class
- Longest Mountain Subarray
- Check if sum of any subarray is Palindrome or not
- What is a Webcrawler and where is it used?
- 0/1 Knapsack Problem to print all possible solutions
- Sort an Array which contain 1 to N values in O(N) using Cycle Sort
- Minimum increment or decrement required to sort the array | Top-down Approach
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
- Find last remaining element after reducing the Array
- Longest common subarray in the given two arrays

Given a binary matrix V[][] of dimensions N * M, wherein each cell is either empty or blocked marked by a 0 and 1 respectively,… Read More »

Given a linked list where every node represents a linked list and contains two pointers of its type: Pointer to next node in the main… Read More »

Given a string str, the task is to check if it can be split into substrings such that each substring starts with a numeric value… Read More »

Given three integers X, Y and N, the task is to find the largest number possible of length N consisting only of X and Y… Read More »

Given a number N, the task is to find the number of quadraples such that a2 + b2 = c2 + d2 where (1 <=… Read More »

Given two integers N and X, the task is to find the minimum count of integers with sum N and having unit digit X. If… Read More »

Given an array arr[] of N positive integers and a number K, the task is to find the maximum value of bitwise OR of the… Read More »

Given a positive integer N, the task is to find the sum of divisors of all the numbers from 1 to N. Examples: Input: N… Read More »

Given an unweighted directed graph G as a path matrix, the task is to find out if the graph is Strongly Connected or Unilaterally Connected… Read More »

Given an undirected graph having N vertices and M edges and each vertex is associated with a cost and a source vertex S is given.… Read More »

Given an array arr[] of positive integers. The task is to reverse a subarray to minimize the sum of elements at even places and print… Read More »

Given a binary tree, the task is to print the longest path from the root node to the leaf node. If there are multiple answers… Read More »

Given two numbers K and N. The task is to represent the given number K as a sum of several N-bonacci numbers. Examples: Input: K… Read More »

Given an array arr[] of size N, the task is to find the minimum possible sum by extracting the smallest element from any K subsequences… Read More »

Given two integers N and K, the task is to count the numbers up to N digits such that no two zeros are adjacents and… Read More »