An online coding round was held on CoCubes consisting of 3 problems. All the questions had their main functions written, and we only had to write the answer function and return the result. (Pass by reference was only used)
Questions were:
1:Given a string sequence, find the minimum alphabets to be added to make it a palindrome.
ex: abcdc
OUTPUT: ba
2:It was a DFS based graph problem.
3:Given a number, find the smallest number possible after removing a given number of digits. The order of digits is retained(Given in input).
ex:7530258
4(that means we can remove four digits)
OUTPUT:025
Some questions from other sets were related to :
1:Finding Armstrong number
2:Finding The Largest prime in a given range