## Maximum product of bitonic subsequence of size 3

Given an array arr[] of positive integers of size N, the task is to find the maximum product of bitonic subsequence of size 3. Bitonic… Read More »

- Must do Math for Competitive Programming
- Which C++ libraries are useful for competitive programming?
- Breadth First Search without using Queue
- Which Java libraries are useful for competitive programming?
- Minimize the maximum difference between adjacent elements in an array
- 7 Best Coding Challenge Websites in 2020
- Which Python Modules are useful for competitive programming?
- Speed up Code executions with help of Pragma in C/C++
- Basic Algorithm Techniques Not Taught in Academics
- Setting up a C++ Competitive Programming Environment
- Writing code faster during Competitive Programming in C++
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Count of subarrays of an Array having all unique digits
- Logarithm tricks for Competitive Programming
- Default values in a Map in C++ STL
- Move all zeroes to end of array using Two-Pointers
- Sum of GCD of all possible sequences
- How To Approach A Coding Problem ?
- Minimize the maximum difference of adjacent elements after at most K insertions
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Submatrix of given size with maximum 1's
- Kth most frequent Character in a given String
- Longest Mountain Subarray
- Length of the smallest substring which contains all vowels
- Find distance between two nodes in the given Binary tree for Q queries
- Count of substrings of length K with exactly K distinct characters
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
- Find last remaining element after reducing the Array
- Queries for elements having values within the range A to B in the given index range using Segment Tree

Given an array arr[] of positive integers of size N, the task is to find the maximum product of bitonic subsequence of size 3. Bitonic… Read More »

Given an array of ranges arr[] of length N and a number D, the task is to find the minimum amount by which the number… Read More »

Given a string S, the task is to find the count of maximum repeated frequency of characters in the given string S. Examples: Input: S… Read More »

Given an array arr[] of N positive integers. The task is to print all possible pairs such that their XOR is a Prime Number. Examples:… Read More »

Given four non-collinear points A, B, C, and P. The task is to find whether point P lies inside, outside or on the circumcircle formed… Read More »

Given a number N. The task is to check whether the given number N has unique prime factors or not. If yes then print YES… Read More »

Given a string str. The task is to count the number of all different strings possible if two consecutive same characters of the string can… Read More »

Given an acyclic undirected graph having N nodes and N-1 edges in the form of a 2D array arr[][] in which every row consists of… Read More »

Given a string S, the task is to find the prefix of string S with the maximum possible length such that frequency of each character… Read More »

Given the dimensions of a block L, B and H, the task is to form a Hollow Rectangular prism of length A and height Ht… Read More »

Given a number in the form of a string s, the task is to calculate and display minimum splits required such that the segments formed… Read More »

Given Xi and Yi co-ordinate of N distinct points in the 2-D Plane, the task is to count the number of squares that can be… Read More »

Given a list of ranges with starting and end value, the task is to find the minimum number of ranges that are required to be… Read More »

Given an integer N number of stairs, the task is count the number ways to reach the Nth stair by taking 1 or 2 step… Read More »

Prequisites: Equation of circle when three points on the circle are given, Convex Hull Given an array arr[][] containing N points in a 2-D plane… Read More »