From 1a5d3d6604f92d0554410de1ca238554e7dbf941 Mon Sep 17 00:00:00 2001 From: Aditya Yaduvanshi <38696088+adityayaduvanshi@users.noreply.github.com> Date: Sun, 7 Aug 2022 01:51:14 +0530 Subject: [PATCH] Update README.md --- README.md | 20 ++++++++++++++++---- 1 file changed, 16 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index a032d980..d85fe09d 100644 --- a/README.md +++ b/README.md @@ -61,9 +61,16 @@ problem-name\ #### `README.md` Specification / Template ````markdown -# +# Delete the kth node from the end -< description of the problem > +Lets K be the total nodes in the linked list. + +Observation : The Nth node from the end is (K-N+1)th node from the beginning. + +So the problem simplifies down to that we have to find (K-N+1)th node from the beginning. + +One way of doing it is to find the length (K) of the linked list in one pass and then in the second pass move (K-N+1) step from the beginning to reach the Nth node from the end. +To do it in one pass. Let’s take the first pointer and move N step from the beginning. Now the first pointer is (K-N+1) steps away from the last node, which is the same number of steps the second pointer require to move from the beginning to reach the Nth node from the end. ## Prerequisites @@ -75,12 +82,16 @@ problem-name\ - instructions to run the project - < Simple and reproducible commands to execute the project > ```bash - make # or 'cargo run', or 'dotnet run' or 'mvn exec:java' etc. + javac circular.java + java circular ``` ## Test Cases & Output < if exists> -< If you can provide test cases, describe it here, else remove this section > +Test Case 1: +Input- 3 + 1 2 3 4 5 6 +Output- 1>2>3>5>6 ```` #### `.gitignore` File @@ -130,6 +141,7 @@ The programming should keep the naming convention rule of each programming langu <a href="https://github.com/MakeContributions/DSA/graphs/contributors"> <img src="https://contrib.rocks/image?repo=MakeContributions/DSA" /> + </a> ## Open Graph