Added codes for 20 March

GeeksForGeeks/March/20-3-24/GFG.java

@@ -0,0 +1,150 @@
+//{ Driver Code Starts
+//Initial Template for Java
+
+import java.io.*;
+import java.util.*;
+import java.lang.*; 
+
+
+class Node {
+    int data;
+    Node left, right;
+
+    public Node(int data){
+        this.data = data;
+    }
+}
+
+class GFG {
+
+
+    static Node buildTree(String str){
+
+        if(str.length()==0 || str.charAt(0)=='N'){
+            return null;
+        }
+
+        String ip[] = str.split(" ");
+        // Create the root of the tree
+        Node root = new Node(Integer.parseInt(ip[0]));
+        // Push the root to the queue
+
+        Queue<Node> queue = new LinkedList<>(); 
+
+        queue.add(root);
+        // Starting from the second element
+
+        int i = 1;
+        while(queue.size()>0 && i < ip.length) {
+
+            // Get and remove the front of the queue
+            Node currNode = queue.peek();
+            queue.remove();
+
+            // Get the current node's value from the string
+            String currVal = ip[i];
+
+            // If the left child is not null
+            if(!currVal.equals("N")) {
+
+                // Create the left child for the current node
+                currNode.left = new Node(Integer.parseInt(currVal));
+                // Push it to the queue
+                queue.add(currNode.left);
+            }
+
+            // For the right child
+            i++;
+            if(i >= ip.length)
+                break;
+
+            currVal = ip[i];
+
+            // If the right child is not null
+            if(!currVal.equals("N")) {
+
+                // Create the right child for the current node
+                currNode.right = new Node(Integer.parseInt(currVal));
+
+                // Push it to the queue
+                queue.add(currNode.right);
+            }
+            i++;
+        }
+
+        return root;
+    }
+    public static void inorder(Node root){
+        if(root == null)
+            return;
+
+        inorder(root.left);
+        System.out.print(root.data+" ");
+        inorder(root.right);
+    }
+
+	public static void main (String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int t=Integer.parseInt(br.readLine());
+		while(t-- > 0){
+		    String s = br.readLine();
+	    	Node root = buildTree(s);
+		    Solution obj = new Solution();
+		    int res = obj.sumOfLongRootToLeafPath(root);
+		    System.out.println(res);
+		}
+	}
+}
+// } Driver Code Ends
+
+
+//User function Template for Java
+
+/*
+node class of binary tree
+class Node {
+    int data;
+    Node left, right;
+    
+    public Node(int data){
+        this.data = data;
+    }
+}
+*/
+class Solution
+{
+    int ans=0;
+    public int sumOfLongRootToLeafPath(Node root)
+    {
+        //code here
+        int ht=getH(root);
+        ans=0;
+        solve(root,ht,1,root.data);
+        return ans;
+    }
+
+
+    public int getH(Node root)
+    {
+        if(root==null)
+            return 0;
+
+        int l=getH(root.left);
+        int r=getH(root.right);
+
+        return Math.max(l,r)+1;
+    }
+
+    void solve(Node root,int ht,int c,int sum)
+    {
+        if(root==null)
+            return;
+        if(c==ht)
+            ans=Math.max(ans,sum);
+
+        if(root.left!=null)
+            solve(root.left,ht,c+1,sum+root.left.data);
+        if(root.right!=null)
+            solve(root.right,ht,c+1,sum+root.right.data);
+    }
+}

GeeksForGeeks/March/20-3-24/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)

LeetCode/March/20-3-24/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)

LeetCode/March/20-3-24/Solution.java

@@ -0,0 +1,33 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution 
+{
+    public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) 
+    {
+        ListNode nodeBeforeA = list1;
+        for (int i = 0; i < a - 1; ++i)
+            nodeBeforeA = nodeBeforeA.next;
+
+        ListNode nodeB = nodeBeforeA.next;
+        for (int i = 0; i < b - a; ++i)
+            nodeB = nodeB.next;
+
+        nodeBeforeA.next = list2;
+        ListNode lastNodeInList2 = list2;
+
+        while (lastNodeInList2.next != null)
+            lastNodeInList2 = lastNodeInList2.next;
+
+        lastNodeInList2.next = nodeB.next;
+        nodeB.next = null;
+        return list1;
+    }
+}