## G-40: Number of Ways to Arrive at Destination

You are in a city that consists of n intersections numbered from 0 to n – 1 with bi-directional roads

## G-39: Minimum Multiplications to Reach End

Given start, end, and an array arr of n numbers. At each step, the start is multiplied by any number

## G-38: Cheapest Flights Within K Stops

There are n cities and m edges connected by some number of flights. You are given an array of flights

## G-37: Path With Minimum Effort

You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x

## G-36: Shortest Distance in a Binary Maze

Problem Statement:  Given an n * m matrix grid where each element can either be 0 or 1. You need

## Articulation Point in Graph: G-56

Problem Statement: Given an undirected connected graph with V vertices and adjacency list adj. You are required to find all

## Bridges in Graph – Using Tarjan’s Algorithm of time in and low time: G-55

Problem Statement: There are n servers numbered from 0 to n – 1 connected by undirected server-to-server connections forming a

## Strongly Connected Components – Kosaraju’s Algorithm: G-54

Problem Statement: Given a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, Find the number