## Maximum Surpasser in the given array

The “surpasser” of an element in an array is defined as the number of elements that are to the “right” … Read more

The “surpasser” of an element in an array is defined as the number of elements that are to the “right” … Read more

Problem: Given a bipartite graph, write an algorithm to find the maximum matching. The maximum bipartite matching solves many problems … Read more

Given N orders, each order consists of pickup and delivery services, means delivery of a particular service will after the … Read more

Given an array of integers, you are allowed to swap only adjacent elements in the array. write a program to … Read more

Objective: Given an array of size N which contains integers from range 0 to N-1. (No duplicates). Write a program … Read more

Problem: There is N number of items that need to be transferred from one place to another by a robot. … Read more

Stable Marriage Given N men and N women and the marriage preference order for each man and woman. Their marriage … Read more

Objective: Given a graph represented by the adjacency List, write a Breadth-First Search(BFS) algorithm to check whether the graph is … Read more

Objective: Given a graph, write an algorithm to find all the articulation points or cut vertices. Articulation Points: In a … Read more

Objective: Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of distinct or unique islands. … Read more

Objective: Given a graph and a source vertex write an algorithm to find the shortest path from the source vertex to … Read more

Objective: Given a graph represented by the adjacency List, write a Depth-First Search(DFS) algorithm to check whether the graph is … Read more

Objective: Given a stack of integers, write an algorithm to sort the stack using recursion. Example: Original Stack: [14, 9, … Read more

Given: There are N people in a social network and there are friends group. Each person can be part of … Read more

Objective: Given a graph represented by the adjacency matrix, write a Depth-First Search(DFS) algorithm to check whether the graph is … Read more