Callisto Info Solutions interview questions

Q1:- Given an array nums and two sliding windows of size K & L which don’t have any element in common between them, you need to return the maximum sum of elements we can get between both windows. This is basically an extension of SLIDING WINDOW Problem on Geeks for Geeks. https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/ Q2:- Given a string with elements having lowercase letters and question marks. Replace each question mark with lowercase letter such that the element is not equal to the element before it and the element after it. Ex:- Input String:- abcab??bac? Output:- abcabacbaca (There can be a lot of different outputs, anyone of them was accepted) Input String:- ???????? Output:- abcdefgh Q3:- We are given the maximum occurances of ‘a’, ‘b’ and ‘c’ in a string. We need to make the largest length string containing only ‘a’, ‘b’ and ‘c’ such that no three consecutive characters are same. Ex:- Input:- 3 3 3 Output:- abcabcabc (There can be a lot of different outputs, anyone of them was accepted) Input:- 5 5 3 Output:- aabbcaabbcabc About 14 students out of 130 were selected for the interviews