Pay and Duration
Pay: 1.14L/monthDuration: 8-10 weeks
Q1
Given an array of n strings (length of string at max is 15) (n is at max 50k) (all strings made up from 'a' to 'j'), and an integer K (K is at max 10), we can select almost K alphabets. Find the maximum number of strings that can be made from the chosen alphabets, if the chosen alphabets can be used any number of times to make a string.
Q2
Given an infinite stack, one can transfer blocks from ith stack to (i+1)th stack in the following way: 2 blocks of stack i contribute to 1 block of stack i+1, find the minimum number of stack blocks that can be achieved.
<Insert CSEA link>