bitonic

20+ posts

Similar Topics

DSA

21k+ articles

Mathematical

7.6k+ articles

Arrays

6.4k+ articles

Strings

3.1k+ articles

Greedy

2k+ articles

Sorting

1.7k+ articles

Searching

1.6k+ articles

Competitive Programming

1.5k+ articles

Dynamic Programming

1.4k+ articles

Pattern Searching

570+ articles

Check if an Array can be Sorted by picking only the corner Array elements

Last Updated: 29 April 2021

Given an array arr[] consisting of N elements, the task is to check if the given array can be sorted by picking only corner elements i.e., elements either from left or rig ...read more

Count of Reverse Bitonic Substrings in a given String

Last Updated: 07 July 2023

Given a string S, the task is to count the number of Reverse Bitonic Substrings in the given string.Reverse bitonic substring: A string in which the ASCII values of the ch ...read more

Last Updated: 21 November 2022

Given a bitonic array arr[] the task is to sort the given bitonic array.A Bitonic Sequence is a sequence of numbers that is first strictly increasing then after a point st ...read more

Check if a given string is a Reverse Bitonic String or not

Last Updated: 26 March 2021

Given a string str, the task is to check if that string is a Reverse Bitonic string or not. If the string str is reverse Bitonic string, then print "YES". Otherwise, print ...read more

Strings

Pattern Searching

Competitive Programming

bitonic

Reverse

DSA

Longest Reverse Bitonic Sequence

Last Updated: 19 April 2021

Given an arr[] of length N, the task is to find the length of longest Reverse Bitonic Subsequence. A subsequence is called Reverse Bitonic if it is first decreasing, then ...read more

Arrays

Algorithms

Dynamic Programming

Competitive Programming

bitonic

LIS

DSA

Count of all possible bitonic subarrays

Last Updated: 20 May 2021

Given an array arr[] consisting of N integers, the task is to count all the subarrays which are Bitonic in nature.A bitonic subarray is a subarray in which elements are ei ...read more

Arrays

Competitive Programming

bitonic

subarray

DSA

Efficiently merging two sorted arrays with O(1) extra space and O(NlogN + MlogM)

Last Updated: 10 April 2023

Given two sorted arrays, arr1[] and arr2[], the task is to merge them in O(Nlog(N) + Mlog(M)) time with O(1) extra space into a sorted array where N is the size of the fir ...read more

Program to check if an array is bitonic or not

Last Updated: 22 December 2022

Given an array of N elements. The task is to check if the array is bitonic or not.An array is said to be bitonic if the elements in the array are first strictly increasing ...read more

Maximum sum bitonic subarray

Last Updated: 23 April 2023

Given an array containing n numbers. The problem is to find the maximum sum bitonic subarray. A bitonic subarray is a subarray in which elements are first increasing and t ...read more

Number of bitonic arrays of length n and consisting of elements from 1 to n

Last Updated: 24 March 2023

For a given number n (n 1), we need to find the number of ways you can make a bitonic array of length n, consisting of all elements from 1 to n.Note: [1, 2,...n] and [n, ...read more

Combinatorial

bitonic

DSA

Longest Bitonic Subsequence in O(n log n)

Last Updated: 11 November 2022

Given an array arr[0 … n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write a function that take ...read more

Printing Longest Bitonic Subsequence

Last Updated: 16 February 2023

The Longest Bitonic Subsequence problem is to find the longest subsequence of a given sequence such that it is first increasing and then decreasing. A sequence, sorted in ...read more

1 2 >>

1 2 >>

1 2 >>