| about | help | code help+videos | done | prefs |
Start with two arrays of strings, A and B, each with its elements in reverse alphabetical order. Write a method which returns a new array containing the all the elements from the two arrays. The result array should be in reverse alphabetical order and there may be duplicates. myMergeReverse(["z", "c", "a"], ["z", "f", "b"]) → ["z", "z", "f", "c", "b", "a"] myMergeReverse(["c", "a"], ["z", "f", "b"]) → ["z", "f", "c", "b", "a"] myMergeReverse(["d", "d", "c"], ["d"]) → ["d", "d", "d", "c"] ...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 Post-solution available
Copyright Nick Parlante 2017 - privacy