Skip to content

Category Archives: DSA

Given two numbers X and Y. the task is to find the number N (N ≤ 10^18) which satisfies these two conditions: (N + X)… Read More
Given an array arr[], the task is to find the maximum sum possible such that any subarray of the indices from [l, r] i.e all… Read More
Given a number N (1 ≤ N ≤ 9×1018), the task is to find P and Q satisfying the equation N = P 2. Q… Read More
Given an array, arr[], and an integer K, the task is to find the total number of ways in which we can divide the array… Read More
Given a binary square matrix of characters having size N x N such that 1 represents land and 0 represents water, the task is to… Read More
When can we have duplicate nodes in the heap in Dijkstras Algorithm? In Dijkstra’s algorithm, a heap is used to efficiently keep track of the… Read More
A Li Chao tree (also known as a Dynamic Convex Hull or Segment Tree with lazy propagations) is a data structure that allows for efficient… Read More
Given a string str, the task is to extract all the Email ID’s from the given string. Example: Input: “Please send your resumes to Hr@Iwillgetbacktoyou@gmail.com… Read More
Given N and K, the task is to form an array where each element represents the number of ways to reach each index i (1… Read More
Given an array arr[] of size n, the task is to find the maximum possible size x of a subset such that there are exactly… Read More
Convolution is a mathematical operation used in signal processing, image processing, and other fields to combine two functions in order to produce a third function.… Read More
Given some Account Office Reference Number, the task is to check if they are valid or not using regular expressions. Rules for the valid  Account… Read More
Given some Loan Account Number(LAN), the task is to check if they are valid or not using regular expressions. Rules for the valid Loan Account… Read More
Given an array arr[] of size N ( N is even ), the task is to construct an array B[] such that the sum of… Read More
Given a tree with N vertices from 0 to N – 1 (0th node is root) and val[] where val[i] denotes the value of the… Read More

Start Your Coding Journey Now!