Re-insert val+1 and their indexes of all the valid moves to the queue. Consider each cell as a node and each boundary between any two adjacent cells be an edge. Distance of nearest cell having Ask Question Asked 11 months ago Modified 11 months ago Viewed 17 times 0 Given a binary grid of n*m. You are given the tree in the form of an array A[1. Input n= 6 arr = {1, 1, 2, 2, 2, 1} Output 5 Explanation arr [] = {1, 1, 2, 2, 2, 1} Max Distance: 5 Distance for 1 is: 5-0 = 5 Distance for 2 is. If the popped node is the destination node, return its distance. 1) Nodes in the subtree rooted with target node. Here, vector1 is the first vector. cpp","path":"Graph/Geeksforgeeks/Alex. The smallest of them is 18. If the path is not possible. Solve company interview questions and improve your coding intellectFind the distance of the nearest 1 in the grid for each cell. An Efficient Solution is based on. Source : Wikipedia. First find all islands in the Grid using DFS. The K-NN algorithm works by finding the K nearest neighbors to a given data point based on a distance metric, such as Euclidean distance. Example 1:Platform to practice programming problems. A move can be made to a cell grid [i] [j] only if grid [i] [j] = 0 and only left, right, up and down movements are permitted. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"2D Hopscotch. Ln 1, Col 1. Minimize the Heights II. You switched accounts on another tab or window. The distance is calculated as |i 1 - i 2 | + |j 1 - j 2 |, where i 1, j 1 are the row number and column number of the current cell, and i 2, j 2 are the row number and column number of the nearest cell having value 1. Run a Breadth-first search on each cell and while keeping track of the number of obstacles we can. minHeight =. Follow the below steps to solve the problem: Declare a 2-D array count of size M * N. Distance of nearest cell having 1 in a binary matrix; Check if a cycle of length 3 exists or not in a graph that satisfy a given condition; Maximum height of an elevation possible such that adjacent matrix cells have a difference of at most height 1; Minimum distance to the corner of a grid from source; Edge Coloring of a GraphGiven a binary grid of n*m. gitattributes","contentType":"file"},{"name":"Binary_Search_Tree. Try all 8 possible positions where a Knight can reach from its position. Explanation: Largest minimum distance = 5. Iterate until you don't need any update. Q2: How to Find Distance Between Two Points in 2D? Answer: We can find the distance between two points (x 1, y 1) and (x 2, y 2) using the distance formula as follows:Input: Number of people = 4 Relations : 1 - 2 and 2 - 3 Output: Number of existing Groups = 2 Number of new groups that can be formed = 3 Explanation: The existing groups are (1, 2, 3) and (4). An Efficient Solution is based on Binary Search. etc. In the second iteration we have (1, 2) and so on where (1) and (2) are. vscode","path":". If the x and y become the boundary edges any time return val. Note: The Graph doesn't contain any negative weight cycle. 2) pop () which removes an element from top of stack. The K-Nearest Neighbor (KNN) algorithm is a popular machine learning technique used for classification and regression tasks. Mark the source cell as visited and initialize its distance to 0. GfG-Problem Link:. See the following recursion. The next greater element for 75 is 76, which is at position 6. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions. Find the closest pair from two sorted arrays. So during the first step of KNN, we must load the training as well as test data. . Use a table to store solutions of subproblems to avoiding recalculate the same subproblems multiple times. 5:09 JAVA Code Explanation. The problem is to find the number closest to N and divisible by M. The distance between two points is nothing but the length of the straight line segement joining those points i. Distance array will be to store the distance to nearest island. Given a destination D , find the minimum number of steps required to re. Hence, the shortest distance of node 0 is 0 and the shortest distance. The distance is. Given another array, station[] of size N representing petrol pumps where ith petrol pump is station[i][0] position away from the start and has station[i][1] amount of fuel. The idea is to store multiple items of the same type together. 3) findMiddle () which will return middle element of the stack. vscode","path":". If the pat. Rearrange a string so that all same characters become d distance away; Minimize the maximum difference between the heights. Ln 1, Col 1. Contests. Complexity Analysis: Time Complexity: O(n^2), Nested loop is used to traverse the array. Consider the following two arrays: A: {1, 2, 11, 15} B: {4, 12, 19, 23, 127, 235}Solve DSA problems on GfG Practice. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java - YouTube. Find the distance of the nearest 1 in the grid for each cell. The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the current cell, and i2, j2& Find the distance of the nearest 1 in the grid for each cell. Tip 1 : Have atleast 2 projects, of which you have thorough knowledge. Find the distance of the nearest 1 in the grid for each cell. The task is to find the largest sum of a cycle in the maze (Sum of a cycle is the sum of the cell indexes of all cells present in that cycle). The distance is calculated as |i 1 - i 2 | + |j 1 - j 2 |, where i 1, j 1 are the row number and column number of the current cell, and i 2, j 2 are the row number and column number of the nearest cell having value 1. Find the distance of the nearest 1 in the grid for each cell. Step 3 − For each point in the test data do the following −. Then sort the array according to the Euclidean distance found and print the first k closest points from the list. Select D’ ⊆ D, the set of k nearest training data points to the query points; Predict the class of the query point, using distance-weighted voting. This is the best place to expand your. If no valid path exists then print -1. You switched accounts on another tab or window. Find out the minimum steps a Knight will take to reach the target position. Compute d(x i, x) for i = 1, . Source Code :. ,n , the distance between the query point and every other point in the training set. You need to find the the length of the largest cycle in the maze. It is not dependent on the actual values of xi and yi but only if they are equal to each other or not equal. An element of array is leader if it is greater than or equal to all the elements to its right side. Given an array Arr of N positive integers and another number X. At i = 1. 01 Matrix Problem Description. It also help to crack the technical inteviews. A cell in the given maze has a value of -1 if it is a blockage or dead-end, else 0. Space Complexity: O(1), no extra space is required. Distance = 5 – 3 = 2. distance of y = distance x. Steps involved in detecting cycle in a directed graph using BFS. When we talk about distance, we tend to think of the Euclidian distance, using spatial coordinates:Given a linked list of N nodes such that it may contain a loop. The path can only be created out of a cell if its value is 1. We can get above formula by simply applying Pythagoras theorem. In this post, BFS based solution is discussed. We can move across a cell only if we have positive points ( > 0 ). Iterate till the queue is empty or we reach any boundary edge. Diameter of a Bianry Tree. This is the best place to expand your knowledge and get prepared for your next interview. Start with a matrix with 0 where the 1 are located and a large number (larger then any possible distance) on the other cells. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"0239-sliding-window-maximum","path":"0239-sliding-window-maximum","contentType":"directory. First, right shift N, K+1 times followed by left shifting the result K times, which gives the count of numbers satisfying the given condition till the nearest power of 2 less than N. Create an empty queue and enqueue the source cell having a distance 0 from the source (itself) and mark it as visited. Iterate over array from left to right. The maximum of all those minimal distances is the answer. The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the current cell, and i2, j2 are the row number and column number of the nearest cell having value 1. Practice. There should be atleast one 1 in the grid. Every cell of the maze contains these numbers 1, 2 or 3. 4) deleteMiddle () which will delete the middle element. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"2D Hopscotch. So the idea is to do a breadth-first search from the starting cell till the ending cell is found. Minimum distance to the corner of a grid from source; Distance of nearest cell having 1 in a binary matrix; Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell; Implementing Water Supply Problem using Breadth First Search; Shortest path between two points in a Matrix with at most K obstaclesQuick Link0:00 Introduction. 1) Sort the given array a[]. Find all possible paths that the rat can take to reach from. cpp","path":"2D Hopscotch. Traverse four edges of. The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the current cell,. Given a binary grid of n*m. An Efficient Solution is based on Binary Search. {"payload":{"allShortcutsEnabled":false,"fileTree":{"Graph/Geeksforgeeks":{"items":[{"name":"Alex Travelling using Bellman Ford. Method 1:Method 1:Using a custom function. If it contains 3 : means we can go Right and Down to both paths from that cell. Fixed Point is 3. For each 0-cell, compute its distance from every 1-cell and store the minimum. GfG-Problem Link: and Notes Link: Series: Nearest 1 in a binary matrix; Distance of nearest cell having 1 in a binary matrix; Minimum distance to the corner of a grid from source; Minimum cost to reach from the top-left to the bottom-right corner of a matrix; Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":". Step2: Do following for every row after the first row. Initialize a priority queue to store the cells to be processed, and add the source cell to the priority queue. Solve the selected problem successfully and this amount will be deducted automatically. While moving through the grid, we can get some obstacles that we can not jump and the way to reach the bottom right corner is blocked. If the Kth bit is set in N, then add the count of numbers from the nearest power of 2 less than N to the answer. 0:57 Example Explanation. cpp. Note: The matrix can only be traversed either horizontally or vertically at a time. The idea is to simply use Kahn’s algorithm for Topological Sorting. 1 Time Machine costs 60 GeekBits. Approach: The shortest path can be searched using BFS on a Matrix. A Computer Science portal for geeks. minJumps (start, end) = 1 + Min (minJumps (k, end)) for all k reachable from start. Below are the steps involved in the implementation of the code: Initialize a 2D array ‘ ans ‘ of size n x m, which will store the minimum distance from each cell to the. Article Contributed By : N. All the nodes will be connected to adjacent nodes with an edge of weight 1 and the nodes with the same characters with an edge with weight 0. You have to do at most one “Flip” operation of any subarray. cpp","path":"Graph/Geeksforgeeks/Alex. Find the distance of the nearest 1 in the grid for each cell. Distance of nearest cell having 1 in a binary matrix: Link: Link: First negative integer in every window of size “k” Link: Link: Check if all levels of two trees are anagrams or not. cpp","path":"2D Hopscotch. Input: N = 6, X = 16 Arr [] = {1, 4, 45, 6, 10, 8} Output: Yes Explanation: Arr. Then iterate over your matrix. Does robot moves circular. Product Based Company SDE Sheets. You have to return a list of integers denoting shortest distance between each node and Source vertex S. Matrix[i][j] denotes the weight of the edge from i to j. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions. C++. Given an array Arr of N positive integers and another number X. cpp","path":"Graph/Geeksforgeeks/Alex. 2) dp [diffOfX] [diffOfY] = dp [diffOfY] [diffOfX]. Distance measures. Every cell of the maze contains these numbers 1, 2 or 3. To count number of groups, we need to simply count. If there are more than one such number, then output the one having maximum absolute value. Below is the implementation of the above. Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. Step2: Create a priority queue to store the live nodes with the minimum cost at the top. At i = 1. Example 1: Input: E = [[0,1,9]] S = 0 Output: 0 9 Explanation: Shortest distance of all. Given a binary grid of n*m. Given an array of N integers arr [] where each element represents the maximum length of the jump that can be made forward from that element. It relies on the idea that similar data points tend to have similar labels or values. By using this concept, the distance between two strings is the sum of distances of corresponding letters. Quick Link 0:00 Introduction. If the popped node is the destination node, then return its distance. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"2D Hopscotch. Let’s address those issues in more detail now. Given a matrix mat [] [] of size N*M and the destination (x, y) to be reached from (0, 0), the task is to find if you can reach the destination following the given criteria: If the cell value is 0 you cannot move to that cell. Contests Menu. One solution is to solve in O (VE) time using Bellman–Ford. There can be other solutions as well like (2, 2, 6), (2, 4, 4), (2, 3, 5). Given a grid of dimension nxm where each cell in the grid can have values 0, 1 or 2 which has the following meaning: 0 : Empty cell 1: Cells have fresh oranges 2: Cells have rotten oranges . 5:09 JAVA Code Explanation. cpp. vscode","path":". . . Create an empty hash table. Whenever we pass through a cell, points in that cell are added to our overall points, the task is to find minimum initial points to reach cell (m-1, n-1) from (0, 0) by following these certain set of rules : 1. So come along and solve The. Steps :-. So the task is to determine what is the minimum time required so that all the oranges become rotten. Finding LCA becomes easy when parent pointer is given as we can easily find all ancestors of a node using parent pointer. e 2) So, cell 2 is the output. (n). cpp. Daily practice not only helps you retain your concepts but also helps you build the most important skill, i. edge [i] contains the cell number that can be reached from of cell ‘i’ in one step. Given an infinite number line. You are given a weighted undirected graph having n vertices numbered from 1 to n and m edges describing there are edges between a to b with some weight, find the shortest path between the vertex 1 and the vertex n and if path does not exist then return a list consisting of only -1. 1) The sum j is achieved including i'th item. Given a string (seats) of 1s and 0s, where 1 represents a filled seat and 0 represents an empty seat in a row. Find the distance of. We can change all its values to 100 with minimum cost, |1 - 100| + |100 - 100| + |101 - 100| = 100. Figure 8: Comparison of Voronoi diagrams using the Euclidean (left) and Manhattan (right) distance for a same set of points Source: Wikipedia. If the element is the leftmost element, nearest smaller element on left side is considered as 0. Contests. 2) Divide all points in two halves. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions. Note: You can only move left, right, up and down, and only through cells that contain 1. Push and pop are standard stack operations. ; Loop till queue is empty. So if a person is standing at i-th stair, the person can move to i+1, i+2, i+3-th stair. Get the front element (x, y, val = moves) in the queue and mark vis [x] [y] as visited. Formally, select a range (l, r) in the array A [], such that (0 ≤ l ≤ r < n) holds and flip the elements in this range to get the maximum ones in the final array. The next greater element for 74 is 75, which is at position 2. An array is a collection of items stored at contiguous memory locations. so the total number of Node is N * N. ,n , the distance between the query point and every other point in the training set. Frequencies of Limited Range Array Elements. /* Link to the "Distance of nearest cell having 1" Problem ==>>. Maximum of all distances to the nearest 1 cell from any 0 cell in a Binary matrix. Note : You can move into an adjacent cell if that adjacent cell is filled with element 1. The distance is calculated as |i 1 - i 2 | + |j 1 - j 2 |, where i 1, j 1 are the row number and column number of the current cell, and i 2, j 2 are the row number and column number of the nearest cell having value 1. Then find the minimum distance island pair among these, using BFS. cpp","contentType":"file"},{"name":"3 Divisors. The formula for distance between two point (x1, y1) and (x2, y2) is. Follow the steps to solve the problem using the above efficient approach: Create two 2d arrays ‘visited’ and ‘distance’ initialized by 0. Example 1: Input : N = 5 A [] = {-8, 2, 3, -6, 10} K = 2 Output : -8 0 -6 -6 Exp. Method 1: The task is to find the distance between two given numbers, So find the distance between any two elements using nested loops. cpp. The second line has a list of N values of the edge [ ] array, where edge [i] conatins the cell. Now sort it to find minimum middle position, which will be the best meeting point. The minimum number of jumps to reach end from first can be calculated using the minimum value from the recursive calls. This approach allows the algorithm. Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. cpp. You are given an array nums. Given a binary grid of n*m. Time Complexity: O(n^2). Key Pair. , problem solving. Exclusively for Freshers! Participate for Free on 21st November & Fast-Track Your Resume to Top Tech Companies. cpp","path":"Graph/Geeksforgeeks/Alex. Repeat the above steps, i. You start at 0 and can go either to the left or to the right. Updating Neighbors. Back to Explore Page. 9:19 C++ Code Explanation. Traverse a loop from 0 till ROW. If value in current position is 0, then set distance to 0, otherwise increase distance by 1. Example 2: Input: N = 1500 Output: 1521 21 Explanation: Two of the. Explanation: weight of 0th cell is 0. If you wish to donate to the channel:Google pay UPI ID: adimantheboss123@okaxis_____A gr. Minimum distance to travel to cover all intervals. Input: N = 4, arr = {2, 4, 8, 0} Output: 4 Explanation: Among possible rotations of given array, the rotations 8 0 2 4 and 0 2 4 8, have the maximum hamming distance of 4. cpp","contentType":"file"},{"name":"3 Divisors. Given a binary grid of n*m. Method 1: Without using the inbuilt. 0. Note: An island is either surrounded by water or boNaive Approach: The simplest idea to solve this problem is that, whenever a node is traversed on the left or right of a node, then the distances of the nodes their subtrees reduces by 1, and distance of the rest of the nodes from that node increases by 1. 0 <= m <= 105. Dynamic Programming Equation : 1) dp [diffOfX] [diffOfY] is the minimum steps taken from knight’s position to target’s position. We choose one of the 8 moves in this step). Platform to practice programming problems. DSA REPOSITORY: + DSA COURSE:. At each step it picks the node/cell having the lowest ‘ f ’, and process that node/cell. vscode","contentType":"directory"},{"name":"DP","path":"DP","contentType. 0:09 Understanding Problem. Approach: The idea is to use binary search, and for a distance mid, compute whether it is possible to reach the end of the array in exactly k jumps where the maximum distance between any two islands chosen for jumping is less than or equal to the distance mid, then check if some distance less than mid exists for which it is possible to reach the. Sum of previous numbers that are greater than current number for given array. cpp","contentType":"file"},{"name":"3 Divisors. The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the current cell, and i2, j2&Distance of nearest cell having 1 in a binary matrix: Link: Link: First negative integer in every window of size “k” Link: Link: Check if all levels of two trees are anagrams or not. Ln 1, Col 1. Mark the source cell as visited and initialize its distance to 0. O ==> Open Space G ==> Guard W ==> Wall. Use a stack pre to find the index of the nearest smaller tower to the left of the current tower. Q2: How to Find Distance Between Two Points in 2D? Answer: We can find the distance between two points (x 1, y 1) and (x 2, y 2) using the distance formula as follows:A Computer Science portal for geeks. 5) Create an array strip[] that stores all points which are at most d distance away from the middle line dividing the two sets. The entries where j < i are meaningless. cpp","path":"2D Hopscotch. Replace duplicates with greater than previous duplicate value. Distance measures. This will find closest zero to the right. Note: If the difference is same for two values print the value which is greater than the given number. If y is its child, then it is observed that the sum of distances of y and x are related as;. Find the shortest distance from a source cell to a destination cell, traversing through limited cells only. The cells are named with an integer from 0 to N-1. Examples: Input: a[] = {1, 5, 11, 20}, b[] = {4, 8, 15} Output: 5 Explanation: The minimum range. G-13. Find the distance of the nearest 1 in the grid for each cell. 8K) Submissions. Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell; Distance of nearest cell having 1 in a binary matrix; Minimum distance to the corner of a grid from source; Minimum cost to reach from the top-left to the bottom-right corner of a matrix; Implementing Water Supply Problem using Breadth First. From a given cell, we are allowed to move to cells (i+1, j) and (i, j+1) only. The nearest perfect square of arr [1] (= 2) is 1. cpp. The source and destination cells are always inside the given matrix. Given a binary grid of n*m. Thanks for watching. Following are the steps: a) First throw two dice to reach cell number 3 and then ladder to reach 22. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":"1971. This approach allows the. Now from the second element, push the element to the main stack. Example 1: [Input: mat = [[0,0,0],[0,1,0],[0,0,0]] Output: [[0,0,0],[0,1,0],[0,0,0]] Example 2: [Input: mat = [[0,0,0],[0,1,0],[1,1,1]] Output: [[0,0,0],[0,1,0],[1,2,1. Now, BFS can be used to find the shortest path from the cell. Back to Explore Page. Do all the possible moves (right, left, up and down) possible. 0:57 Example Explanation. 2:38 Logic Explanation. The maximum of all those minimal distances is the answer. cpp Go to file Go to file T; Go to line L; Copy path Copy permalink; This commit does not belong to any branch on this repository, and may belong to a. Given a grid of size M*N with each cell consisting of an integer which represents points. Find the distance of the nearest 1 in the grid for each cell. The distance transform [2] is closely related to a Voronoi diagram (see Figure 5). grid [i] [j] == 0 or grid [i] [j] == 1. Given two integers N and M. Let us discuss Rat in a Maze as another example problem that can be solved using Backtracking. The nearest perfect square of arr [2] (= 7) is 9. This problem can be solved by observing the. Time Complexity: O(K) + O(m * log(k)) , where M = N – K Auxiliary Space: O(K) Note: We can also use a Balanced Binary Search Tree instead of a Heap to store k+1 elements. Count cells in a grid from which maximum number of cells can be reached by K vertical or horizontal jumps. If x is not present in the array (arr) then return 0. Input : s = 20, d = 3 Output : 299. Let us first verify that the conditions of DP are still satisfied. Consider a rat placed at (0, 0) in a square matrix of order N * N. Run a while loop till l <= r, lowerbound is less than the upperbound. Back to Explore Page. N] of size N. Minimum moves taken to move coin of each cell to any one cell of Matrix. cpp. Find the horizontal distance from P 1 to P 2. A loop here means that the last node of the link list is connected to the node at position X (1-based index). cpp. Dynamic Programming. Back to Explore Page. The main difference here is that a ‘O’ is not replaced by ‘X’ if it lies in region that ends on a boundary. For every array element, find the nearest perfect square. Example 1: Input: n = 6 A [] = {16,17,4,3,5,2} Output: 17 5 2 Explanation: The first leader is 17 as it is greater than all the elements to its right. The distance between two adjacent cells is 1. 06% Submissions: 491K+ Points: 4. 2. {"payload":{"allShortcutsEnabled":false,"fileTree":{"":{"items":[{"name":". Given a matrix of N*M order. . Then find the minimum distance island pair among these, using BFS. {"payload":{"allShortcutsEnabled":false,"fileTree":{"Graph/Geeksforgeeks":{"items":[{"name":"Alex Travelling using Bellman Ford. For each tower, you must perform exactly one of the following operations exactly once. The distance is calculated as |i1 - i2| + |j1 - j2|, where i1, j1 are the row number and column number of the current cell, and i2, j2 are the row number and column number of the nearest cell having value 1. Input is given as an array of size N where eachentry. ELSE Move left until a 0 is found. Elements greater than the previous and next element in an Array. All vertices will get distance = distance from their nearest source. Also you can move only up, down, left and right. 61% Submissions: 217K+ Points: 2. Time Complexity: O(N 2) Auxiliary Space: O(1) Efficient approach: The above approach can be further optimized using the Prefix Sum technique and Map. For example :Complete the function booleanMatrix () that takes the matrix as input parameter and modifies it in-place. Iterate till the queue is empty or we reach any boundary edge. Therefore, the following relation gives the sum of distances of all nodes from a node,. Given a maze with obstacles, count the number of paths to reach the rightmost-bottommost cell from the topmost-leftmost cell. Solve company interview questions and improve your coding intellect{"payload":{"allShortcutsEnabled":false,"fileTree":{"Graph/Geeksforgeeks":{"items":[{"name":"Alex Travelling using Bellman Ford. GFG Weekly Coding Contest #100. Find the distance of the nearest 1 in the grid for each cell. If the reachable position is not already visited and is inside the board, push this state into the queue with a distance 1 more than its parent state. Find if Path Exists in Graph","contentType. Rearrange a string so that all same characters become d distance away; Minimize the maximum difference between the heights. Check if the mid value or index mid = low + (high – low) / 2, is the peak element or not, if yes then print the element and terminate. Edge [i] is -1 if the i th cell doesn’t have an exit. Find out the nearest number which is a perfect square and also the absolute difference between them. So the idea is to do a breadth-first search from the starting cell till the ending cell is. Distance of nearest cell having 1 in a binary matrix; Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell; Implementing Water Supply Problem using Breadth First Search; Shortest path between two points in a Matrix with at most K obstacles; Minimum distance to fetch water from well in a village Quick Link0:00 Introduction.