# Category Archives: Algorithms

Given an array arr[] containing N email addresses with different domains, the task is to find the unique domains and their frequencies from the list… Read More
Given two arrays A[] and B[] (B[i] < A[i]) of size N each and an integer K, the task is to perform the operation of… Read More
Given two integers N and M, the task is to generate any N * M sized maze containing only 0 (representing a wall) and 1… Read More
Given an array arr[] of N strings, and Q queries where each of the queries contains some characters, the task is to check if for… Read More
Given a binary array arr[] of size N which is starting from index 0, the task is to reach the end of the array in… Read More
Construct a string that contains a times letter ‘A’ and b times letter ‘B’ (a > b) such that the maximum continuous occurrence of a… Read More
For a given matrix before[][], the corresponding cell (x, y) of the after[][] matrix is calculated as follows:  res = 0;for(i = 0; i <=… Read More
Recommended Solve DSA problems on GfG Practice. Solve Problems My Personal Notes arrow_drop_up Save
Prerequisite: What is Z-transform?  A z-Transform is important for analyzing discrete signals and systems. In this article, we will see the properties of z-Transforms. These… Read More
In the journey of programming, every programmer comes across a point where they want to solve a problem in a more efficient way. While finding… Read More
Given a Binary tree, the task is to print the outer cone layer i.e. combination of layers formed by moving only through the left child… Read More
Given an array arr[] of size N, the task is to check if it is possible to make all array elements consecutive by performing any… Read More
Given a 2-dimensional integer array arr[] representing N ranges, each of type [starti, endi] (starti, endi ≤ 109) and Q queries represented in array query[],… Read More
Given a tree with N vertices and N-1 edges represented by a 2D array edges[], the task is to find the minimum value among the… Read More
Given an integer M and a sorted integer array arr[] of length N containing 1 and N-1 prime numbers, each appearing just once, the task… Read More