Skip to content

Category Archives: Algorithms

Given an array arr[] of length N consisting of uppercase English letters only and a letter ch. the task is to find the final array… Read More
Given a circular array arr[] of size N containing positive integers only, Player A and B are playing a game, turn by turn, the game… Read More
Given an array A[] of size N, the task is to check if there exists any integer that divide all the elements of that array… Read More
Given an array nums[] of length N containing non-negative integers, the task is to convert all elements from index 0 to N-2 to zero, after… Read More
Given a positive integer N, the task is to find the number of distinct ways to express N as a sum of positive palindromic integers… Read More
Given an array arr[] of size N, determine if there exist 3 distinct indices integers, such that their sum ends in digit K. Examples: Input:… Read More
Given an array arr[] of size N, the task is to find the total number of unique pair sums possible from the array elements. Examples:… Read More
Given a string s of length N, and Q queries, each of type (K, C) where K is an integer C is a character, the… Read More
Given a string S and a list lis[] of N number of words, the task is to find every possible (N+1)th word from string S… Read More
Pre-Internship Drive: Microsoft internship was one of the best things that happened to me during my college days. It came during that time of my… Read More
Given an array A[] of size N. An array has to be created using the given array considering the following conditions. If the index is… Read More
Given an integer array arr[] of size N that is sorted in increasing order and an integer K, Return an array with power of K… Read More
Given a positive integer N, the task is to find all pairs of integers (i, j) from the range [1, N] in increasing order of… Read More
Given N tasks and N people who can work on them. Each task requires A[i] (0 <= i <= N-1) units of work to complete… Read More
Given binary strings S1 and S2 of length N, the task is to check if S2 can be made equal to S1 by performing the… Read More

Start Your Coding Journey Now!