The interview process began with a 90-minute coding round that included three questions. This was followed by a group flyer session, during which we had to code on paper for 45 minutes. Finally, there were three in-person interviews, with questions as detailed below.

Given a string S and two indexes i & j, modify the string in a pattern such that:

• Characters from index 0 to i are moved to the back of the string.
• Characters from index j to the end of the string are moved to the front.

e.g., S = “abcdef” and i=1, j=3. Output should be: “defcab” Constraint: Constant Space.

Given an array of positive integers, sort the array such that when all elements are concatenated into a string, the number formed is maximum. e.g., input: [12, 9, 32] output: [9, 32, 12]

In a native language, alphabets are in this order: a b d c k l g h ng q r. Given two strings, str1 and str2, find which one is larger. Larger means rankwise more (e.g., if “da” and “c” are given, then “da” > “c” as d comes first). Write this function:

c bool compare(char* str1, char* str2); // Returns 1 if str1 > str2. // Returns -1 if str2 > str1. // Returns 0 otherwise.