Skip to content

Category Archives: Divide and Conquer

Given a binary string S of length N. The task is to find the following: The minimum number of subsequences, string S can be divided… Read More
Insertion sort: The array is virtually split into a sorted and an unsorted part. Values from the unsorted part are picked and placed at the… Read More
Order-Agnostic Binary Search is a modified version of Binary Search algorithm. Here in this modified binary search comes with one more condition checking. The intuition… Read More
Given two sorted arrays A[] and B[] consisting of N and M integers respectively, the task is to find the Kth smallest number in the… Read More
Given two numeric strings A and B, the task is to find the product of the two numeric strings efficiently. Example:Attention reader! Don’t stop learning… Read More
Given a Generic Tree consisting of N nodes numbered from 0 to N – 1 which is rooted at node 0 and an array val[]… Read More
Given an array arr[] of N distinct integers, the task is to check if it is possible to sort the array in increasing order by… Read More
Given three integers A, N and P, the task is to find (A^(N!)) % P. Examples:Attention reader! Don’t stop learning now. Get hold of all… Read More
Given a binary string s, the task is to calculate the number of such substrings where the count of 1‘s is strictly greater than the… Read More
There are many ways of classifying algorithms and a few of them are shown below: Implementation Method Design Method Other Classifications Classification by Implementation Method:Attention… Read More
Given three numbers W, B, and O representing the quantities of white, black, and other colors shirts respectively, the task is to find the maximum… Read More
Given two integers W and C, representing the number of watermelons and coins, the task is to find the maximum number of mangoes that can… Read More
Given a sorted array arr[] of size N and an integer K, the task is to find Kth smallest element present in the array. The… Read More
Given an array arr[] consisting of N integers, the task is to sort the given array in ascending order using the slow sort. Examples:Attention reader!… Read More
Competitive Programming is vital for one’s development in the coding field. This article is going to discuss some basics points one should keep in mind… Read More

Start Your Coding Journey Now!