## Count the number of Prime Cliques in an undirected graph

Given a graph with N nodes and E edges, the task is to count the number of clique having their size as a prime number… Read More »

- Must do Math for Competitive Programming
- How to create a COVID-19 Tracker Android App
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Basic Algorithm Techniques Not Taught in Academics
- Role of SemiColon in various Programming Languages
- Setting up a C++ Competitive Programming Environment
- Logarithm tricks for Competitive Programming
- How to Earn Money While Studying in College through Coding?
- Difference between SJF and LJF CPU scheduling algorithms
- std::greater in C++ with Examples
- How to Practice for the Technical Rounds in Interview?
- Is it Worth to Learn Python in 2020?
- Create a Music Player using JavaScript
- Default value of Vector in C++ STL
- Convert integer to string in Python
- Longest Palindrome in a String formed by concatenating its prefix and suffix
- Length of the smallest substring which contains all vowels
- Minimum size Subarray with maximum sum in non-increasing order
- Maximum of all distances to the nearest 1 cell from any 0 cell in a Binary matrix
- What is PERN Stack?
- Move all occurence of letter 'x' from the string s to the end using Recursion
- Find length of loop in a Linked List using Map
- What is a Webcrawler and where is it used?
- Rust vs C++: Will Rust Replace C++ in Future ?
- Generate an array of given size with equal count and sum of odd and even numbers
- Sort an Array based on the absolute difference of adjacent elements
- Check if an Array is a permutation of numbers from 1 to N
- Count nodes in the given tree whose weight is a fibonacci number
- Remove all Fibonacci Nodes from a Circular Singly Linked List
- Optimal Strategy for the Divisor game using Dynamic Programming

Given a graph with N nodes and E edges, the task is to count the number of clique having their size as a prime number… Read More »

Given an undirected acyclic graph having N nodes and M edges, the task is to find the size of the largest tree in the forest… Read More »

Given Q queries where each query consists of two numbers L and R which denotes a range [L, R]. The task is to find the… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of Armstrong numbers in… Read More »

In every programming language, memory is a vital resource and is also scarce in nature. Hence it’s essential that the memory is managed thoroughly without… Read More »

Netflix is one of the most popular online media service provider and production companies in the world right now. What started out as a small… Read More »

In this article, we will make a simple timer to calculate lap-time intervals using Python. Module used time: This module provides various time-related functions. It… Read More »

The algorithmic world is beautiful with multifarious strategies and tools being developed round the clock to render to the need for high-performance computing. In fact,… Read More »

As we have studied, signature is a way of authenticating the data coming from a trusted individual. Similarly, digital signature is a way of authenticating… Read More »

The Unix timestamp is designed to track time as a running total of seconds from the Unix Epoch on January 1st, 1970 at UTC. To… Read More »

YAML: It is a light-weight, human-readable data-representation language. It is primarily designed to make the format easy to read while including complex features. Since YAML… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: maximum(start, end): Print the maximum Armstrong number of elements… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of perfect square numbers… Read More »

We generally study most of the algorithmic techniques in academics like Searching, Sorting, Dynamic Programming, Greedy Algorithms, Divide and Conquer, Backtracking, etc. But below techniques… Read More »

1.Shortest Job First (SJF) : Shortest Job First (SJF) Scheduling Algorithm is based upon the burst time of the process. The processes are put into… Read More »