## Count of cells in a matrix whose adjacent cells’s sum is prime Number

Given a M x N matrix mat[][], the task is to count the number of cells which have the sum of its adjacent cells equal… Read More »

- Must do Math for Competitive Programming
- Which C++ libraries are useful for competitive programming?
- Breadth First Search without using Queue
- 7 Best Coding Challenge Websites in 2020
- Minimize the maximum difference between adjacent elements in an array
- Which Java libraries are useful for competitive programming?
- Speed up Code executions with help of Pragma in C/C++
- Which Python Modules are useful for competitive programming?
- Logarithm tricks for Competitive Programming
- Setting up a C++ Competitive Programming Environment
- Basic Algorithm Techniques Not Taught in Academics
- Writing code faster during Competitive Programming in C++
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Count of subarrays of an Array having all unique digits
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Default values in a Map in C++ STL
- Count the number of ways to construct the target string
- Move all zeroes to end of array using Two-Pointers
- How To Approach A Coding Problem ?
- Sum of GCD of all possible sequences
- Kth most frequent Character in a given String
- Minimize the maximum difference of adjacent elements after at most K insertions
- Count of substrings of length K with exactly K distinct characters
- Maximum LCM among all pairs (i, j) from the given Array
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Count of subarrays which start and end with the same element
- Finding Median of unsorted Array in linear time using C++ STL
- Important functions of STL Components in C++
- Competitive Programming vs Software Development - Where Should I Invest My Time?
- Shortest path in a directed graph by Dijkstra’s algorithm

Given a M x N matrix mat[][], the task is to count the number of cells which have the sum of its adjacent cells equal… Read More »

Given an undirected graph, the task is to find the size of each connected component and print the number of unique sizes of connected components… Read More »

Design a Data structure which supports insertion and first non-repeating element in O(1) time. Operations that are supported by the data structure: Insertion: Insert a… Read More »

Given an array arr[] of N elements and two integers A to B, the task is to answer Q queries each having two integers L… Read More »

Given an undirected graph with V vertices and E edges, the task is to check that if the largest connected component of the graph forms… Read More »

Given string str. The task is to find the longest subsequence of str such that all the characters adjacent to each other in the subsequence… Read More »

Given an integer X, denoting the number of factors of a positive integer N can have. the task is to find the maximum number of… Read More »

Given two sorted array of size N. The task is to find the maximum number of elements in the first array which are strictly greater… Read More »

Given an array of N elements, the task is to minimize the maximum difference of adjacent elements by inserting at most K elements in the… Read More »

Given an even number N, the task is to split all N powers of 2 into two sets such that the difference of their sum… Read More »

Given a balanced string str of size N with an equal number of L and R, the task is to find a maximum number X,… Read More »

Given an integer array arr[] of size N, the task is to count the number of sub-arrays that have an odd product. Examples: Input :… Read More »

Given a binary tree consisting of distinct values and two numbers K1 and K2, the task is to find all nodes that lie between them… Read More »

Given an array arr[], the task is to arrange the array in such a way that the absolute difference between the adjacent elements is in… Read More »

Given a matrix of size N x M consisting of integers 1, 2, 3 and 4. Each value represents the possible movement from that cell:… Read More »