1: https://leetcode.com/problems/reverse-string-ii/, with k = 2
2: Sort all the diagonals of a matrix.

Ex. a = [[1,4,3],[2,3,2],[4,1,2]].

sorted matrix: [[1,2,3],[1,2,4],[4,2,3]].

3: Given two strings of integers, sum the ith elements starting from the end, and return a new string of the sums in correct order.

Ex. string1 = "99", string2 = "123".

returned = "11112".

4: Cut ribbons question: https://leetcode.com/discuss/interview-question/388503/Google-or-Phone-Screen-or-Cut-Ribbon/350993

The first three were a breeze, passing all tests. The last one I struggled to find a faster solution; I passed all the sample cases but didn't pass all the test cases.

My overall score was 784, and I was not able to move on to the next round.