| about | help | code help+videos | done | prefs |
Given an array of Strings, and two additional Strings s1 and s2, count how many of the arrays strings fall between s1 and s2 lexicographically. s1 will always come before s2 in the alphabet and all the Strings will use only lower-case letters. stringsInBetween(["aaron", "michael", "ken", "david", "greg", "gena", "brandy", "scott"], "kelly", "tom") → 3 stringsInBetween(["aaron", "michael", "ken", "david", "greg", "gena", "brandy", "scott"], "arnold", "zoey") → 7 stringsInBetween(["b"], "a", "c") → 1 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 200
Copyright Nick Parlante 2017 - privacy