A string A contains k lowercase letters and can form multiple subsequences (not necessarily contiguous). If each lowercase letter appears with the same frequency in a subsequence as in the original string, then this subsequence is considered a perfect subsequence. Given a string A, determine the number of its perfect subsequences. For example, in the string "abca", the subsequences "a", "b", "c", "a", "ab", "bc", "ca", "aa", etc., are all valid.
Tell us about a group project and setback you encountered and how you dealt with it
I was asked Hard / Medium LC questions.
What's your favourite subject in University
Algorithms and Complexity questions in Java or C
Why you apply for this graduate programme and why you want to work at this company?
What are your hobbies?
If a colleague was struggling to make a complex decision, what would you do to help?
Can you describe a time when you had to be independent?
individual presentation a group then a then a regular interview.
Viewing 1811 - 1820 interview questions