## Maximum sum of values of nodes among all connected components of an undirected graph

Given an undirected graph with V vertices and E edges. Every node has been assigned a given value. The task is to find the connected… 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 an undirected graph with V vertices and E edges. Every node has been assigned a given value. The task is to find the connected… Read More »

Given a 2D matrix arr[][] of N*N dimensions, the task is to find the sum of elements of all four parts of the matrix divided… Read More »

Given three arrays firstkey[], secondkey[] and value[] where elements firstkey[i] and secondkey[i] denotes a composite key and their value is value[i], the task is to… Read More »

Given an array arr[] containing non-negative integers of length N, the task is to print the length of the longest subsequence of Perfect numbers in… Read More »

Given an array arr[] of integers, our task is to find the length of the largest subarray such that all the elements of the sub-array… Read More »

Given an undirected graph with N vertices and M edges, the task is to find the absolute difference Between sum of degrees of odd degree… Read More »

Given an integer array arr[] containing a permutation of integers from 1 to N. Let K[] be some arbitrary array. Every element in the array… Read More »

Given an array arr[][] which contains the edges of a graph to be used to construct an undirected graph G with N nodes, the task… Read More »

Given a number N, the task is to find the sum of the product of elements of all the possible subsets formed by only divisors… Read More »

Given a queue Q containing N strings, the task is to restructure the queue to double its size such that the second half represents the… Read More »

Given a number N, the task is to insert the minimum number of opening and closing parenthesis into the number N such that the resultant… Read More »

Given an array arr[] containing non-negative integers of length N, the task is to print the length of the longest subsequence of Powerful numbers in… Read More »

Given an array arr[] and Q queries, the task is to find the resulting updated array after Q queries. There are two types of queries… Read More »

Given a string str which contains pairs of balanced parentheses, the task is to calculate the score of the given string based on the given… Read More »

Given a positive integer N (N ≥ 2), the task is to count the number of integers X in the range [2, N] such that… Read More »