Added codes for 3 March

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

@@ -0,0 +1,43 @@
+//{ Driver Code Starts
+import java.util.*;
+import java.io.*;
+import java.lang.*;
+
+public class GfG { 
+	public static void main (String[] args) throws IOException  {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int t = Integer.parseInt(br.readLine().trim());
+		while(t-->0){
+		    String inputLine[] = br.readLine().trim().split(" ");
+		    int n = Integer.parseInt(inputLine[0]);
+		    int k = Integer.parseInt(inputLine[1]);
+		    int[] arr = new int[n];
+		    inputLine = br.readLine().trim().split(" ");
+		    for(int i=0; i<n; i++)arr[i] = Integer.parseInt(inputLine[i]);
+
+		    Solution obj = new Solution();
+		    System.out.println(obj.firstElementKTime(n, k, arr));
+		}
+	}
+}
+
+// } Driver Code Ends
+
+
+class Solution
+{
+    public int firstElementKTime(int n, int k, int[] a) 
+    { 
+        HashMap<Integer, Integer> count_map = new HashMap<>();
+        for (int i = 0; i < n; i++)
+        {
+            count_map.put(a[i], count_map.getOrDefault(a[i], 0) + 1);
+            if (count_map.get(a[i]) == k) 
+            {
+                return a[i];
+            }
+        }
+
+        return -1;
+    } 
+}

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

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

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

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

LeetCode/March/02-3-24/SOlution.java

@@ -0,0 +1,17 @@
+class Solution 
+{
+    public int[] sortedSquares(int[] nums) 
+    {
+        int n = nums.length;
+        int[] ans = new int[n];
+        int i = n - 1;
+
+        for (int l = 0, r = n - 1; l <= r;)
+            if (Math.abs(nums[l]) > Math.abs(nums[r]))
+                ans[i--] = nums[l] * nums[l++];
+            else
+                ans[i--] = nums[r] * nums[r--];
+
+        return ans;
+    }
+}