Adding all previously written code

Author: formidablae

2021/Easy/Codeland_Username_Validation.py

@@ -0,0 +1,17 @@
+def CodelandUsernameValidation(strParam):
+
+  if len(strParam) < 4:
+    return "false"
+  if len(strParam) > 25:
+    return "false"
+  if not strParam[0].isalpha():
+    return "false"
+  if strParam[-1] == "_":
+    return "false"
+  for char in strParam:
+    if not(char.isalpha() or char.isnumeric() or char == "_"):
+      return "false"
+  return "true"
+
+# keep this function call here 
+print(CodelandUsernameValidation(input()))

2021/Easy/Find_Intersection.py

@@ -0,0 +1,30 @@
+def FindIntersection(strArr):
+
+  # code goes here
+  first = [int(x.strip()) for x in strArr[0].split(',')]
+  second = [int(x.strip()) for x in strArr[1].split(',')]
+
+  i = 0
+  j = 0
+  result = ""
+  interection = False
+  while i < len(first) and j < len(second):
+    if first[i] == second[j]:
+      result = result + str(first[i])
+      result = result + ","
+      interection = True
+      i = i + 1
+      j = j + 1
+    elif first[i] < second[j]:
+      i = i + 1
+    else:
+      j = j + 1
+
+  if interection:
+    if result[-1] == ",":
+      return result[:-1]
+    return result
+  return "false"
+
+# keep this function call here 
+print(FindIntersection(input()))

2021/Easy/First_Factorial.py

@@ -0,0 +1,9 @@
+def FirstFactorial(num):
+
+  # code goes here
+  if num == 1:
+    return 1
+  return num * FirstFactorial(num - 1)
+
+# keep this function call here 
+print(FirstFactorial(input()))

2021/Easy/First_Reverse.py

@@ -0,0 +1,5 @@
+def FirstReverse(strParam):
+  return strParam[::-1]
+
+# keep this function call here 
+print(FirstReverse(input()))

2021/Easy/Longest_Word.java

@@ -0,0 +1,36 @@
+import java.util.*; 
+import java.io.*;
+
+class Main {  
+  public static String LongestWord(String sen) { 
+  
+    // code goes here   
+    /* Note: In Java the return type of a function and the 
+       parameter types being passed are defined, so this return 
+       call must match the return type of the function.
+       You are free to modify the return type. */
+       
+       String result = "";
+       String[] senArray = sen.replaceAll("[^a-zA-Z ]", "").toLowerCase().split("\\s+");
+       
+       result = senArray[0];
+       for (int i = 1; i < senArray.length; i++)
+       {
+           if (result.length() < senArray[i].length())
+           {
+               result = senArray[i];
+           }
+       }
+       
+       return result;
+    
+  } 
+  
+  public static void main (String[] args) {  
+    // keep this function call here     
+    Scanner s = new Scanner(System.in);
+    System.out.print(LongestWord(s.nextLine())); 
+  }   
+  
+}Longest Word
+

2021/Easy/Questions_Marks.py

@@ -0,0 +1,37 @@
+def QuestionsMarks(strParam):
+
+  # code goes here
+  liststr=[]
+  liststr[:0]=strParam
+  listdigquest = []
+  for el in liststr:
+    if el.isdigit():
+      listdigquest.append(int(el))
+    elif el == "?":
+      listdigquest.append(el)
+    
+  i = 0
+  j = i + 1
+  result = False
+  while i < len(listdigquest) - 4:
+    if listdigquest[i] != "?":
+      for j in range(i + 1, len(listdigquest)):
+        if listdigquest[j] != "?" and listdigquest[i] + listdigquest[j] == 10:
+          if countquest(listdigquest, i + 1, j) == 3:
+            result = True
+          else:
+            return "false"
+    i = i + 1
+  if result:
+    return "true"
+  return "false"
+
+def countquest(arr, st, en):
+  cnt = 0
+  for i in range(st, en):
+    if arr[i] == "?":
+      cnt = cnt + 1
+  return cnt
+
+# keep this function call here 
+print(QuestionsMarks(input()))