6 kyu
Sorted Arrays
409 of 736dnolan
Description:
Given any number of arrays each sorted in ascending order, find the nth smallest number of all their elements.
All the arguments except the last will be arrays, the last argument is n.
nthSmallest([1,5], [2], [4,8,9], 4) // returns 5 because it's the 4th smallest value
Be mindful of performance.
Arrays
Algorithms
Performance
Similar Kata:
Stats:
| Created | Mar 23, 2016 |
| Published | Mar 23, 2016 |
| Warriors Trained | 1955 |
| Total Skips | 107 |
| Total Code Submissions | 4478 |
| Total Times Completed | 736 |
| JavaScript Completions | 409 |
| C# Completions | 94 |
| C++ Completions | 248 |
| Total Stars | 49 |
| % of votes with a positive feedback rating | 89% of 194 |
| Total "Very Satisfied" Votes | 160 |
| Total "Somewhat Satisfied" Votes | 24 |
| Total "Not Satisfied" Votes | 10 |
| Total Rank Assessments | 8 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 6 kyu |
| Lowest Assessed Rank | 8 kyu |
