Merge pull request #1 from dikshajoshi18/alpha

Alpha

Author: dikshajoshi18

.github/workflows/label.yml renamed to .github/workflows/labeler.yml

@@ -0,0 +1,86 @@
+'''# Problem: https://www.hackerrank.com/challenges/tutorial-intro/problem
+# Score: 30
+About Tutorial Challenges
+Many of the challenges on HackerRank are difficult and assume that you already know the relevant algorithms. These tutorial challenges are different. They break down algorithmic concepts into smaller challenges so that you can learn the algorithm by solving them. They are intended for those who already know some programming, however. You could be a student majoring in computer science, a self-taught programmer, or an experienced developer who wants an active algorithms review. Here's a great place to learn by doing!
+
+The first series of challenges covers sorting. They are listed below:
+
+Tutorial Challenges - Sorting
+
+Insertion Sort challenges
+
+Insertion Sort 1 - Inserting
+Insertion Sort 2 - Sorting
+Correctness and loop invariant
+Running Time of Algorithms
+Quicksort challenges
+
+Quicksort 1 - Partition
+Quicksort 2 - Sorting
+Quicksort In-place (advanced)
+Running time of Quicksort
+Counting sort challenges
+
+Counting Sort 1 - Counting
+Counting Sort 2 - Simple sort
+Counting Sort 3 - Preparing
+Full Counting Sort (advanced)
+There will also be some challenges where you'll get to apply what you've learned using the completed algorithms.
+
+About the Challenges
+Each challenge will describe a scenario and you will code a solution. As you progress through the challenges, you will learn some important concepts in algorithms. In each challenge, you will receive input on STDIN and you will need to print the correct output to STDOUT.
+
+There may be time limits that will force you to make your code efficient. If you receive a "Terminated due to time out" message when you submit your solution, you'll need to reconsider your method. If you want to test your code locally, each test case can be downloaded, inputs and expected results, using hackos. You earn hackos as you solve challenges, and you can spend them on these tests.
+
+For many challenges, helper methods (like an array) will be provided for you to process the input into a useful format. You can use these methods to get started with your program, or you can write your own input methods if you want. Your code just needs to print the right output to each test case.
+
+Sample Challenge
+This is a simple challenge to get things started. Given a sorted array () and a number (), can you print the index location of  in the array?
+
+For example, if  and , you would print  for a zero-based index array.
+
+If you are going to use the provided code for I/O, this next section is for you.
+
+Function Description
+
+Complete the introTutorial function in the editor below. It must return an integer representing the zero-based index of .
+
+introTutorial has the following parameter(s):
+
+arr: a sorted array of integers
+V: an integer to search for
+The next section describes the input format. You can often skip it, if you are using included methods or code stubs.
+
+Input Format
+
+The first line contains an integer, , a value to search for.
+The next line contains an integer, , the size of . The last line contains  space-separated integers, each a value of  where .
+
+Output Format
+Output the index of  in the array.
+
+The next section describes the constraints and ranges of the input. You should check this section to know the range of the input.
+
+Constraints
+
+It is guaranteed that  will occur in  exactly once.
+This "sample" shows the first input test case. It is often useful to go through the sample to understand a challenge.
+
+Sample Input 0
+
+4
+6
+1 4 5 7 9 12
+Sample Output 0
+
+1
+Explanation 0
+. The value  is the  element in the array, but its index is  since in this case, array indices start from  (see array definition under Input Format).
+'''
+v = int(input())
+n = int(input())
+arr = list(map(int, input().split()))
+i = 0
+while arr[i] != v:
+    i += 1
+print(i)

Algorithms/Intro to Tutorial Challenges.py

@@ -0,0 +1,58 @@
+'''# Problem: https://www.hackerrank.com/challenges/marcs-cakewalk/problem
+# Score: 15
+Marc loves cupcakes, but he also likes to stay fit. Each cupcake has a calorie count, and Marc can walk a distance to expend those calories. If Marc has eaten  cupcakes so far, after eating a cupcake with  calories he must walk at least  miles to maintain his weight.
+
+For example, if he eats  cupcakes with calorie counts in the following order: , the miles he will need to walk are . This is not the minimum, though, so we need to test other orders of consumption. In this case, our minimum miles is calculated as .
+
+Given the individual calorie counts for each of the cupcakes, determine the minimum number of miles Marc must walk to maintain his weight. Note that he can eat the cupcakes in any order.
+
+Function Description
+
+Complete the marcsCakewalk function in the editor below. It should return a long integer that represents the minimum miles necessary.
+
+marcsCakewalk has the following parameter(s):
+
+calorie: an integer array that represents calorie count for each cupcake
+Input Format
+
+The first line contains an integer , the number of cupcakes in .
+The second line contains  space-separated integers .
+
+Constraints
+
+Output Format
+
+Print a long integer denoting the minimum number of miles Marc must walk to maintain his weight.
+
+Sample Input 0
+
+3
+1 3 2
+Sample Output 0
+
+11
+Explanation 0
+
+Let's say the number of miles Marc must walk to maintain his weight is . He can minimize  by eating the  cupcakes in the following order:
+
+Eat the cupcake with  calories, so .
+Eat the cupcake with  calories, so .
+Eat the cupcake with  calories, so .
+We then print the final value of , which is , as our answer.
+
+Sample Input 1
+
+4
+7 4 9 6
+Sample Output 1
+
+79
+'''
+
+_ = input()
+calories = list(map(int, input().split()))
+calories = sorted(calories, reverse=True)
+ans = 0
+for index, cupcake in enumerate(calories):
+    ans += 2**index*cupcake
+print(ans)

Algorithms/Marc's Cakewalk.py

@@ -0,0 +1,66 @@
+'''# Problem: https://www.hackerrank.com/challenges/minimum-absolute-difference-in-an-array/problem
+# Score: 15
+Consider an array of integers, . We define the absolute difference between two elements,  and  (where ), to be the absolute value of .
+
+Given an array of integers, find and print the minimum absolute difference between any two elements in the array. For example, given the array  we can create  pairs of numbers:  and . The absolute differences for these pairs are ,  and . The minimum absolute difference is .
+
+Function Description
+
+Complete the minimumAbsoluteDifference function in the editor below. It should return an integer that represents the minimum absolute difference between any pair of elements.
+
+minimumAbsoluteDifference has the following parameter(s):
+
+n: an integer that represents the length of arr
+arr: an array of integers
+Input Format
+
+The first line contains a single integer , the size of .
+The second line contains  space-separated integers .
+
+Constraints
+
+Output Format
+
+Print the minimum absolute difference between any two elements in the array.
+
+Sample Input 0
+
+3
+3 -7 0
+Sample Output 0
+
+3
+Explanation 0
+
+With  integers in our array, we have three possible pairs: , , and . The absolute values of the differences between these pairs are as follows:
+
+Notice that if we were to switch the order of the numbers in these pairs, the resulting absolute values would still be the same. The smallest of these possible absolute differences is .
+
+Sample Input 1
+
+10
+-59 -36 -13 1 -53 -92 -2 -96 -54 75
+Sample Output 1
+
+1
+Explanation 1
+
+The smallest absolute difference is .
+
+Sample Input 2
+
+5
+1 -3 71 68 17
+Sample Output 2
+
+3
+Explanation 2
+
+The minimum absolute difference is '''
+
+_ = input()
+arr = sorted(map(int, input().split()))
+diff = 2*10**9
+for i in range(1, len(arr)):
+    diff = min(diff, arr[i] - arr[i-1])
+print(diff)

Algorithms/Minimum Absolute Difference in an Array.py

@@ -0,0 +1,62 @@
+'''# Problem: https://www.hackerrank.com/challenges/two-arrays/problem
+# Score: 40
+Consider two -element arrays of integers,  and . You want to permute them into some  and  such that the relation  holds for all  where . For example, if , , and , a valid  satisfying our relation would be  and ,  and .
+
+You are given  queries consisting of , , and . For each query, print YES on a new line if some permutation ,  satisfying the relation above exists. Otherwise, print NO.
+
+Function Description
+
+Complete the twoArrays function in the editor below. It should return a string, either YES or NO.
+
+twoArrays has the following parameter(s):
+
+k: an integer
+A: an array of integers
+B: an array of integers
+Input Format
+
+The first line contains an integer , the number of queries.
+
+The next  sets of  lines are as follows:
+
+The first line contains two space-separated integers  and , the size of both arrays  and , and the relation variable.
+The second line contains  space-separated integers .
+The third line contains  space-separated integers .
+Constraints
+
+Output Format
+
+For each query, print YES on a new line if valid permutations exist. Otherwise, print NO.
+
+Sample Input
+
+2
+3 10
+2 1 3
+7 8 9
+4 5
+1 2 2 1
+3 3 3 4
+Sample Output
+
+YES
+NO
+Explanation
+
+We perform the following two queries:
+
+, , and . We permute these into  and  so that the following statements are true:
+
+Thus, we print YES on a new line.
+
+, , and . To permute  and  into a valid  and , we would need at least three numbers in  to be greater than ; as this is not the case, we print NO on a new line.'''
+
+n = int(input())
+for _ in range(n):
+    __, k = map(int, input().split())
+    a = sorted(list(map(int, input().split())))
+    b = sorted(list(map(int, input().split())), reverse=True)
+    if all([a[i] + b[i] >= k for i in range(len(a))]):
+        print('YES')
+    else:
+        print('NO')

Algorithms/Permuting Two Arrays.py

@@ -0,0 +1,51 @@
+'''Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are.
+
+For example, there are  socks with colors . There is one pair of color  and one of color . There are three odd socks left, one of each color. The number of pairs is .
+
+Function Description
+
+Complete the sockMerchant function in the editor below. It must return an integer representing the number of matching pairs of socks that are available.
+
+sockMerchant has the following parameter(s):
+
+n: the number of socks in the pile
+ar: the colors of each sock
+Input Format
+
+The first line contains an integer , the number of socks represented in .
+The second line contains  space-separated integers describing the colors  of the socks in the pile.
+
+Constraints
+Output Format
+
+Return the total number of matching pairs of socks that Alex can sell.
+
+Sample Input
+
+9
+10 20 20 10 10 30 50 10 20
+Sample Output
+
+3
+Explanation
+
+sock.png
+
+Alex can match three pairs of socks'''
+
+#solution
+def sockMerchant(n, ar):
+    return sum([ar.count(i)//2 for i in set(ar)])
+
+if __name__ == '__main__':
+    fptr = open(os.environ['OUTPUT_PATH'], 'w')
+
+    n = int(input())
+
+    ar = list(map(int, input().rstrip().split()))
+
+    result = sockMerchant(n, ar)
+
+    fptr.write(str(result) + '\n')
+
+    fptr.close()

Python/Sales by Match.py

@@ -0,0 +1,45 @@
+'''
+An extra day is added to the calendar almost every four years as February 29, and the day is called a leap day. It corrects the calendar for the fact that our planet takes approximately 365.25 days to orbit the sun. A leap year contains a leap day.
+
+In the Gregorian calendar, three conditions are used to identify leap years:
+
+The year can be evenly divided by 4, is a leap year, unless:
+The year can be evenly divided by 100, it is NOT a leap year, unless:
+The year is also evenly divisible by 400. Then it is a leap year.
+This means that in the Gregorian calendar, the years 2000 and 2400 are leap years, while 1800, 1900, 2100, 2200, 2300 and 2500 are NOT leap years. Source
+
+Task
+
+Given a year, determine whether it is a leap year. If it is a leap year, return the Boolean True, otherwise return False.
+
+Note that the code stub provided reads from STDIN and passes arguments to the is_leap function. It is only necessary to complete the is_leap function.
+
+Input Format
+
+Read , the year to test.
+
+Constraints
+
+
+Output Format
+
+The function must return a Boolean value (True/False). Output is handled by the provided code stub.
+
+Sample Input 0
+
+1990
+Sample Output 0
+
+False
+Explanation 0
+
+1990 is not a multiple of 4 hence it's not a leap year.'''
+
+def is_leap(year):
+    leapyear = False
+    if (((year%4==0 and year%100!=0) or year%400==0) and year>=1900):
+                leapyear=True
+    return leapyear
+
+year = int(input())
+print(is_leap(year))