up

RajSDE · RajSDE · commit 3318c6cc2739 · 2022-02-25T15:18:01.000+05:30
diff --git a/JavaPractice/DetectCycleInaDirectedGraph/readme.md b/JavaPractice/DetectCycleInaDirectedGraph/readme.md
@@ -1,7 +1,5 @@
 ## Detect cycle in a directed graph 
-Given a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, check whether it contains any cycle or not.
-
-[🔗Goto](https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1/?page=1&difficulty[]=1&status[]=unsolved&company[]=Amazon&sortBy=submissions#) 
+Given a Directed Graph with V vertices (Numbered from 0 to V-1) and E edges, check whether it contains any cycle or not. [🔗Goto](https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1/?page=1&difficulty[]=1&status[]=unsolved&company[]=Amazon&sortBy=submissions#) 
 
 <details>
 <summary>Full Code</summary>
diff --git a/JavaPractice/MinimumNumberOfJumps/Readme.md b/JavaPractice/MinimumNumberOfJumps/Readme.md
@@ -1,6 +1,6 @@
 ## Minimum number of jumps
 Given an array of N integers arr[] where each element represents the max number of steps that can be made forward from that element. Find the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, then you cannot move through that element.
-**Note:** Return -1 if you can't reach the end of the array. [🔗Goto](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1/?page=1&difficulty[]=1&status[]=unsolved&company[]=Amazon&sortBy=submissions#) 
+**Note:** Return -1 if you can't reach the end of the array.  [🔗Goto](https://practice.geeksforgeeks.org/problems/minimum-number-of-jumps-1587115620/1/?page=1&difficulty[]=1&status[]=unsolved&company[]=Amazon&sortBy=submissions#) 
 
 <details>
 <summary>Full Code</summary>
