## Bitonic string

Given a string str, the task is to check if that string is a Bitonic String or not. If string str is Bitonic String then… Read More »

- Must do Math for Competitive Programming
- Array of Vectors in C++ STL
- Breadth First Search without using Queue
- Minimize the maximum difference between adjacent elements in an array
- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Shortest Path Faster Algorithm
- Maximum sum path in a Matrix
- Basic Algorithm Techniques Not Taught in Academics
- Role of SemiColon in various Programming Languages
- Maximum number of unique values in the array after performing given operations
- Sum of GCD of all possible sequences
- Traveling Salesman Problem using Genetic Algorithm
- Minimum Cost Graph
- Median of an unsorted array using Quick Select Algorithm
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Word Break Problem | DP-32 | Set - 2
- Huffman Coding using Priority Queue
- Find lexicographically smallest string in at most one swaps
- Kth most frequent Character in a given String
- Operator Overloading '<<' and '>>' operator in a linked list class
- Longest Mountain Subarray
- Check if sum of any subarray is Palindrome or not
- What is a Webcrawler and where is it used?
- 0/1 Knapsack Problem to print all possible solutions
- Sort an Array which contain 1 to N values in O(N) using Cycle Sort
- Minimum increment or decrement required to sort the array | Top-down Approach
- 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
- Longest common subarray in the given two arrays

Given a string str, the task is to check if that string is a Bitonic String or not. If string str is Bitonic String then… Read More »

Given an array arr[] of N positive integers and the number of queries Q, each query contains two numbers L and R. The task is… Read More »

Given a number N, the task is to find a pair of integers in the range [2, N] with maximum GCD. Examples: Input: N =… Read More »

Given an array arr[] consisting of N elements and an integer P, the task is to find the initial array from which given arr[] is… Read More »

Given a matrix mat[][] of R rows and C columns. The task is to find the sum of all elements from the main diagonal which… Read More »

Given an array of N elements, the task is to find the minimum value of K such that Bitwise XOR of K with all array… Read More »

Given string str, the task is to check if characters at the odd indexes of str form a palindrome string or not. If not then… Read More »

Given an array arr[] of length N, the task is to print the number of array elements which cannot form a pair with any other… Read More »

Given two integer N and K, the task is to find the number of sequence of length K consisting of values from the range [1,… Read More »

Given two permutations P1 and P2 of numbers from 1 to N, the task is to find the maximum count of corresponding same elements in… Read More »

Given an array arr[] of N integers the task is to generate a prefix product array from the given array. In a prefix product array,… Read More »

Given an integer array arr[] and Q queries, the task is to find the sum of the array for each query of the following type:… Read More »

Given an array arr[] of N positive elements, the task is to find the maximum bitwise OR value of a pair from the given array.… Read More »

Given an array arr[] of N elements and Q queries of the form [X]. For each query, the task is to find the largest interval… Read More »