All Medium Articles

## Find four elements that sum to a given value | Two-Pointer approach 3

Given an array arr of integers of size N and a target number, the task is to find all unique quadruplets in it, whose sum… Read More »

## Check if a Sequence is a concatenation of two permutations 3

Given an array arr containing positive integers, the task is to check if the given array arr is a concatenation of two permutations or not.… Read More »

## Count of Fibonacci pairs which satisfy the given equation 3

Given an array arr[] containing Q positive integers and two numbers A and B, the task is to find the number of ordered pairs (x,… Read More »

## Count of same length Strings that exists lexicographically in between two given Strings 3

Given two string S1 and S2 of length L, the task is to count the number of strings of length L, that exists in between… Read More »

## Sum of two large Floating-point numbers 3

Given two very large floating-point numbers in form of large strings str1 and str2, the task is to add the given two numbers. Example: Input:… Read More »

## Find element that maximizes LCM of an Array in the range 1 to M 3

Given an array arr of size N containing numbers in the range [1, M], the task is to find an element, in the range [1,… Read More »

## Number of factors of very large number N modulo M where M is any prime number 3

Given a large number N, the task is to find the total number of factors of the number N modulo M where M is any… Read More »

## Why Prim’s and Kruskal’s MST algorithm fails for Directed Graph? 3

Pre-requisites: Graph and its representations Greedy Algorithms | Set 5 (Prim’s Minimum Spanning Tree (MST)) Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2 Given a… Read More »

## Nodes at Kth level without duplicates in a Binary Tree 3

Given a binary tree with N nodes and an integer K, the task is to print nodes of the Kth level of a binary tree… Read More »

## Check if a Tree can be split into K equal connected components 3.5

Given Adjacency List representation of a tree and an integer K., the task is to find whether the given tree can be split into K… Read More »

## Completely Fair Queuing (CFQ) in Operating System 3

Several Linux I/O schedulers have been proposed. Some of these are: Completely Fair Queuing (CFQ) Deadline NOOP Anticipatory CFQ is one of the input/output scheduler… Read More »

## How to be a Good Programmer in College ? 3.2

Below are some simple steps that I have learned with my experiences with coding. Learn a programming language, preferably C++ or Java. The advantage of… Read More »

## Difference between Turn Around Time (TAT) and Waiting Time (WT) in CPU Scheduling 3

In CPU Scheduling, we often need to find average Turnaround and Waiting Time with the help of Arrival, Burst and Completion Time. Let’s have a… Read More »

## Steps in Rapid Application Development (RAD) model 3

Rapid Application Development (RAD) model heavily based on prototyping and iterative development and no detail pre-planning is involve in this model. This model was first… Read More »

## Real Time Operating System (RTOS) 3

Real time operating systems (RTOS) are used in environments where a large number of events, mostly external to the computer system, must be accepted and… Read More »

## Sum of all numbers in the given range which are divisible by M 3

Given three numbers A, B and M such that A < B, the task is to find the sum of numbers divisible by M in… Read More »

## Sum of all Non-Fibonacci numbers in a range for Q queries 3

Given Q queries containing ranges in the form of [L, R], the task is to find the sum of all non-fibonacci numbers for each range… Read More »

## Maximum sum of elements divisible by K from the given array 3.5

Given an array of integers and a number K. The task is to find the maximum sum which is divisible by K from the given… Read More »

## Python – Diagonal element addition among lists 3

Sometimes, while working with Python lists, we can have a problem in which we need to perform addition of lists in diagonal manner that i.e.… Read More »

## Become Leader of Coding Era – GeeksforGeeks Campus Ambassador Program 3

Do you remember how eagerly you wanted to be the captain of your gully cricket team (nostalgia!!)? And yes, the time when you wanted to… Read More »