From 1cb3fdec535d4a1bfd6d6a326010d274e9355fed Mon Sep 17 00:00:00 2001
From: Tanmay-312 <jain2002tj@gmail.com>
Date: Tue, 27 Feb 2024 17:30:48 +0530
Subject: [PATCH] Added codes for 27 Feb

---
 GeeksForGeeks/February/27-2-24/GFG.java  | 62 ++++++++++++++++++++++++
 GeeksForGeeks/February/27-2-24/README.md |  2 +
 LeetCode/February/README.md              |  2 +
 LeetCode/February/Solution.java          | 36 ++++++++++++++
 4 files changed, 102 insertions(+)
 create mode 100644 GeeksForGeeks/February/27-2-24/GFG.java
 create mode 100644 GeeksForGeeks/February/27-2-24/README.md
 create mode 100644 LeetCode/February/README.md
 create mode 100644 LeetCode/February/Solution.java

diff --git a/GeeksForGeeks/February/27-2-24/GFG.java b/GeeksForGeeks/February/27-2-24/GFG.java
new file mode 100644
index 0000000..ace0e60
--- /dev/null
+++ b/GeeksForGeeks/February/27-2-24/GFG.java
@@ -0,0 +1,62 @@
+//{ Driver Code Starts
+//Initial Template for Java
+
+//Initial Template for Java
+
+//Initial Template for Java
+
+/*package whatever //do not write package name here */
+
+import java.io.*;
+import java.util.*;
+
+
+class Array {
+    
+    // Driver code
+	public static void main (String[] args) throws IOException{
+		// Taking input using buffered reader
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		
+		int testcases = Integer.parseInt(br.readLine());
+		
+		// looping through all testcases
+		while(testcases-- > 0){
+		    int sizeOfArray = Integer.parseInt(br.readLine());
+		    int arr [] = new int[sizeOfArray];
+		    
+		    String line = br.readLine();
+		    String[] elements = line.trim().split("\\s+");
+		    for(int i = 0;i<sizeOfArray;i++){
+		        arr[i] = Integer.parseInt(elements[i]);
+		    }
+		    
+		    Solution obj = new Solution();
+		    arr = obj.game_with_number(arr, sizeOfArray);
+		    for(int i=0; i< sizeOfArray;i++){
+		        System.out.print(arr[i] + " ");
+		    }
+		    System.out.println();
+		}
+	}
+}
+
+
+
+// } Driver Code Ends
+
+
+//User function Template for Java
+
+class Solution
+{
+    // Function for finding maximum and value pair
+    public static int[] game_with_number (int arr[], int n) 
+    {
+        // Complete the function
+        for (int i=0; i<n-1; i++)
+            arr[i] |= arr[i+1];
+            
+        return arr;
+    }
+}
diff --git a/GeeksForGeeks/February/27-2-24/README.md b/GeeksForGeeks/February/27-2-24/README.md
new file mode 100644
index 0000000..9567f26
--- /dev/null
+++ b/GeeksForGeeks/February/27-2-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)
diff --git a/LeetCode/February/README.md b/LeetCode/February/README.md
new file mode 100644
index 0000000..722dfdc
--- /dev/null
+++ b/LeetCode/February/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(h)
diff --git a/LeetCode/February/Solution.java b/LeetCode/February/Solution.java
new file mode 100644
index 0000000..cf5654d
--- /dev/null
+++ b/LeetCode/February/Solution.java
@@ -0,0 +1,36 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution 
+{
+    public int diameterOfBinaryTree(TreeNode root) 
+    {
+        maxDepth(root);
+        return ans;
+    }
+
+    private int ans = 0;
+
+    private int maxDepth(TreeNode root) 
+    {
+        if (root == null)
+            return 0;
+
+        int l = maxDepth(root.left);
+        int r = maxDepth(root.right);
+        ans = Math.max(ans, l + r);
+        return 1 + Math.max(l, r);
+    }
+}