Applied: OCT 28
Recieved: Nov 3
Deadline to complete test Nov17(14 days)
Platform: Codility
The test has 4 question which needs to be solved in 70min
each question has 300 points
- Given an Integer “12345” return the (product of digits-sum of digits) --EASY
eg:“12345”
(1 2 3 4 5)-(1+2+3+4+5)
2.Given two strings S and T consisting of digits and lowercase letters, you are allowed to remove only digit from either string, count how many ways of removal to make S lexicographically smaller than T.
If s = ‘3ab’ and t = ‘cd’, return 1. If s = ‘123ab’ and t = ‘423cd’, return 6. – Medium
https://stackoverflow.com/questions/57648760/given-2-strings-remove-only-one-digit-to-make-1-string-lexicographically-smalle - Given a Matrix sort the border elements
int[][]={{1,2,3,4,},{5,6,7,8},{9,10,11,12},{13,14,15,16}}
return {{1,2,3,4},{16,6,7,5},{15,11,10,8},{14,13,12,9}}
4.https://leetcode.com/discuss/interview-question/388503/Google-or-Phone-Screen-or-Cut-Ribbon/350993
Got 826 .Solved 3 questions completely and got 100 points in 1 question