feat: Added solutions to the first 5 challenges

* Added solutions to the first 5 challenges from 3 Months Preparation Kit

Author: ralvarezdev

three-month-preparation-kit/week1/breaking-best-and-worst-records.py

@@ -0,0 +1,45 @@
+#!/bin/python3
+
+import math
+import os
+import random
+import re
+import sys
+
+#
+# Complete the 'breakingRecords' function below.
+#
+# The function is expected to return an INTEGER_ARRAY.
+# The function accepts INTEGER_ARRAY scores as parameter.
+#
+
+
+def breakingRecords(scores):
+    minNumber = maxNumber = scores[0]
+    minBreaking = maxBreaking = 0
+
+    for score in scores[1:]:
+        if score < minNumber:
+            minNumber = score
+            minBreaking += 1
+
+        elif score > maxNumber:
+            maxNumber = score
+            maxBreaking += 1
+
+    return [maxBreaking, minBreaking]
+
+
+if __name__ == "__main__":
+    fptr = open(os.environ["OUTPUT_PATH"], "w")
+
+    n = int(input().strip())
+
+    scores = list(map(int, input().rstrip().split()))
+
+    result = breakingRecords(scores)
+
+    fptr.write(" ".join(map(str, result)))
+    fptr.write("\n")
+
+    fptr.close()

three-month-preparation-kit/week1/camel-case.java

@@ -0,0 +1,63 @@
+import java.io.*;
+import java.util.*;
+
+public class Solution {
+    public  static String setFirstUpperCase(String word)
+    {
+        return Character.toUpperCase(word.charAt(0))+ word.substring(1);
+    }
+
+    public static void main(String[] args) {
+        Scanner scanner= new Scanner(System.in);
+        boolean isSplit;
+        Character SPLIT='S', CLASS='C', VARIABLE='V', METHOD='M',typeWord;
+        
+        while(scanner.hasNext()){   
+            String[] line=scanner.nextLine().split(";");
+            isSplit=SPLIT.equals(line[0].charAt(0));
+            typeWord=line[1].charAt(0);
+            String formattedStr="";
+            String[] words = line[2].split(" ");
+                        
+            if(!isSplit){                   
+                if(typeWord.equals(CLASS))
+                    for(String word: words)
+                        formattedStr+=setFirstUpperCase(word);
+                
+                else{
+                    int counter=0;
+                    
+                    for(String word:words){
+                        if(counter!=0)
+                           formattedStr+=setFirstUpperCase(word);
+                        else
+                            formattedStr+=word;
+                        
+                        counter++;
+                    }
+                    
+                    if(typeWord.equals(METHOD))
+                        formattedStr+="()";
+                }
+            }
+            else{            
+                int counter=0;
+                String word=words[0];
+                
+                if(typeWord.equals(METHOD))
+                    word=word.substring(0, word.length()-2);
+                
+                for(int i=0;i<word.length();i++){   
+                    char letter=word.charAt(i);
+                
+                    if(counter!=0 && Character.isUpperCase(letter))
+                        formattedStr+=' ';
+                    
+                    formattedStr+=Character.toLowerCase(letter);
+                    counter++;
+                }
+            }            
+            System.out.println(formattedStr);
+        }
+    }
+}

three-month-preparation-kit/week1/mini-max-sum.py

@@ -0,0 +1,34 @@
+#!/bin/python3
+
+import math
+import os
+import random
+import re
+import sys
+
+#
+# Complete the 'miniMaxSum' function below.
+#
+# The function accepts INTEGER_ARRAY arr as parameter.
+#
+
+def miniMaxSum(arr):
+    minNumber=arr[0]
+    maxNumber=arr[0]
+    total=0
+    
+    for number in arr:
+        if number<minNumber:
+            minNumber=number
+        elif number>maxNumber:
+            maxNumber=number
+            
+        total+=number
+            
+    print(f'{total-maxNumber} {total-minNumber}')
+
+if __name__ == '__main__':
+
+    arr = list(map(int, input().rstrip().split()))
+
+    miniMaxSum(arr)

three-month-preparation-kit/week1/plus-minus.py

@@ -0,0 +1,37 @@
+#!/bin/python3
+
+import math
+import os
+import random
+import re
+import sys
+
+#
+# Complete the 'plusMinus' function below.
+#
+# The function accepts INTEGER_ARRAY arr as parameter.
+#
+
+def plusMinus(arr):
+    numberLength=len(arr)
+    positiveCounter=0
+    negativeCounter=0
+    ceroCounter=0
+    
+    for number in arr:
+        if number>0:
+            positiveCounter+=1
+        elif number<0:
+            negativeCounter+=1
+        else:
+            ceroCounter+=1
+        
+    for number in [positiveCounter, negativeCounter, ceroCounter]:
+        print(number/numberLength)
+    
+if __name__ == '__main__':
+    n = int(input().strip())
+
+    arr = list(map(int, input().rstrip().split()))
+
+    plusMinus(arr)

three-month-preparation-kit/week1/time-conversion.py

@@ -0,0 +1,40 @@
+#!/bin/python3
+
+import math
+import os
+import random
+import re
+import sys
+
+#
+# Complete the 'timeConversion' function below.
+#
+# The function is expected to return a STRING.
+# The function accepts STRING s as parameter.
+#
+
+
+def timeConversion(s):
+    hourFormat = s[-2:]
+    militaryHour = int(s[:2])
+
+    if hourFormat == "AM":
+        if militaryHour >= 12:
+            militaryHour -= 12
+
+    elif militaryHour < 12:
+        militaryHour += 12
+
+    return f"{militaryHour:02}{s[2:-2]}"
+
+
+if __name__ == "__main__":
+    fptr = open(os.environ["OUTPUT_PATH"], "w")
+
+    s = input()
+
+    result = timeConversion(s)
+
+    fptr.write(result + "\n")
+
+    fptr.close()