some changes

Heaps & Hashing/Hard/Find_Median_In_A_Stream.py

@@ -1,4 +1,4 @@
 # Problem URL: https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0
 class Solution:
     def solve(self, *args, **kwargs):
-        pass
+        pass

Heaps & Hashing/Heap data structure.ipynb

@@ -185,7 +185,39 @@
    "execution_count": null,
    "metadata": {},
    "outputs": [],
-   "source": []
+   "source": [
+    "class Solution:\n",
+    "    # Heapify function to maintain heap property.\n",
+    "    def heapify(self, arr, n, i):\n",
+    "        smallest = i\n",
+    "        left = 2 * i + 1\n",
+    "        right = 2 * i + 2\n",
+    "        \n",
+    "        if left < n and arr[left] > arr[smallest]:\n",
+    "            smallest = left\n",
+    "            \n",
+    "        if right < n and arr[right] > arr[smallest]:\n",
+    "            smallest = right\n",
+    "            \n",
+    "        if smallest != i:\n",
+    "            arr[i], arr[smallest] = arr[smallest], arr[i]\n",
+    "            self.heapify(arr, n, smallest)\n",
+    "    \n",
+    "    # Function to build a Heap from array.\n",
+    "    def buildHeap(self, arr, n):\n",
+    "        for i in range(n // 2 - 1, -1, -1):\n",
+    "            self.heapify(arr, n, i)\n",
+    "        \n",
+    "    # Function to sort an array using Heap Sort.\n",
+    "    def HeapSort(self, arr, n):\n",
+    "        # Step 1: Build a max heap\n",
+    "        self.buildHeap(arr, n)\n",
+    "        \n",
+    "        # Step 2: Extract elements from the heap one by one\n",
+    "        for i in range(n-1, 0, -1):\n",
+    "            arr[0], arr[i] = arr[i], arr[0]  # Move current root to end\n",
+    "            self.heapify(arr, i, 0)  # Heapify the reduced heap\n"
+   ]
   },
   {
    "cell_type": "code",

Heaps & Hashing/Heap_Sort.py

@@ -0,0 +1,31 @@
+def heapify(arr,n,i):
+    while True:
+        left=2*i+1
+        right=2*i+2
+        smallest=i
+
+        if left < n and arr[left] > arr[smallest]:
+            smallest=left
+
+        if right < n and arr[right] > arr[smallest]:
+            smallest=right
+
+        if smallest==i:
+            break
+        arr[smallest],arr[i]=arr[i],arr[smallest]
+        i=smallest
+
+
+def HeapSort(arr,n):
+    for i in range(n//2-1,-1,-1):
+        heapify(arr,n,i)
+
+    for i in range(n-1,0,-1):
+        arr[0],arr[i]=arr[i],arr[0]
+        heapify(arr,i,0)
+
+
+if __name__=="__main__":
+    arr=[2,3,23,12,45,67,97,89,76]
+    HeapSort(arr,len(arr))
+    print(arr)

LINKED-LIST problems/Concept/Uses_of_Linked_List_Real_Life.py

@@ -0,0 +1,4 @@
+# No URL provided
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Add_1_to_a_Number_Represented_as_Linked_List.py

@@ -0,0 +1,33 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/add-1-to-a-number-represented-as-linked-list/1
+class Solution:
+    class Node:
+        def __init__(self,data) -> None:
+            self.next=None
+            self.data=data
+
+    def __init__(self) -> None:
+        self.head=None
+
+    def insert(self,value):
+        new_node=self.Node(value)
+        if self.head==None:
+            head=new_node
+            return
+        new_node.next=self.head
+        self.head=new_node
+
+    def display(self):
+        n=self.head
+        if n:
+            while n:
+                print(n.data, end=' ')
+                n=n.next
+    def solve(self, *args, **kwargs):
+        pass
+
+
+if __name__=="__main__":
+    obj=Solution()
+    obj.insert(10)
+    print(obj.display())
+

LINKED-LIST problems/Easy/Arrays_vs_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/middle-of-the-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Circular_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/circular-linked-list/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Convert_Binary_Number_in_a_Linked_List_to_Integer.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Intersection_of_Two_Linked_Lists.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/intersection-of-two-linked-lists/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Intersection_of_Two_Sorted_Linked_Lists.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Merge_Two_Sorted_Lists.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/merge-two-sorted-lists/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Middle_of_the_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/middle-of-the-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Move_Last_Element_to_Front_of_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/move-last-element-to-front-of-a-given-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Nth_Node_from_End_of_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Remove_Duplicate_Element_from_Sorted_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Remove_Duplicates_from_Sorted_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/remove-duplicates-from-sorted-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Remove_Linked_List_Elements.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/remove-linked-list-elements/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Representation_of_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/delete-node-in-a-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Reverse_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/reverse-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Reverse_a_Doubly_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/reverse-a-doubly-linked-list/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Reverse_a_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/reverse-a-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Easy/Sort_Linked_List_of_0s_1s_2s.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/sort-a-linked-list-of-0s-1s-or-2s/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Flatten_a_Linked_List_with_Next_and_Child_Pointers.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/flatten-a-linked-list-with-next-and-child-pointers/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Flattening_a_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/flattening-a-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/LRU_Cache_Implementation.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/lru-cache/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Linked_List_with_Next_and_Arbit_Pointer.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/a-linked-list-with-next-and-arbit-pointer/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Merge_Sort_for_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/merge-sort-for-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Merge_k_Sorted_Lists.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/merge-k-sorted-lists/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Quick_Sort_on_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/quick-sort-on-linked-list/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Quick_Sort_on_Singly_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/quicksort-on-singly-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Reverse_Nodes_in_k-Group.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/reverse-nodes-in-k-group/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Hard/Reverse_Nodes_in_k-Group_No_Extra_Space.py

@@ -0,0 +1,4 @@
+# No URL provided
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Add_Two_Numbers_Represented_by_Linked_Lists.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Check_if_Linked_List_is_Palindrome.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Clone_a_Linked_List_with_Next_and_Random_Pointer.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Copy_List_with_Random_Pointer_No_Extra_Space.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/reverse-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Copy_List_with_Random_Pointer_With_Extra_Space.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/copy-list-with-random-pointer/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Delete_Node_in_a_Singly_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/given-only-a-pointer-to-a-node-to-be-deleted-in-a-singly-linked-list-how-do-you-delete-it/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Delete_Nodes_with_Greater_Value_on_Right.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/delete-nodes-which-have-a-greater-value-on-right-side/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Design_Browser_History.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/design-browser-history/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Design_HashMap.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/design-hashmap/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Detect_Loop_in_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Detect_and_Remove_Loop_in_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/detect-and-remove-loop-in-a-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Doubly_Linked_List_and_STLs.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/design-hashset/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Find_First_Node_of_Loop_in_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/find-first-node-of-loop-in-a-linked-list/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Flattening_of_a_Linked_List.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Intersection_Point_in_Y_Shaped_Linked_Lists.py

@@ -0,0 +1,4 @@
+# Problem URL: https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Intersection_Point_of_Two_Linked_Lists.py

@@ -0,0 +1,4 @@
+# Problem URL: https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/LRU_Cache.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/lru-cache/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Linked_List_Cycle.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/linked-list-cycle/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass

LINKED-LIST problems/Medium/Linked_List_Cycle_II.py

@@ -0,0 +1,4 @@
+# Problem URL: https://leetcode.com/problems/linked-list-cycle-ii/
+class Solution:
+    def solve(self, *args, **kwargs):
+        pass