## Minimum distance between the maximum and minimum element of a given Array

Given an array A[] consisting of N elements, the task is to find the minimum distance between the minimum and the maximum element of the… Read More »

- Must do Math for Competitive Programming
- Array of Vectors in C++ STL
- Breadth First Search without using Queue
- Minimize the maximum difference between adjacent elements in an array
- Shortest Path Faster Algorithm
- Basic Algorithm Techniques Not Taught in Academics
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Check if a string is a scrambled form of another string
- Role of SemiColon in various Programming Languages
- Word Break Problem | DP-32 | Set - 2
- Count the number of ways to construct the target string
- Median of an unsorted array using Quick Select Algorithm
- Sum of GCD of all possible sequences
- Extended Knapsack Problem
- Maximum number of unique values in the array after performing given operations
- Kth most frequent Character in a given String
- Count of substrings of length K with exactly K distinct characters
- Maximum LCM among all pairs (i, j) from the given Array
- Longest common subarray in the given two arrays
- Count of subarrays which start and end with the same element
- Huffman Coding using Priority Queue
- 0/1 Knapsack Problem to print all possible solutions
- Flood Fill Algorithm
- Find if there is a path between two vertices in an undirected graph
- Find lexicographically smallest string in at most one swaps
- Finding Median of unsorted Array in linear time using C++ STL
- Shortest path in a directed graph by Dijkstra’s algorithm
- What is a Webcrawler and where is it used?
- Operator Overloading '<<' and '>>' operator in a linked list class
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?

Given an array A[] consisting of N elements, the task is to find the minimum distance between the minimum and the maximum element of the… Read More »

Problem Statement: Write a menu-driven program for using switch-case with following features: Store Contact numbers of people Search for the Contact numbers using their names… Read More »

Consider 9 circles each arranged at the center of cells of a 2-D matrix of shape 3*3. Draw 3 straight lines without removing pen from… Read More »

Uni-variate optimization is a simple case of a non-linear optimization problem with an unconstrained case that is there is no constraint. Uni-variate optimization may be… Read More »

Whenever we are working on ML projects, we have to deal with the high dimensionality of the dataset. There is a very particular term to… Read More »

Given a binary tree and a value K, the task is to check if every node of the binary tree has either value of the… Read More »

Given a Binary Tree, the task is to count all paths from root to leaf which forms an Arithmetic Progression. Examples: Input: Output: 2 Explanation: The paths… Read More »

Given a Perfect BST with N nodes and an integer K, the task is to find the Kth smallest element in present in the tree.… Read More »

Given an array arr[] of size N, consisting of positive and negative integers, the task is to find the longest alternating subsequence(i.e. the sign of… Read More »

Given an array arr[] representing a list of prime factors of a given number, the task is to find the product of divisors of that… Read More »

Given an integer N, the task is to find the number of binary strings possible of length N having same frequency of 0s and 1s.… Read More »

Given an array arr[] and integer K, the task is to split the array into subsets of size K, such that each subset consists of… Read More »

Given an array arr[] of N positive integers, the task is to find the length of the longest subsequence such that Bitwise XOR of all… Read More »

Given a matrix with N rows and M columns, the task is make all possible paths from the cell (N, M) to (1, 1) palindrome… Read More »

Given a number in form of string str and an integer K, the task is to find the smallest integer that can be formed after… Read More »