## Print nodes having maximum and minimum degrees

Given an undirected graph having N nodes, the task is to print the nodes having minimum and maximum degree. Examples: Input: 1—–2 | | 3—–4… Read More »

- What is Competitive Programming and How to Prepare for It?
- Make the list non-decreasing by changing only one digit of the elements
- Nth XOR Fibonacci number
- Write a function to get the intersection point of two Linked Lists | Set 2
- Number of substrings that start with "geeks" and end with "for"
- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Check if a cycle of length 3 exists or not in a graph that satisfy a given condition
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Reversing a Queue using another Queue
- Minimum increment or decrement operations required to make the array sorted
- Check if the rows of a binary matrix can be made unique by removing a single column
- Number of Subarrays with positive product
- Queries for the minimum element in an array excluding the given index range
- Longest Increasing Subsequence using Longest Common Subsequence Algorithm
- Print nodes having maximum and minimum degrees
- Color all boxes in line such that every M consecutive boxes are unique
- Minimize the sum of the array according the given condition
- Count of triples (A, B, C) where A*C is greater than B*B
- Find two co-prime integers such that the first divides A and the second divides B
- Sum of all natural numbers from L to R ( for large values of L and R )
- Largest sub-matrix with all equal elements
- Minimize the cost of partitioning an array into K groups
- Maximum length sub-array which satisfies the given conditions
- Find out the prime numbers in the form of A+nB or B+nA
- Check if the Matrix satisfies the given conditions
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Count of Multiples of A ,B or C less than or equal to N
- Sort elements by modulo with K
- time.h localtime() function in C with Examples
- Interactive Problems in Competitive Programming | Set 2

Given an undirected graph having N nodes, the task is to print the nodes having minimum and maximum degree. Examples: Input: 1—–2 | | 3—–4… Read More »

Given an array arr[] of N integers, the task is to find the maximum length of any sub-array of arr[] which satisfies one of the… Read More »

Given a binary matrix of size N * M, the task is to find the largest area sub-matrix such that all elements in it are… Read More »

Given N boxes that are kept in a straight line and M colors such that M ≤ N. The position of the boxes cannot be… Read More »

Given an array arr[] of N integers and Q queries where each query consists of an index range [L, R]. For each query, the task… Read More »

Given a matrix mat[][], the task is to check whether the matrix is valid or not. A valid matrix is the matrix that satisfies the… Read More »

Given an array arr[] of integers and an integer K. The task is to sort the elements of the given array in the increasing order… Read More »

Given four integers N, A, B and C. The task is to find the count of integers from the range [1, N] which are divisible… Read More »

The localtime() function is defined in the time.h header file. The localtime( ) function return the local time of the user i.e time present at… Read More »

Given a binary matrix mat[][] of size M * N. The task is to check whether the row of the matrix will be unique after… Read More »

Given two integers A and B and an integer N. The task is to find out N prime numbers of the form A + nB… Read More »

Given three integers A, B and C. The task is to count the number of triples (a, b, c) such that a * c >… Read More »

Given an array arr[] of N integers, the task is to find the count of subarrays with positive product. Examples: Input: arr[] = {-1, 2,… Read More »

There are two singly linked lists in a system. By some programming error, the end node of one of the linked list got linked to… Read More »

Given an array arr[] of N integers where every element is from the range [1000, 9999]. The task is to make the array non-decreasing by… Read More »