## Minimum moves to reach from i to j in a cyclic string

Given a cyclic string str and two integers i and j, the task is to count the minimum number of steps required to move from… Read More »

## Majority element in a circular array of 0’s and 1’s

Given a circular array containing only 0’s and 1’s, of size n where n = p*q (p and q are both odd integers). The task… Read More »

## Minimum bit changes in Binary Circular array to reach a index

Given a Binary Circular Array of size N elements and two positive integers x and y indicating the indices in the circular array. The task… Read More »

## Find last element after deleting every second element in array of n integers

Given a circular array of size n containing integers from 1 to n. Find the last element that would remain in the list after erasing… Read More »

## Python | Check whether two lists are circularly identical

Given two lists, check if they are circularly identical or not. Examples: Input : list1 = [10, 10, 0, 0, 10] list2 = [10, 10,… Read More »

## Length of longest increasing circular subarray

Given an array containing n numbers. The problem is to find the length of the longest contiguous subarray in a circular manner such that every… Read More »

## Circular array

An array is called circular if we consider first element as next of last element. Circular arrays are used to implement queue (Refer this and… Read More »

## Minimum absolute difference of adjacent elements in a circular array

Given n integers, which form a circle. Find the minimal absolute value of any adjacent pair. If there are many optimum solutions, output any of… Read More »

## Find the Longest Increasing Subsequence in Circular manner

Given an array, the task is to find to LIS (Longest Increasing Subsequence) in a circular way. Examples : Input : arr[] = {5, 4,… Read More »

## Circular Queue | Set 2 (Circular Linked List Implementation)

Prerequisite – Circular Singly Linked List We have discussed basics and how to implement circular queue using array in set 1. Circular Queue | Set… Read More »

## Circular Queue | Set 1 (Introduction and Array Implementation)

Prerequisite – Queues Circular Queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and… Read More »

## Implementation of Deque using circular array

Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.In previous post we had… Read More »

## Maximize sum of consecutive differences in a circular array

Given an array of n elements. Consider array as circular array i.e element after an is a1. The task is to find maximum sum of… Read More »

## Maximum circular subarray sum

Given n numbers (both +ve and -ve), arranged in a circle, fnd the maximum sum of consecutive number. Examples: Input: a[] = {8, -8, 9,… Read More »