Given n numbers (both +ve and -ve), arranged in a circle, find the maximum sum of consecutive numbers....
Given an array arr of size N and an integer K, the task is to find the maximum sum subarray of size k among all contiguous sub-array (considering circular subarray also)....
Given an array arr[] consisting of N integers and a positive integer M, the task is to find the sum of the first M elements of the array formed by the infinite concatenation of the given array arr[]....
Given a circular array arr[] of size N, the task is to check if it is possible to make all array elements of the circular array equal by increasing pairs of adjacent elements by 1....
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 is check which path, clockwise or anti-clockwise, from index x to index y, we face the minimum number bit flips. Output “Clockwise” or “Anti-clockwise” and the value of minimum bit flip, in case of equal count output “Clockwise”....
Given a circular array arr[] consisting of N integers, the task is to find the starting index of the circular array such that the prefix sum from that index is always non-negative. If there exists no such index, then print “-1”....
A Circular Queue is an extended version of a normal queue where the last element of the queue is connected to the first element of the queue forming a circle....
Given a binary circular array arr[] of size N, the task is to find the minimum swaps to group all 0s together in the array....
Given two lists, check if they are circularly identical or not. Examples:...
Given a circular array arr of N integers, the task is to minimize the maximum absolute difference of adjacent elements of the array without any removals....
A Circular Resizable Array is a data structure that effectively maintains a fixed-size array by enabling members to be added or withdrawn circularly. It is sometimes referred to as a circular buffer or ring buffer. This cyclical behavior is especially helpful in situations when a smooth array wrap is required and a continuous data flow is anticipated. In this tutorial, we will look at how to create a circular resizable array in Java....
