# Category Archives: Algorithms

Given an array A[] of length N, the task is to count the number of subarrays of A[] that contain the length of that subarray.… Read More
Given an array arr[] of size N and an integer K, the task is to find the count of all the ordered pairs (i, j)… Read More
Given a string S of size N, having lowercase alphabets, the task is to find the lexicographically minimum string after moving a subsequence to the… Read More
Given an array arr[] of size N and integers L and R defining the given range, the task is to find the number of elements… Read More
I applied for the Uber SDE 1 role by taking a referral. ROUND 1 (CODING ROUND): Problem 1: Base 2 to Base 6 conversion https://www.geeksforgeeks.org/convert-a-number-from-base-2-to-base-6/… Read More
Circularly sorted arrays are arrays that are sorted in ascending or descending order and then rotated by a number of steps. Let us take an… Read More
Given an array (arr[]) of N integers, find a subsequence of 4 elements such that a[i] < a[j] < a[k] < a[l] and i <… Read More
Given an array arr[] of integers of size N that might contain duplicates, the task is to find all possible unique subsets, using C++ STL.… Read More
Given two integers N and K and an array of N positive integers (i.e., a0, a1, a2…., an-1), the task is to find the minimum… Read More
Hadamard matrix is a square matrix with the unique property that any two of its rows are orthogonal. In geometric terms that means that the… Read More
Given integers N, M and p, the task is to find the probability of hitting a target for the Nth time at the Mth throw… Read More
Given integers N and K, the task is to find the number of possible arrangements of N people around a circular table such that K… Read More
Given a positive integer N, the task is to check if N is a Squarable Number or not. An integer “N” is said to be… Read More
Given three integers N, X, Y, and an array arr[] of size N, the task is to find the count of subarrays having at least… Read More
Given a non-negative integer N, the task is to find the square root of N using bitwise operations. If the integer is not the perfect… Read More