https://github.com/skyv26/sales-by-match
Problem Solving Exercise
https://github.com/skyv26/sales-by-match
Last synced: about 2 months ago
JSON representation
Problem Solving Exercise
- Host: GitHub
- URL: https://github.com/skyv26/sales-by-match
- Owner: skyv26
- Created: 2022-09-06T07:50:09.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2022-09-06T07:58:36.000Z (over 2 years ago)
- Last Synced: 2025-01-19T05:05:11.396Z (3 months ago)
- Language: JavaScript
- Size: 1.95 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
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.
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
n = 9
ar = [10, 20, 20, 10, 10, 30, 50, 10, 20]
Sample Output
3