## Search element in a Spirally sorted Matrix

Given a spirally sorted matrix with N * N elements and an integer X, the task is to find the position of this given integer… Read More »

- Quick Sort vs Merge Sort
- Find the Missing Number in a sorted array
- Modular exponentiation (Recursive)
- Largest perfect square number in an Array
- Dynamic Programming vs Divide-and-Conquer
- Binary Search In JavaScript
- Kth Smallest sum of continuous subarrays of positive numbers
- Binary Search (bisect) in Python
- Find Nth term (A matrix exponentiation example)
- Minimum in an array which is first decreasing then increasing
- Queries to check whether a given digit is present in the given Range
- Minimum K such that every substring of length atleast K contains a character c
- Java 8 | Arrays parallelSort() method with Examples
- Search in a sorted 2D matrix (Stored in row major order)
- Range and Update Sum Queries with Factorial
- Minimum operations of the given type required to make a complete graph
- Cut all the rods with some length such that the sum of cut-off length is maximized
- Minimum number N such that total set bits of all numbers from 1 to N is at-least X
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- First strictly greater element in a sorted array in Java
- Numbers that are bitwise AND of at least one non-empty sub-array
- First strictly smaller element in a sorted array in Java
- Find element position in given monotonic sequence
- Search element in a Spirally sorted Matrix
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Number of ways to divide a given number as a set of integers in decreasing order
- Search equal, bigger or smaller in a sorted array in Java
- Generate a random permutation of elements from range [L, R] (Divide and Conquer)

Given a spirally sorted matrix with N * N elements and an integer X, the task is to find the position of this given integer… Read More »

Given k sorted arrays of different length, merge them into a single array such that the merged array is also sorted. Examples: Input : {{3,… Read More »

Given a range [L, R] where L ≤ R, the task is to generate a random permutation of the sequence [L, L + 1, L… Read More »

Giving k sorted arrays, each of size N, the task is to merge them into a single sorted array. Examples: Input : arr[][] = {{5,… Read More »

Given N vertex where N is even. Initially there is no edge between any of the vertices. You are allowed to perform operation as illustrated… Read More »

Given a number X, the task is to find the minimum number N such that total set bits of all numbers from 1 to n… Read More »

Given a string S containing lowercase latin letters. A character c is called K-amazing if every substring of S with length atleast K contains this… Read More »

Given an array of N integers where array elements form a strictly decreasing and increasing sequence. The task is to find the smallest number in… Read More »

Given an array arr[] of N integers and number of queries Q. The task is to answer three types of queries. Update [l, r] –… Read More »

Given an integer k and a monotonic increasing sequence: f(n) = an + bn [log2(n)] + cn^3 where (a = 1, 2, 3, …), (b… Read More »

Given an array of n integers. The task is to find the largest number which is a perfect square. Print -1 if there is no… Read More »

Given an integer ‘K’ and a row-wise sorted 2-D Matrix i.e. the matrix has the following properties: Integers in each row are sorted from left… Read More »

Given an array ‘arr’, the task is to find all possible integers each of which is the bitwise AND of at least one non-empty sub-array… Read More »

Pre-requisites: Segment Tree Given an array of digits arr[]. Given a number of range [L, R] and a digit X with each range. The task… Read More »

Given an sorted array of positive numbers our tasks is to find the kth smallest sum of continuous subarray. Examples: Input : a[] = {1,… Read More »