## Maximum points of intersections possible among X circles and Y straight lines

Given two integers X and Y, the task is to find the maximum number of points of intersection possible among X circles and Y straight… 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
- Length of the smallest substring which contains all vowels
- Longest Mountain Subarray
- Find distance between two nodes in the given Binary tree for Q queries
- 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
- Count of substrings of length K with exactly K distinct characters
- Queries for elements having values within the range A to B in the given index range using Segment Tree

Given two integers X and Y, the task is to find the maximum number of points of intersection possible among X circles and Y straight… Read More »

Given a positive integer M and two arrays arr[] and value[] of N and K positive integers respectively, the task is to add every element… Read More »

Given an integer Q representing the number of queries and an array where each query has an integer N. Our task is to iterate through… Read More »

Given an integer array arr[] of size N, the task is to find the minimum number of array elements required to be divided by 2,… Read More »

Given two arrays A[] and B[], each of size N, and two integers X and Y denoting the maximum number of elements that can be… Read More »

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[] consisting of N elements and an integer P, the task is to find the initial array from which given arr[] is… 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 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 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 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 elements and Q queries of the form [X]. For each query, the task is to find the largest interval… Read More »

Given an array of integers arr[], the task is to count the minimum number of changes required to convert each array element to its nearest… Read More »

Given two integers L and R, the task is to find the count of total numbers of prime numbers in the range [L, R] whose… Read More »

Given a binary tree of N nodes, the task is to print level order traversal in a spiral form. In spiral form, nodes at the… Read More »