From caf2311583ed072d31f3ef7c3941d3b0d13b6db4 Mon Sep 17 00:00:00 2001
From: tejaspundpal <96496782+tejaspundpal@users.noreply.github.com>
Date: Sun, 3 Sep 2023 07:24:48 +0530
Subject: [PATCH] Problem Solving

---
 .idea/workspace.xml                      | 40 ++++++++++++++++-
 LinkedList/Delete Nth node from end.java | 56 ++++++++++++------------
 2 files changed, 66 insertions(+), 30 deletions(-)

diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index cc9c7e9..6a4a90e 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -1,7 +1,36 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <project version="4">
   <component name="ChangeListManager">
-    <list default="true" id="f53db98a-e6f5-41d3-b935-5cd9a241f63f" name="Changes" comment="Problem Solving" />
+    <list default="true" id="f53db98a-e6f5-41d3-b935-5cd9a241f63f" name="Changes" comment="Problem Solving">
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/CommonElementIn3SortedArrays.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/FindSquareNo.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/HighestLowestFreqElement.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/MaximizingTheArray.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/MinimizeTheDifference.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/ProductExceptSelf.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/RearrangeAlternatively.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/RearrangeAlternativelyMaxAndMinElement.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/ThirdMaximumNumber.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Arrays/TrappingRainWater.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/BitManipulation/FlipBits.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Matrix/SetMatrixZeros.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/CheckPalindrome.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/CountPalindromeWord.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/CountingContinuousString.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/Dic.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/EncodeString.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/Make1stLetterCapital.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/RemoveCharacter.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/ReverseWordsInString.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/Split.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/Strings/SubstringFind.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/Problems/recursion/ReachTheDestination.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/Problems/Arrays/PairSum.java" beforeDir="false" afterPath="$PROJECT_DIR$/Problems/Arrays/PairSum.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/Problems/Strings/AlternateString.java" beforeDir="false" afterPath="$PROJECT_DIR$/Problems/Strings/AlternateString.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/Problems/Strings/HR_anagram.java" beforeDir="false" afterPath="$PROJECT_DIR$/Problems/Strings/HR_anagram.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/Problems/Strings/ReverseWord.java" beforeDir="false" afterPath="$PROJECT_DIR$/Problems/Strings/ReverseWord.java" afterDir="false" />
+    </list>
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
     <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
@@ -54,7 +83,14 @@
       <option name="project" value="LOCAL" />
       <updated>1689615092635</updated>
     </task>
-    <option name="localTasksCounter" value="2" />
+    <task id="LOCAL-00002" summary="Problem Solving">
+      <created>1693672015883</created>
+      <option name="number" value="00002" />
+      <option name="presentableId" value="LOCAL-00002" />
+      <option name="project" value="LOCAL" />
+      <updated>1693672015883</updated>
+    </task>
+    <option name="localTasksCounter" value="3" />
     <servers />
   </component>
   <component name="Vcs.Log.Tabs.Properties">
diff --git a/LinkedList/Delete Nth node from end.java b/LinkedList/Delete Nth node from end.java
index e3b80dc..9dc9b88 100644
--- a/LinkedList/Delete Nth node from end.java	
+++ b/LinkedList/Delete Nth node from end.java	
@@ -1,31 +1,31 @@
 //This is method to delete Nth node from end of the linked list.
 //if method cannot have access to head then you have to pass head to function.Here I am not passing head as my linked list having access to head.
 
-public void deleteNthFromEnd(int n){
-        if(head == null){
-            System.out.println("List is Empty.");
-            return;
-        }
-        if(head.next == null){
-            head = null;
-            return;
-        }
-        int size = 0;
-        Node curr = head;
-        while(curr != null){
-            curr = curr.next;
-            size++;
-        }
-        if(n == size){
-            head = head.next;
-            return;
-        }
-        int searchIndex = (size-n)+1;
-        Node prev = head;
-        int i = 1;
-        while(i < searchIndex-1){
-            prev = prev.next;
-            i++;
-        }
-        prev.next = prev.next.next;
-    }
+//public void deleteNthFromEnd(int n){
+//        if(head == null){
+//            System.out.println("List is Empty.");
+//            return;
+//        }
+//        if(head.next == null){
+//            head = null;
+//            return;
+//        }
+//        int size = 0;
+//        Node curr = head;
+//        while(curr != null){
+//            curr = curr.next;
+//            size++;
+//        }
+//        if(n == size){
+//            head = head.next;
+//            return;
+//        }
+//        int searchIndex = (size-n)+1;
+//        Node prev = head;
+//        int i = 1;
+//        while(i < searchIndex-1){
+//            prev = prev.next;
+//            i++;
+//        }
+//        prev.next = prev.next.next;
+//    }