Update Commit

Author: NR7KINGithub

11. Binary Search/Find_Nth_Root_Of_M.java renamed to 11. Binary Search/code360_Find_Nth_Root_Of_M.java

@@ -1,4 +1,4 @@
-public class Find_Nth_Root_Of_M {
+public class code360_Find_Nth_Root_Of_M {
     public static int NthRoot(int n, int m) {
         if(m == 1) {
             return 1;

13. Stack And Queue/Implement_Stack_Using_Queues_225.java

@@ -0,0 +1,44 @@
+import java.util.LinkedList;
+import java.util.Queue;
+
+class MyStack {
+    private Queue<Integer> queue;
+
+    public MyStack() {
+        queue = new LinkedList<>();
+    }
+
+    public void push(int x) {
+        queue.add(x);
+        for (int i = 1; i < queue.size(); i++) {
+            queue.add(queue.remove());
+        }
+    }
+    
+    public int pop() {
+        return queue.remove();
+    }
+    
+    public int top() {
+        return queue.peek();
+    }
+    
+    public boolean empty() {
+        return queue.isEmpty();
+    }
+}
+
+public class Implement_Stack_Using_Queues_225 {
+    public static void main(String[] args) {
+        MyStack obj = new MyStack();
+        obj.push(1);
+        obj.push(2);
+        int param_3 = obj.top();
+        int param_2 = obj.pop();
+        boolean param_4 = obj.empty(); 
+
+        System.out.println("Top Element: " + param_3);
+        System.out.println("Popped Element: " + param_2);
+        System.out.println("Stack Empty? " + param_4);
+    }
+}

13. Stack And Queue/Sort_A_Stack.java renamed to 13. Stack And Queue/code_360_Sort_A_Stack.java

@@ -1,6 +1,6 @@
 import java.util.*;
 
-public class Sort_A_Stack {
+public class code_360_Sort_A_Stack {
     // Function to sort the stack
     public static void sortStack(Stack<Integer> stack) {
         // Base case: if stack is empty, return

15. String Part I/Longest_Common_Prefix.java renamed to 15. String Part I/Longest_Common_Prefix_14.java

@@ -1,4 +1,4 @@
-public class Longest_Common_Prefix {
+public class Longest_Common_Prefix_14 {
     public String longestCommonPrefix(String[] strs) {
         String prefix = strs[0];
         for(int i = 1; i < strs.length; i++)
@@ -11,7 +11,7 @@ public String longestCommonPrefix(String[] strs) {
         return prefix;
     }
     public static void main(String[] args) {
-        Longest_Common_Prefix ob = new Longest_Common_Prefix();
+        Longest_Common_Prefix_14 ob = new Longest_Common_Prefix_14();
         String[] strs = {"flower","flow","flight"};
         System.err.println(ob.longestCommonPrefix(strs));
     }

15. String Part I/Roman_To_Integer.java renamed to 15. String Part I/Roman_To_Integer_13.java

@@ -1,4 +1,4 @@
-public class Roman_To_Integer {
+public class Roman_To_Integer_13 {
     public int romanToInt(String s) {
         int ans = 0, num = 0;
         for (int i = s.length()-1; i >= 0; i--) {
@@ -19,7 +19,7 @@ public int romanToInt(String s) {
         return ans;
     }
     public static void main(String args[]) {
-        Roman_To_Integer ob = new Roman_To_Integer();
+        Roman_To_Integer_13 ob = new Roman_To_Integer_13();
         System.out.println(ob.romanToInt("MCMXCIV"));
     }
 }

16. String Part II/Needle_And_Haystack.java renamed to 16. String Part II/Find_The_Index_Of_The_First_Occurence_In_A_String_28.java

@@ -1,4 +1,4 @@
-public class Needle_And_Haystack {
+public class Find_The_Index_Of_The_First_Occurence_In_A_String_28 {
     public int strStr(String haystack, String needle) {
         for(int i = 0; ;i++) 
         {
@@ -12,7 +12,7 @@ public int strStr(String haystack, String needle) {
         }
     }
     public static void main(String[] args) {
-        Needle_And_Haystack ob = new Needle_And_Haystack();
+        Find_The_Index_Of_The_First_Occurence_In_A_String_28 ob = new Find_The_Index_Of_The_First_Occurence_In_A_String_28();
         System.out.println(ob.strStr("happyandhappy", "happy"));
     }
 }

18. Binary Tree Part II/100_Same_Tree.py

@@ -1,5 +1,5 @@
 # Definition for a binary tree node
-class TreeNode(object):
+class Node(object):
     def __init__(self, val=0, left=None, right=None):
         self.val = val
         self.left = left
@@ -19,21 +19,21 @@ def same(p, q):
 
     return same(p,q)
 
-p = TreeNode(1)
-p.left = TreeNode(2)
-p.right = TreeNode(2)
-p.left.left = TreeNode(3)
-p.right.right = TreeNode(3)
-p.left.right = TreeNode(4)
-p.right.left = TreeNode(4)
+p = Node(1)
+p.left = Node(2)
+p.right = Node(2)
+p.left.left = Node(3)
+p.right.right = Node(3)
+p.left.right = Node(4)
+p.right.left = Node(4)
 
 
-q = TreeNode(1)
-q.left = TreeNode(2)
-q.right = TreeNode(2)
-q.left.left = TreeNode(3)
-q.right.right = TreeNode(3)
-q.left.right = TreeNode(4)
-q.right.left = TreeNode(4)
+q = Node(1)
+q.left = Node(2)
+q.right = Node(2)
+q.left.left = Node(3)
+q.right.right = Node(3)
+q.left.right = Node(4)
+q.right.left = Node(4)
 
 print(isSameTree(p, q))

19. Binary Tree Part III/101_Symmetric_Tree.py

@@ -1,5 +1,5 @@
 # Definition for a binary tree node
-class TreeNode:
+class Node:
     def __init__(self, val=0, left=None, right=None):
         self.val = val
         self.left = left
@@ -18,12 +18,12 @@ def Symmetric(root1, root2):
     return Symmetric(root,root)
 
 
-root = TreeNode(1)
-root.left = TreeNode(2)
-root.right = TreeNode(2)
-root.left.left = TreeNode(3)
-root.right.right = TreeNode(3)
-root.left.right = TreeNode(4)
-root.right.left = TreeNode(4)
+root = Node(1)
+root.left = Node(2)
+root.right = Node(2)
+root.left.left = Node(3)
+root.right.right = Node(3)
+root.left.right = Node(4)
+root.right.left = Node(4)
 
 print(isSymmetric(root))

20. Binary Searh Tree Part I/700_Search_In_A_Binary_Search_Tree.py

@@ -1,12 +1,12 @@
 from typing import Optional
 # Definition for a binary tree node
-class TreeNode:
+class Node:
      def __init__(self, val=0, left=None, right=None):
         self.val = val
         self.left = left
         self.right = right
 
-def searchBST(root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
+def searchBST(root: Optional[Node], val: int) -> Optional[Node]:
     while (root is not None and root.val != val):
         if (val < root.val):
             root = root.left
@@ -15,13 +15,13 @@ def searchBST(root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
     return root
 
 if __name__ == "__main__":
-    root = TreeNode(4)
-    root.left = TreeNode(2)
-    root.right = TreeNode(7)
-    root.left.left = TreeNode(1)
-    root.left.right = TreeNode(3)
+    root = Node(4)
+    root.left = Node(2)
+    root.right = Node(7)
+    root.left.left = Node(1)
+    root.left.right = Node(3)
     result = searchBST(root, 2)
-    def Tree(node: Optional[TreeNode]) -> list:
+    def Tree(node: Optional[Node]) -> list:
         if not node:
             return []
         return [node.val] + Tree(node.left) + Tree(node.right)

21. Binary Search Tree Part II/230_Kth_Smallest_Element_In_A_BST.py

@@ -1,12 +1,12 @@
 # Definition for a binary tree node.
-class TreeNode:
+class Node:
     def __init__(self, val=0, left=None, right=None):
         self.val = val
         self.left = left
         self.right = right
 
 class Solution:
-    def kthSmallest(self, root: TreeNode, k: int) -> int:
+    def kthSmallest(self, root: Node, k: int) -> int:
         # Initialize variables to keep track of count and result
         self.count = 0
         self.result = None
@@ -28,8 +28,8 @@ def in_order_traversal(node):
         return self.result
 
 if __name__ == "__main__":
-    root = TreeNode(3)
-    root.left = TreeNode(1)
-    root.right = TreeNode(4)
-    root.left.right = TreeNode(2)
+    root = Node(3)
+    root.left = Node(1)
+    root.right = Node(4)
+    root.left.right = Node(2)
     print(Solution().kthSmallest(root, 1))