Sales By Match HackerRank Solutions

 There is a large pile of socks that must be paired by color. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are.

Example

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.

sockMerchant has the following parameter(s):

  • int n: the number of socks in the pile
  • int ar[n]: the colors of each sock

Returns

  • int: the number of pairs

Input Format

The first line contains an integer , the number of socks represented in .
The second line contains  space-separated integers, , the colors of the socks in the pile.

Constraints

  •  where 

Sample Input

STDIN                       Function
-----                       --------
9                           n = 9
10 20 20 10 10 30 50 10 20  ar = [10, 20, 20, 10, 10, 30, 50, 10, 20]

Sample Output

3

Explanation

sock.png

There are three pairs of socks.




## Solutions::--

#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'sockMerchant' function below.
#
# The function is expected to return an INTEGER.
# The function accepts following parameters:
#  1. INTEGER n
#  2. INTEGER_ARRAY ar
#
from collections import Counter

 
def sockMerchant(n, ar):
    #print(set(ar))
    return sum([ar.count(i)//2 for i in set(ar)]) ## Main Solution
    
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

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

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

    result = sockMerchant(n, ar)

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

    fptr.close()




Comments

Post a Comment

Popular posts from this blog

No Idea ! Hackerrank Solution

  There is an array of     integers. There are also     disjoint sets ,     and   , each containing     integers. You like all the integers in set     and dislike all the integers in set   . Your initial happiness is   . For each     integer in the array, if   , you add     to your happiness. If   , you add     to your happiness. Otherwise, your happiness does not change. Output your final happiness at the end. Note:  Since   and   are sets, they have no repeated elements. However, the array might contain duplicate elements. Constraints Input Format The first line contains integers   and   separated by a space. The second line contains   integers, the elements of the array. The third and fourth lines contain   integers,   and  , respectively. Output Format Output a single integer, your total happines...
Read more

Company Logo | HackerRank Solutions

  A newly opened multinational brand has decided to base their company logo on the three most common characters in the company name. They are now trying out various combinations of company names and logos based on this condition. Given a string   , which is the company name in lowercase letters, your task is to find the top three most common characters in the string. Print the three most common characters along with their occurrence count. Sort in descending order of occurrence count. If the occurrence count is the same, sort the characters in alphabetical order. For example, according to the conditions described above,  would have it's logo with the letters  . Input Format A single line of input containing the string  . Constraints  has at least   distinct characters Output Format Print the three most common characters along with their occurrence count each on a separate line. Sort output in descending order of occurrence count. If the occurrence...
Read more

The Minion Game Hackerrank Solution

Image
  Kevin and Stuart want to play the ' The Minion Game '. Game Rules Both players are given the same string,  . Both players have to make substrings using the letters of the string  . Stuart has to make words starting with  consonants . Kevin has to make words starting with  vowels . The game ends when both players have made all possible substrings. Scoring A player gets  +1  point for each occurrence of the substring in the string  . For Example : String   =  BANANA Kevin's vowel beginning word =  ANA Here,  ANA  occurs twice in  BANANA . Hence, Kevin will get  2  Points. For better understanding, see the image below: Your task is to determine the winner of the game and their score. Function Description Complete the  minion_game  in the editor below. minion_game  has the following parameters: string string:  the string to analyze Prints string:  the winner's name and score, sepa...
Read more