new commit

Author: neeraj-a2912

Arrays/candyDistribution.java

@@ -0,0 +1,14 @@
+import java.util.HashSet;
+
+public class candyDistribution {
+    public static int distributeCandies(int[] candyType) {
+        HashSet<Integer> set = new HashSet<>();
+        for(int candy: candyType){
+            set.add(candy);
+        }
+        return Math.min(set.size(), candyType.length/2);
+    }
+    public static void main(String[] args) {
+        // take inputs accordingly
+    }
+}

Strings/FirstUniqChar.java

@@ -0,0 +1,26 @@
+package Strings;
+
+import java.util.HashMap;
+
+public class FirstUniqChar {
+    public int firstUniqChar(String s) {
+        HashMap<Character,Integer> map = new HashMap<>();
+        for(int i=0; i<s.length(); i++){
+            if(map.containsKey(s.charAt(i))){
+                map.put(s.charAt(i), map.get(s.charAt(i))+1);
+            }else{
+                map.put(s.charAt(i), 1);
+            }
+        }
+        for(int i=0; i<s.length(); i++){
+            if(map.get(s.charAt(i))==1){
+                return i;
+            }
+        }
+        return -1;
+    }
+    public static void main(String[] args) {
+        // take user input accordingly
+        
+    }
+}

Strings/ValidPalindrome.py

@@ -0,0 +1,11 @@
+def isPalindrome(self, s: str) -> bool:
+    lst = []
+    for i in s:
+        if i.isalnum():
+            lst.append(i.lower())
+    l,r = 0, len(lst)-1
+    while(l<=r):
+        if lst[l]!=lst[r]:
+            return False
+        l,r=l+1,r-1
+    return True