Added codes for 9 March

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

@@ -0,0 +1,52 @@
+//{ Driver Code Starts
+//Initial Template for Java
+
+import java.io.*;
+import java.util.*;
+
+
+class GfG
+{
+    public static void main(String args[])
+        {
+            Scanner sc = new Scanner(System.in);
+            int t = sc.nextInt();
+            while(t-->0)
+                {
+                    String S = sc.next();
+                    int R = sc.nextInt();
+                    int N = sc.nextInt();
+                    Solution obj = new Solution();
+                    System.out.println(obj.nthCharacter(S,R,N));
+                }
+
+        }
+}
+
+// } Driver Code Ends
+
+
+//User function Template for Java
+
+class Solution
+{
+    public char nthCharacter(String s, int r, int n)
+    {
+        //code here
+        while(r-- > 0) 
+        {
+            String m = "";
+            for(int i = 0; i < Math.min(s.length(),n+1); i++) 
+            {
+                if(s.charAt(i) == '1')
+                    m+="10";
+                else
+                    m+="01";
+            }
+
+            s = m;
+        }
+
+        return s.charAt(n);
+    }
+}

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

@@ -0,0 +1,2 @@
+Time complexity - O(r * |s|)
+Space complexity - O(|s|)

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

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

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

@@ -0,0 +1,21 @@
+class Solution 
+{
+    public int getCommon(int[] nums1, int[] nums2) 
+    {
+        int i = 0;
+        int j = 0;
+
+        while (i < nums1.length && j < nums2.length) 
+        {
+            if (nums1[i] == nums2[j])
+                return nums1[i];
+
+            if (nums1[i] < nums2[j])
+                ++i;
+            else
+                ++j;
+        }
+
+        return -1;
+    }
+}