6 kyu
Simple Fun #52: Pair Of Shoes
1,031 of 2,052myjinxin2015
Description:
Task
Yesterday you found some shoes in your room. Each shoe is described by two values:
type indicates if it's a left or a right shoe;
size is the size of the shoe.
Your task is to check whether it is possible to pair the shoes you found in such a way that each pair consists of a right and a left shoe of an equal size.
Example
For:
shoes = [[0, 21],
[1, 23],
[1, 21],
[0, 23]]
the output should be true
;
For:
shoes = [[0, 21],
[1, 23],
[1, 21],
[1, 23]]
the output should be false
.
Input/Output
[input]
2D integer arrayshoes
Array of shoes. Each shoe is given in the format [type, size], where type is either 0 or 1 for left and right respectively, and size is a positive integer.Constraints:
2 ≤ shoes.length ≤ 50, 1 ≤ shoes[i][1] ≤ 100.
[output]
a boolean valuetrue
if it is possible to pair the shoes,false
otherwise.
Puzzles
Similar Kata:
Stats:
Created | Jan 25, 2017 |
Published | Jan 25, 2017 |
Warriors Trained | 3911 |
Total Skips | 69 |
Total Code Submissions | 9199 |
Total Times Completed | 2052 |
JavaScript Completions | 1031 |
Python Completions | 748 |
Ruby Completions | 74 |
Crystal Completions | 6 |
C# Completions | 148 |
C Completions | 51 |
Factor Completions | 6 |
Java Completions | 64 |
Haskell Completions | 12 |
Total Stars | 57 |
% of votes with a positive feedback rating | 95% of 320 |
Total "Very Satisfied" Votes | 294 |
Total "Somewhat Satisfied" Votes | 21 |
Total "Not Satisfied" Votes | 5 |
Total Rank Assessments | 13 |
Average Assessed Rank | 6 kyu |
Highest Assessed Rank | 6 kyu |
Lowest Assessed Rank | 7 kyu |