On 14 sept, i got the chance for UBER hiring Drive\n\nQ1. Given an array of sorted integers, sort the array in ascending order of squares of its elements.\n\nFor example:\n[1, 5, ,7, 7, 8, 10]    ->    [1, 5, 7, 7, 8, 10]\n[-5, -3, -3, 2, 4, 4, 8]    ->    [2, -3, -3, 4, 4, -5, 8]\n                     i.e., squares : [4, 9, 9, 16, 16, 25, 64]\n\t\t\t\t\t \nFollow up questions:- find kth min or max element after sorting \ninterviewer was looking for O(LogN) time complexity for this followup question which i could not able to get\n\n\nQ2. Given a series of text, write some code to find the top k terms in that text.\n\ntext: b a b a a c\nk: 2\n\nResult: ["a", "b"] since a occurs 3 times, b 2 times.\n\n\nFollow up :- what if we have to split the text on different characters.\n\n\nplease feel free to put your answer in comment for both questions\n\nThank you

On 14 sept, i got the chance for UBER hiring Drive\n\nQ1. Given an array of sorted integers, sort the array in ascending order of squares of its elements.\n\nFo