{"push_id":1807100141,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8e7eff7be61c44dd04138cd70830fb0c450e1fe5","before":"36cd63f7e3f239c115930ee9e737c55bf6825c23","commits":[{"sha":"8e7eff7be61c44dd04138cd70830fb0c450e1fe5","author":{"name":"rrzschool","email":"bf32bb807fc866fab14609b880b0937df72bb979@gmail.com"},"message":"Create WaveArray.cpp\n\nGiven an array of integers, sort the array into a wave like array and return it, \r\nIn other words, arrange the elements into a sequence such that a1 >= a2 <= a3 >= a4 <= a5.....\r\n\r\nExample:\r\nGiven [1, 2, 3, 4]\r\nOne possible answer : [2, 1, 4, 3]\r\nAnother possible answer : [4, 1, 3, 2]\r\n\r\nNOTE : If there are multiple answers possible, return the one thats lexicographically smallest.  \r\nSo, in example case, you will return [ 2, 1, 4, 3].","distinct":true,"url":"https://api.github.com/repos/rrzschool/InterviewBit/commits/8e7eff7be61c44dd04138cd70830fb0c450e1fe5"}]}
{"actor":{"display_login":"rrzschool"}}