## To Find GCD of two number

#include <iostream>using namespace std;int gcd_iter(int u, int v) { int t; while (v) { t = u; u = v; v = t % v; } return u… Read more »

MENU

#include <iostream>using namespace std;int gcd_iter(int u, int v) { int t; while (v) { t = u; u = v; v = t % v; } return u… Read more »

We know that NodeJS is becoming popular due to its fast prototype development and implemention with more performance than Python or any other programming language.Lets start by creating a package.json… Read more »

Closures are not hard to understand once the core concept is grokked. However, they are impossible to understand by reading any theoretical or academically oriented explanations! This article is intended for programmers… Read more »

Decorators allow you to make simple modifications to callable objects like functions, method or classes. By definition, a decorator is a function that takes another function and extends the behavior… Read more »

The terms mean, median and mode are used to describe the central tendency of a large data set. Range provides provides context for the mean, median and mode.Without these three… Read more »

Given a string str containing. The problem is to print the characters along with their frequency and in the given format explained in the examples below. Input : str = “abacd”… Read more »

Statistics, in short, is the study of data. It includes descriptive statistics (the study of methods and tools for collecting data, and mathematical models to describe and interpret data) and inferential statistics (the systems… Read more »

A linked list is a linear data structure where each element is a separate object. Linked list elements are not stored at contiguous location; the elements are linked using pointers. Each node of a list is made up… Read more »

A set is an unordered collection with no duplicate elements. Basic uses include membership testing and eliminating duplicate entries. Set objects also support mathematical operations like union, intersection, difference, and… Read more »