Skip to content

Latest commit

 

History

History
36 lines (22 loc) · 1.05 KB

README.md

File metadata and controls

36 lines (22 loc) · 1.05 KB

My Github Portfolio

About Me

My name is Brenda Rearden and I have been working as a Software Developer for 3 years.

These are different applications / coding puzzles I have completed

Sock Merchant

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 .

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 1 <= n <= 100 1 <= ar[i] <= 100 where 0 <= i < n

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

3