## Count of triplets in an Array such that A[i] * A[j] = A[k] and i < j < k

Given an array A[ ] consisting of N positive integers, the task is to find the number of triplets A[i], A[j] & A[k] in 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
- Role of SemiColon in various Programming Languages
- Check if a string is a scrambled form of another string
- Word Break Problem | DP-32 | Set - 2
- Median of an unsorted array using Quick Select Algorithm
- Count the number of ways to construct the target string
- Sum of GCD of all possible sequences
- Maximum number of unique values in the array after performing given operations
- Kth most frequent Character in a given String
- Extended Knapsack Problem
- Count of substrings of length K with exactly K distinct characters
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Longest common subarray in the given two arrays
- Huffman Coding using Priority Queue
- 0/1 Knapsack Problem to print all possible solutions
- Find if there is a path between two vertices in an undirected graph
- Find lexicographically smallest string in at most one swaps
- Flood Fill Algorithm
- Finding Median of unsorted Array in linear time using C++ STL
- What is a Webcrawler and where is it used?
- Operator Overloading '<<' and '>>' operator in a linked list class
- Shortest path in a directed graph by Dijkstra’s algorithm
- Why Prim’s and Kruskal's MST algorithm fails for Directed Graph?

Given an array A[ ] consisting of N positive integers, the task is to find the number of triplets A[i], A[j] & A[k] in the… Read More »

Given an array A[ ] consisting of N strings, the task is to count the number of pairs of possible strings that on merging forms… Read More »

Given a string S in the form of a sentence, the task is to find the word from the text with maximum number of its… Read More »

Given a string in camel case, the task is to write a Java program to convert the given string from camel case to snake case… Read More »

Given an integer N, which denotes the size of the matrix that is N*N. There is a robot placed over the top-left corner of the… Read More »

Linear Congruential Method is a class of Pseudo Random Number Generator (PRNG) algorithms used for generating sequences of random-like numbers in a specific range. This… Read More »

Multiplicative Congruential Method (Lehmer Method) is a type of linear congruential generator for generating pseudorandom numbers in a specific range. This method can be defined… Read More »

Additive Congruential Method is a type of linear congruential generator for generating pseudorandom numbers in a specific range. This method can be defined as: where,… Read More »

Given a decimal number as N, the task is to convert N into an equivalent irreducible fraction. An irreducible fraction is a fraction in which… Read More »

Given N axis-parallel rectangles in a 2-D cartesian coordinate system and coordinates of 4N-1 vertices, the task is to find the single vertex missing.Examples: Input:… Read More »

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 »