Tech Highland

Download Remove China Apps By OneTouchAppLabs

2020-06-03T16:24:00.001+05:30

Name of Application	Remove China Apps
Owner Name	OneTouch AppLabs
Country Name	India
Size of App	3.3 MB
Current Rating	4.9 Star (Rated for 3+)
Category of App	Boycott Chinese Products India
Platform	Android & iOS

Validating Credit Card Numbers - Hacker Rank Problem Solution Python Code

2020-05-10T22:16:00.001+05:30

You and Fredrick are good friends. Yesterday, Fredrick received

credit cards from ABCD Bank. He wants to verify whether his credit card numbers are valid or not. You happen to be great at regex so he is asking for your help!

A valid credit card from ABCD Bank has the following characteristics:

► It must start with a

.
► It must contain exactly

digits.
► It must only consist of digits (

).
► It may have digits in groups of

, separated by one hyphen "

".
► It must NOT use any other separator like '

' , '_', etc.
► It must NOT have

or more consecutive repeated digits.

Examples:

Valid Credit Card Numbers

4253625879615786
4424424424442444
5122-2368-7954-3214

Invalid Credit Card Numbers

42536258796157867       #17 digits in card number → Invalid 
4424444424442444        #Consecutive digits are repeating 4 or more times → Invalid
5122-2368-7954 - 3214   #Separators other than '-' are used → Invalid
44244x4424442444        #Contains non digit characters → Invalid
0525362587961578        #Doesn't start with 4, 5 or 6 → Invalid

Input Format

The first line of input contains an integer

.
The next

lines contain credit card numbers.

Constraints

Output Format

Print 'Valid' if the credit card number is valid. Otherwise, print 'Invalid'. Do not print the quotes.

Sample Input

6
4123456789123456
5123-4567-8912-3456
61234-567-8912-3456
4123356789123456
5133-3367-8912-3456
5123 - 3567 - 8912 - 3456

Sample Output

Valid
Valid
Invalid
Valid
Invalid
Invalid

Explanation

4123456789123456 : Valid
5123-4567-8912-3456 : Valid
61234

-8912-3456 : Invalid, because the card number is not divided into equal groups of

.
4123356789123456 : Valid
51

67-8912-3456 : Invalid, consecutive digits

is repeating

times.
5123

4567

8912

3456 : Invalid, because space '

' and - are used as separators.

# Enter your code here. Read input from STDIN. Print output to STDOUTdef AllDigits(credit_card):
    for digit in credit_card:
        if '0' <= digit <= '9':
            pass        else:
            return False    return True

def ConsecutiveRepeatedDigits(credit_card):
    count = 1    for i in range(15):
        if credit_card[i] == credit_card[i + 1]:
            count += 1            if count == 4:
                return True        else:
            count = 1    return False

def DigitsAndHyphenOnly(credit_card):
    for digit in credit_card:
        if digit == '-' or ('0' <= digit <= '9'):
            pass        else:
            return False    return True

def DigitsSepratedCorrectly(credit_card):
    for i in range(4, len(credit_card), 5):
        if credit_card[i] != '-':
            return False    return True

for i in range(int(input())):
    credit_card = input()
    if AllDigits(credit_card) == True:
        if len(credit_card) != 16:
            print("Invalid")
        elif not ('4' <= credit_card[0] <= '6'):
            print("Invalid")
        elif ConsecutiveRepeatedDigits(credit_card) == True:
            print("Invalid")
        else:
            print("Valid")
    elif DigitsAndHyphenOnly(credit_card) == True:
        if DigitsSepratedCorrectly(credit_card) == False:
            print("Invalid")
        else:
            credit_card = credit_card.split('-')
            credit_card = ''.join(credit_card)
            if len(credit_card) != 16:
                print("Invalid")
            elif not ('4' <= credit_card[0] <= '6'):
                print("Invalid")
            elif ConsecutiveRepeatedDigits(credit_card) == True:
                print("Invalid")
            else:
                print("Valid")
    else:
        print("Invalid")

Validating UID - Hacker rank python code solution

2020-05-10T21:32:00.000+05:30

ABCXYZ company has up to

employees.
The company decides to create a unique identification number (UID) for each of its employees.
The company has assigned you the task of validating all the randomly generated UIDs.

A valid UID must follow the rules below:

It must contain at least uppercase English alphabet characters.
It must contain at least digits ( - ).
It should only contain alphanumeric characters ( - , - & - ).
No character should repeat.
There must be exactly characters in a valid UID.

Input Format

The first line contains an integer

, the number of test cases.
The next

lines contains an employee's UID.

Output Format

For each test case, print 'Valid' if the UID is valid. Otherwise, print 'Invalid', on separate lines. Do not print the quotation marks.

Sample Input

2
B1CD102354
B1CDEF2354

Sample Output

Invalid
Valid

Explanation

B1CD102354:

is repeating → Invalid
B1CDEF2354: Valid

# Enter your code here. Read input from STDIN. Print output to STDOUT
def UpperCaseCount(UID):
    count = 0    for letter in UID:
        if 'A' <= letter <= 'Z':
            count += 1    return count
def DigitCount(UID):
    count = 0    for letter in UID:
        if '0' <= letter <= '9':
            count += 1    return count

def AnyCharRepeated(UID):
    for char in UID:
        if UID.count(char) >1:
            return True    return False
for i in range(int(input())):
    UID = input()
    if len(UID) != 10:
        print("Invalid")
    elif UID.isalnum() == False:
        print("Invalid")
    elif UpperCaseCount(UID) < 2:
        print("Invalid")
    elif DigitCount(UID) < 3:
        print("Invalid")
    elif AnyCharRepeated(UID) == True:
        print("Invalid")
    else:
        print("Valid")

Detect HTML Tags, Attributes and Attribute Values - Hacker Rank Python Code

2020-05-10T20:51:00.000+05:30

You are given an HTML code snippet of

lines.
Your task is to detect and print all the HTML tags, attributes and attribute values.

Print the detected items in the following format:

Tag1
Tag2
-> Attribute2[0] > Attribute_value2[0]
-> Attribute2[1] > Attribute_value2[1]
-> Attribute2[2] > Attribute_value2[2]
Tag3
-> Attribute3[0] > Attribute_value3[0]

The -> symbol indicates that the tag contains an attribute. It is immediately followed by the name of the attribute and the attribute value.
The > symbol acts as a separator of attributes and attribute values.

If an HTML tag has no attribute then simply print the name of the tag.

Note: Do not detect any HTML tag, attribute or attribute value inside the HTML comment tags (). Comments can be multiline.
All attributes have an attribute value.

Input Format

The first line contains an integer

, the number of lines in the HTML code snippet.
The next

lines contain HTML code.

Constraints

Output Format

Print the HTML tags, attributes and attribute values in order of their occurrence from top to bottom in the snippet.

Format your answers as explained in the problem statement.

Sample Input

9
<head>
<title>HTML</title>
</head>
<object type="application/x-flash" 
  data="your-file.swf" 
  width="0" height="0">
  <!-- <param name="movie" value="your-file.swf" /> -->
  <param name="quality" value="high"/>
</object>

Sample Output

head
title
object
-> type > application/x-flash
-> data > your-file.swf
-> width > 0
-> height > 0
param
-> name > quality
-> value > high

Explanation

head tag: Print the head tag only because it has no attribute.
title tag: Print the title tag only because it has no attribute.
object tag: Print the object tag. In the next lines, print the attributes type, data, width and height along with their respective values.
tag: Don't detect anything inside it.
param tag: Print the param tag. In the next lines, print the attributes name along with their respective values.

from html.parser import HTMLParser


class MyHTMLParser(HTMLParser):
    def handle_starttag(self, tag, attrs):
        print(tag)
        for at in attrs:
            print("-> {} > {}".format(at[0], at[1]))

    def handle_startendtag(self, tag, attrs):
        print(tag)
        for at in attrs:
            print("-> {} > {}".format(at[0], at[1]))


html = ""for i in range(int(input())):
    html += input().rstrip()
    html += '\n'
parser = MyHTMLParser()
parser.feed(html)
parser.close()

Triangle Quest - Hacker rank python code solution

2020-05-10T20:23:00.002+05:30

You are given a positive integer

. Print a numerical triangle of height

like the one below:

1
22
333
4444
55555
......

Can you do it using only arithmetic operations, a single for loop and print statement?

Use no more than two lines. The first line (the for statement) is already written for you. You have to complete the print statement.

Note: Using anything related to strings will give a score of

Input Format
A single line containing integer,

Constraints

Output Format
Print

lines as explained above.

Sample Input

Sample Output



for i in range(1,int(input())): #More than 2 lines will result in 0 score. Do not leave a blank line also    print(i*(10**i-1)//9)

Mod Divmod - Hacker rank python solution code

2020-05-10T19:55:00.000+05:30

One of the built-in functions of Python is divmod, which takes two arguments

and

and returns a tuple containing the quotient of

first and then the remainder

For example:

>>> print divmod(177,10)
(17, 7)

Here, the integer division is 177/10 => 17 and the modulo operator is 177%10 => 7.

Task
Read in two integers,

and

, and print three lines.
The first line is the integer division

(While using Python2 remember to import division from __future__).
The second line is the result of the modulo operator:

.
The third line prints the divmod of

and

Input Format
The first line contains the first integer,

, and the second line contains the second integer,

Output Format
Print the result as described above.

Sample Input

177
10

Sample Output

17
7
(17, 7)



# Enter your code here. Read input from STDIN. Print output to STDOUTa = int(input())
b = int(input())
print(a//b)
print(a%b)
print(divmod(a, b))

Finding the percentage - Hacker rank solution code python

2020-05-10T19:50:00.004+05:30

You have a record of

students. Each record contains the student's name, and their percent marks in Maths, Physics and Chemistry. The marks can be floating values. The user enters some integer

followed by the names and marks for

students. You are required to save the record in a dictionary data type. The user then enters a student's name. Output the average percentage marks obtained by that student, correct to two decimal places.

Input Format

The first line contains the integer

, the number of students. The next

lines contains the name and marks obtained by that student separated by a space. The final line contains the name of a particular student previously listed.

Constraints

Output Format

Print one line: The average of the marks obtained by the particular student correct to 2 decimal places.

Sample Input 0

3
Krishna 67 68 69
Arjun 70 98 63
Malika 52 56 60
Malika

Sample Output 0

56.00

Explanation 0

Marks for Malika are

whose average is

Sample Input 1

2
Harsh 25 26.5 28
Anurag 26 28 30
Harsh

Sample Output 1

26.50



import math
if __name__ == '__main__':
    n = int(input())
    student_marks = {}
    for _ in range(n):
        name, *line = input().split()
        scores = list(map(float, line))
        student_marks[name] = scores
    query_name = input()

value = student_marks[query_name]

print(format(sum(value)/len(value),'.2f'))

Find the Runner-Up Score! - Hacker Rank Solution Python Code

2020-05-09T17:08:00.000+05:30

Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given

scores. Store them in a list and find the score of the runner-up.

Input Format

The first line contains

. The second line contains an array

integers each separated by a space.

Constraints

Output Format

Print the runner-up score.

Sample Input 0

5
2 3 6 6 5

Sample Output 0

Explanation 0

Given list is

. The maximum score is

, second maximum is

. Hence, we print

as the runner-up score.

if __name__ == '__main__':
    n = int(input())
    arr = map(int, input().split())
    arr = arr = list(dict.fromkeys(arr))
    arr.sort(reverse=True)
    print(arr[1])

List Comprehensions - Hacker rank python solution code

2020-05-09T17:00:00.001+05:30

Let's learn about list comprehensions! You are given three integers

and

representing the dimensions of a cuboid along with an integer

. You have to print a list of all possible coordinates given by

on a 3D grid where the sum of

is not equal to

. Here,

Input Format

Four integers

and

each on four separate lines, respectively.

Constraints

Print the list in lexicographic increasing order.

Sample Input 0

Sample Output 0

[[0, 0, 0], [0, 0, 1], [0, 1, 0], [1, 0, 0], [1, 1, 1]]

Explanation 0

Concept

You have already used lists in previous hacks. List comprehensions are an elegant way to build a list without having to use different for loops to append values one by one. This example might help.

Example: You are given two integers x and y . You need to find out the ordered pairs ( i , j ) , such that ( i + j ) is not equal to n and print them in lexicographic order.( 0 <= i <= x ) and ( 0 <= j <= y) This is the code if we dont use list comprehensions in Python.

python x = int ( raw_input()) y = int ( raw_input()) n = int ( raw_input()) ar = [] p = 0 for i in range ( x + 1 ) : for j in range( y + 1): if i+j != n: ar.append([]) ar[p] = [ i , j ] p+=1 print ar

Other smaller codes may also exist, but using list comprehensions is always a good option. Code using list comprehensions:

python x = int ( raw_input()) y = int ( raw_input()) n = int ( raw_input()) print [ [ i, j] for i in range( x + 1) for j in range( y + 1) if ( ( i + j ) != n )]

Sample Input 1

Sample Output 1

[[0, 0, 0], [0, 0, 1], [0, 1, 0], [0, 1, 2], [0, 2, 1], [0, 2, 2], [1, 0, 0], [1, 0, 2], [1, 1, 1], [1, 1, 2], [1, 2, 0], [1, 2, 1], [1, 2, 2], [2, 0, 1], [2, 0, 2], [2, 1, 0], [2, 1, 1], [2, 1, 2], [2, 2, 0], [2, 2, 1], [2, 2, 2]]



if __name__ == '__main__':
    x = int(input())
    y = int(input())
    z = int(input())
    n = int(input())

    list_coordinates = [[i,j,k] for i in range(x+1) for j in range(y+1) for k in range(z+1) if i+j+k != n]

    print(list_coordinates)

Print Function - Hacker rank python problem solution code

2020-05-09T13:05:00.002+05:30

Check Tutorial tab to know how to to solve.

Read an integer

Without using any string methods, try to print the following:

Note that "

" represents the values in between.

Input Format

The first line contains an integer

Output Format

Output the answer as explained in the task.

Sample Input 0

Sample Output 0



if __name__ == '__main__':
    n = int(input())
    for i in range(1,n+1):
        print(i,end='')

Write a function - Hacker rank python problem solution

2020-05-09T12:58:00.002+05:30

We add a Leap Day on February 29, almost every four years. The leap day is an extra, or intercalary day and we add it to the shortest month of the year, February.
In the Gregorian calendar three criteria must be taken into account 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
You are given the year, and you have to write a function to check if the year is leap or not.

Note that you have to complete the function and remaining code is given as template.

Input Format

Read y, the year that needs to be checked.

Constraints

Output Format

Output is taken care of by the template. Your function must return a boolean value (True/False)

Sample Input 0

Sample Output 0

False

Explanation 0

1990 is not a multiple of 4 hence it's not a leap year.

def is_leap(year):
    if year%4 == 0 and year%100 != 0:
        return True    elif year%400 == 0:
        return True    return False
year = int(input())
print(is_leap(year))

Day 20: Sorting - Hacker Rank Solution (Python) Code

2020-05-06T21:39:00.001+05:30

Objective
Today, we're discussing a simple sorting algorithm called Bubble Sort. Check out the Tutorial tab for learning materials and an instructional video!

Consider the following version of Bubble Sort:

for (int i = 0; i < n; i++) {
    // Track number of elements swapped during a single array traversal
    int numberOfSwaps = 0;
    
    for (int j = 0; j < n - 1; j++) {
        // Swap adjacent elements if they are in decreasing order
        if (a[j] > a[j + 1]) {
            swap(a[j], a[j + 1]);
            numberOfSwaps++;
        }
    }
    
    // If no elements were swapped during a traversal, array is sorted
    if (numberOfSwaps == 0) {
        break;
    }
}

Task
Given an array,

, of size

distinct elements, sort the array in ascending order using the Bubble Sort algorithm above. Once sorted, print the following

lines:

Array is sorted in numSwaps swaps.
where is the number of swaps that took place.
First Element: firstElement
where is the first element in the sorted array.
Last Element: lastElement
where is the last element in the sorted array.

Hint: To complete this challenge, you will need to add a variable that keeps a running tally of all swaps that occur during execution.

Input Format

The first line contains an integer,

, denoting the number of elements in array

.
The second line contains

space-separated integers describing the respective values of

Constraints

, where .

Output Format

Print the following three lines of output:

Array is sorted in numSwaps swaps.
where is the number of swaps that took place.
First Element: firstElement
where is the first element in the sorted array.
Last Element: lastElement
where is the last element in the sorted array.

Sample Input 0

3
1 2 3

Sample Output 0

Array is sorted in 0 swaps.
First Element: 1
Last Element: 3

Explanation 0

The array is already sorted, so

swaps take place and we print the necessary

lines of output shown above.

Sample Input 1

3
3 2 1

Sample Output 1

Array is sorted in 3 swaps.
First Element: 1
Last Element: 3

Explanation 1

The array

is not sorted, so we perform the following

swaps:

At this point the array is sorted and we print the necessary

lines of output shown above.

#!/bin/python3
import sys

n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
# Write Your Code Here
count = 0
for i in range(len(a)-1):
    for j in range(0,len(a)-1):
        if a[j] > a[j+1]:
            a[j], a[j+1] = a[j+1], a[j]
            count += 1
print('Array is sorted in {} swaps.'.format(count))
print('First Element: {}'.format(a[0]))
print('Last Element: {}'.format(a[-1]))

Day 19: Interfaces - Hacker Rank Solution (Python) Code

2020-05-06T21:19:00.003+05:30

Objective
Today, we're learning about Interfaces. Check out the Tutorial tab for learning materials and an instructional video!

Task
The AdvancedArithmetic interface and the method declaration for the abstract divisorSum(n) method are provided for you in the editor below.

Complete the implementation of Calculator class, which implements the AdvancedArithmetic interface. The implementation for the divisorSum(n) method must return the sum of all divisors of

Input Format

A single line containing an integer,

Constraints

Output Format

You are not responsible for printing anything to stdout. The locked template code in the editor below will call your code and print the necessary output.

Sample Input

Sample Output

I implemented: AdvancedArithmetic
12

Explanation

The integer

is evenly divisible by

, and

. Our divisorSum method should return the sum of these numbers, which is

. The Solution class then prints

on the first line, followed by the sum returned by divisorSum (which is

) on the second line.

class AdvancedArithmetic(object):
    def divisorSum(n):
        raise NotImplementedError
class Calculator(AdvancedArithmetic):
    def divisorSum(self, n):
        sum = 0        for i in range(1,n+1):
            if n%i == 0:
                sum += i
        return sum

n = int(input())
my_calculator = Calculator()
s = my_calculator.divisorSum(n)
print("I implemented: " + type(my_calculator).__bases__[0].__name__)
print(s)

Day 18: Queues and Stacks - Hacker Rank Solution (Python) Code

2020-05-06T21:11:00.001+05:30

Welcome to Day 18! Today we're learning about Stacks and Queues. Check out the Tutorial tab for learning materials and an instructional video!

A palindrome is a word, phrase, number, or other sequence of characters which reads the same backwards and forwards. Can you determine if a given string,

, is a palindrome?

To solve this challenge, we must first take each character in

, enqueue it in a queue, and also push that same character onto a stack. Once that's done, we must dequeue the first character from the queue and pop the top character off the stack, then compare the two characters to see if they are the same; as long as the characters match, we continue dequeueing, popping, and comparing each character until our containers are empty (a non-match means

isn't a palindrome).

Write the following declarations and implementations:

Two instance variables: one for your , and one for your .
A void pushCharacter(char ch) method that pushes a character onto a stack.
A void enqueueCharacter(char ch) method that enqueues a character in the instance variable.
A char popCharacter() method that pops and returns the character at the top of the instance variable.
A char dequeueCharacter() method that dequeues and returns the first character in the instance variable.

Input Format

You do not need to read anything from stdin. The locked stub code in your editor reads a single line containing string

. It then calls the methods specified above to pass each character to your instance variables.

Constraints

is composed of lowercase English letters.

Output Format

You are not responsible for printing any output to stdout.
If your code is correctly written and

is a palindrome, the locked stub code will print

; otherwise, it will print

Sample Input

racecar

Sample Output

The word, racecar, is a palindrome.

import sys
from queue import LifoQueue
from queue import Queue


class Solution:
    stack = LifoQueue(maxsize=0)
    queue = Queue(maxsize=0)

    # Write your code here    def pushCharacter(self, char):
        Solution.stack.put(char)

    def enqueueCharacter(self, char):
        Solution.queue.put(char)

    def popCharacter(self):
        return Solution.stack.get()

    def dequeueCharacter(self):
        return Solution.queue.get()


# read the string ss = input()
# Create the Solution class objectobj = Solution()

l = len(s)
# push/enqueue all the characters of string s to stackfor i in range(l):
    obj.pushCharacter(s[i])
    obj.enqueueCharacter(s[i])

isPalindrome = True'''pop the top character from stackdequeue the first character from queuecompare both the characters'''for i in range(l // 2):
    if obj.popCharacter() != obj.dequeueCharacter():
        isPalindrome = False        break# finally print whether string s is palindrome or not.if isPalindrome:
    print("The word, " + s + ", is a palindrome.")
else:
    print("The word, " + s + ", is not a palindrome.")

Day 17: More Exceptions - Hacker Rank solutions (Python) code

2020-05-06T20:37:00.003+05:30

Objective
Yesterday's challenge taught you to manage exceptional situations by using try and catch blocks. In today's challenge, you're going to practice throwing and propagating an exception. Check out the Tutorial tab for learning materials and an instructional video!

Task
Write a Calculator class with a single method: int power(int,int). The power method takes two integers,

and

, as parameters and returns the integer result of

. If either

is negative, then the method must throw an exception with the message: n and p should be non-negative.

Note: Do not use an access modifier (e.g.: public) in the declaration for your Calculator class.

Input Format

Input from stdin is handled for you by the locked stub code in your editor. The first line contains an integer,

, the number of test cases. Each of the

subsequent lines describes a test case in

space-separated integers denoting

and

, respectively.

Constraints

No Test Case will result in overflow for correctly written code.

Output Format

Output to stdout is handled for you by the locked stub code in your editor. There are

lines of output, where each line contains the result of

as calculated by your Calculator class' power method.

Sample Input

Sample Output

243
16
n and p should be non-negative
n and p should be non-negative

Explanation

and

are positive, so power returns the result of

, which is

and

are positive, so power returns the result of

=, which is

: Both inputs (

and

) are negative, so power throws an exception and

is printed.

: One of the inputs (

) is negative, so power throws an exception and

is printed.

#Write your code hereclass Calculator:
    def power(self,n,p):
        if n < 0 or p < 0:
            raise ValueError('n and p should be non-negative')
        else:
            return n**p


myCalculator=Calculator()
T=int(input())
for i in range(T):
    n,p = map(int, input().split())
    try:
        ans=myCalculator.power(n,p)
        print(ans)
    except Exception as e:
        print(e)

Day 16: Exceptions - String to Integer - Hackerrank solution (Python) code

2020-05-06T18:29:00.001+05:30

Objective
Today, we're getting started with Exceptions by learning how to parse an integer from a string and print a custom error message. Check out the Tutorial tab for learning materials and an instructional video!

Task
Read a string,

, and print its integer value; if

cannot be converted to an integer, print Bad String.

Note: You must use the String-to-Integer and exception handling constructs built into your submission language. If you attempt to use loops/conditional statements, you will get a

score.

Input Format

A single string,

Constraints

, where is the length of string .
is composed of either lowercase letters () or decimal digits ().

Output Format

Print the parsed integer value of

, or Bad String if

cannot be converted to an integer.

Sample Input 0

Sample Output 0

Sample Input 1

za

Sample Output 1

Bad String

Explanation

Sample Case

contains an integer, so it should not raise an exception when we attempt to convert it to an integer. Thus, we print the

.
Sample Case

does not contain any integers, so an attempt to convert it to an integer will raise an exception. Thus, our exception handler prints Bad String.

#!/bin/python3
import sys


S = input().strip()

try:
    print(int(S))
except:
    print('Bad String')

Picking Numbers - Hacker rank solution (Python) code

2020-05-06T01:38:00.000+05:30

Given an array of integers, find and print the maximum number of integers you can select from the array such that the absolute difference between any two of the chosen integers is less than or equal to

. For example, if your array is

, you can create two subarrays meeting the criterion:

and

. The maximum length subarray has

elements.

Function Description

Complete the pickingNumbers function in the editor below. It should return an integer that represents the length of the longest array that can be created.

pickingNumbers has the following parameter(s):

a: an array of integers

Input Format

The first line contains a single integer

, the size of the array

.
The second line contains

space-separated integers

Constraints

The answer will be .

Output Format

A single integer denoting the maximum number of integers you can choose from the array such that the absolute difference between any two of the chosen integers is

Sample Input 0

6
4 6 5 3 3 1

Sample Output 0

Explanation 0

We choose the following multiset of integers from the array:

. Each pair in the multiset has an absolute difference

(i.e.,

and

), so we print the number of chosen integers,

, as our answer.

Sample Input 1

6
1 2 2 3 1 2

Sample Output 1

Explanation 1

We choose the following multiset of integers from the array:

. Each pair in the multiset has an absolute difference

(i.e.,

, and

), so we print the number of chosen integers,

, as our answer.

#!/bin/python3
import math
import os
import random
import re
import sys

## Complete the 'pickingNumbers' function below.## The function is expected to return an INTEGER.# The function accepts INTEGER_ARRAY a as parameter.#
def pickingNumbers(a):
    count_list = [1]
    a.sort(reverse=True)
    for i in range(len(a)):
        count = 0        for j in range(i+1, len(a)):
            if a[i] - a[j] <= 1:
                count += 1        count_list.append(count+1)
    return max(count_list)


if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input().strip())

    a = list(map(int, input().rstrip().split()))

    result = pickingNumbers(a)

    fptr.write(str(result) + '\n')

    fptr.close()

Forming a Magic Square - Hacker rank solution (Python) code

2020-05-06T01:08:00.002+05:30

Problem

We define a magic square to be an

matrix of distinct positive integers from

where the sum of any row, column, or diagonal of length

is always equal to the same number: the magic constant.

You will be given a

matrix

of integers in the inclusive range

. We can convert any digit

to any other digit

in the range

at cost of

. Given

, convert it into a magic square at minimal cost. Print this cost on a new line.

Note: The resulting magic square must contain distinct integers in the inclusive range

For example, we start with the following matrix

5 3 4
1 5 8
6 4 2

We can convert it to the following magic square:

8 3 4
1 5 9
6 7 2

This took three replacements at a cost of

Function Description

Complete the formingMagicSquare function in the editor below. It should return an integer that represents the minimal total cost of converting the input square to a magic square.

formingMagicSquare has the following parameter(s):

s: a array of integers

Input Format

Each of the lines contains three space-separated integers of row

Constraints

Output Format

Print an integer denoting the minimum cost of turning matrix

into a magic square.

Sample Input 0

4 9 2
3 5 7
8 1 5

Sample Output 0

Explanation 0

If we change the bottom right value,

, from

at a cost of

becomes a magic square at the minimum possible cost.

Sample Input 1

4 8 2
4 5 7
6 1 6

Sample Output 1

Explanation 1

Using 0-based indexing, if we make

-> at a cost of
-> at a cost of
-> at a cost of ,

then the total cost will be

#!/bin/python3
import math
import os
import random
import re
import sys

# Complete the formingMagicSquare function below.def formingMagicSquare(s):
    one_d_array = []

    for item in s:
        one_d_array += item

    possible_combinations = [[2, 7, 6, 9, 5, 1, 4, 3, 8],                             [2, 9, 4, 7, 5, 3, 6, 1, 8],                             [4, 3, 8, 9, 5, 1, 2, 7, 6],                             [4, 9, 2, 3, 5, 7, 8, 1, 6],                             [6, 1, 8, 7, 5, 3, 2, 9, 4],                             [6, 7, 2, 1, 5, 9, 8, 3, 4],                             [8, 1, 6, 3, 5, 7, 4, 9, 2],                             [8, 3, 4, 1, 5, 9, 6, 7, 2]]
    cost = []

    for item in possible_combinations:
        temp_sum = 0        for i in range(9):
            temp_sum += abs(item[i]-one_d_array[i])
        cost.append(temp_sum)

    return min(cost)



if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    s = []

    for _ in range(3):
        s.append(list(map(int, input().rstrip().split())))

    result = formingMagicSquare(s)

    fptr.write(str(result) + '\n')

    fptr.close()

Cats and a Mouse - Hackerrank Solution (Python) code 2020

2020-05-05T18:07:00.000+05:30

Two cats and a mouse are at various positions on a line. You will be given their starting positions. Your task is to determine which cat will reach the mouse first, assuming the mouse doesn't move and the cats travel at equal speed. If the cats arrive at the same time, the mouse will be allowed to move and it will escape while they fight.

You are given

queries in the form of

, and

representing the respective positions for cats

and

, and for mouse

. Complete the function

to return the appropriate answer to each query, which will be printed on a new line.

If cat catches the mouse first, print Cat A.
If cat catches the mouse first, print Cat B.
If both cats reach the mouse at the same time, print Mouse C as the two cats fight and mouse escapes.

For example, cat

is at position

and cat

is at

. If mouse

is at position

, it is

units from cat

and

unit from cat

. Cat

will catch the mouse.

Function Description

Complete the catAndMouse function in the editor below. It should return one of the three strings as described.

catAndMouse has the following parameter(s):

x: an integer, Cat 's position
y: an integer, Cat 's position
z: an integer, Mouse 's position

Input Format

The first line contains a single integer,

, denoting the number of queries.
Each of the

subsequent lines contains three space-separated integers describing the respective values of

(cat

's location),

(cat

's location), and

(mouse

's location).

Constraints

Output Format

For each query, return Cat A if cat

catches the mouse first, Cat B if cat

catches the mouse first, or Mouse C if the mouse escapes.

Sample Input 0

2
1 2 3
1 3 2

Sample Output 0

Cat B
Mouse C

Explanation 0

Query 0: The positions of the cats and mouse are shown below:

Cat

will catch the mouse first, so we print Cat B on a new line.

Query 1: In this query, cats

and

reach mouse

at the exact same time:

Because the mouse escapes, we print Mouse C on a new line.

#!/bin/python3
import math
import os
import random
import re
import sys

# Complete the catAndMouse function below.def catAndMouse(x, y, z):
    if abs(z-x) == abs(z-y):
        return 'Mouse C'    elif abs(z-x) < abs(z-y):
        return 'Cat A'    else:
        return 'Cat B'

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    q = int(input())

    for q_itr in range(q):
        xyz = input().split()

        x = int(xyz[0])

        y = int(xyz[1])

        z = int(xyz[2])

        result = catAndMouse(x, y, z)

        fptr.write(result + '\n')

    fptr.close()

Electronics Shop - Hackerrank Solution (Python) code

2020-05-05T17:56:00.000+05:30

Monica wants to buy a keyboard and a USB drive from her favorite electronics store. The store has several models of each. Monica wants to spend as much as possible for the

items, given her budget.

Given the price lists for the store's keyboards and USB drives, and Monica's budget, find and print the amount of money Monica will spend. If she doesn't have enough money to both a keyboard and a USB drive, print -1 instead. She will buy only the two required items.

For example, suppose she has

to spend. Three types of keyboards cost

. Two USB drives cost

. She could purchase a

, or a

. She chooses the latter. She can't buy more than

items so she can't spend exactly

Function Description

Complete the getMoneySpent function in the editor below. It should return the maximum total price for the two items within Monica's budget, or

if she cannot afford both items.

getMoneySpent has the following parameter(s):

keyboards: an array of integers representing keyboard prices
drives: an array of integers representing drive prices
b: the units of currency in Monica's budget

Input Format

The first line contains three space-separated integers

, and

, her budget, the number of keyboard models and the number of USB drive models.
The second line contains

space-separated integers

, the prices of each keyboard model.
The third line contains

space-separated integers

, the prices of the USB drives.

Constraints

The price of each item is in the inclusive range .

Output Format

Print a single integer denoting the amount of money Monica will spend. If she doesn't have enough money to buy one keyboard and one USB drive, print -1 instead.

Sample Input 0

10 2 3
3 1
5 2 8

Sample Output 0

Explanation 0

She can buy the

keyboard and the

USB drive for a total cost of

Sample Input 1

5 1 1
4
5

Sample Output 1

-1

Explanation 1

There is no way to buy one keyboard and one USB drive because

, so we print

#!/bin/python3
import os
import sys

## Complete the getMoneySpent function below.#def getMoneySpent(keyboards, drives, b):
    all_prices = []
    for keyboard in keyboards:
        for drive in drives:
            all_prices.append(keyboard+drive)    
    all_prices.sort(reverse=True)
    for combine_price in all_prices:
        if combine_price <= b:
            return combine_price
    return -1
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    bnm = input().split()

    b = int(bnm[0])

    n = int(bnm[1])

    m = int(bnm[2])

    keyboards = list(map(int, input().rstrip().split()))

    drives = list(map(int, input().rstrip().split()))

    #    # The maximum amount of money she can spend on a keyboard and USB drive, or -1 if she can't purchase both items    #
    moneySpent = getMoneySpent(keyboards, drives, b)

    fptr.write(str(moneySpent) + '\n')

    fptr.close()

Counting Valleys - Hackerrank Solution (Python) Code

2020-05-05T16:04:00.002+05:30

Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike he took exactly

steps. For every step he took, he noted if it was an uphill,

, or a downhill,

step. Gary's hikes start and end at sea level and each step up or down represents a

unit change in altitude. We define the following terms:

A mountain is a sequence of consecutive steps above sea level, starting with a step up from sea level and ending with a step down to sea level.
A valley is a sequence of consecutive steps below sea level, starting with a step down from sea level and ending with a step up to sea level.

Given Gary's sequence of up and down steps during his last hike, find and print the number of valleys he walked through.

For example, if Gary's path is

, he first enters a valley

units deep. Then he climbs out an up onto a mountain

units high. Finally, he returns to sea level and ends his hike.

Function Description

Complete the countingValleys function in the editor below. It must return an integer that denotes the number of valleys Gary traversed.

countingValleys has the following parameter(s):

n: the number of steps Gary takes
s: a string describing his path

Input Format

The first line contains an integer

, the number of steps in Gary's hike.
The second line contains a single string

, of

characters that describe his path.

Constraints

Output Format

Print a single integer that denotes the number of valleys Gary walked through during his hike.

Sample Input

8
UDDDUDUU

Sample Output

Explanation

If we represent _ as sea level, a step up as /, and a step down as \, Gary's hike can be drawn as:

_/\      _
   \    /
    \/\/

He enters and leaves one valley.

#!/bin/python3
import math
import os
import random
import re
import sys

# Complete the countingValleys function below.def countingValleys(n, s):
    d_count = u_count = no_of_vallyes = 0    i = 0    while n > i:
        if s[i] == 'D':
            d_count += 1        else:
            u_count += 1        i += 1        while d_count != u_count:
            if s[i] == 'D':
                d_count += 1            else:
                u_count += 1            i += 1        if s[i-1] == 'U':
            no_of_vallyes += 1    return no_of_vallyes



if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input())

    s = input()

    result = countingValleys(n, s)

    fptr.write(str(result) + '\n')

    fptr.close()

Drawing Book - Hacker Rank Problem Solution (Python) Code

2020-05-03T01:13:00.001+05:30

Problem

Brie’s Drawing teacher asks her class to open their books to a page number. Brie can either start turning pages from the front of the book or from the back of the book. She always turns pages one at a time. When she opens the book, page

is always on the right side:

When she flips page

, she sees pages

and

. Each page except the last page will always be printed on both sides. The last page may only be printed on the front, given the length of the book. If the book is

pages long, and she wants to turn to page

, what is the minimum number of pages she will turn? She can start at the beginning or the end of the book.

Given

and

, find and print the minimum number of pages Brie must turn in order to arrive at page

Function Description

Complete the pageCount function in the editor below. It should return the minimum number of pages Brie must turn.

pageCount has the following parameter(s):

n: the number of pages in the book
p: the page number to turn to

Input Format

The first line contains an integer

, the number of pages in the book.
The second line contains an integer,

, the page that Brie's teacher wants her to turn to.

Constraints

Output Format

Print an integer denoting the minimum number of pages Brie must turn to get to page

Sample Input 0

6
2

Sample Output 0

Explanation 0

If Brie starts turning from page

, she only needs to turn

page:

If Brie starts turning from page

, she needs to turn

pages:

Because we want to print the minumum number of page turns, we print

as our answer.

Sample Input 1

5
4

Sample Output 1

Explanation 1

If Brie starts turning from page

, she needs to turn

pages:

If Brie starts turning from page

, she doesn't need to turn any pages:

Because we want to print the minimum number of page turns, we print

as our answer.

Python 3 - Problem Solution Code

#!/bin/python3
import os
import sys

## Complete the pageCount function below.#def pageCount(n, p):
    turns =p//2    if p <= n//2:
        return turns
    total_turns = n//2    return total_turns-turns
    #    # Write your code here.    #
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    n = int(input())

    p = int(input())

    result = pageCount(n, p)

    fptr.write(str(result) + '\n')

    fptr.close()

Sock Merchant - Hacker Rank Problem Solution (Python) Code

2020-05-03T00:27:00.001+05:30

Problem

John works at a clothing store. He has a large pile of socks that he must pair 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

where

Output Format

Return the total number of matching pairs of socks that John can sell.

Sample Input

9
10 20 20 10 10 30 50 10 20

Sample Output

Explanation

John can match three pairs of socks.

Python 3 - Code

#!/bin/python3
import math
import os
import random
import re
import sys

# Complete the sockMerchant function below.def sockMerchant(n, ar):
    pairs = 0    while ar:
        single_color = ar[0]
        no_of_socks = ar.count(single_color)
        if no_of_socks >= 2:
            pairs += no_of_socks//2        while single_color in ar:
            ar.remove(single_color)
    return pairs

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()

Bon Appétit - HackerRank Problem Solution (Python)

2020-05-03T00:03:00.000+05:30

Anna and Brian are sharing a meal at a restuarant and they agree to split the bill equally. Brian wants to order something that Anna is allergic to though, and they agree that Anna won't pay for that item. Brian gets the check and calculates Anna's portion. You must determine if his calculation is correct.

For example, assume the bill has the following prices:

. Anna declines to eat item

which costs

. If Brian calculates the bill correctly, Anna will pay

. If he includes the cost of

, he will calculate

. In the second case, he should refund

to Anna.

Function Description

Complete the bonAppetit function in the editor below. It should print Bon Appetit if the bill is fairly split. Otherwise, it should print the integer amount of money that Brian owes Anna.

bonAppetit has the following parameter(s):

bill: an array of integers representing the cost of each item ordered
k: an integer representing the zero-based index of the item Anna doesn't eat
b: the amount of money that Anna contributed to the bill

Input Format

The first line contains two space-separated integers

and

, the number of items ordered and the

-based index of the item that Anna did not eat.
The second line contains

space-separated integers

where

.
The third line contains an integer,

, the amount of money that Brian charged Anna for her share of the bill.

Constraints

The amount of money due Anna will always be an integer

Output Format

If Brian did not overcharge Anna, print Bon Appetit on a new line; otherwise, print the difference (i.e.,

) that Brian must refund to Anna. This will always be an integer.

Sample Input 0

4 1
3 10 2 9
12

Sample Output 0

Explanation 0
Anna didn't eat item

, but she shared the rest of the items with Brian. The total cost of the shared items is

and, split in half, the cost per person is

. Brian charged her

for her portion of the bill. We print the amount Anna was overcharged,

, on a new line.

Sample Input 1

4 1
3 10 2 9
7

Sample Output 1

Bon Appetit

Explanation 1
Anna didn't eat item

, but she shared the rest of the items with Brian. The total cost of the shared items is

and, split in half, the cost per person is

. Because

, we print Bon Appetit on a new line.

#!/bin/python3
import math
import os
import random
import re
import sys

# Complete the bonAppetit function below.def bonAppetit(bill, k, b):
    anna_share = bill.copy()
    del anna_share[k]
    final_price = sum(anna_share)//2    if final_price == b:
        print('Bon Appetit')
    else:
        print(b-final_price)


if __name__ == '__main__':
    nk = input().rstrip().split()

    n = int(nk[0])

    k = int(nk[1])

    bill = list(map(int, input().rstrip().split()))

    b = int(input().strip())

    bonAppetit(bill, k, b)

Day of the Programmer - HackerRank Solution (Python)

2020-05-02T23:36:00.000+05:30

Marie invented a Time Machine and wants to test it by time-traveling to visit Russia on the Day of the Programmer (the

day of the year) during a year in the inclusive range from

From

, Russia's official calendar was the Julian calendar; since

they used the Gregorian calendar system. The transition from the Julian to Gregorian calendar system occurred in

, when the next day after January

was February

. This means that in

, February

was the

day of the year in Russia.

In both calendar systems, February is the only month with a variable amount of days; it has

days during a leap year, and

days during all other years. In the Julian calendar, leap years are divisible by

; in the Gregorian calendar, leap years are either of the following:

Divisible by .
Divisible by and not divisible by .

Given a year,

, find the date of the

day of that year according to the official Russian calendar during that year. Then print it in the format dd.mm.yyyy, where dd is the two-digit day, mm is the two-digit month, and yyyy is

For example, the given

is divisible by

, so it is a leap year. The

day of a leap year after

is September 12, so the answer is

Function Description

Complete the dayOfProgrammer function in the editor below. It should return a string representing the date of the

day of the year given.

dayOfProgrammer has the following parameter(s):

year: an integer

Input Format

A single integer denoting year

Constraints

Output Format

Print the full date of Day of the Programmer during year

in the format dd.mm.yyyy, where dd is the two-digit day, mm is the two-digit month, and yyyy is

Sample Input 0

Sample Output 0

13.09.2017

Explanation 0

In the year

, January has

days, February has

days, March has

days, April has

days, May has

days, June has

days, July has

days, and August has

days. When we sum the total number of days in the first eight months, we get

. Day of the Programmer is the

day, so then calculate

to determine that it falls on day

of the

month (September). We then print the full date in the specified format, which is 13.09.2017.

Sample Input 1

Sample Output 1

12.09.2016

Explanation 1

Year

is a leap year, so February has

days but all the other months have the same number of days as in

. When we sum the total number of days in the first eight months, we get

. Day of the Programmer is the

day, so then calculate

to determine that it falls on day

of the

month (September). We then print the full date in the specified format, which is 12.09.2016.

Sample Input 2

Sample Output 2

12.09.1800

Explanation 2

Since 1800 is leap year. Day lies on 12 September.

#!/bin/python3
import math
import os
import random
import re
import sys

# Complete the dayOfProgrammer function below.def dayOfProgrammer(year):

    if 1700 <= year <= 1917:
        if year%4 == 0:
            return '12.09.'+str(year)
        else:
            return '13.09.'+str(year)
    if 1919 <= year <= 2700:
        if year%100 == 0 and year%400 == 0:
            return '12.09.'+str(year)
        if year%100 == 0:
            return '13.09.'+str(year)
        if year%4 == 0:
            return '12.09.'+str(year)
        else:
            return '13.09.'+str(year)
    if year == 1918:
        return '26.09.'+str(year)




if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    year = int(input().strip())

    result = dayOfProgrammer(year)

    fptr.write(result + '\n')

    fptr.close()