Skip to content

Commit

Permalink
Added codes for 27 Feb
Browse files Browse the repository at this point in the history
  • Loading branch information
Tanmay-312 committed Feb 27, 2024
1 parent ac5e2ed commit 1cb3fde
Show file tree
Hide file tree
Showing 4 changed files with 102 additions and 0 deletions.
62 changes: 62 additions & 0 deletions GeeksForGeeks/February/27-2-24/GFG.java
Original file line number Diff line number Diff line change
@@ -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;
}
}
2 changes: 2 additions & 0 deletions GeeksForGeeks/February/27-2-24/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
Time complexity - O(n)
Space complexity - O(1)
2 changes: 2 additions & 0 deletions LeetCode/February/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
Time complexity - O(n)
Space complexity - O(h)
36 changes: 36 additions & 0 deletions LeetCode/February/Solution.java
Original file line number Diff line number Diff line change
@@ -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);
}
}

0 comments on commit 1cb3fde

Please sign in to comment.