- Email Joshi Vikram Contractor X Hackerrank Question Meander X Hackerrank Com Test Eifsidn6q35 Questions Retn1kep 1 (80.76 KiB) Viewed 60 times
solve in Java 8 in 30 minutes
solve in java 8
Email-Joshi, Vikram (Contractor X HackerRank Question - Meander X hackerrank.com/test/eifsidn6q35/questions/retn1kep ← → C M Gmail 2m 55s left Ⓒ ALL Ⓡ 1 YouTube Maps BETA Can't read the text? Switch theme 1. Meandering Array An array of integers is defined as being in meandering order when the first two elements are the respective largest and smallest elements in the array and the subsequent elements alternate between its next largest and next smallest elements. In other words, the elements are in order of [first_largest, first smallest, second largest, second_smallest,...). Example The array [-1, 1, 2, 3, -5] sorted normally is [-5, -1, 1, 2,3]. Sorted in meandering order, it becomes [3, -5, 2,-1,1]. Function Description Complete the function meanderingArray in the editor below. meanderingArray has the following parameter(s): unsorted[n]: the unsorted array Returns: int[n]: the array sorted in meandering order Constraints + X * ☐ ⠀ Ⓒ Info 45 44 45 46 47 48 49 50 51 52 53 54 Line: 53 Col: 15 Test Results Custom Input Run Code Run Tests Submit Compilation error Use print or log statements to debug why your hidden test cases are failing. Hidden test cases are used to evaluate if your code can handle different scenarios, including corner cases. Compilation command mcs -debug -unsafe -sdk:4.7.2 -r:System.Reactive. Debugger,System.Reactive. Providers,System.Reacti ve.Observable. Aliases,System.Reactive. PlatformServices, System. Reactive.Runtime.Remoting, System.Re active.Windows.Forms, System.Reactive.Windows.Threading, System.Reactive. Interfaces, System.Reactiv e.Linq,System.Reactive.Core -r:System.Numerics -r:System.Data -r:System.Net.Http r:System.Net.Ht tp. Formatting -r:Mono.Data.Sqlite -r:/usr/lib/cli/Newtonsoft.Json-5.0/Newtonsoft.Json.dll -r:Syst em.Runtime.Serialization Solution.cs -o: Solution.exe Compilation message Me LAe ENG IN d 4) D 17:28 21.02.2013 C# 3 for (int k=0; k<n;k++) { } return unsorted; Autocomplete Ready Ⓒ unsorted[k]= tempArr[k]; } } class Solution 12 ☆ C